Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
A scalable approach for reliable downstream data delivery in wireless sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Algorithm Design
Minimum energy reliable paths using unreliable wireless links
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 5th international conference on Information processing in sensor networks
Variations of the maximum leaf spanning tree problem for bipartite graphs
Information Processing Letters
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithms and Protocols for Wireless Sensor Networks
Algorithms and Protocols for Wireless Sensor Networks
Multi-path routing protocols in wireless mobile ad hoc networks: a quantitative comparison
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
IEEE Transactions on Information Theory
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
Coding-aware scheduling for reliable many-to-one flows
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Survivability strategies in multihop wireless networks
IEEE Wireless Communications
Robust network codes for unicast connections: a case study
IEEE/ACM Transactions on Networking (TON)
S-NC: structure-free network coding-aware routing in wireless sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Fault-tolerant routing mechanism based on network coding in wireless mesh networks
Journal of Network and Computer Applications
Scalable redundancy for sensors-to-sink communication
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
This paper addresses the problem of survivability of many-to-one flows in wireless networks, such as wireless mesh networks (WMNs) and wireless sensor networks (WSNs). Traditional protection schemes are either resource-hungry like the (1+1) protection scheme, or introduce a delay and interrupt the network operation like the (1 : N) protection scheme. In this paper, we present a network coding-based protection technique that overcomes the deficiencies of the traditional schemes. We derive and prove the necessary and sufficient conditions for our solution on a restricted network topology. Then we relax these connectivity requirements and show how to generalize the sufficient and necessary conditions to work with any other topology. We also show how to perform deterministic coding with {0,1} coefficients to achieve linear independence. Moreover, we discuss some of the practical considerations related to our approach. Specifically, we show how to adapt our solution when the network has a limited min-cut; we therefore define a more general problem that takes this constraint into account, which prove to be NP-complete. Furthermore, we discuss the decoding process at the sink, and show how to make use of our solution in the upstream communication (from sink to sources). We also study the effect of the proposed scheme on network performance. Finally, we consider the implementation of our approach when all network nodes have single transceivers, and we solve the problem through a greedy algorithm that constructs a feasible schedule for the transmissions from the sources.