From contacts to graphs: pitfalls in using complex network analysis for DTN routing
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
A realistic framework for delay-tolerant network routing in open terrains with continuous churn
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Forward correction and fountain codes in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Communication capacity-based message exchange mechanism for delay-tolerant networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Research challenges towards the Future Internet
Computer Communications
Modeling and simulation of service composition in opportunistic networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
ACM SIGMOBILE Mobile Computing and Communications Review
Modelling social-aware forwarding in opportunistic networks
PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges
Analysing delay-tolerant networks with correlated mobility
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Ego network models for Future Internet social networking environments
Computer Communications
Epidemic content distribution: empirical and analytic performance
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Performance modeling of DTN routing with heterogeneous and selfish nodes
Wireless Networks
Threshold based locking routing strategy for delay tolerant network
Wireless Networks
| Hi-index | 0.00 |
Communication networks are traditionally assumed to be connected. However, emerging wireless applications such as vehicular networks, pocket-switched networks, etc., coupled with volatile links, node mobility, and power outages, will require the network to operate despite frequent disconnections. To this end, opportunistic routing techniques have been proposed, where a node may store-and-carry a message for some time, until a new forwarding opportunity arises. Although a number of such algorithms exist, most focus on relatively homogeneous settings of nodes. However, in many envisioned applications, participating nodes might include handhelds, vehicles, sensors, etc. These various "classes” have diverse characteristics and mobility patterns, and will contribute quite differently to the routing process. In this paper, we address the problem of routing in intermittently connected wireless networks comprising multiple classes of nodes. We show that proposed solutions, which perform well in homogeneous scenarios, are not as competent in this setting. To this end, we propose a class of routing schemes that can identify the nodes of "highest utility” for routing, improving the delay and delivery ratio by four to five times. Additionally, we propose an analytical framework based on fluid models that can be used to analyze the performance of various opportunistic routing strategies, in heterogeneous settings.