A Steiner tree movement control algorithm(SMC)is proposed to improve low success rate and large movement cost in wireless ad hoc network topology recovery. The SMC computes a Steiner tree by calling 3STP-MSP algorithm
where the vertices contain all the nodes in the network and the introduced Steiner points. Then the Steiner points are regarded as movement destinations
and some nodes are selected and scheduled to move to these Steiner points. SMC runs iteratively until the network is connected. Simulation results show that the SMC not only reconnects the network with a success rate 100%
but also decreases the movement cost significantly
compared with the MST-based PMST-UV algorithm
and that the total movement distance is reduced by 37% to 45% and the number of total movement nodes is reduced by 9% to 29%.
关键词
Keywords
references
SESAY S, YANG Zongkai, HE Jianhua. A survey on mobile ad hoc wireless network [J]. Information Technology Journal, 2004, 3(2): 168-175.
ABBASI A A, AKKAYA K, YOUNIS M. A distributed connectivity restoration algorithm in wireless sensor and actor networks [C]∥Proceedings of 32nd IEEE Conference on LCN. Piscataway, NJ, USA: IEEE, 2007: 496-503.
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.
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.
DIESTEL R. Graph theory [M]. 3rded. Heidelberg, Germany: Springer-Verlag, 2006.
GILBERT E N, POLLAK H O. Steiner minimal trees [J]. SIAM Journal on Applied Mathematics, 1968, 16(1): 1-29.
CHENG Xiuzhen, DU Dingzhu, WANG Lusheng, et al. Relay sensor placement in wireless sensor networks [J]. Wireless Networks, 2008, 14(3): 347-355.
CHEN Donghui, DU Dingzhu, HU Xiaodong, et al. Approximations for Steiner trees with minimum number of Steiner points [J]. Elsevier Theoretical Computer Science, 2001, 262(1/2): 83-99.
BETTSTETTER C. On the minimum node degree and connectivity of a wireless multihop network [C]∥Proceeding of 3rd ACM International Symposium on Mobile Ad Hoc Networking Computing. New York, NY, USA: ACM Press, 2002: 80-91.