TY - JOUR
T1 - Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks
AU - Arkin, Esther M.
AU - Efrat, Alon
AU - Mitchell, Joseph S.B.
AU - Polishchuk, Valentin
AU - Ramasubramanian, Srinivasan
AU - Sankararaman, Swaminathan
AU - Taheri, Javad
N1 - Funding Information:
E. Arkin and J. Mitchell are partially funded by the National Science Foundation ( CCF-07929019, CCF-1018388 ). A. Efrat is supported by NSF CAREER Grant 0348000 and NSF Grant CNS-1017714 . V. Polishchuk is supported by the Academy of Finland , Grant 138520 . We thank the anonymous reviewers for their many helpful comments and suggestions.
PY - 2014/1
Y1 - 2014/1
N2 - In this paper, we study the fundamental optimization problem in wireless sensor networks of base-station positioning such that data from the sensors may be transmitted to it in an energy-efficient manner. We primarily consider the setting where a sensor transmits all of its data directly to the base-station or relays it via one other node. This setting provides two benefits: low duty-cycling due to limited synchronization requirements between nodes and low end-to-end delay due to the limited number of hops in the routes. Given the battery limitations of the sensor nodes, our objective is to maximize the network lifetime. First, we present efficient algorithms for computing a transmission scheme for the sensors given a fixed base-station and show how to implement these in a distributed fashion with only a constant number of messages per sensor. Next, we show that the optimization problem for the setting where sensors may transmit data through more than 2 hops is NP-Hard. Finally, we present efficient algorithms for the problem of locating the base-station and simultaneously finding a transmission scheme. We compare our algorithms with linear-programming based algorithms for more general settings through extensive simulations and outline the benefits of the different approaches.
AB - In this paper, we study the fundamental optimization problem in wireless sensor networks of base-station positioning such that data from the sensors may be transmitted to it in an energy-efficient manner. We primarily consider the setting where a sensor transmits all of its data directly to the base-station or relays it via one other node. This setting provides two benefits: low duty-cycling due to limited synchronization requirements between nodes and low end-to-end delay due to the limited number of hops in the routes. Given the battery limitations of the sensor nodes, our objective is to maximize the network lifetime. First, we present efficient algorithms for computing a transmission scheme for the sensors given a fixed base-station and show how to implement these in a distributed fashion with only a constant number of messages per sensor. Next, we show that the optimization problem for the setting where sensors may transmit data through more than 2 hops is NP-Hard. Finally, we present efficient algorithms for the problem of locating the base-station and simultaneously finding a transmission scheme. We compare our algorithms with linear-programming based algorithms for more general settings through extensive simulations and outline the benefits of the different approaches.
KW - Algorithms
KW - Base-station location
KW - Data forwarding
KW - Network design
KW - Optimization
KW - Routing
KW - Sensor networks
UR - http://www.scopus.com/inward/record.url?scp=84888644834&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84888644834&partnerID=8YFLogxK
U2 - 10.1016/j.adhoc.2011.09.010
DO - 10.1016/j.adhoc.2011.09.010
M3 - Article
AN - SCOPUS:84888644834
SN - 1570-8705
VL - 12
SP - 201
EP - 218
JO - Ad Hoc Networks
JF - Ad Hoc Networks
IS - 1
ER -