Topology design for on-demand dual-path routing in wireless networks
From MaRDI portal
Publication:1947619
DOI10.1007/s11590-012-0453-0zbMath1269.90028OpenAlexW2021556718MaRDI QIDQ1947619
Alexey Sorokin, Balabhaskar Balasundaram, Vladimir L. Boginski, Marco Antonio M. Carvalho
Publication date: 23 April 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0453-0
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items (2)
An integer programming formulation of the key management problem in wireless sensor networks ⋮ On the chance-constrained minimum spanning \(k\)-core problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical aspects of network routing optimization.
- Energy efficient and QoS based routing protocol for wireless sensor networks
- Wireless networking, dominating and packing
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- Maximal Flow Through a Network
- Strong formulations for network design problems with connectivity requirements
This page was built for publication: Topology design for on-demand dual-path routing in wireless networks