By Topic

Reducing data collection latency in Wireless sensor networks with mobile elements

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liang He ; Univ. of Victoria, Victoria, BC, Canada ; Jianping Pan ; Jingdong Xu

The introduction of mobile elements has created a new dimension to reduce and balance energy consumption in wireless sensor networks, however, data collection latency may become higher. Thus the scheduling of mobile elements, i.e., how they traverse through the sensing field and when they collect data from which sensor, is of ultimate importance and has attracted increasing attention from the research community. Formulated as the Traveling Salesman Problem with Neighborhoods (TSPN) and due to its NP-hardness, so far only approximation and heuristic algorithms have appeared in the literature, but the former only have theoretical value now due to their large approximation factors. In this paper, following a progressive optimization approach, we propose a combine-skip-substitute (css) scheme, which is shown to outperform the best known heuristic algorithm. Besides the correctness and complexity analysis of the proposed scheme, we also show its performance and potentials for further extension through extensive simulation results.

Published in:

Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on

Date of Conference:

10-15 April 2011