一种均衡网络传输功率的移动控制算法

doi:10.3969/j.issn.1001-2400.2011.03.009

Abstract

Abstract:

To decrease the movement cost and the algorithm's iteration number in balancing the transmission power of nodes, a novel movement control algorithm is proposed, which is based on the minimum connected dominating set and Steiner tree. Firstly, a node set, which acts as the backbone of the network, is computed. Then a Steiner tree is constructed with the input of the backbone node set and the critical transmission radius, where the Steiner points are set as the moving candidates' destination points. Finally, the nodes which are not in the backbone node set are matched with and moved to the Steiner points to balance the transmission power. Simulation results show that, compared to the MST-based PMST-UV, the proposed algorithm reduces the movement cost and the iteration number, with the total movement distance decreased 13%~34%, and the iteration number reduced 17%~68%.

Key words: wireless ad hoc network, movement control, balanced transmission power, minimum connected dominating set

CLC Number:

TP393

YAN Zhongjiang；SHEN Zhong；CHANG Yilin；YANG Jiawei. Movement control algorithm for balancing transmission power[J].J4, 2011, 38(3): 48-54.

References

［1］ Sesay S, Yang Z, He J. A Survey on Mobile Ad Hoc Wireless Network ［J］. Information Technology Journal, 2004, 3(2): 168-175.
［2］ Li N, Hou J C, Sha L. Design and Analysis of an MST-based Topology Control Algorithm ［J］. IEEE Trans on Wireless Communications, 2005, 4(3): 1195-1206.
［3］沈中, 常义林, 崔灿. 无线Ad Hoc网络中保留最小能量路径的拓扑控制算法［J］. 西安电子科技大学学报, 2006, 33(3): 341-346.
Shen Zhong, Chang Yilin, Cui Can. Study of the Minimum-energy Path-preserving Topology Control Algorithm for Wireless Ad Hoc Networks ［J］. Journal of Xidian University, 2006, 33(3): 341-346.
［4］公维宾, 常义林, 沈中. 传感器网络中实现传输功率均衡的移动控制算法［J］. 西安电子科技大学学报, 2008, 35(3): 816-822.
Gong Weibing, Chang Yilin, Shen Zhong. Movement Control Algorithms for Realizing the Balance of Transmission Power for Sensor Networks ［J］. Journal of Xidian University, 2008, 35(3): 816-822.
［5］ Younis M, Akkaya K. Strategies and Techniques for Node Placement in Wireless Sensor Networks: a Survey ［J］. Elsevier Ad Hoc Network Journal, 2008, 6(4): 621-655.
［6］ Akkaya K, Senel F. Detecting and Connecting Disjoint Sub-networks in Wireless Sensor and Actor Networks ［J］. Elsevier Ad Hoc Networks, 2009, 7 (7): 1330-1346.
［7］ Diestel R. Graph Theory ［M］. 3rd. Heidelberg: Springer-Verlag, 2006.
［8］路纲, 周明天, 牛新征, 等. 无线网络邻近图综述［J］. 软件学报, 2008, 19(4): 888-911.
Lu Gang, Zhou Mingtian, Niu Xinzheng, et al. A Survey of Proximity Graphs in Wireless Networks ［J］. Journal of Software, 2008, 19(4): 888-911.
［9］ Cheng X, Du D Z, Wang L, et al. Relay Sensor Placement in Wireless Sensor Networks ［J］. Wireless Networks, 2008, 14(3): 347-355.
［10］ Chen D H, Du D Z, Hu X D, et al. Approximations for Steiner Trees with Minimum Number of Steiner Points ［J］. Elsevier Theoretical Computer Science, 2001, 262(2001): 83-99.
［11］ Guha S, Khuller S. Approximation Algorithms for Connected Dominating Sets ［J］. Algorithmica, 1998, 20(4): 374-387.
［12］ Gilbert E N, Pollak H O. Steiner Minimal Trees ［J］. SIAM Journal on Applied Mathematics, 1968, 16(1): 1-29.
［13］ Sedgewick R. Graph Algorithms ［M］. 北京: 中国电力出版社, 2003.
［14］ Penrose M D. The Longest Edge of the Random Minimal Spanning Tree ［J］. The Annals of Applied Probability, 1997, 7(2): 340-361.

[1]	GONG Wei-bin;SHEN Zhong;CHANG Yi-lin. Movement control algorithms for realizing the balance of transmission power for sensor networks [J]. J4, 2008, 35(5): 816-822.
[2]	HE Peng;LI Jian-dong;CHEN Yan-hui. A novel geographic routing applied in Ad Hoc networks [J]. J4, 2006, 33(2): 218-222.
[3]	ZHANG Guang-hui;LI Jian-dong;ZHOU Lei;LIU Jing. Effect of mobility on the critical transmitting range for connectivity in wireless Ad Hoc networks [J]. J4, 2005, 32(6): 881-884.

Movement control algorithm for balancing transmission power

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 3

Metrics

Comments

Recommended 10