Rate Control for Network-Coded Multipath Relaying with Time-Varying Connectivity

Shrader, Brooke; Babikyan, Armen; Jones, Nathaniel M.; Shake, Thomas; Worthen, Andrew P.

doi:10.1109/jsac.2011.110520

Cited by 13 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Random linear coding over GF(256) with blocks of twelve packets (1400 bytes/packet) is performed as described in [4]. Initially four coded packets are sent on each path.…”

Section: Demonstrationmentioning

confidence: 99%

Demo

Barto

Brennen

Herrera

et al. 2014

Proceedings of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing

Self Cite

View full text Add to dashboard Cite

This work addresses the challenge in providing reliable communication in mobile networks with intermittent, on/off links through the use of a routing overlay designed to deal with these channel impairments. Link blockage is a predominant feature of mobile networks operating at 10+ GHz frequencies, and current techniques are ill-suited to address this problem. We present an approach comprised of multiplepath routing with end-to-end coding, queue-length-based congestion control, and a negative acknowledgement (NACK) loss-recovery scheme; these are implemented in an IP-overlay. The demonstrated scenario consists of two clusters of mobile ground vehicles operating in an "urban canyon" environment. Blockage occurs on satellite links connecting the clusters. Through the use of interactive displays, demo participants gain an understanding of routing behavior.

show abstract

“…Random linear coding over GF(256) with blocks of twelve packets (1400 bytes/packet) is performed as described in [4]. Initially four coded packets are sent on each path.…”

Section: Demonstrationmentioning

confidence: 99%

Demo

Barto

Brennen

Herrera

et al. 2014

Proceedings of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…[8] studies how to allocate transmission rate resources among two users in a Gaussian multiple access channel to trade network sum rate for the delays the users experience. [9] considers the performance, deployment, and security properties of network scheduling that differentiates users on the basis of whether they would like a high rate or a Digital Object Identifier 10.1109/JSAC.2011.110501 [11], [12], [13], [14], [15] [16], [17], [18], [19] low queueing delay. Finally, [10] utilizes a network calculus approach to study the effect of classes of link scheduling algorithms on end to end delay.…”

Section: Guest Editorial Trading Rate For Delay At the Application Anmentioning

confidence: 99%

Guest Editorial Trading Rate for Delay at the Application and Transport Layers

Walsh

Weber

Oliveira

et al. 2011

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

“…Recently, a lot of new routing algorithms have been proposed for spacecraft networks considering time-varying topology and intermittent connectivity. [8][9][10][11] However, little research has been done on how to maintain a timevarying spacecraft topology with low-cost efficiency ratio and low unreliability.…”

Section: Introductionmentioning

confidence: 99%

Efficient topology control for time-varying spacecraft networks with unreliable links

Zhang

et al. 2019

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In spacecraft networks, the time-varying topology, intermittent connectivity, and unreliable links make management of the network challenging. Previous works mainly focus on information propagation or routing. However, with a large number of nodes in the future spacecraft networks, it is very crucial regarding how to make efficient network topology controls. In this article, we investigate the topology control problem in spacecraft networks where the time-varying topology can be predicted. We first develop a model that formalizes the time-varying spacecraft network topologies as a directed space–time graph. Compared with most existing static graph models, this model includes both temporal and spatial topology information. To capture the characteristics of practical network, links in our space–time graph model are weighted by cost, efficiency, and unreliability. The purpose of our topology control is to construct a sparse (low total cost) structure from the original topology such that (1) the topology is still connected over space–time graph; (2) the cost efficiency ratio of the topology is minimized; and (3) the unreliability parameter is lower than the required bound. We prove that such an optimization problem is NP-hard. Then, we provide five heuristic algorithms, which can significantly maintain low topology cost efficiency ratio while achieving high reliable connectivity. Finally, simulations have been conducted on random space networks and hybrid low earth orbit/geostationary earth orbit satellite-based sensor network. Simulation results demonstrate the efficiency of our model and topology control algorithms.

show abstract

Rate Control for Network-Coded Multipath Relaying with Time-Varying Connectivity

Cited by 13 publications

References 12 publications

Demo

Demo

Guest Editorial Trading Rate for Delay at the Application and Transport Layers

Efficient topology control for time-varying spacecraft networks with unreliable links

Contact Info

Product

Resources

About