Overcoming untuned radios in wireless networks with network coding

Petrović, Dragan; Ramchandran, Kannan; Rabaey, Jan M.

doi:10.1109/tit.2006.874396

Cited by 43 publications

(23 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…COPE was designed by Katti et al [44]. Applying network coding to untuned radios is investigated by Petrović et al [65]. Similar ideas have recently been applied to transportation networks.…”

Section: Notesmentioning

confidence: 99%

Network Coding Applications

Fragouli

Soljanin²

2007

FNT in Networking

133

View full text Add to dashboard Cite

Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial deals with wireless and content distribution networks, considered to be the most likely applications of network coding, and it also reviews emerging applications of network coding such as network monitoring and management. Multiple unicasts, security, networks with unreliable links, and quantum networks are also addressed. The preceding companion deals with theoretical foundations of network coding.

show abstract

Section: Notesmentioning

confidence: 99%

Network Coding Applications

Fragouli

Soljanin²

2007

FNT in Networking

133

View full text Add to dashboard Cite

show abstract

“…Then from Lemma 4, with high probability, any circle of this radius will have O(na c (n)) nodes, and hence at most O(na c (n)) sources. Thus the 3 We are currently working on extending this work to larger values of c. In that regime it may be beneficial to choose P as per some specific rule, e.g. point of intersection of circle and horizontal line through S 4 This is a loose upper bound.…”

Section: Lemma 13mentioning

confidence: 99%

“…However the channels are untuned and hence partially ovelapping, rather than disjoint. As per the assumption in [3], two nodes can communicate directly if the carrier frequency of one is admitted by the other, i.e., if there is at least 50% overlap between two channels, communication is possible. We consider the issue of capacity of a randomly deployed network of n nodes, where each node has an untuned radio, and each node is the source of one flow, with a randomly chosen destination.…”

Section: The Case Of Untuned Radiosmentioning

confidence: 99%

“…It has been proposed in [3] that extremely inexpensive wireless devices can be manufactured if it is possible to handle untuned radios whose operating frequency may lie randomly within some band. Also considered in [3] is the possibility that each device may have a small number of such untuned radios, and a random network coding based approach is proposed to relay information between a single sourcedestination pair.…”

Section: Introductionmentioning

confidence: 99%

“…Also considered in [3] is the possibility that each device may have a small number of such untuned radios, and a random network coding based approach is proposed to relay information between a single sourcedestination pair. Some work on cognitive radio has addressed the issue of coordination in the face of restricted and variable channel availability at individual nodes due to active primary users [4], [5].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints

Bhandari¹,

Vaidya²

2007

View full text Add to dashboard Cite

This paper argues for the need to address the issue of multi-channel network performance under constraints on channel switching. We present examples from emergent directions in wireless networking to motivate the need for such a study, and introduce some models to capture channel switching constraints. For some of these models, we study connectivity and capacity of a wireless network comprising n randomly deployed nodes, equipped with a single interface each, when there are c = O(logn) channels of equal bandwidth W c available. We consider an adjacent (c, f ) channel assignment where a node may switch between f adjacent channels, but the adjacent channel block is randomly assigned. We show that the per-flow capacity for this channel assignment model is Θ(W f cn logn ). We then show how the adjacent (c, 2) assignment maps to the case of untuned radios. We also consider a random (c, f ) assignment where each node may switch between a pre-assigned random subset of f channels. For this model, we prove that per-flow capacity is O(W

show abstract

Network Coding for Distributed Storage in Wireless Networks

Dimakis

Ramchandran

2008

Networked Sensing Information and Control

View full text Add to dashboard Cite

Overcoming untuned radios in wireless networks with network coding

Cited by 43 publications

References 12 publications

Network Coding Applications

Network Coding Applications

Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints

Network Coding for Distributed Storage in Wireless Networks

Contact Info

Product

Resources

About