Mobile Agents Aided Congestion Aware Multipath Routing in Mobile Ad Hoc Networks

Shekhar, H. M. P.; Ramanatha, K. S.

doi:10.1109/contel.2007.381851

Cited by 5 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From another point of view, due to the lake of any centralized administration, a MANET is easy to be deployed and expanded allowing the establishment of temporary communications without any pre-installed infrastructure [5]. Accordingly, it becomes very suitable for several important application domains, in which it is not economically practical or physically possible to install an underlying infrastructure or the expediency of the situation does not permit such installation such as military and disasters (e.g., earthquake, flood, … etc.).…”

Section: Introductionmentioning

confidence: 99%

A Scalable-Adaptive Snack Routing Strategy (SRS) for Semi-Administrated Mobile Ad Hoc Networks (SAMANETs)

Saleh

2011

Int J Wireless Inf Networks

View full text Add to dashboard Cite

Recently, Mobile Ad Hoc networks (MANETs) are growing in popularity and importance. They present a possible communication among a set of mobile nodes with no need for either a pre-established infrastructure or a central administration. However, in order to guarantee an efficient communication among network nodes, efficient routing algorithms should be established. Routing plays the central role in providing ubiquitous network communications services in such dynamic networks. The problem is further aggravated through the node mobility as any node may move at any time without notice. Several routing protocols had been proposed; however, most of them suffer from control packet flooding, which results in a scalability problem. In this paper, a new routing strategy for MANETs is proposed which is called Snack Routing Strategy (SRS). The basic idea of SRS is to continuously inform the network mobile nodes with any changes in the network topology without overloading the network by a huge amount of control messages. SRS is a hybrid routing strategy that relies on Learning by accumulation, hence, new routes can be discovered by learning the accumulative data stored in the nodes routing tables by several foraging artificial snacks. SRS uses no periodic routing advertisement messages but uses artificial snacks instead, thereby reducing the network bandwidth overhead and minimizing end-to-end transmission delay. SRS has been compared against two well known protocols AODV and DSR. Experimental results have shown that SRS outperforms both AODV and DSR as it introduces the minimal routing overheads.

show abstract

Section: Introductionmentioning

confidence: 99%

A Scalable-Adaptive Snack Routing Strategy (SRS) for Semi-Administrated Mobile Ad Hoc Networks (SAMANETs)

Saleh

2011

Int J Wireless Inf Networks

View full text Add to dashboard Cite

show abstract

“…In addition, how to avoid the network congestion [15][16][17][18] is also essential when selecting a route for communication. Traditionally, the way to judge the level of contention is based on either the queueing length of a node [15,16,19], packet drops [19], or delay [17,18,20]. However, the available bandwidth around a node can also reflect the congestion around that node.…”

Section: Introductionmentioning

confidence: 99%

An Effective Routing Protocol with Guaranteed Route Preference for Mobile Ad Hoc Networks

Chien

Chan

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Battery power and queue conservation are critical issues in mobile ad hoc network (MANET). These two factors not only affect the delivery ratio but also the lifetime of the network. In this work, we will propose a simple and effective routing protocol to extend the lifetime and to evenly distribute the traffic loads of the networks as possible. Furthermore, a concept of serving capacity is introduced to reflect the level of congestion around a node. In this way, the proposed routing protocols can avoid network congestion and achieve higher packet delivery ratios. The extensive computer simulation is conducted to compare the proposed protocol against many existing routing protocols. The results show that the proposed routing protocol can have better performance in terms of queueing length, lifetime, and packet delivery ratio and have comparable end-to-end delays.

show abstract