DTN Routing Algorithm Based on Perceptions of Node Mobile Information
Abstract
Due to the high mobility of nodes in DTN, the topology is changing forever. On this base, putting forward an efficient routing protocol becomes a hot topic in this area. Focus on the moving character of nodes, putting forward a routing algorithm in DTN (BMI) based on perceptions of node mobile information. This algorithm improved from the classical routing protocol spray and wait. First, change the wait phase to active routing. Then consider the moving information of meeting nodes and purpose nodes, choose a node which has a higher possibility to meet the purpose node. Simulation results show that, this algorithm can significantly improve the delivery ratio and reduce the delay.
Keywords
Full Text:
PDFRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).