Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Coordinated sensor deployment for improving secure communications and sensing coverage
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Underground structure monitoring with wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Trade-offs between mobility and density for coverage in wireless sensor networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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 single active flow must lie entirely on the line between the source and destination with each node spaced evenly along such a line. Based on 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 on 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 an 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 al. (Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc'04), pp 163---174 2004) using only one-hop neighbor information, our methods will converge more quickly. The experimental results show a substantial improvement on the speed of achieving the optimal configuration and the total moving distance of nodes.