WSNs中基于能量代价的最小权和支配集拓扑控制算法

孙超; 尹荣荣; 郝晓辰; 刘彬

doi:10.3724/SP.J.1146.2009.00342

WSNs中基于能量代价的最小权和支配集拓扑控制算法

doi: 10.3724/SP.J.1146.2009.00342

计量
- 文章访问数: 3657
- HTML全文浏览量: 68
- PDF下载量: 947
- 被引次数: 0
出版历程
- 收稿日期: 2009-03-16
- 修回日期: 2009-09-21
- 刊出日期: 2010-04-19

Energy Cost Based Topology Control Algorithm of Minimum-Total-Weight Connected Dominating Set in WSNs

摘要

摘要: 该文针对无线传感器网络中最小连通支配集拓扑并非网络耗能最小拓扑的问题，定义由节点剩余能量，邻居个数和通信代价构建的能量代价函数综合反映支配节点的能量效率以及对降低网络整体能耗的贡献，进而以其作为拓扑权值，提出一种基于能量代价的最小权和连通支配集拓扑控制算法。算法选取局部最小权值节点担负支配任务，搭建整体权和最小的支配集，最小化网络整体能耗。实验结果表明，算法不仅具有节能的特点，还确保了通信链路的可靠性，有效延长了网络生命周期。
- 无线传感器网络; 拓扑控制; 能量代价; 最小权和连通支配集
Abstract: In this paper, defining energy cost function constructed by remain energy, neighborhood numbers and communication cost of nodes as topology weight to synthetically reflect the energy efficiency of dominator and the contribution of reduced whole energy consumption, an Energy Cost based topology control algorithm for Minimum-total-weight Connected Dominating Set (ECMCDS) is proposed to solve the problem that the energy consumption of minimum connected dominating set is not minimum. The algorithm locally selects the node with a low-weight undertaking dominating mission to construct minimum-total-weight dominating set, and minimums the total energy consumption of networks. The experimental results show that the algorithm not only has the energy saved characters, but also ensures the reliability of topology links and extends the network life-cycle efficiently.

HTML全文

参考文献(1)

任丰原, 黄海宁, 林闯. 无线传感器网络[J]. 软件学报, 2003,14(7): 1282-1291.Ren F Y, Huang H N, and Lin C. Wireless sensor networks[J].Journal of Software, 2003, 14(7): 1282-1291.[2]Yao K. Sensor networking: Concepts, applications, andchallenges[J]. Acta Automatica Sinica, 2006, 32(6): 839-845.[3]Zhao T, Cai W D, and Liu G. Topology control for wirelesssensor networks[C]. 2007 IFIP International Conference onNetwork and Parallel Computing Workshops, NPC 2007.Dalian, China. Sep 18-21 2007: 343-348.[4]Jardosh S and Ranjan P. A survey: Topology control forwireless sensor networks[C]. International Conference onSignal Processing Communications and Networking, ICSCN2008, Chennai, India, Jan 4-6 2008: 422-427.[5]Navid N and Christian B. Topology management forimproving routing and network performances in mobile adhoc networks[J].Mobile Networks and Applications.2004,9(6):583-594[6]Ruan L, Du H W, and Jia X H, et al.. A greedyapproximation for minimum connected dominating sets[J].Theoretical Computer Science.2004, 329(1):325-330[7]Qian J S and Sun Y J. Construction of distributed connecteddominating sets in growth-bounded graphs[C]. 2008 3rdIEEE Conference on Industrial Electronics and Applications,ICIEA 2008, Singapore, Singapore, Jun 3-5 2008: 1430-1434.[8]唐勇, 周明天. 基于极大独立集的最小连通支配集的分布式算法[J]. 电子学报, 2007, 35(5): 868-874.Tang Y and Zhou M T. Maximal independent set baseddistributed algorithm for minimum connected dominatingset[J]. Acta Electronica Sinica, 2007, 35(5): 868-874.[9]Khaled A, Li X Y, and Wang Y, et al.. Geometric spannersfor wireless ad hoc networks[J].IEEE Transactions onParallel and Distributed Systems.2003, 14(4):408-421[10]Zhu J H, Li J Z, and Liu Y, et al.. Data-driven sleepingscheduling mechanism in sensor networks[J]. ComputerResearch and Development, 2008, 45(1): 172-179.[11]Wang Y, Wang W Z, and Li X Y. Efficient distributedlow-cost backbone formation for wireless networks[J].IEEETransactions on Parallel and Distributed Systems.2006, 17(7):681-693[12]Slama I, Jouaber B, and Zeghlache D. Adaptive lifetimemaximization strategies for wireless sensor networks[C]. 20072nd International Symposium on Wireless PervasiveComputing. San Juan, PR, United States. 2007: 88-92.[13]Sun P G, Zhao H, and Pu M, et al.. Evaluation ofcommunication link in wireless sensor networks[J]. Joural ofNortheastern University (Natural Science), 2008, 29(4):500-503，520.[14]Marco Z and Bhaskar K. Analyzing the transitional region inlow power wireless links[C]. 2004 First Annual IEEECommunications Society Conference on Sensor and Ad hocCommunications and Networks, IEEE SECON 2004. SantaClara, CA, United States. Oct 4-7 2004: 517-526.[15]Li X Y and Wan P J. Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks[C]. 11thAnnual International Conference on Computing andCombinatorics, COCOON 2005. Kunming, China. Aug 16-292005: 126-135.

施引文献

资源附件(0)

访问统计