M. Syed Rabiya, R. Ramalakshmi
This paper addresses a routing problem in the intermittently connected networks,a kind of delay-tolerant network where packets are delivered without establishingan end-to-end path between source and destination. It exploits the current contactbetween two nodes when they are within the transmission range of each other. Asthe nodes’ mobility and storage help packet delivery between two nodes, the relayselection impacts the routing performance. The existing works utilize either the network’sglobal connectivity record or the current encounter's delivery probability todeliver the packet to the destination. Since global connectivity data often becomesstale due to nodes failure, intermittent connectivity, and long delay, our proposedwork employs a novel approach called 2-hops connectivity aware routing mechanism(2-CAR). The 2-CAR utilizes a past connectivity record consisting of 2-hops only.It allows each node to maintain the connectivity record for its neighbors and theneighbors of neighbors, instead of the entire network. The simulation is done toshow the efficiency of the proposed work with increased network size. The simulationresults show that 2-CAR achieves a 20% higher packet delivery rate than thestate of art protocols with less overhead and latency.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados