Mobility Aware Routing for the Airborne Network backbone

Tiwari, Abhishek; Ganguli, Anurag; Sampath, Ashwin; Anderson, D.; Shen, Bao-Hong; Krishnamurthi, Niyant; Yadegar, Jacob; Gerla, Mário; Krzysiak, David

doi:10.1109/milcom.2008.4753313

Cited by 54 publications

(40 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pipeline Coding performs worst, because in order to reduce coding delay, it adopts a non-uniform inclusion of original packets into a coded packet. Because of this property, pipelined based random linear coding requires a relatively higher redundancy as discussed in our preliminary report [14]. Unlike Pipeline Coding, under 0% loss, TCP ComboCoding still achieves the same throughput as TCP with no coding, which confirms the fact that ComboCoding does not introduce a penalty in normal network conditions.…”

Section: A Combocoding Evaluationsupporting

confidence: 58%

See 1 more Smart Citation

Multiple network coded TCP sessions in disruptive wireless scenarios

Chen¹,

Chen

Park

et al. 2011

2011 - MILCOM 2011 Military Communications Conference

Self Cite

View full text Add to dashboard Cite

TCP over wireless networks is challenging due to random losses and DATA-ACK interference. Random linear coding schemes have been proposed to improve TCP robustness against extreme random losses, but a critical issue still remains of DATA-ACK interference. To address this problem, we use inter-flow coding between DATA and ACK at potential intersecting nodes to mitigate self-interference. In addition, a pipelined random linear coding scheme with adaptive redundancy is introduced to overcome high loss rates over unreliable links. The resulting coding scheme, ComboCoding, combines inter-flow and intra-flow coding to provide robust, fair TCP communication in multi-flow disruptive wireless networks. Simulation results show that TCP with ComboCoding delivers higher throughput than other coding options in high loss scenarios. Moreover, we study the behavior of multiple TCP flows intersecting and interfering with each other in the same ad hoc network. The results show that ComboCoding consistently provides better fairness among multiple co-existing TCP sessions when compared with TCP without coding. The main contributions of this paper are: the practical design of random linear coded packets and XOR coded packets on bi-directional streams (DATA and ACK), the adaptive redundancy control scheme, and the multiple coded TCP sessions fairness evaluation.

show abstract

Section: A Combocoding Evaluationsupporting

confidence: 58%

“…(4) ComboCoding differs from [12] Note that in order to deploy our proposed coding scheme, proper modifications on the network layer at the wireless nodes are inevitable as for any network coding implementation. However, modifying the network layer at the node itself is well accepted and is part of the ad hoc network design [14].…”

Section: Introductionmentioning

confidence: 99%

Multiple network coded TCP sessions in disruptive wireless scenarios

Chen¹,

Chen

Park

et al. 2011

2011 - MILCOM 2011 Military Communications Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…This scheme uses destination sequence numbers to guaranty loop freedom in MANETs. Tiwari proposed another approach to effectively employ Located Based-Adaptive Routing to reduce overhead massages and delay in Mobile ad-hoc networks [8]. In this scheme, each mobile node has geographical location data of itself, its groups and the destination.…”

Section: Introductionmentioning

confidence: 99%

“…The requirement this scheme is usually expensive. The reader should be aware that the use of Tree-Seed Algorithm (TSA) to achieve more optimized path in MANETs has been already addressed in [8,9]. An obvious difference between TSA optimization and aforementioned methods is that multiple path from source to destination is selected and routing will be done proportional with the volume of network traffic.…”

Section: Introductionmentioning

confidence: 99%

Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks

Shirazi¹,

Mirabedini²

2016

IJCSES

View full text Add to dashboard Cite

show abstract

“…One early study about end-to-end delay in Delay Tolerant Networks is presented in [10]. In their study, which is based on Mobility Aware Routing Protocol and Mobility Dissemination Protocol (MARP/MDP) [11] for airborne networks, authors try to predict the minimum end-to-end delay and obtain the corresponding path for airborne networks. However, they do not address the issues related with carry time and lifetime.…”

Section: Introductionmentioning

confidence: 99%

Lifetime determination for delay tolerant communications in sparse vehicular networks

Sevimli

Soytürk

2010

IEEE 5th International Symposium on Wireless Pervasive Computing 2010

View full text Add to dashboard Cite

Abstract-Classical ad-hoc network algorithms become impractical for Vehicular Ad Hoc Networks when density of vehicles is low in rural areas and during the periods when the vehicle traffic is low in cities (such as at night). End-to-end connectivity requirement of these algorithms causes deflection. Connections get broken when a suitable network element isn't available for data transfer. This problem which occurs in low dense partially connected Vehicular Ad hoc Networks can be solved by using delay tolerant approaches in routing algorithms. By using the store-carry-forward method, data is carried by network elements until a suitable network element is found. By this way, network connectivity is provided in a delayed manner between momentarily disconnected vehicles. In this paper, the impact of delayed transfer of data to an end-to-end transfer and the impact of data lifetime to the network performance are examined. Considering the speed of vehicles and the desired throughput, lifetime of data is determined according to the network connectivity. The results of this study contribute to the fulfilment of the Quality of Service (QoS) requirements in Vehicular Ad Hoc Network applications. I. INTRODUCTION Studies on VehicularNetworks has expedited in recent years and this technology become applicable as a result of advances in wireless communications. Though the initial studies oriented to safety, its applicability to other areas such as business, entertainment, driving assist and public services, studies enlarged to comprise these new areas.Vehicular Ad Hoc Networks use the DSRC (Dedicated Short Range Communications) [1] standard presenting high data rate (6-27Mbps) which has a bandwidth of 75MHz and band of 5.9GHz. With DSRC, vehicles on the road broadcast the routine traffic message which includes location, time, direction, speed and traffic condition information. Additionally, emergency messages (e.g. accident, emergency brake) are sent on emergency conditions. While the routine messages are single-hop beaconing messages, emergency messages can be sent over multiple-hop paths.The main advantage of Vehicular Ad Hoc Networks is their applicability as an alternative communication network in case of catastrophes such as earthquake, flood etc. due to adhoc nature which does not require network infrastructure.

show abstract

Mobility Aware Routing for the Airborne Network backbone

Cited by 54 publications

References 6 publications

Multiple network coded TCP sessions in disruptive wireless scenarios

Multiple network coded TCP sessions in disruptive wireless scenarios

Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks

Lifetime determination for delay tolerant communications in sparse vehicular networks

Contact Info

Product

Resources

About