收稿日期: 2010-04-21
网络出版日期: 2010-11-15
基金资助
上海电力学院人才引进基金(K-2010-12)资助
Study on optimization of communication radii of nodes in hierarchically clustered wireless sensor networks
Received date: 2010-04-21
Online published: 2010-11-15
孙波 , 高随祥 , 陆青 . 异构分簇无线传感器网络中节点通信半径的研究[J]. 中国科学院大学学报, 2010 , 27(6) : 818 -823 . DOI: 10.7523/j.issn.2095-6134.2010.6.013
This study focuses on how to optimize the communication radii of sensor nodes in hierarchically clustered sensor networks to minimize the total energy consumption. The energy model is E=a(dα+c), where R denotes the range of sensor networks and K is the number of layers. When the radii of sensor nodes are fixed, the upper bound of the optimal radii of sensor nodes is proved to be α c/(α-1) if α=2,c≤4R2, or if α=4, c≤4R2,K≤ 6 R. When the radii are adjustable and α=2, the radii are obtained by minimizing the average energy consumption layer by layer.
[1] Akyildiz I F, Su W, Sankarasubramaniam Y, et al. Wireless sensor networks: a survey
[J]. Computer Networks, 2002, 38(4): 393-422.
[2] Cruller D, Estrin D, Srivastava M. Overview of sensor networks
[J]. Computer, 2004, 37(8): 41-49.
[3] Younis, Krunz M, Ramasubramanian S. Node clustering in wireless sensor networks: Recent developments and deployment challenges
[J]. IEEE Network, 2006, 20(3): 20-25.
[4] Wadaa A, Olariu S, Wilson L, et al. On training a sensor network //Proceedings of Parallel and Distributed Processing Symposium. USA: IEEE Computer Society, 2003.8-15.
[5] Olariu S, Stojmenovic I. Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting //Proceedings of the IEEE INFOCOM. New York: IEEE Communications Society, 2006. 1-12.
[6] Sun B, Gao S X, Chi R, et al. Algorithms for Balancing Energy Consumption in Wireless Sensor Networks //Proceedings of 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing. HongKong: ACM, 2008, 53-60.
[7] 杨文国. 无线传感器网络中若干关键问题研究 . 北京: 中国科学院研究生院, 2006.
/
| 〈 |
|
〉 |
