DTNs (Delay Tolerant Networks)refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor nodes) routing algorithm to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in the network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be achieved. In order to verify the proposed algorithm, DTN simulator is designed by using ONE simulator. According to the result of the simulation, the suggested algorithm can reduce average delay and unnecessary message generation. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Seo, D. O., Kim, G. H., & Lee, D. H. (2011). LCN: Largest common neighbor nodes based routing for delay and disruption tolerant mobile networks. In Communications in Computer and Information Science (Vol. 199 CCIS, pp. 261–270). https://doi.org/10.1007/978-3-642-23312-8_33
Mendeley helps you to discover research relevant for your work.