A moving algorithm for non-uniform deployment in mobile sensor networks Online publication date: Sat, 24-Jan-2015
by Cheng-Hung Liu, Kuo-Feng Ssu, Wei-Tong Wang
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 4, No. 3, 2011
Abstract: Previous research indicated that uniform deployment was not the most efficient way for saving energy in wireless sensor networks (WSNs). The location nearer a sink should have more sensors deployed. This paper describes a moving algorithm for achieving the non-uniform deployment (MAND). With MAND, mobile sensors can move to appropriate locations to prolong the system lifetime. With two refinements on MAND (called EMAND), not only the coverage of the network is maintained, but the lifetime can be improved enormously. Simulation results show that EMAND performs well in the environment with more sensing events.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com