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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.