期刊文献+

无线传感器网络基于权值的极小支配集路由算法 被引量:9

A Routing Algorithm Based on Minimal Dominating Set with Weight for Wireless Sensor Networks
下载PDF
导出
摘要 在无线传感器网络设计中,为节约系统能量、延长网络寿命,提出了基于权值极小支配集路由算法(Minimal domina-tingset with weight,WMDS)。该算法的路由搜索主要集中在生成的支配集及网关节点内。当网络中少数节点发生变化时,只需个别相关节点更新它们的状态,不需要网络中所有节点重新计算支配集。考虑到网络内传感器节点能量分布均衡,各节点可以轮换充当支配点,支配点的数据融合可以减少传输信息包的数量。仿真实验表明,WMDS算法能得到较小的支配集,从而有效减少网络广播过程中的转发节点数,节省了网络资源。路由算法明显减少了信息包传输的数量,均衡了各节点的能量消耗,有效地延长了网络的寿命。 In order to reduce power consuming and prolong the network lifetime, this paper proposes a routing algo-rithm based on minimal dominating set with weight (WMDS)for wireless sensor network. In the algorithm, the searching space for a route is reduced to nodes in the dominating set and gateway nodes. When only a few mobile nodes are in movement, it's no need to recalculate the dominating set from scratch, which means only individual nodes update their status. The WMDS routing algorithm utilizes rotation of dominating nodes to evenly distribute the energy load among the sensors in the network and incorporates data fusion into routing protocol to reduce the amount of information that must be transmittecd. Simulations show that, using this algorithm, the size of the resultant dominating set is smaller, so the algorithm can reduce the retransmission nodes and save network resources efficiently in broadcasting. WMDS routing algorithm can reduce the distributing energy dissipation evenly throughout the sensors, so it extends the system lifetime for the networks.
作者 张静 贾春福
出处 《传感技术学报》 CAS CSCD 北大核心 2009年第12期1784-1788,共5页 Chinese Journal of Sensors and Actuators
基金 国家自然科学基金资助(60973141) 天津市自然科学基金资助(09JCYBJC00300)
关键词 无线传感器网络 极小支配集 能量有效 节点更新 路由 wireless sensor network, MDS(minimum dominating set), energy efficient, network update, routing
  • 相关文献

参考文献13

  • 1Hill J,Szewczyk R, woo A, et al. Systemarchitecture Directions for Networked Sensors[J]. ACM SIGPI AN Notices, 2000,35 (11 ) : 93-104.
  • 2孙雨耕,张静,孙永进,房朝晖.无线自组传感器网络[J].传感技术学报,2004,17(2):331-335. 被引量:89
  • 3Akkaya K, Younis M. A Survey on Routing Protocols for Wireless Sensor Networks[J]. Ad Hoc Networks. 2004, to appear.
  • 4Heinzelman W, Kulik J, Balakrishnan H. Adaptive Protocols for Information Dissemination in Wireless Sensor Networks [C]//Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom99) ,Seattle,WA,August 1999.
  • 5Intanagonwiwat C, Govindan R, Estrin D. Directed Diffusion:A Scalable and Robust Communication Paradigm for Sensor Networks[C]//Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom00), Boston, MA, August 2000.
  • 6Heinzelman W, Chandrakasan A, Balakrishnan H. Energy-Efficient Communication Protocol for Wireless Sensor Networks [C]//Proceeding of the Hawaii International Conference System Sciences, Hawaii, January 2000.
  • 7Lindsey S, Raghavendra C S. Pegasis: Power Efficient Gathering in Sensor Information Systems[C]//Proceedings of the IEEE Aerospace Conference, Big Sky, Montana, March 2002.
  • 8Li L, Halpern J Y. Minimum Energy Mobile Wireless Networks Revisited[C]//Proceedings of IEEE International Conference on Communications (ICC01), Helsinki, Finland, June 2001.
  • 9Kalpakis K, Dasgupta K, Namjoshi P. Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks[C]// Proceedings of IEEE International Conference on Networking (NETWORKS02), Atlanta, GA, August 2002.
  • 10He T, Gu L, Luo L, et al. An Overview of Data Aggregation Architecture for Real-Time Tracking with Sensor Networks [C]//20th International Parallel and Distributed Processing Symposium, 2006 : 25-29.

二级参考文献31

  • 1Craig Ulmer. Wireless Sensor Networks.http://users.ece.gatech.edu/-grimace/research/sensorsimii/wireless-sensor-networks.ppt.
  • 2Chris Savarese, Robust Positioning Algorithms for Distribured Ad-Hoc Wireless Sensor Networks[D].master thesis of University of California at Berkeley 2002.
  • 3Bulusu N, Heidemann J, Bychkovskiy V,and Estrin D, Density-Adaptive Beacon Placement Algorithms for localization in ad-hoc wireless networks[J].In: IEEE Infocom 2002,New York, NY, June 2002.
  • 4Soheil Ghiasi,Ankur srivastava,Xiaojian Yang,and Majid Sarrafzadeh,Optimal Energy Aware Clustering in Sensor Networks[J]. Sensors, 2002,2,258-269.
  • 5heinzelman W R, Kulik J, Balakrishnan H. Adaptive protocols for information dissemination in wireless sensor networks[C]. In:Proceedings of the ACM MobiCom'99, Seattle, Washington,1999 pp.174-185.
  • 6Leonidas J.Guibas, Sensing.Tracking, and Reasoning with Relations[J]. IEEE signal processing magazine,2002,3:73-85.
  • 7Dan Li,Kerry D,Wong, Yu Hen Hu, and Akbar M.Sayeed, Detection Classification,and tracking of Targets[J]. IEEE signal processing magazine,2002,3:17-29.
  • 8Maurice Chu, Horst Haussecker, and Feng Zhao, Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks[R]. Xerox Palo Alto Research Center Technical Report May 2001:2001-10113.
  • 9Hill J, Szewczyk R, Woo A, Hollar S, Culler D, and Pister K. System architecture directions for networked sensors[C]. In:Proceedings of the 9th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Nov.2000
  • 10Tiny O S. An operating system for Networked Sensors. http://webs.cs.berkeley.edu/tos/

共引文献115

同被引文献38

引证文献9

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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