Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks

Nabhen, Ricardo; Jamhour, Edgard; Penna, Manoel Camillo; Fonseca, Mauro; Pujolle, Guy

doi:10.1109/lcn.2007.114

Cited by 28 publications

(23 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The wave expansion approach was proposed to efficiently broadcast in multi-hop radio networks (Chlamtac & Weinstein, 2002). In the year 2002, a gossipbased approach was proposed, where nodes forward the packet with probability, which reduces the overhead of flooding to certain extents (ie., up to 35 percent) (Haas et al, 2002;Abdulai et al, 2007).…”

Section: Literature Reviewmentioning

confidence: 98%

“…Simplest way of broadcasting is flooding in which every node rebroadcasts the received packet in the network. In large mobile environments, flooding has the overhead of redundant retransmission, contention and collisions (Abdulai et al, 2007;Tseng et al, 2002). It also raises several other issues like its inefficiency in terms of resource consumption such as bandwidth and energy (Tseng et al, 2002;Tonguz et al, 2006).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Energy efficient neighbor coverage-based probabilistic rebroadcasting in MANET

Sandeep¹,

Kumar²

2015

J Engin Res

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

Energy efficient neighbor coverage-based probabilistic rebroadcasting in MANET

Sandeep¹,

Kumar²

2015

J Engin Res

View full text Add to dashboard Cite

“…They showed that gossip-based approach can save overhead compared to the flooding. However, when the network density is high or the traffic load is heavy, the improvement of the gossip-based approach is limited [8]. Kim et al [7] proposed a probabilistic broadcasting scheme based on coverage area and neighbour confirmation.…”

Section: IImentioning

confidence: 99%

An Analysis of The Mechanism for Reducing Routing Overhead in Mobile Ad Hoc Network Using Probabilistic Rebroadcast Technique

Patil¹,

Nipanikar²

2015

IJETT

View full text Add to dashboard Cite

Abstract-Mobile ad hoc network (MANETs) consist of nodes which are continuously moving, this causes continuous link breakage due to which there is frequent path failure occurs and route discoveries is required. The fundamental technique for route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request (RREQ) packet unless it has route to the destination. This mechanism incur retransmission which causes overhead and decrease the packet deliverance ratio and increase the end delay, which cannot be avoided. In this paper we proposed reducing routing overhead in mobile ad hoc network using probabilistic rebroadcast mechanism. In this we have introduced rebroadcast delay to determine the neighbour coverage knowledge which will be useful in finding accurate additional coverage ratio and rebroadcast order. To provide node density adaptation we have also defined connectivity factor. By addition of the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify decrease in the routing overhead by decreasing the number of retransmission and improvement in routing performance.

show abstract

“…Thus, optimizing the broadcasting in route discovery is an effective solution to improve the routing performance. [9] Haas et al proposed a gossip based approach, where each node forwards a packet with a probability. They showed that gossip-based approach can save up to 35 percent overhead compared to the flooding.…”

Section: Improve the Routing Performance In Manetmentioning

confidence: 99%

Enhanced routing performance and overhead in Mobile Ad-hoc network for big data Transmission in Telemedicine using computer communication network

Rajasekaran¹,

Saravanan²

2014

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. [1 to 3]. In this paper, we propose a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge.[4] We also define a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance.

show abstract

Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks

Cited by 28 publications

References 17 publications

Energy efficient neighbor coverage-based probabilistic rebroadcasting in MANET

Energy efficient neighbor coverage-based probabilistic rebroadcasting in MANET

An Analysis of The Mechanism for Reducing Routing Overhead in Mobile Ad Hoc Network Using Probabilistic Rebroadcast Technique

Enhanced routing performance and overhead in Mobile Ad-hoc network for big data Transmission in Telemedicine using computer communication network

Contact Info

Product

Resources

About