Mobility control for achieving optimal configuration in wireless sensor networks

作     者：Jiang, Zhen Wu, Jie Kline, Robert 

作者机构：W Chester Univ Dept Comp Sci Informat Secur Ctr W Chester PA 19383 USA Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA 

出 版 物：《WIRELESS NETWORKS》 (无线网络)

年 卷 期：2010年第16卷第1期

页      面：141-152页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：NSF [ANI 0083836  CCR9900646  CNS 0422762  CNS 0434533  EIA 0130806] 

主　　题：Wireless sensor networks (WSNs) Distributed algorithm Information model Mobility control Self-configuration 

摘      要：Recent work in wireless sensor networks, or simply called WSNs, has drawn attention to the mobility capability of each node. In Stojmenovic and Lin (IEEE Trans Parallel Distrib Syst 12: 1023-1032, 2001). it is proved that the optimal positions of the relay nodes along a active flow must lie entirely oil the line between the source and destination with each node spaced evenly along such a line. Based oil this, we propose two practical solutions to control the relay nodes in WSNs to approach their optimal positions in the local relative coordinate system. One uses one-hop neighbor information and the other one uses two-hop neighbor information. Basically, each relay node will approach the midpoint oil the line composed of neighbors. For the latter control scheme, we also discuss Its different implementation with outdated two-hop neighbor information (lagged by one-round neighbor information exchange and update). This is all improvement since given nodes only reuse the two-hop neighbor information previously saved at its one-hop neighbors and does not require any extra neighbor information collection. All the new methods prevent oscillations by demanding minimal moving distance per round (MDPR), otherwise the node does not move. Unlike the one presented in Goldenberg et in. (Proceedings of the 5th ACM International Symposium Oil Mobile Ad Hoc Networking and Computing (Mobihoc 04), pp 163-174 2004) using Only one-hop neighbor information. Our methods win converge more quickly. The experimental results Show a Substantial improvement oil the speed of,achieving the optimal Configuration and the total moving distance of nodes.