Energy Efficient Inactive Node Detection Based Routing Protocol for Delay Tolerant Network

The delay tolerant network multi-copy protocols create and transmit multiple copies of each message that overload the buffer size, energy and bandwidth. The resource consumption is controlled by transmitting the messages to nodes having high encountering ability to meet their destinations. Hence, no...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wireless personal communications 2021, Vol.116 (1), p.227-248
Hauptverfasser: Ayub, Qaisar, Rashid, Sulma
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The delay tolerant network multi-copy protocols create and transmit multiple copies of each message that overload the buffer size, energy and bandwidth. The resource consumption is controlled by transmitting the messages to nodes having high encountering ability to meet their destinations. Hence, nodes loss energy only in transmitting and receiving messages and went to dead state. However, message transmission continues even though the destination is dead. This wastes the network resources because messages destining to dead node will not be able to find their destinations. The existing routing protocols focus on message transmissions and do not have any mechanism to detect inactive nodes or to stop massage replications destining to inactive nodes. In this paper we have proposed a routing protocol called as Energy Efficient Inactive Node Detecting Based Routing Protocol for Delay Tolerant Network (InD). The proposed protocol has employed the node mobility to detect inactive nodes. Moreover, an intelligent buffer management policy has been designed that detect and drop those messages which are destining to dead nodes. The real time mobility scenarios have been used to evaluate the performance of existing and proposed routing protocols under the metrics of message transmissions, message drop, and message delivery and hop count average.
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-020-07712-5