Joint design of scheduling and routing based on connected coverage for optimal sensor network lifetime

Tong Zhao; Qing Zhao

doi:10.1117/12.734607

21 September 2007 Joint design of scheduling and routing based on connected coverage for optimal sensor network lifetime

Tong Zhao, Qing Zhao

Author Affiliations +

Proceedings Volume 6697, Advanced Signal Processing Algorithms, Architectures, and Implementations XVII; 66970K (2007) https://doi.org/10.1117/12.734607
Event: Optical Engineering + Applications, 2007, San Diego, California, United States

Abstract

We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random filed. The measured data are sent to an access point through multi-hop transmissions. We address the joint design of sensor scheduling and information routing in each data collection to optimize a performance measure: network lifetime. We first formulate this problem as an integer programming based on the connected coverage in sensor networks. We then derive an upper bound for the network lifetime which provides a measure for the performance of suboptimal methods. After that, we propose a suboptimal method for node scheduling and data routing to maximize the network lifetime. In the proposed method, instead of treating them as two separated optimization problems, the scheduling and routing are integrated into a single algorithm: when scheduling the sensors for area coverage, we consider not only the network geometry but also the energy consumed for the data transmission; when designing the information routing, we consider the role of each sensor in the scheduling since some sensors have crucial importance on the area coverage and should be treated specially in the routing. We study the performance of the proposed method by comparing its result with the lifetime upper bound and the separated design methods. Numerical examples demonstrate the performance of the proposed method.

Citation Download Citation

Tong Zhao and Qing Zhao "Joint design of scheduling and routing based on connected coverage for optimal sensor network lifetime", Proc. SPIE 6697, Advanced Signal Processing Algorithms, Architectures, and Implementations XVII, 66970K (21 September 2007); https://doi.org/10.1117/12.734607

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available