A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
AODV Routing Protocol Implementation Design
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
A community based mobility model for ad hoc network research
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Prioritized epidemic routing for opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations
IEEE Transactions on Mobile Computing
CREST: an opportunistic forwarding protocol based on conditional residual time
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network
CMC '10 Proceedings of the 2010 International Conference on Communications and Mobile Computing - Volume 03
Probabilistic routing using contact sequencing in delay tolerant networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Backpressure-based routing protocol for DTNs
Proceedings of the ACM SIGCOMM 2010 conference
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
An Energy-Efficient n-Epidemic Routing Protocol for Delay Tolerant Networks
NAS '10 Proceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage
| Hi-index | 0.00 |
Delay tolerance network probabilistic routing protocols forward message to a node by observing its predictability value to meet the message destination. However, it is vital to predict the ability of node to carry the transmitted message. For instance, the traffic confluence on the high probable nodes can produce congestion that results in the drop of previously stored messages. These drops diminish the delivery ratio because the dropped message lost its opportunity to be delivered. Since, there exist multiple copies of each message; therefore, the same node invariably receives the dropped messages from other parts of the network and causes the highest number of transmissions. Additionally, the replication from source node continues on the high probable peers even the previous copies were transmitted on the better predictable neighbors than the current. In this paper, we have proposed a novel routing method called as the adaptive threshold based locking method that maintains the contemporary status of the node based on its activity in the network. We have used the adaptive status measuring metrics such as transmit factor, drop factor and hop away count. Moreover, a threshold based locking method has been introduced to control the diffusion of messages. We have performed the comparison of existing and proposed routing methods with real time mobility traces. The proposed strategy has bolstered the delivery ratio and minimizes hop count, end-to-end delay and number of transmission.