TY - GEN
T1 - An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks
AU - Sir, Mustafa Y.
AU - Senturk, Izzet F.
AU - Sisikoglu, Esra
AU - Akkaya, Kemal
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - Wireless Sensor and Actuator Networks (WSANs) employ mobile nodes in addition to stationary tiny sensors. Similarly, mobile sensors make it possible to have the flexibility of mobility in mobile sensor network (MSN) applications. Mobility can be exploited to connect partitioned WSANs and MSNs due to large scale damages or deployment problems. However, since mobility consume significant energy and it can be limited due to terrain constraints, the travel distance for the mobile nodes should be minimized in such a recovery effort. In this paper, we present a mathematical model which minimizes the total travel distance for connecting a given number of partitions. The idea is based on network flows and the problem is modeled as a mixed integer nonlinear program. The nonlinear terms in the model are linearized using a polygon approximation for computational efficiency. We evaluated the performance of the proposed approach in terms of total distance as well as the time to reconnect the partitions. The results show that our approach outperforms the heuristic approach in terms of total distance and delay and reveals various trade-offs involved in connecting multiple partitions.
AB - Wireless Sensor and Actuator Networks (WSANs) employ mobile nodes in addition to stationary tiny sensors. Similarly, mobile sensors make it possible to have the flexibility of mobility in mobile sensor network (MSN) applications. Mobility can be exploited to connect partitioned WSANs and MSNs due to large scale damages or deployment problems. However, since mobility consume significant energy and it can be limited due to terrain constraints, the travel distance for the mobile nodes should be minimized in such a recovery effort. In this paper, we present a mathematical model which minimizes the total travel distance for connecting a given number of partitions. The idea is based on network flows and the problem is modeled as a mixed integer nonlinear program. The nonlinear terms in the model are linearized using a polygon approximation for computational efficiency. We evaluated the performance of the proposed approach in terms of total distance as well as the time to reconnect the partitions. The results show that our approach outperforms the heuristic approach in terms of total distance and delay and reveals various trade-offs involved in connecting multiple partitions.
UR - http://www.scopus.com/inward/record.url?scp=79960602642&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960602642&partnerID=8YFLogxK
U2 - 10.1109/INFCOMW.2011.5928869
DO - 10.1109/INFCOMW.2011.5928869
M3 - Conference contribution
AN - SCOPUS:79960602642
SN - 9781457702488
T3 - 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011
SP - 525
EP - 530
BT - 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011
T2 - 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011
Y2 - 10 April 2011 through 15 April 2011
ER -