Cart (Loading....) | Create Account
Close category search window

Patrolling Mechanisms for Disconnected Targets in Wireless Mobile Data Mules Networks

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

4 Author(s)
Chih-Yung Chang ; Tamkang Univ., Taipei, Taiwan ; Chih-Yu Lin ; Cehn-Yu Hsieh ; Yi-Jung Ho

This paper considers the target patrolling problem which asks a set of mobile data mules to efficiently patrol a set of given targets. Since the time interval (also referred to visiting interval) for consecutively visiting to each target reflects the monitoring quality of this target, the goal of this research is to minimize the maximal visiting interval. This paper firstly proposes a basic algorithm, called Basic (B-TCTP), which aims at constructing an efficient patrolling route for a number of given data mules such that the visiting intervals of all target points can be minimized. For the scenario containing weighted target points, a Weighted-TCTP (W-TCTP) algorithm is further proposed to satisfy the demand that targets with higher weights have higher data collection frequencies. By considering the energy constraint of each data mule, this paper additionally proposes a RW-TCTP algorithm which treats energy recharge station as a weighted target and arranges the data mules visiting the recharge station before exhausting their energies. Performance study demonstrates that the proposed algorithms outperform existing approaches in terms of visiting intervals of the given targets and length of patrolling path.

Published in:

Parallel Processing (ICPP), 2011 International Conference on

Date of Conference:

13-16 Sept. 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.