Shashi Raj K1
and Siddesh G K2
1Department of Electronics and Communication, Dayananda Sagar
College of Engineering, Bengaluru, India
2Department of Electronics and Communication, JSS Academy of
Technical Education, Bengaluru, India
Abstract
The exponential rise in wireless communication
systems and allied applications has revitalized academia-industries to achieve
more efficient data transmission system to meet Quality-of-Service (QoS)
demands. Amongst major wireless communication techniques, Mobile Ad-hoc Network
(MANET) is found potential to provide decentralized and infrastructure less
communication among multiple distributed nodes across network region. However,
dynamic network conditions such as changing topology, congestion, packet drop,
intrusion possibilities etc often make MANET’s routing a tedious task. On the
other hand, mobile network feature broadens the horizon for intruders to
penetrate the network and causes performance degradation. Unlike classical
MANET protocols where major efforts have been made on single network parameter
based routing decision, this research paper proposes a novel Elitist Genetic
Algorithm (EGA) Multi-Objective Optimization assisted Network Condition Aware
QoS-Routing Protocol for Mobile Ad-hoc Networks (MNCQM). Our proposed MNCQM
protocol exhibits two phase implementation where at first it performs
node-profiling under dynamic network topology for which three factors;
irregular MAC information exchange, queuing overflow and topological variations
have been considered. Towards this objective node features like Packet
Forwarding Probability (PFP) at the MAC layer, Success Probability of Data
Transmission (SPDT) of a neighboring node, and Probability of Successful Data
Delivery (PSDD) have been obtained to estimate Node-Trustworthiness Index
(NTI), which is further used to eliminate untrustworthy nodes. In the second
phase of implementation, a novel Evolutionary Computing assisted non-disjoint
best forwarding path selection model is developed that exploits node’s and
allied link’s connectivity and availability features to identify the
quasi-sub-optimal forwarding paths. EGA algorithm intends to reduce hop-counts,
connectivity-loss and node or link unavailability to estimate best forwarding
node. One key feature of the proposed model is dual-supplementary forwarding
path selection that enables alternate path formation in case of link outage and
thus avoids any iterative network discovery phase.
No comments:
Post a Comment