Ambit lick Solutions
Mail Id: Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com
10. A Neighbor Coverage-Based Probabilist...
Upcoming SlideShare
Loading in …5
×

A neighbor coverage based probabilistic rebroadcast for reducing routing

999 views

Published on


Bulk Projects For sale

IEEE 2009-10-11-12-13 PAPERS AVILABLE.

We are providing low cost project for final year student projects.

Solved 2010 -2011 -2012 - 2013 IEEE in all the domain

Mobile : 8940956123

E-Mail : ambitlick@gmail.com,

INNOVATIVE TITLES ARE ALSO WELLCOME TO DO WITH US


For All BE/BTech, ME/MTech, MSC/MCA/MS , and diplamo graduates

PROJECT SUPPORTS & DELIVERABLES

•Project Abstract
•IEEE Paper
•PPT / Review Details
•Project Report
•Working Procedure in Video
•Screen Shots
•Materials & Books in CD
•Project Certification

Published in: Education
0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
999
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
17
Comments
0
Likes
1
Embeds 0
No embeds

No notes for slide

A neighbor coverage based probabilistic rebroadcast for reducing routing

  1. 1. Ambit lick Solutions Mail Id: Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com 10. A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks 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. 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. 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.

×