A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Reverse path forwarding of broadcast packets
Communications of the ACM
Pollen: using people as a communication medium
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A Practical Analysis of Low-Density Parity-Check Erasure Codes for Wide-Area Storage Applications
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Turning the postal system into a generic digital communication mechanism
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Pocket switched networks and human mobility in conference environments
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
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Delay tolerant mobile networks (DTMNs): controlled flooding in sparse mobile networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Performance modeling of network coding in epidemic routing
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Reliable and efficient message delivery in delay tolerant networks using rateless codes
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
E-Scheme in Delay-Tolerant Networks
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Analysis and design of mobile Wireless Social Model
Computer Communications
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
BikeNet: A mobile sensing system for cyclist experience mapping
ACM Transactions on Sensor Networks (TOSN)
A generalized framework for throughput analysis in sparse mobile networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
On using probabilistic forwarding to improve HEC-based data forwarding in opportunistic networks
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Probabilistic routing using contact sequencing in delay tolerant networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Big wireless measurement campaigns: are they really worth the price?
Proceedings of the 4th ACM international workshop on Hot topics in planet-scale measurement
Routing for opportunistic networks based on probabilistic erasure coding
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Shaping opportunistic networks
Computer Communications
Universal scheme improving probabilistic routing in delay-tolerant networks
Computer Communications
Dynamic DTN Routing Strategies Based on Knowledge
Wireless Personal Communications: An International Journal
Agent-based multicast opportunistic routing protocol for wireless networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
A Comparison of Opportunistic Connection Datasets
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
With wireless networking technologies extending into the fabrics of our working and operating environments, proper handling of intermittent wireless connectivity and network disruptions is of significance. As the sheer number of potential opportunistic application continues to surge (i.e. wireless sensor networks, underwater sensor networks, pocket switched networks, transportation networks, and etc.), the design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable. While previous solutions use either replication or coding techniques to address the challenges in opportunistic networks, the tradeoff of these two techniques only make them ideal under certain network scenarios. In this paper, we propose a hybrid scheme, named H-EC, to deal with a wide variety of opportunistic network cases. H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques. We evaluate H-EC against other similar strategies in terms of delivery ratio and latency, and find that H-EC offers robustness in worst-case delay performance cases while achieving good performance in small delay performance cases. We also discuss the traffic overhead issues associated with H-EC as compared to other schemes, and present several strategies that can potentially alleviate the traffic overhead of H-EC schemes.