The Number of Neighbors Needed for Connectivity of Wireless Networks

被引：1

作者：

Feng Xue

P.R. Kumar

机构：

[1] University of Illinois,Department of Electrical and Computer Engineering, and Coordinated Science Laboratory

[2] Urbana-Champaign,undefined

来源：

Wireless Networks | 2004年 / 10卷

关键词：

wireless networks; connectivity; ad hoc networks; transmission range control;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Unlike wired networks, wireless networks do not come with links. Rather, links have to be fashioned out of the ether by nodes choosing neighbors to connect to. Moreover the location of the nodes may be random.

引用

页码：169 / 181

页数：12

共 16 条

[1]

Mathar R.(1995)Analyzing routing strategy NFP in multihop packet radio network on a line IEEE Transactions on Communications 43 977-988

[2]

Mattfeldt J.(1994)Connectivity properties of a random radio network Proceedings of the IEE - Communications 141 289-296

[3]

Ni J.(1984)Optimal transmission ranges for randomly distributed packet radio terminals IEEE Trans. Commun. 32 246-257

[4]

Chandler S.(2000)The capacity of wireless networks IEEE Transactions on Information Theory 46 388-404

[5]

Takagi H.(1989)Connectivity properties of a packet radio network model IEEE Transactions on Information Theory 35 1044-1047

[6]

Kleinrock L.(1997)The longest edge of the random minimal spanning tree The Annals of Applied Probability 7 340-361

[7]

Gupta P.(1993)On central limit theorems in geometrical probability Annals of Applied Probability 3 1033-1046

[8]

Kumar P.(1996)Nearest neighbor and hard sphere models in continuum percolation Random Structures and Algorithms 9 295-315

[9]

Philips T.K.(undefined)undefined undefined undefined undefined-undefined

[10]

Panwar S.S.(undefined)undefined undefined undefined undefined-undefined

← 1 2 →