Open Access
Multipath Network Coding in Wireless Mesh Networks
Velmurugan Ayyadurai,Klaus Moessner,Rahim Tafazolli +2 more
- 22 Oct 2012
1
TL;DR: In this paper, the authors considered a small-scale mesh network with multiple sources and multiple sinks suitable for multihop wireless backhaul applications within the WiMAX standard and proposed a joint consideration of wireless media access control (MAC) and network-layer multipath selection.
read more
Abstract: A practical wireless network solution for providing community broadband Internet access services are considered to be wireless mesh networks with delay-throughput tradeoff. This important aspect of network design lies in the capability to simultaneously support multiple independent mesh connections at the intermediate mobile stations. The intermediate mobile stations act as routers by combining network packets with forwarding, a scenario usually known as multiple coding unicasts. The problem of efficient network design for such applications based on multipath network coding with delay control on packet servicing is considered. The simulated solution involves a joint consideration of wireless media access control (MAC) and network-layer multipath selection. Rather than considering general wireless mesh networks, here the focus is on a relatively small-scale mesh network with multiple sources and multiple sinks suitable for multihop wireless backhaul applications within WiMAX standard.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A new network coding mechanism balancing coding opportunities, energy and QoS in WSNs
TL;DR: A new Network Coding mechanism in WSNs (Wireless Sensor Networks), which is named COEQ and aims at balancing coding opportunities, energy and QoS, is proposed and analyzed and it is shown thatCOEQ can improve throughput and save energy when the transmitting rate is low.
9
References
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
9.3K
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
TL;DR: The stability of a queueing network with interdependent servers is considered and a policy is obtained which is optimal in the sense that its Stability Region is a superset of the stability region of every other scheduling policy, and this stability region is characterized.
A Random Linear Network Coding Approach to Multicast
TL;DR: This work presents a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks, and shows that this approach can take advantage of redundant network capacity for improved success probability and robustness.