Abstract
Problem statement: A mobile ad hoc network is a self-configuring network of mobile nodes connected by wireless links. As the nodes are free to move randomly, topology of the network may change rapidly and unpredictably. As a result, intermediat e nodes in the communication routes tend to lose connection with each other during the communication process. In order to repair a broken link, an end- to- end (from source to destination) route discovery is typically performed to establish a new route for communication. The mechanism results in huge communication overhead and long delay in completion of the communication. So, it is rational to locally re pair a link, as much as possible, than to discover a whole new route. Approach: In the present article, we proposed a Link Stabili ty and Node Energy Conscious (LSNEC) local route repair scheme for mobile ad hoc networks. In case of breakage of a link from node na to another node nb in between a communication session, LSNEC instructs na to broadcast a ROUTE- REPAIR message within its radio-range specifying nb or any successor of nb in the broken route, as a desirable destination. If any node residing within the radio-range of na has an already established single/multi-hop path to any one of those destinati ons mentioned in the ROUTE-REPAIR message, it sends a REPAIR-ACK message back to na. Attributes of REPAIR-ACK include the identificati on number (s) of the destination (s) as well as identificatio n numbers, geographical positions (in terms of lati tude and longitude), radio-ranges and residual energies of n odes present in the associated path to that destina tion along with the intuitively computed stability of li nks between the consecutive nodes. The stability is computed depending upon relative velocities of the involved nodes, distance between them and the histo ry of survival of the link. The optimal path is chosen depending upon the residual energy of nodes, stabi lity of links and number of hops in that path. Results: In simulations we compared the LSNEC embedded versions of the protocols Ad hoc On-demand Distance Vector routing (AODV) and Associatively Based Routing (ABR) with their ordinary versions as well as PATCH and Quick Local Repair scheme (to be referred to as QLR subsequently in this study) embe dded versions. Both PATCH and QLR are well- known local repairing schemes for ad hoc networks. It is found that, LSNEC-AODV dramatically saves 57% control overhead compared to ordinary AODV, 32.7% compared to PATCH-AODV and 36.3% compared to QLR-AODV. Similarly, LSNEC-ABR saves 29.3% control overhead than ordinary ABR, 10.7% than PATCH-ABR and 12.8% than QLR-ABR. Accordingly decrease the power consumption of network nodes and delay in recovery. Conclusion: The simulation results emphatically illustrated th e performance benefit of our proposed scheme LSNEC compared to the other state-of-the-art local route- repair schemes, in respect of control overhead, ove rall energy consumption of the network, data packet delivery ratio and route recovery delay. LSNEC has its application wherever an ad hoc network is used. Please note that ad hoc networks are extremely usef ul in military and other tactical applications such as emergency rescue, exploration missions and other sc enarios w here cellular infrastructure is unavailab le.
Highlights
A mobile ad hoc network is an autonomous system made up of mobile nodes communicating through wireless links without any static infrastructure
Simulations were carried out using ns-2 simulator which is a well known packet level simulator, to evaluate the proposed local recovery mechanism
The average emphasize the effectiveness of our proposed degree of the nodes keep increasing and the such that the average route length is generally long. possibility of successful local recovery increase
Summary
A mobile ad hoc network is an autonomous system made up of mobile nodes communicating through wireless links without any static infrastructure. If τ denotes the upper limit of waiting time of that packet in message queue of any node and Rmax denotes the maximum available radio-range in the network, maximum delay Γmax for multi-hop communication is given by: Γmax = H Rmax/σ+(H-1) τ (6). If πij(t)>Γmax, it indicates that nj has been continuously residing within the neighborhood of ni for more than the time span that may be required at most, for a message to traverse from its source to destination In this situation the stability is 1. In case of presence of equal number of lively nodes in the fighter candidate alternatives with maximum link stability, the one with minimum number of hops among them, is elected as the optimal candidate for repairing the broken link between ni+1 & ni+2.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
