Naps: Scalable, robust topology management in wireless ad hoc networks

被引:0
作者
Godfrey, PB [1 ]
Ratajczak, D [1 ]
机构
[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
来源
IPSN '04: THIRD INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING IN SENSOR NETWORKS | 2004年
关键词
wireless ad hoc networks; sensor networks; topology management; percolation theory; simulation;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Topology management schemes conserve energy in wireless ad hoe networks by identifying redundant nodes that may turn off their radios or other components while maintaining connectivity. We present Naps, a randomized topology management scheme that does not rely on geographic location information, provides flexibility in the target density of waking nodes, and sends only a periodic heartbeat message between waking neighbors; thus it is implementable even on modest hardware. We formally analyze the connectivity of the waking graphs produced by Naps, showing that these graphs have nearly complete connectivity even at relatively low densities. We examine simulation results for a wide range of initial deployment densities and for heterogeneous and mobile deployments.
引用
收藏
页码:443 / 451
页数:9
相关论文
共 22 条
  • [1] [Anonymous], 2000, 527 USC INF SCI I
  • [2] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
  • [3] [Anonymous], 2003, ACM Symposium on Mobile Ad Hoc Networking and Computing, DOI DOI 10.1145/778415.778432
  • [4] BOOTH L, 2003, ANN APPL PROBABILITY, V13
  • [5] A survey of mobility models for ad hoc network research
    Camp, T
    Boleng, J
    Davies, V
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2002, 2 (05) : 483 - 502
  • [6] Chen B., 2001, P MOBICOM, P85
  • [7] DOUSSE O, 2003, P IEEE INF SAN FRANC
  • [8] Grimmett G., 1999, PERCOLATION
  • [9] The capacity of wireless networks
    Gupta, P
    Kumar, PR
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 388 - 404
  • [10] GUPTA P, 1999, SYS CON FDN, P547