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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem. John Wiley & Sons (1985)
Fischetti, M., Salazar-Gonzalez, J.J., Toth, P.: The generalized traveling salesman and orienteering problems. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12, pp. 609–662. Springer (2004)
Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Journal of Natural Computing 9(1), 47–60 (2010)
Fischetti, M., Gonzlez, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized travelling salesman problem. Operations Research 45, 378–394 (1997)
Akkaya, K., Senel, F., Thimmapuram, A., Uludag, S.: Distributed recovery from network partitioning in movable sensor/actor networks via controlled mobility. IEEE Transaction on Computing 59, 258–271 (2010)
Abbasi, A.A., Younis, M.F., Baroudi, U.A.: A least-movement topology repair algorithm for partitioned wireless sensor-actor networks. International Journal of Sensor Networks 11(4), 250–262 (2012)
Abbasi, A.A., Younis, M.F., Baroudi, U.A.: Recovering from a node failure in wireless sensor-actor networks with minimal topology changes. IEEE Transaction on Vehicular Technology 62(1), 256–271 (2013)
Senel, F., Younis, M., Akkaya, K.: A robust relay node placement heuristic for structurally damaged wireless sensor networks. In: LCN 2009, pp. 633–640 (2009)
Lee, S., Younis, M.: Recovery from multiple simultaneous failures in wireless sensor networks using minimum steiner tree. Journal of Parallel Distributed Computing 70, 525–536 (2010)
Kim, H., Kwon, T., Mah, P.S.: Multiple sink positioning and routing to maximize the lifetime of sensor networks. IEICE Transactions on Communications 91-B(11), 3499–3506 (2008)
Gu, Y., Ji, Y., Li, J., Chen, H., Zhao, B., Liu, F.: Towards an optimal sink placement in wireless sensor networks. In: ICC 2010, pp. 1–5 (2010)
Kim, D., Wang, W., Sohaee, N., Ma, C., Wu, W., Lee, W., Du, D.Z.: Minimum data-latency-bound k-sink placement problem in wireless sensor networks. IEEE/ACM Transaction on Networking 19(5), 1344–1353 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Truong, T.T., Brown, K.N., 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. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-39247-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39246-7
Online ISBN: 978-3-642-39247-4
eBook Packages: Computer ScienceComputer Science (R0)