東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Security and routing issues in wirel...

Du, Hongjie.

FindBook

Google Book

Amazon

博客來

Security and routing issues in wireless networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Security and routing issues in wireless networks./
作者:	Du, Hongjie.
面頁冊數:	86 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-03, Section: B, page: 1768.
Contained By:	Dissertation Abstracts International72-03B.
標題:	Information Technology. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3441839
ISBN:	9781124464213

Security and routing issues in wireless networks.
Du, Hongjie.

Security and routing issues in wireless networks. - 86 p.

Source: Dissertation Abstracts International, Volume: 72-03, Section: B, page: 1768.

Thesis (Ph.D.)--The University of Texas at Dallas, 2010.

Wireless networks have been widely used in industries, military and education. We usually represent a wireless network as a Unit Disk Graph (UDG) G = (V, E). There are many issues considered in wireless networks. In this dissertation, I mainly focused on the security and routing issues which are two of the most important issues in wireless networks. Security is one of the important issues in wireless networks. Secure clustering problem plays an important role in distributed sensor networks. Weakly Connected Dominating Set (WCDS) is used for solving this problem. Therefore, computing a minimum WCDS becomes an important topic of this research. I compared the size of Maximal Independent Set (MIS) and minimum WCDS in unit disk graph. The analysis showed that five is the least upper bound for this ratio. I also presented a distributed algorithm to produce a weakly connected MIS within a factor 5 from the minimum WCDS. DENIAL-OF-SERVICE (DoS) attack, which aims to make a service unavailable to legitimate clients, is another threat to the internet security. I made a connection between group testing and internet security. Group testing is a technique to detect the defective items with minimum number of tests. It tests the items by group instead of one by one to save the testing times. I used group testing technique to test which server or application is being attacked. Group testing is a technique to detect the defective items with minimum number of tests. It tests the items by group instead of one by one to save the testing times. Routing is another most important issues in wireless networks. A good routing path can save much energy. Energy consumption is always a big concern in wireless networks. Connected Dominating Set (CDS) is a popular way to construct the virtual backbone in wireless network. I showed that a minimum nonsubmodular cover problem could be reduced into a problem of minimum submodular cover with submodular cost. And I approached to the solution of MOC-CDS problem by showing a little weaker result using Generalized Hitting Set.

ISBN: 9781124464213Subjects--Topical Terms:

1030799
Information Technology.

Security and routing issues in wireless networks.
LDR:02933nam 2200277 4500 001 1403702
005 20111111143224.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124464213
035 $a (UMI)AAI3441839
035 $a AAI3441839
040 $a UMI $c UMI
100 1 $a Du, Hongjie. $3 1682979
245 1 0 $a Security and routing issues in wireless networks.
300 $a 86 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-03, Section: B, page: 1768.
500 $a Adviser: Wei Li Wu.
502 $a Thesis (Ph.D.)--The University of Texas at Dallas, 2010.
520 $a Wireless networks have been widely used in industries, military and education. We usually represent a wireless network as a Unit Disk Graph (UDG) G = (V, E). There are many issues considered in wireless networks. In this dissertation, I mainly focused on the security and routing issues which are two of the most important issues in wireless networks. Security is one of the important issues in wireless networks. Secure clustering problem plays an important role in distributed sensor networks. Weakly Connected Dominating Set (WCDS) is used for solving this problem. Therefore, computing a minimum WCDS becomes an important topic of this research. I compared the size of Maximal Independent Set (MIS) and minimum WCDS in unit disk graph. The analysis showed that five is the least upper bound for this ratio. I also presented a distributed algorithm to produce a weakly connected MIS within a factor 5 from the minimum WCDS. DENIAL-OF-SERVICE (DoS) attack, which aims to make a service unavailable to legitimate clients, is another threat to the internet security. I made a connection between group testing and internet security. Group testing is a technique to detect the defective items with minimum number of tests. It tests the items by group instead of one by one to save the testing times. I used group testing technique to test which server or application is being attacked. Group testing is a technique to detect the defective items with minimum number of tests. It tests the items by group instead of one by one to save the testing times. Routing is another most important issues in wireless networks. A good routing path can save much energy. Energy consumption is always a big concern in wireless networks. Connected Dominating Set (CDS) is a popular way to construct the virtual backbone in wireless network. I showed that a minimum nonsubmodular cover problem could be reduced into a problem of minimum submodular cover with submodular cost. And I approached to the solution of MOC-CDS problem by showing a little weaker result using Generalized Hitting Set.
590 $a School code: 0382.
650 4 $a Information Technology. $3 1030799
650 4 $a Computer Science. $3 626642
690 $a 0489
690 $a 0984
710 2 $a The University of Texas at Dallas. $3 1018411
773 0 $t Dissertation Abstracts International $g 72-03B.
790 1 0 $a Wu, Wei Li, $e advisor
790 $a 0382
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3441839