Abstract
One way to achieve reliability with low-latency is through multi-path routing and transport protocols that build redundant delivery channels (or data paths) to reduce end-to-end packet losses and retransmissions. However, the applicability and effectiveness of such protocols are limited by the topological constraints of the underlying communication infrastructure. Multiple data delivery paths can only be constructed over networks that are capable of supporting multiple paths. In mission-critical wireless networks, the underlying network topology is directly affected by the terrain, location and environmental interferences, however the settings of the wireless radios at each node can be properly configured to compensate for these effects for multi-path support. In this work we investigate optimization models for topology designs that enable end-to-end dual-path support on a distributed wireless sensor network. We consider the case of a fixed sensor network with isotropic antennas, where the control variable for topology management is the transmission power on network nodes. For optimization modeling, the network metrics of relevance are coverage, robustness and power utilization. The optimization models proposed in this work eliminate some of the typical assumptions made in the pertinent network design literature that are too strong in this application context.
Similar content being viewed by others
References
Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)
Arguedas, M., Perez, C., Carvalho, M., Granados, A., Hoback, K., Kraus, W.: Investigating the use of topology adaptation for robust multi-path transport: a preliminary study. In: 2009 Eighth IEEE International Symposium on Network Computing and Applications, pp. 118–121. IEEE, Piscataway (2009)
Balasundaram, B., Butenko, S. : Graph domination, coloring and cliques in telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 865–890. Spinger Science + Business Media, New York (2006)
Bang-Jensen J., Chiarandini M., Morling P.: A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Networks 55(4), 299–325 (2010)
Bertsimas D., Weismantel R.: Optimization Over Integers. Dynamic Ideas, Belmont (2005)
Carvalho, M., Granados, A., Subramanian, S., Perez, C.: A cross-layer approach to mixed-control topology management for MANETs. In: The 2010 Military Communications Conference—Unclassified Program—Cyber Security and Network Management (MILCOM 2010-CSNM), San Jose, California, USA, vol. 10 (2010)
Carvalho, M., Winkler, R., Perez, C., Kovach, J., Choy, S.: A cross-layer predictive routing protocol for mobile ad hoc networks. In: Suresh, R. (ed.) Presented at the Society of Photo-Optical Instrumentation Engineers (SPIE) Conference. Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series, vol. 6981, May 2008
Chakraborty, T., Chuzhoy, J., Khanna, S.: Network design for vertex connectivity. In: STOC ’08: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, New York, USA, pp. 167–176. ACM, New York (2008)
Choi, J.Y., Ko, Y.B., Kim, Y.S., Jin, J.S.: A dual-path on-demand routing protocol for tactical wireless networks. In: 2010 The 12th International Conference on Advanced Communication Technology (ICACT), vol. 1, pp. 445–450. IEEE, Piscataway (2010)
Ghada, K., Li, J., Ji, Y.: Cross-layer design for topology control and routing in manets. In: Wireless Communications and Mobile Computing (2010)
He, E., Leigh, J., Yu, O., DeFanti, T.A.: Reliable blast udp: predictable high performance bulk data transfer. In: Proceedings of the IEEE International Conference on Cluster Computing, CLUSTER ’02, Washington, DC, USA, pp. 317. IEEE Computer Society, Huntsville (2002)
Ford L. Jr, Fulkerson D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)
Ljubić I.: A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. Networks 56(3), 169–182 (2010)
Magnanti T.L., Raghavan S.: Strong formulations for network design problems with connectivity requirements. Networks 45(2), 61–79 (2005)
Menger K.: Zur allgemeinen kurventheorie. Fundam. Math. 10, 95–115 (1927)
Monma C.L., Shallcross D.F.: Methods for designing communications networks with certain two-connected survivability constraints. Oper. Res. 37(4), 531–541 (1989)
Mueller, S., Tsang, R.P., Ghosal, D.: Multipath routing in mobile ad hoc networks: issues and challenges. In: Performance Tools and Applications to Networked Systems, pp. 209–234 (2004)
Oliveira C., Pardalos P.M.: Mathematical Aspects of Network Routing Optimization. Springer, Berlin (2011)
Partridge, C., Hinden, R.M.: Version 2 of the Reliable Data Protocol (RDP). RFC 1151 (Experimental) April (1990)
Postel, J.: Transmission Control Protocol. RFC 793 (Standard), September (1981)
Resende M.G.C., Pardalos P.M.: Handbook of Optimization in Telecommunications. Springer, Berlin (2006)
Steiglitz K., Weiner P., Kleitman D.: The design of minimum-cost survivable networks. IEEE Trans. Circuit Theory 16(4), 455–460 (1969)
Velten, D., Hinden, R.M., Sax, J.: Reliable Data Protocol. RFC 908 (Experimental), July (1984)
Wu W., Gao X., Pardalos P., Du D.-Z.: Wireless networking, dominating and packing. Optim. Lett. 4, 347–358 (2010)
Yahya, B., Ben-Othman, J.: Relax: an energy efficient multipath routing protocol for wireless sensor networks. In: 2010 IEEE International Conference on Communications (ICC), pp. 1–6. IEEE, Piscataway (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Carvalho, M., Sorokin, A., Boginski, V. et al. Topology design for on-demand dual-path routing in wireless networks. Optim Lett 7, 695–707 (2013). https://doi.org/10.1007/s11590-012-0453-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-012-0453-0