|
|||
|---|---|---|---|
Abstract
A mobile
ad hoc network consists of nodes that move arbitrarily
and form dynamic topologies. The nature of the open
structure and scarcely available battery-based energy,
node misbehaviors may exist. An individual mobile node
may attempt to benefit from other nodes, but refuse to
share its own resources. Such nodes are called selfish
or misbehaving nodes. These selfish nodes may severely
affect the performance of network. In this paper, we
propose the selfish aware AODV+2ACK model to
detect routing misbehavior and to mitigate their adverse
effect. The main idea of the AODV+2ACK model
is to send two-hop acknowledgment packets in the
opposite direction of the routing path. In order to
reduce additional routing overhead, only a fraction of
the received data packets are acknowledged in the
AODV+2ACK scheme. Thus, we propose to investigate
performance of AODV+2ACK model even in the
presence of selfish nodes and the same has been compared
with the ordinary AODV protocol. The simulation study in
this paper brings out that the proposed protocol has
higher performance than existing AODV and DSR, in terms
of throughput, packet delivery ratio and end-end delay.
Keywords
—
Ad Hoc
Networks, selfish nodes, QoS routing, security
(
 Full
Paper, 897 KB)
BibTex: @ARTICLE{P1140905606,
AUTHOR = {T.V.P.Sundararajan
and A.Shanmugam},
TITLE = { Performance Analysis of Selfish Node Aware Routing Protocol for Mobile Ad Hoc Networks}, JOURNAL = {ICGST International Journal on Computer Network and Internet Research, CNIR}, YEAR = {2009}, VOLUME = {09}, ISSUE = {I},
PAGES= {1--9}
}
( |
|||
|
