Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks

DOI10.1016/J.TCS.2009.06.035zbMath1207.68108OpenAlexW2098396276MaRDI QIDQ621838

Huiqiang Yang, Deying Li, Yuexuan Wang, QingHua Zhu

Publication date: 28 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.035

zbMATH Keywords

approximation algorithmwireless networksfault-tolerant\(k\)-inconnected many-to-one routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks

Cites Work

• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
• MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
• Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
• Disjoint paths in a network
• Unnamed Item

This page was built for publication: Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks