Repairing Wireless Sensor Network connectivity with mobility and hop-count constraints

Loading...
Thumbnail Image
Files
Date
2013-07
Authors
Truong, Thuy T.
Brown, Kenneth N.
Sreenan, Cormac J.
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Research Projects
Organizational Units
Journal Issue
Abstract
Wireless Sensor Networks can become partitioned due to node failure or damage, and must be repaired by deploying new sensors, relays or sink nodes to restore some quality of service. We formulate the task as a multi-objective problem over two graphs. The solution specifies additional nodes to reconnect a connectivity graph subject to network path-length constraints, and a path through a mobility graph to visit those locations. The objectives are to minimise both the cost of the additional nodes and the length of the mobility path. We propose two heuristic algorithms which prioritise the different objectives. We evaluate the two algorithms on randomly generated graphs, and compare their solutions to the optimal solutions for the individual objectives. Finally, we assess the total restoration time for different classes of agent, i.e. small robots and larger vehicles, which allows us to trade-off longer computation times for shorter mobility paths.
Description
Keywords
Sensor Network , Connectivity Repair , Sink Placement
Citation
Truong, T. T., Brown, K. N. and Sreenan, C. J. (2013) 'Repairing Wireless Sensor Network Connectivity with Mobility and Hop-Count Constraints', in Cichoń, J., Gȩbala, M. & Klonowski, M. (eds.) Ad-hoc, Mobile, and Wireless Network: 12th International Conference, ADHOC-NOW 2013, Wrocław, Poland, July 8-10, 2013, Lecture Notes in Computer Science book series (LNCS, volume 7960) Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 75-86. doi: 10.1007/978-3-642-39247-4_7
Link to publisher’s version
Copyright
© Springer-Verlag Berlin Heidelberg 2013. This is the author-created version of the article published in ADHOC-NOW 2013, LCNS 7960. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39247-4_7