東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Random geometric aspects in multi-ho...

Wang, Lixin.

Linked to FindBook

Google Book

Amazon

博客來

Random geometric aspects in multi-hop wireless networks.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Random geometric aspects in multi-hop wireless networks./
Author:	Wang, Lixin.
Description:	158 p.
Notes:	Source: Dissertation Abstracts International, Volume: 71-09, Section: B, page: 5593.
Contained By:	Dissertation Abstracts International71-09B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3417936
ISBN:	9781124146508

Random geometric aspects in multi-hop wireless networks.
Wang, Lixin.

Random geometric aspects in multi-hop wireless networks. - 158 p.

Source: Dissertation Abstracts International, Volume: 71-09, Section: B, page: 5593.

Thesis (Ph.D.)--Illinois Institute of Technology, 2010.

A randomly deployed large-scale wireless ad hoc network is naturally represented by an r-disk graph over a random point set. Relative neighborhood graph (RNG) has been widely used in localized topology control and geographic routing in wireless ad hoc and sensor networks. If all the nodes have the same transmission radii, the maximum edge length of the RNG is the smallest transmission radius for constructing the RNG by using only 1-hop neighbor information and it is referred to as the critical transmission radius of the RNG. The critical transmission radius of the RNG is the minimum requirement on the maximum transmission radius by those applications of RNG. Greedy forward routing (GFR) is attractive in wireless ad hoc and sensor networks due to its efficiency and scalability. GFR may discard a packet before it reaches its destination if the transmission radii of the nodes are small. To ensure that every packet can reach its destination, all nodes should have sufficiently large transmission radii. The critical transmission radius of a planar node set V for greedy forward routing is the smallest transmission radius by V which ensures successful delivery of any packet from any source node in V to any destination node in V. In this thesis, we conduct probabilistic studies on the critical transmission radius for the RNG and GFR.

ISBN: 9781124146508Subjects--Topical Terms:

626642
Computer Science.

Random geometric aspects in multi-hop wireless networks.
LDR:02197nam 2200265 4500 001 1405126
005 20111206130411.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124146508
035 $a (UMI)AAI3417936
035 $a AAI3417936
040 $a UMI $c UMI
100 1 $a Wang, Lixin. $3 1285564
245 1 0 $a Random geometric aspects in multi-hop wireless networks.
300 $a 158 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-09, Section: B, page: 5593.
500 $a Adviser: Peng-Jun Wan.
502 $a Thesis (Ph.D.)--Illinois Institute of Technology, 2010.
520 $a A randomly deployed large-scale wireless ad hoc network is naturally represented by an r-disk graph over a random point set. Relative neighborhood graph (RNG) has been widely used in localized topology control and geographic routing in wireless ad hoc and sensor networks. If all the nodes have the same transmission radii, the maximum edge length of the RNG is the smallest transmission radius for constructing the RNG by using only 1-hop neighbor information and it is referred to as the critical transmission radius of the RNG. The critical transmission radius of the RNG is the minimum requirement on the maximum transmission radius by those applications of RNG. Greedy forward routing (GFR) is attractive in wireless ad hoc and sensor networks due to its efficiency and scalability. GFR may discard a packet before it reaches its destination if the transmission radii of the nodes are small. To ensure that every packet can reach its destination, all nodes should have sufficiently large transmission radii. The critical transmission radius of a planar node set V for greedy forward routing is the smallest transmission radius by V which ensures successful delivery of any packet from any source node in V to any destination node in V. In this thesis, we conduct probabilistic studies on the critical transmission radius for the RNG and GFR.
590 $a School code: 0091.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Illinois Institute of Technology. $3 1018749
773 0 $t Dissertation Abstracts International $g 71-09B.
790 1 0 $a Wan, Peng-Jun, $e advisor
790 $a 0091
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3417936