Flow-based scheme for time-constrained data gathering in wireless sensor networks Online publication date: Tue, 08-Mar-2016
by Khaled Almi'ani; Anastasios Viglas; Frans Schalekamp; Reza Abrishambaf
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 10, No. 1, 2016
Abstract: We consider the problem of data gathering in a wireless sensor network using a single mobile element. The solution must involve a combination of a mobile element visiting a subset of the nodes (caching points), while other nodes communicate their data to the caching points in a multi-hop communication paradigm. The caching point nodes are selected with the aim of reducing the number of hops, a message originated from a node must travel to reach the nearest caching point. In this paper, we propose a flow-based algorithm that iteratively constructs the mobile element tour and the multi-hop routing trees. By transforming the topology of the network into maximum flow instance, our approach aims to construct its solution to reduce the overall traffic in the network. We evaluate our algorithm by comparing its performance with best comparable well-known algorithms from the literature.
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 Wireless and Mobile Computing (IJWMC):
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