Journal of Computing Science and Engineering

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

A Direction Entropy-Based Forwarding Scheme in an Opportunistic Network

  • Received : 2014.05.23
  • Accepted : 2014.08.28
  • Published : 2014.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

In an opportunistic network, one of the most challenging issues is the equilibrium of the network traffic and transmission delay for forwarding messages. To resolve this problem, we propose a new forwarding scheme, called the direction entropy-based forwarding scheme (DEFS), using the main direction and direction entropy based on the information collected about the directions of the nodes in the network. Since each node sends a message to another node with a different location and less direction entropy, DEFS utilizes those nodes that are more likely to travel to various locations to forward the messages to the destination nodes. Experiments were performed on the network simulator NS-2. The results show that DEFS provides better balance than the typical forwarding schemes, such as Epidemic, PRoPHET, and WAIT.

Keywords

References

  1. P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, "Pocket switched networks and human mobility in conference environments," in Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking, Philadelphia, PA, 2005, pp. 244-251.
  2. Z. Zhang, "Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challengers," IEEE Communication Surveys Tutorials, vol. 8, no. 1, pp. 24-37, 2006.
  3. M. Conti and M. Kumar, "Opportunities in opportunistic computing," IEEE Computer, vol. 43, no. 1, pp. 42-50, 2010.
  4. C. Bordrini, M. Conti, and A. Passarella, "Modeling socialaware forwarding in opportunistic networks," Performance Evaluation of Computer and Communication Systems, Lecture Notes in Computer Science vol. 6821, Heidelberg: Springer, pp. 141-152, 2011.
  5. A. Vahdat and D. Becker, "Epidemic routing for partiallyconnected ad hoc networks," Duke University, Technical Report CS-2000-06, 2000.
  6. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray and wait: an efficient routing scheme for intermittently connected mobile networks," in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, Philadelphia, PA, 2005, pp. 252-259.
  7. E. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant MANETs," in Proceedings of the 8th ACM international symposium on Mobile Ad Hoc Networking and Computing, Montreal, Canada, 2007, pp. 32-40.
  8. P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: socialbased forwarding in delay tolerant networks," IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1576-1589, 2011. https://doi.org/10.1109/TMC.2010.246
  9. A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," in Service Assurance with Partial and Intermittent Resources, Lecture Notes in Computer Science vol. 3126, Heidelberg: Springer, pp. 239-254, 2004.
  10. A. Mtibaa, M. May, C. Diot, and M. Ammar, "PeopleRank: social opportunistic forwarding," in Proceedings of IEEE INFOCOM, San Diego, CA, 2010, pp. 1-5.
  11. S. Ihara, Information Theory for Continuous Systems, Singapore: World Scientific Publishing, 1993.
  12. The project of Network Simulator ns-2, http://www.isi.edu/nsnam/ns/.
  13. C. Boldrini and A. Passarella, "HCMM: modelling spatial and temporal properties of human mobility driven by users' social relationships," Computer Communications, vol. 33, no. 9, pp. 1056-1074, 2010. https://doi.org/10.1016/j.comcom.2010.01.013
  14. S. K. Kim, J. H. Choi, and S. B. Yang, "Hotspot: locationbased forwarding scheme in an opportunistic network," Ad Hoc & Sensor Wireless Networks, in press.