AODV Routing Protocol Implementation Design
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant 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
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Feedback Adaptive Routing Algorithm for DTN
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02
NECTAR: a DTN routing protocol based on neighborhood contact history
Proceedings of the 2009 ACM symposium on Applied Computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Encounter: based routing in DTNs
ACM SIGMOBILE Mobile Computing and Communications Review
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
HYMAD: Hybrid DTN-MANET routing for dense and highly dynamic wireless networks
Computer Communications
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
TTL based routing in opportunistic networks
Journal of Network and Computer Applications
Survey paper: A survey on routing algorithms for wireless Ad-Hoc and mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The probabilistic routing protocols accelerate the network traffic towards more vital nodes to achieve high delivery ratio and low delays. However, as the traffic burden rises, the nodes turn into soaked and drop previously stored messages that reduce the delivery ratio and increase end-to-end delay. Hereby it is vital to compute the accurate quality value of nodes. In this paper, we have proposed a Contact Quality Based Forwarding strategy (CQBFS) for city-based environments where nodes are heterogeneous, resources are scarce and traffic density is high. The activity of a node is measured in terms of its ability to transmit the carried message and drop magnitude. Moreover, an effective quality impact based buffer management policy has been used to control the impact of message drop on network throughput. The proposed CQBFS outperforms PRoPHET, Epidemic, Maxprop and TTL based routing protocols in terms of message transmissions, delivery probability, message drop, end-to-end delay and Hop count average under the real time traces Sassy and Helsinki city.