TY - JOUR
T1 - The lifetime maximization problem in wireless sensor networks with a mobile sink
T2 - Mixed-integer programming formulations and algorithms
AU - Behdani, Behnam
AU - Cole Smith, J.
AU - Xia, Ye
N1 - Funding Information:
This work has been supported by the National Science Foundation through grant CMMI-1100765 and the De- fense Threat Reduction Agency through grant HDTRA1-10-1-0050. The authors are very grateful for the insightful remarks contributed by two referees, which led to an improved version of this article.
PY - 2013/10/1
Y1 - 2013/10/1
N2 - This article considers the problem of maximizing the lifetime of a wireless sensor network with a mobile sink. The sink travels at finite speed among a subset of possible sink locations to collect data from a stationary set of sensor nodes. The considered problem chooses a subset of sink locations for the sink to visit, finds a tour for the sink among the selected sink locations, and prescribes an optimal data routing scheme from the sensor nodes to each location visited by the sink. The sinks tour is constrained by the time it spends at each location collecting data. Two variations of this problem are examined based on assumptions regarding delay tolerance. Exact mixed-integer programming formulations to model this problem are provided along with cutting planes, preprocessing techniques, and a Benders decomposition algorithm to improve its solvability. Computational results demonstrate the effectiveness of the proposed methods.
AB - This article considers the problem of maximizing the lifetime of a wireless sensor network with a mobile sink. The sink travels at finite speed among a subset of possible sink locations to collect data from a stationary set of sensor nodes. The considered problem chooses a subset of sink locations for the sink to visit, finds a tour for the sink among the selected sink locations, and prescribes an optimal data routing scheme from the sensor nodes to each location visited by the sink. The sinks tour is constrained by the time it spends at each location collecting data. Two variations of this problem are examined based on assumptions regarding delay tolerance. Exact mixed-integer programming formulations to model this problem are provided along with cutting planes, preprocessing techniques, and a Benders decomposition algorithm to improve its solvability. Computational results demonstrate the effectiveness of the proposed methods.
KW - Wireless sensor networks
KW - lifetime maximization
KW - mixed-integer programming
KW - mobile sink
KW - sink trajectory
UR - http://www.scopus.com/inward/record.url?scp=84880212628&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84880212628&partnerID=8YFLogxK
U2 - 10.1080/0740817X.2013.770189
DO - 10.1080/0740817X.2013.770189
M3 - Article
AN - SCOPUS:84880212628
SN - 0740-817X
VL - 45
SP - 1094
EP - 1113
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 10
ER -