Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks

DOI10.1007/978-3-642-02026-1_46MaRDI QIDQ3637095zbMATH OpenOpenAlexFDO

Authors QingHua Zhu, Huiqiang Yang, Deying Li

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_46

zbMATH Keywords

\(k\)-inconnected many-to-one routingfault-tolerantheuristicswireless networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic network models in operations research (90B10)

Recommendations

• Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
• Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks
• Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
• Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks
• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks

Cited in

(5)

• On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
• A MDP approach to fault-tolerant routing
• A topology control algorithm based on D-region fault
• Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks
• Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks

This page was built for publication: Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637095)