Towards congestion-aware all-to-all information dissemination in mobile ad-hoc networks

Gaba, Albana; Voulgaris, Spyros; Steen, Maarten van

doi:10.1109/glocomw.2010.5700228

Cited by 4 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this proposed protocol, the battery level and queue length are used as the key resource utilization parameters. In [17] authors have discussed protocols for all-to-all dissemination in ad hoc wireless networks. They have evaluated the performance of the GOSSIP3 dissemination protocol under varying network loads and have concluded that MAC layer congestion awareness is important for improving application-level efficiency.…”

Section: Related Workmentioning

confidence: 99%

Load Balanced Congestion Adaptive Routing for Mobile Ad Hoc Networks

Kim

Tomar

Shrivastava

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In mobile ad hoc networks the congestion is a major issue, which affects the overall performance of the networks. The load balancing in the network alongside the congestion is another major problem in mobile ad hoc network (MANET) routing due to difference in link cost of the route. Most of the existing routing protocols provide solutions to load balancing or congestion adaptivity separately. In this paper, a congestion adaptive routing along with load balancing, that is, load balanced congestion adaptive routing (LBCAR), has been proposed. Transferring of load from congested nodes to less busy nodes and involvement of other nodes in transmission that can take part in route can improve the overall network life. In the proposed protocol two metrics, traffic load density and link cost associated with a routing path, have been used to determine the congestion status. The route with low traffic load density and maximum life time is selected for packet transmission using this protocol. Performance of the network using LBCAR has been analyzed and compared with congestion adaptive routing protocol (CRP) for packet delivery ratio, average end-to-end delay, and normalized routing overhead.

show abstract

Section: Related Workmentioning

confidence: 99%

Load Balanced Congestion Adaptive Routing for Mobile Ad Hoc Networks

Kim

Tomar

Shrivastava

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…We proceed by giving two concrete example applications from each class: Examples of the first class include context-aware routing and network self-monitoring. Context-aware routing entails the routing of messages through a network such that the routing load is balanced with respect to the availability of resources or QoS (e.g., congestion awareness [9], topology awareness [10]). In network self-monitoring, the network should detect failures or performance anomalies and software healing agents are dispatched to the affected area.…”

Section: Introductionmentioning

confidence: 99%

On distributed computation of information potentials

Loukas

Woehrle

Glatz

et al. 2012

Proceedings of the 8th International Workshop on Foundations of Mobile Computing

View full text Add to dashboard Cite

A common task of mobile wireless ad-hoc networks is to distributedly extract information from a monitored process. We define process information as a measure that is sensed and computed by each mobile node in a network. For complex tasks, such as searching in a network and coordination of robotic swarms, we are typically interested in the spatial distribution of the process information. Spatial distributions can be thought of as information potentials that recursively consider the richness of information around each node. This paper describes a localized mechanism for determining the information potential on each node based on local process information and the potential of neighboring nodes. The mechanism allows us to distributedly generate a spectrum of possible information potentials between the extreme points of a local view and distributed averaging. In this work, we describe the mechanism, prove its exponential convergence, and characterize the spectrum of information potentials. Moreover, we use the mechanism to generate information potentials that are unimodal, i.e., feature a single extremum. Unimodality is a very valuable property for chemotactic search, which can be used in diverse application tasks such as directed search of information and rendezvous of mobile agents.

show abstract