Joint Design of Scheduling and Routing Based on Connected Coverage for Optimal Sensor Network Lifetime
Source: University of California
The authors consider information retrieval in a wireless sensor network deployed to monitor a spatially corrected random led. The measured data are sent to an access point through multi-hop transmissions. They address the joint design of sensor scheduling and information routing in each data collection to optimize a performance measure: network lifetime. They first formulate this problem as an integer programming based on the connected coverage in sensor networks. They, then derive an upper bound for the network lifetime which provides a measure for the performance of suboptimal methods. After that, they propose a suboptimal method for node scheduling and data routing to maximize the network lifetime.