Beruflich Dokumente
Kultur Dokumente
ISSN:2319-6890)(online),2347-5013(print)
01 Jan. 2016
ISSN:2319-6890)(online),2347-5013(print)
01 Jan. 2016
Due to high mobile nature of nodes MANETs, frequent
breakages in links which lead to frequent path failures and also,
route discoveries. We cannot neglect the overhead of route
discovery. In the discovery of route, broadcasting is important
and real data dispersal mechanism where node is rebroadcasting
existence unaware, first received request packet if it has way to
destination, so it reasons broadcast flood problem. We propose
coverage based probabilistic rebroadcasting protocol for dropping
overhead in the MANETs. To effectively feat neighbour coverage
knowledge, we propose a novel rebroadcast delay to determine
the rebroadcast order, we obtain accurate added coverage ratio by
detecting neighbour coverage information. We describe
connectivity factors to deliver node adaptation. It is combining
coverage ratio and the connectivity factors; it set sensible
probability. [8].
III. Related Work
The coverage area which node covers is used for adjustment
of rebroadcasting probability. If node located closer to the sender,
it means small additional coverage and rebroadcasting from same
node reach less added nodes, and it is rebroadcasting probability
will fixed lesser. Aware broadcasting schemes is planned to profit
greater performance in the terms of packet delivery ratios and
number of retransmit the nodes. It is sufficient for informal
execution without use of neighbours info or maintain counter for
duplicate packets. [1]
IV. Existing work
Neighbour coverage based probabilistic rebroadcasting
(NCPR) is calculating the rebroadcast delay and rebroadcast
probability [12]. To successfully use the neighbour coverage
knowledge, a novel rebroadcast delay is used to find out the
rebroadcast order, and then can get a more correct additional
coverage ratio. Network connectivity is used to reduce the
redundant retransmissions; a metric named connectivity factor is
used. A rebroadcast probability is set, by joining coverage ratios
and connectivity factors. It is used to reduce the number of
rebroadcasts of the RREQ (route request) packet, to improve the
routing performance. It has very less routing overhead and less
end to end delay.
The rebroadcast probability can be considered of containing
two parts:
A. Additional coverage ratio:
Additional coverage ratio defined as, the ratio of the number
of nodes enclosed by the single broadcasting to total neighbours.
Additional coverage = no of nodes covered by single
broadcast / total no of broadcast ratio
B. Connectivity factor:
Connectivity factor plays very important role in network
coverage. Connectivity factor, as the name suggests, gives
relations of networks connectivity and neighbours of node. This
scheme uses a rebroadcast delay which helps us to identify the
forwarding order and more efficiently exploit the neighbour
knowledge. This Creates less rebroadcast traffic than flooding and
other schemes. Because of less redundant broadcast it reduces
network collision and contention and so increases the packet
delivery ratio and decreases average packet end-end delay. Also
Page 63
ISSN:2319-6890)(online),2347-5013(print)
01 Jan. 2016
VII.
iii.
H. Alamari, M. Abolhasan, and T. wysocki, On
Optimizing Route
Discovery in absence of previous
route
information in MANETs, proc.of IEEE VTC 2009 Spring, pp. 1-5,
20099.
iv.
X.Wu, H. R. Sadjadpour, and J.J. Garcia- LunaAceves,Routing Overhead as A Function of Node Mobility: Modeling
framework and implications On Proactive Routing, Proc. IEEE MASS0
7, pp. 1-9-2007.
v.
S.Y.Ni, Y.C.Tseng, Y.S.Chen, and J.P.Sheu, The
Broadcast Storm Problem in A Mobile Ad hoc Network, Proc. Of
ACM/IEEE Mobicom 99, pp. 151-262, 1999.
vi.
Mohammed, M. Ould-Khaoua, L. M. Macknezie,
C.Perkins, and J.D. Abdulai, Probablistic Counter B Based Route
Discovery for Mobile Ad hoc Networks, Proc. Of WCMC09, pp.13351339, 2009.
Page 64
doi : 10.17950/ijer/v5s1/116
ISSN:2319-6890)(online),2347-5013(print)
01 Jan. 2016
x.
J. D. Abdulai, M. Ould-Khaoua and L. M. Macknezie,
A. Mohammed, Neighbor Coverage: A Dynamic Probablistic Route
Discovery in Mobile Ad hoc Networks, Proc. Of SPECTS08, pp. 165172,2008.
xi.
F. Xue, and P. R. Kumar, The Number of Neighbors
needed for
connectivity of Wireless Networks, Wireless
Networks, volume 10, issue 2, pp. 169-181, 2004.
xii.
Xin Ming Zhang, En Bo Wang, Jing Jing Xia, Dan
Keun Sung, A
Neighbor Coverage-Based Probabilistic
Rebroadcast for Reducing
Routing Overhead in Mobile Ad Hoc
Networks IEEE TRANSACTIONS ON MOBILE COMPUTING Vol 12,
2013.
Page 65