TY - GEN
T1 - Data transmission and base-station placement for optimizing network lifetime
AU - Arkin, Esther M.
AU - Polishchuk, Valentin
AU - Efrat, Alon
AU - Ramasubramanian, Srinivasan
AU - Taheri, Javad
AU - Mitchell, Joseph S.B.
AU - Sankararaman, Swaminathan
PY - 2010
Y1 - 2010
N2 - We study the problem of transmitting data from a set of sensors to a base-station where the data is to be gathered. Each sensor continuously generates data and has to transmit it through the network (via other sensor nodes) to the base-station. Considering the battery limitations of the sensors, our goal is to find an optimum location of the base-station and a corresponding data transmission scheme for routing the data from the sensors, such that the network is operating for the longest possible time. We focus mainly on tree networks for 2-level trees, with at most 2 hops from sensor to the base-station. For such networks we give efficient algorithms for forwarding data from sensors to the base-station and for locating the base-station optimally for maximizing network lifetime. Further, we show that determining a transmission protocol for trees with 3 or more levels is NP-hard. We demonstrate the effectiveness of our methods with experimental results on simulated data, comparing our 2-level tree algorithm with methods based on linear programming.
AB - We study the problem of transmitting data from a set of sensors to a base-station where the data is to be gathered. Each sensor continuously generates data and has to transmit it through the network (via other sensor nodes) to the base-station. Considering the battery limitations of the sensors, our goal is to find an optimum location of the base-station and a corresponding data transmission scheme for routing the data from the sensors, such that the network is operating for the longest possible time. We focus mainly on tree networks for 2-level trees, with at most 2 hops from sensor to the base-station. For such networks we give efficient algorithms for forwarding data from sensors to the base-station and for locating the base-station optimally for maximizing network lifetime. Further, we show that determining a transmission protocol for trees with 3 or more levels is NP-hard. We demonstrate the effectiveness of our methods with experimental results on simulated data, comparing our 2-level tree algorithm with methods based on linear programming.
KW - algorithms
KW - base-station location
KW - matching
KW - optimization
KW - routing
KW - sensor networks
UR - http://www.scopus.com/inward/record.url?scp=78549283546&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78549283546&partnerID=8YFLogxK
U2 - 10.1145/1860684.1860692
DO - 10.1145/1860684.1860692
M3 - Conference contribution
AN - SCOPUS:78549283546
SN - 9781450304139
T3 - Proceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10
SP - 23
EP - 32
BT - Proceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10
T2 - 6th ACM SIGACT-SIGMOBILE International Workshop on Foundations of Mobile Computing, DIALM-POMC 2010
Y2 - 16 September 2010 through 16 September 2010
ER -