期刊文献+

节点密度对优化Ad Hoc网络生存期的影响的研究 被引量:2

Study on the Effect of the Nodal Density on Optimizing Ad Hoc Network Lifetime
下载PDF
导出
摘要 节点密度会限制拓扑控制策略对Ad Hoc网络生存期的有效优化范围.通过推导节点密度决定下的拓扑控制力的饱和状态趋向约束条件,阐述了节点密度与网络生存期的优化程度及拓扑控制性能分析之间的关系.通过实验仿真验证发现,在Ad Hoc网络中,通过平均度约束的拓扑控制确实可以延长网络生存期;而且,在节点密度的制约下,拓扑控制策略对网络生存期的优化将会达到饱和. Nodal density limits the effective work range of the topology control strategy for optimizing the Ad Hoc network lifetime. Through deducing a constraint on the topology control ~ saturation trend, this paper presents the relationship between the network nodal density and both the network lifetime~ optimized level and the topology control performance analysis. Further simulations not only show that the average -degree constraint topology can prolong the network lifetime in the Ad Hoc network, but also show that under the constraint of nodal density, the optimization of the network lifetime controlled by topology will reach saturation.
出处 《云南民族大学学报(自然科学版)》 CAS 2010年第4期235-240,共6页 Journal of Yunnan Minzu University:Natural Sciences Edition
基金 国家自然科学基金(60473031) 湖南省自然科学基金(06JJ4078)
关键词 拓扑控制 网络生存期 平均通信半径 平均度 邻近图 topology control network lifetime average communication radius average degree proximity graph
  • 相关文献

参考文献14

  • 1XU Y,BIEN S,MORI Y,et al.Topology control protocols to conserve energy in wireless Ad Hoc networks[J].IEEE Transaction on Mobile Computing,2003(1):174-192.
  • 2陈力军,毛莺池,陈道蓄,谢立.平均度约束的无线传感器网络拓扑控制[J].计算机学报,2007,30(9):1544-1550. 被引量:23
  • 3NEWMAN M E J.Random graphs as models of networks[M] //BORNHOLDT S,SCHUSTER H G.Handbook of Graphs and NETWORKS.Berlin:Wiley-VCH,2003:35-68.
  • 4BORKAR V S,MANJUNATH D.Distributed topology control of wireless networks[J].Wireless Networks,2008,14(5):671-682.
  • 5张学,陆桑璐,陈贵海,陈道蓄,谢立.无线传感器网络的拓扑控制[J].软件学报,2007,18(4):943-954. 被引量:100
  • 6王炫,李建东,张文柱.拓扑控制对Ad Hoc网络性能的影响[J].计算机科学,2006,33(6):44-47. 被引量:6
  • 7路纲,周明天,牛新征,佘堃,唐勇,秦科.无线网络邻近图综述[J].软件学报,2008,19(4):888-911. 被引量:46
  • 8KAWADIA V,KUMAR P R.Principles and protocols for power control in wireless Ad Hoc networks[J].IEEE JSAC,2005,23(1):76-88.
  • 9FALL K,VARODHAN K.The ns manual[EB/OL].http://www.isi.edu/nsnam/ns/doc/ns_doc.pdf.
  • 10LI N,HOU J C,SHA L.Design and analysis of an MST-based topology control algorithm[C] // Proc IEEE INFOCOM'03.San Francisco,2003:1702-1712.

二级参考文献63

  • 1唐勇,周明天.基于极大独立集的最小连通支配集的分布式算法[J].电子学报,2007,35(5):868-874. 被引量:21
  • 2Krunz M, Muqattash A, Lee Sung-Ju. Transmission power control in wireless ad hoc networks: challenges, solutions and open issues [J]. IEEE Network,2004,18(5) : 8-14
  • 3Rodoplu V, Meng T H. Minimum energy mobile wireless networks [J]. IEEE Selected Areas in communications, 1999,17(8)1333-1344
  • 4Hu L Toploogy control for multihop packet radio networks [J].IEEE Trans on Communications, 1993,41(10): 1474-1481
  • 5Li Li, Halpem J Y,Bahl P, et al. A cone-based distributed topology-control algorithm for wireless multi-hop networks [J]. IEEE/ACM Transactions on Networking, 2005,13(1):147-159
  • 6Hou Ting-Chao, Li V. Transmission Range Control in Multihop Packet Radio Networks [J]. ,IEEE Trans on Communications,1986,34(1):38-44
  • 7Takagi H, Kleinrock L. Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals [J]. IEEE Transactions on Communications, 1984,32(3):246-257
  • 8Wattenhofer R, Li L, Bahl P. Distributed topology control for power efficient operation in multihop wireless ad hoc networks [A]. In: Proc. of INFOCOM'2001 [C]. Anchorage, Alaska:IEEE, 2001. 1388-1397
  • 9Glauche I,Krause W,Sollacher R. Continuum percolation of wireless ad hoc communication networks [DB/OL]. www. ima. umn.edu/prob-pde/reprints-preprints/ greiner/greiner_PhysieaA325-2003-577.pdf.2003
  • 10Kleinrock L,Silvester J. Optimum Transmission Radii for Packet Radio Networks or Why Six is a Magic Number [A]. In:IEEE Proceedings of the IEEE National Telecommunications Conference[C]. Birmingham,Alabama,19?8. 431-435

共引文献159

同被引文献21

  • 1MHATRE V P, ROSENBERG C P. MAZUMDAR R R . On the capacity of ad hoc networks under random packet losses [ J ]. IEEE Transactions on Information Theory, 2009,55(6):2 494 -2 498.
  • 2BURKHART M, RICKENBACH P V, WATTENHOFER R, et al. Does Topology control reduce interference? [ C]//Proceedings of the 5th ACM international symposi- um on Mobile ad hoc networking and computing. Roppongi Hills, Tokyo, Japan : ACM, 2004 : 24 - 26.
  • 3JOHANSSON T, CARR - MOTYCKOV L. Reducing inter- ference in ad hoc networks through topology control[ C l// Proceedings of 3rd ACM Joint Workshop on Foundations of Mobile Computing, Cologne, Germany : ACM,2005 : 17 - 23.
  • 4SANTI P. Topology control in wireless ad hoc and sensor net- works[J]. ACM Computing Surveys. 2005, 37(2) :164 - 194.
  • 5RAJARAMAN R. Topology control and routing in ad hoc net- works: a survey[J]. ACM SIGACT News. 2002:60-73.
  • 6ZHAO LIANG, LLOYD E L, RAVI S S. Topology control in constant rate mobile ad hoc networks [ J ]. Wireless Net- works,2010,16 ( 2 ) :467 - 480.
  • 7TOUSSAINT G T. The relative neighborhood graph of a finite planar set [J]. Pattern Recognition,1980,12(4) :261 -268.
  • 8GABRIEL K R, SOKAL R R. A new statistical approach to geographic variation analysis [ J]. Systematic Zoology, 1969,18:259 - 278.
  • 9GAO J, GUIBAS L, HERSHBERGER J, et al. Geomet- ric spanner for routing in mobile networks [ C ]//Proceed- ings of the 2nd Acm Symposium On Mobile Ad Hoc Net- working & Computing ( Mobihoc' 01 ). Long Beach: ACM,2001:45 - 55.
  • 10PRIM R C. Shortest connection networks and generaliza- tion [J]. Bell System Tech, 1957, 36:1 389-1 401.

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部