An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks

Mustafa Sir, Izzet F. Senturk, Esra Sisikoglu, Kemal Akkaya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

41 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publication2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011
Pages525-530
Number of pages6
DOIs
StatePublished - Jul 26 2011
Event2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011 - Shanghai, China
Duration: Apr 10 2011Apr 15 2011

Other

Other2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011
CountryChina
CityShanghai
Period4/10/114/15/11

Fingerprint

Actuators
Sensors
Wireless networks
travel
Computational efficiency
Sensor networks
heuristics
damages
flexibility
Mathematical models
energy
Recovery
efficiency
performance

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Sir, M., Senturk, I. F., Sisikoglu, E., & Akkaya, K. (2011). An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks. In 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011 (pp. 525-530). [5928869] https://doi.org/10.1109/INFCOMW.2011.5928869

An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks. / Sir, Mustafa; Senturk, Izzet F.; Sisikoglu, Esra; Akkaya, Kemal.

2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011. 2011. p. 525-530 5928869.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sir, M, Senturk, IF, Sisikoglu, E & Akkaya, K 2011, An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks. in 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011., 5928869, pp. 525-530, 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011, Shanghai, China, 4/10/11. https://doi.org/10.1109/INFCOMW.2011.5928869
Sir M, Senturk IF, Sisikoglu E, Akkaya K. An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks. In 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011. 2011. p. 525-530. 5928869 https://doi.org/10.1109/INFCOMW.2011.5928869
Sir, Mustafa ; Senturk, Izzet F. ; Sisikoglu, Esra ; Akkaya, Kemal. / An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks. 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011. 2011. pp. 525-530
@inproceedings{fa8176cf14a84e75831d270d24e10585,
title = "An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks",
abstract = "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.",
author = "Mustafa Sir and Senturk, {Izzet F.} and Esra Sisikoglu and Kemal Akkaya",
year = "2011",
month = "7",
day = "26",
doi = "10.1109/INFCOMW.2011.5928869",
language = "English (US)",
isbn = "9781457702488",
pages = "525--530",
booktitle = "2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011",

}

TY - GEN

T1 - An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks

AU - Sir, Mustafa

AU - Senturk, Izzet F.

AU - Sisikoglu, Esra

AU - Akkaya, Kemal

PY - 2011/7/26

Y1 - 2011/7/26

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

SP - 525

EP - 530

BT - 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011

ER -