Abstract
Wireless Sensor Networks (WSNs) are prone to failures. To be robust to failures, the network topology should provide alternative routes to the sinks so when failures occur the routing protocol can still offer reliable delivery. We define l-CRC, a new centrality index which measures a node’s importance to connectivity and efficient delivery in the network. We then use this centrality index to concentrate on the most important nodes, providing alternative paths around the nodes with high centrality. Varying l-CRC allows us to trade off cost for robustness. We introduce GRASP-ABP, a local search algorithm for initial robust topology design. We evaluate the algorithm empirically in terms of the number of additional nodes it suggests and its runtime. We then evaluate the robustness of the designs against node failures in simulation, and we demonstrate that the centrality-based GRASP-ABP’s designs are able to offer reliable delivery, comparable to competitor algorithms, but with fewer additional relays and faster runtime.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bredin, J.L., Demaine, E.D., Hajiaghayi, M., Rus, D.: Deploying Sensor Networks with Guaranteed Capacity and Fault Tolerance. In: Proc. 6th ACM Int’l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 309–319 (2005)
Han, X., Cao, X., Lloyd, E.L., Shen, C.C.: Fault-tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks. IEEE Trans. Mobile Computing 9(5), 643–656 (2010)
Bhandari, R.: Optimal Physical Diversity Algorithms and Survivable Networks. In: Proc. 2nd IEEE Symp. Computers and Communications (ISCC), pp. 433–441 (1997)
Karenos, K., Pendarakis, D., Kalogeraki, V., Yang, H., Liu, Z.: Overlay Routing under Geographically Correlated Failures in Distributed Event-Based Systems. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6427, pp. 764–784. Springer, Heidelberg (2010)
Bhandari, R.: Survivable Networks: Algorithm for Diverse Routing. Kluwer Academic Publishers (1999)
Freeman, L.C.: Centrality in Social Networks Conceptual Clarification. Social Networks 1(3), 215–239 (1979)
Brandes, U.: On Variants of Shortest-Path Betweenness Centrality and Their Generic Computation. Social Networks 30(2), 136–145 (2008)
Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6, 109–133 (1995)
Kchiche, A., Kamoun, F.: Centrality-based Access-Points Deployment for Vehicular Networks. In: Proc. 17th Int’l Conf. Telecommunications (ICT), pp. 700–706 (2010)
Segovia, J., Calle, E., Vila, P.: An Improved Method for Discovering Link Criticality in Transport Networks. In: 6th Int’l Conf. Broadband Communications, Networks, and Systems (BROADNETS), pp. 1–8 (2009)
Oliveira, E.M.R., Ramos, H.S., Loureiro, A.A.F.: Centrality-based Routing for Wireless Sensor Networks. In: Proc. 3rd IFIP Wireless Days, pp. 1–2 (2010)
Pathak, P.H., Dutta, R.: Impact of Power Control on Relay Load Balancing in Wireless Sensor Networks. In: Proc. IEEE Wireless Communications and Networking Conference (WCNC), pp. 1–6 (2010)
Shavitt, Y., Singer, Y.: Beyond Centrality - Classifying Topological Significance using Backup Efficiency and Alternative Paths. New Journal of Physics 9(266) (2007)
Pu, J., Xiong, Z., Lu, X.: Fault-Tolerant Deployment with k-connectivity and Partial k-connectivity in Sensor Networks. Wireless Communications and Mobile Computing 9(7), 909–919 (2008)
Misra, S., Hong, S.D., Xue, G., Tang, J.: Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements. In: Proc. 27th Ann. IEEE Conf. Computer Communications (INFOCOM), pp. 281–285 (2008)
Sitanayah, L., Brown, K.N., Sreenan, C.J.: Fault-Tolerant Relay Deployment for k Node-Disjoint Paths in Wireless Sensor Networks. In: Proc. 4th Int’l Conf. IFIP Wireless Days (2011)
The Network Simulator - ns-2 (September 30, 2009), http://www.isi.edu/nsnam/ns/
Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., Levis, P.: Collection Tree Protocol. In: Proc. 7th ACM Conf. Embedded Networked Sensor Systems (SenSys), pp. 1–14 (2009)
Tmote Sky Datasheet (September 30, 2009), http://www.eecs.harvard.edu/~konrad/projects/shimmer/references/tmotesky-datasheet.pdf
Guo, Y., Kong, F., Zhu, D., Tosun, A.S., Deng, Q.: Sensor Placement for Lifetime Maximization in Monitoring Oil Pipelines. In: Proc. 1st ACM/IEEE Int’l Conf. Cyber-Physical Systems (ICCPS), pp. 61–68 (2010)
Archer, B., Weisstein, E.W.: Lagrange Interpolating Polynomial. MathWorld–A Wolfram Web Resource (September 1, 2011), http://mathworld.wolfram.com/LagrangeInterpolatingPolynomial.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sitanayah, L., Brown, K.N., Sreenan, C.J. (2012). Fault-Tolerant Relay Deployment Based on Length-Constrained Connectivity and Rerouting Centrality in Wireless Sensor Networks. In: Picco, G.P., Heinzelman, W. (eds) Wireless Sensor Networks. EWSN 2012. Lecture Notes in Computer Science, vol 7158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28169-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-28169-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28168-6
Online ISBN: 978-3-642-28169-3
eBook Packages: Computer ScienceComputer Science (R0)