An efficient data gathering algorithm for large-scale wireless sensor networks with mobile sinks Online publication date: Tue, 08-May-2018
by Jumin Zhao; Qingming Tang; Deng-ao Li; Biaokai Zhu; Yikun Li
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 28, No. 1, 2018
Abstract: Recently, wireless sensor networks with mobile sinks (mWSN) have attracted massive attention attributed to the benefits of mobility. The updating of routing, however, will generate a lot of control packets due to the movements of mobile sinks in mWSN, which will consume a lot of energy and reduce the life of network. This paper proposed a data gathering algorithm for large-scale mWSN. In the proposed algorithm, the entire network was divided into several gathering scopes. Each gathering scope locally updates the routing structure according to the path extension ratio which can effectively reduce the control packets generated by the updating of routing. To decrease the frequency of updating and the energy consumption of network, anchor nodes chains are adopted. Extensive simulation results show that the proposed algorithm can significantly reduce the control packets and prolong the lifetime of network when compared with other algorithms.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook