Abstract
Opportunistic networks are characterized by having only intermittent connectivity on end-to-end paths, making successful delivery of messages very challenging. A key part of an opportunistic routing and forwarding scheme is message scheduling, where a node fixes the sequence in which it transmits messages for further relaying to its various neighbours. This paper presents a scheduling scheme which incorporates knowledge about the remaining contact time and compare its performance against baseline schemes from the literature. The results show that incorporating remaining contact time can indeed give substantial improvements in key performance indicators like the average delivery delay or the overhead ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The discovery process often relies on periodically transmitted beacon packets and the discovery delay is then strongly influenced by the beacon period.
References
Jain, S., Fall, K., Patra, R.: Routing in delay tolerant network. In: ACM SIGCOMM (2004)
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.S., Rubenstein, D.: Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. In: Proceeding ASPLOS 2002 (2002)
Heidemann, W., J., Ye, J. Wills, A. Syed, Y. Li.: Research challenges and applications for underwater sensor networking. In: Proceedings of the IEEE Wireless Communications and Networking Conference (2006)
Disruption tolerant networking. www.darpa.mi
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: routing for vehicle-based disruption-tolerant networks. In: IEEE Infocom
Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. In: SIGMOBILE Mobile Computing and Communication Review (2003)
Small, T., Haas, Z.: Resource and performance tradeoffs in delay-tolerant wireless networks. In: Proceeding ACM WDTN, pp. 260–267 (2005)
Wang, Y., Jain, S., Martonosi, M., Fall, F.: Erasure-coding based routing for opportunistic networks. In: ACM SIGCOMM Workshop on Delay Tolerant Networks (2005)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an routing in intermittently connected mobile networks. In: IEEE/ACM Transactions on Networking (2005)
Spyropoulos, T., Obraczka, K.: Routing in delay-tolerant networks comprising heterogeneous node populations. In: IEEE Transactions on Mobile Computing (2009)
Burns, B., Brock, O., Levine, B.N.: MV routing and capacity building in disruption tolerant networks. In: Proceedings of IEEE INFOCOM (2005)
Krifa, A., Barakat, C.: Message drop and scheduling in DTNs: theory and practice. IEEE Trans. Mobile Comput. 11(9), 1470–1483 (2012)
Balasubramanian, A., Neil Levine, B., Venkataramani, A.: DTN routing as a resource allocation problem. In: SIGCOMM 2007. ACM, Japan, August 2007
Elwhishi, A., Ho, P., Naik, K., Shihada, B.: A novel message scheduling framework for delay tolerant networks routing. IEEE Trans. Parallel Distrib. Syst. 24(5), 871–880 (2013)
Li, Y., Jin, D., Wang, Z., Zeng, L., Chen, S.: Exponential and power law distribution of contact duration in urban vehicular ad hoc networks. IEEE Signal Processing Letters 20(1), 110–113 (2013)
Sandulescu, G., Tehrani, S.N.: Opportunistic dtn routing with window-aware adaptive replication. In: Proceedings of the 4th Asian Conference on Internet Engineering, AINTEC 2008, pp. 103–112 (2008)
IEEE Computer Society, sponsored by the LAN/MAN Standards Committee, IEEE Standard for Information technology - Telecommunications, Information Exchange between Systems - Local, Metropolitan Area Networks - Specific Requirements - Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications (2012)
Li, Y., Qian, M., J. D., L. Su, Z. L.: Adaptive optimal buffer management policies for realistic DTN. In: GLOBECOM (2009)
Wang, W., Srinivasan, V., Motani, M.: Adaptive contact probing mechanisms for delay tolerant applications. In: 13th ACM International Conference Mobile Computing and Networking (MOBICOM), pp. 230–241, September 2007
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R.: Pocket switched networks: real-world mobility and its conse-quences for opportunistic forwarding. Univ. Technical report, Cambridge, Computer Lab, U.K. (2005)
Keränen, A., Ott, J., Kärkkäinen, T.: The ONE simulator for DTN protocol evaluation. In: SIMUTools 2009: Proceedings of the 2nd International Conference on Simulation Tools and Techniques. ICST, New York (2009)
Huson, M.L., Sen, A.: Broadcast scheduling algorithms for radio networks. In: Military Communications Conference, IEEE MILCOM, pp. 647–651 (1995)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Duke University, Technical report, April 2000
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Ali, S., Willig, A. (2016). ONRECT: Scheduling Algorithm for Opportunistic Networks. In: Mitton, N., Loscri, V., Mouradian, A. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2016. Lecture Notes in Computer Science(), vol 9724. Springer, Cham. https://doi.org/10.1007/978-3-319-40509-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-40509-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40508-7
Online ISBN: 978-3-319-40509-4
eBook Packages: Computer ScienceComputer Science (R0)