Distributed topology control algorithm for multihop wireless networks

被引:42
作者
Borbash, SA [1 ]
Jennings, EH [1 ]
机构
[1] Lab Telecommun Sci, Adelphi, MD 20783 USA
来源
PROCEEDING OF THE 2002 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-3 | 2002年
关键词
D O I
10.1109/IJCNN.2002.1005497
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a network initialization algorithm for wireless networks with distributed intelligence. Each node (agent) has only local, incomplete knowledge and it must make local decisions to meet a predefined global objective. Our objective is to use power control to establish a topology based on the relative neighborhood graph which has good overall performance in terms of power usage, low interference, and reliability.
引用
收藏
页码:355 / 360
页数:4
相关论文
共 11 条
[1]  
[Anonymous], P ACM MOBIHOC 01 OCT
[2]   TOPOLOGY CONTROL FOR MULTIHOP PACKET RADIO NETWORKS [J].
HU, LM .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (10) :1474-1481
[3]  
JENNINGS E, 2001, UNPUB TOPOLOGY EFFIC
[4]  
LI X, 2001, P 10 IEEE INT C COMP
[5]  
MCGLYNN MJ, 2001, P ACM S MOB AD HOC N
[6]  
QUIRK K, 2001, P GLOBECOM 2001
[7]  
RAMANATHAN R, 2000, P IEEE INFOCOM 2000
[8]  
SALONIDIS T, 2001, P IEEE INFOCOM 2001
[9]   THE RELATIVE NEIGHBORHOOD GRAPH, WITH AN APPLICATION TO MINIMUM SPANNING-TREES [J].
SUPOWIT, KJ .
JOURNAL OF THE ACM, 1983, 30 (03) :428-448
[10]   THE RELATIVE NEIGHBORHOOD GRAPH OF A FINITE PLANAR SET [J].
TOUSSAINT, GT .
PATTERN RECOGNITION, 1980, 12 (04) :261-268