KSII Transactions on Internet and Information Systems (TIIS)

  • 제12권5호
  • /
  • Pages.1992-2008
  • /
  • 2018
  • /
  • 1976-7277(pISSN)
  • /
  • 1976-7277(eISSN)
한국인터넷정보학회 (Korean Society for Internet Information)
권호 표지
DOI QR코드

DOI QR Code

FARS: A Fairness-aware Routing Strategy for Mobile Opportunistic Networks

  • Ma, Huahong (School of Information Engineering, Henan University of Science and Technology) ;
  • Wu, Honghai (School of Information Engineering, Henan University of Science and Technology) ;
  • Zheng, Guoqiang (School of Information Engineering, Henan University of Science and Technology) ;
  • Ji, Baofeng (School of Information Engineering, Henan University of Science and Technology) ;
  • Li, Jishun (Henan Key Laboratory for Machinery Design and Transmission System)
  • 투고 : 2017.04.17
  • 심사 : 2017.12.10
  • 발행 : 2018.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Mobile opportunistic network is a kind of ad hoc networks, which implements the multi-hop routing communication with the help of contact opportunity brought about by the mobility of the nodes. It always uses opportunistic data transmission mode based on store-carry-forward to solve intermittent connect problem of link. Although many routing schemes have been proposed, most of them adopt the greedy transmission mode to pursue a higher delivery efficient, which result in unfairness extremely among nodes. While, this issue has not been paid enough attention up to now. In this paper, we analyzed the main factors that reflect fairness among nodes, modeled routing selection as a multiple attribute decision making problem, and proposed our Fairness-aware Routing Strategy, named FARS. To evaluate the performance of our FARS, extensive simulations and analysis have been done based on a real-life dataset and a synthetic dataset, respectively. The results show that, compared with other existing protocols, our FARS can greatly improve the fairness of the nodes when ensuring the overall delivery performance of the network.

키워드

참고문헌

  1. M.R.Schurgot, Cristina and k Jaffres-Runser, "Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication," IEEE Communications Magazine, vol. 50, no. 7, pp. 155-162, July 2011. https://doi.org/10.1109/MCOM.2012.6231292
  2. W.Y.Shin, S.Y.Chung and Y.H.Lee, "Parallel opportunistic routing in wireless networks," Information Theory, IEEE Transactions on, vol.59, no.10, pp.6290-300, October 2013. https://doi.org/10.1109/TIT.2013.2272884
  3. E.Ghadimi, O.Landsiedel, P.Soldati, S.Duquennoy and M.Johansson, "Opportunistic routing in low duty-cycle wireless sensor networks," ACM Transactions on Sensor Networks (TOSN). vol.10, no.4, pp.67, June 2014.
  4. S.Batabyal and P.Bhaumik, "Mobility models, traces and impact of mobility on opportunistic routing algorithms: A survey," IEEE Communications Surveys & Tutorials, vol.17, no.3, pp.1679-1707, July 2015. https://doi.org/10.1109/COMST.2015.2419819
  5. Fall K, "A delay-tolerant network architecture for challenged internets," in Proc. of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications,. pp.27-34, August 25-29, 2003.
  6. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks," University of Kansas, Lawrence. CS-200006, 2000.
  7. A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," ACM SIGMOBILE mobile computing and communications review, vol.7, no.3, pp. 19-20, August 25-29, 2003. https://doi.org/10.1145/961268.961272
  8. E. Talipov, Y. Chon, and H. Cha, "User context-based data delivery in opportunistic smartphone networks," Pervasive and Mobile Computing, vol. 17, no. 1, pp. 122-138, February, 2015. https://doi.org/10.1016/j.pmcj.2014.06.001
  9. H.A. Nguyen and S Giordano, "Context information prediction for social-based routing in opportunistic networks," Ad Hoc Networks, vol.10, no.8, pp.1557-1569, November 2012. https://doi.org/10.1016/j.adhoc.2011.05.007
  10. E. Bulut and B. K. Szymanski, "Exploiting friendship relations for efficient routing in mobile social networks," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 12, pp. 2254-2265, 2012. https://doi.org/10.1109/TPDS.2012.83
  11. A. Mtibaa, M. May, C. Diot, and M. Ammar, "PeopleRank: social opportunistic forwarding," in Proc. of the 30th IEEE International Conference on Computer Communications, pp. 1-5, March14-19, 2010.
  12. E.M.Daly andM.Haahr, "Social network analysis for routing in disconnected delay-tolerant MANETs," in Proc. of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 32-40, September 9-14, 2007.
  13. E. M. Daly and M. Haahr, "Social network analysis for information flow in disconnected delay-tolerant MANETs," IEEE Transactions on Mobile Computing, vol. 8, no. 5, pp. 606-621, May 2009. https://doi.org/10.1109/TMC.2008.161
  14. P. Hui, J. Crowcroft, and E. Yoneki, "BUBBLE Rap: social-based forwarding in delay-tolerant networks," IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1576-1589, November 2011. https://doi.org/10.1109/TMC.2010.246
  15. P. Yuan, H. Ma, and H. Fu, "Hotspot-entropy based data forwarding in opportunistic social networks," Pervasive and Mobile Computing, vol. 16, pp. 136-154, January 2015. https://doi.org/10.1016/j.pmcj.2014.06.003
  16. Kaur, G, Hamsapriya, T, and Lalwani. P, "A new energy efficient queue based multipath load balancing in Ad hoc network," In Proc. of 2014 International Conference on Computer Communication and Informatics: Ushering in Technologies of Tomorrow, pp. 1-6, January3-5, 2014.
  17. Fan, Xiaoguang, Victor OK Li, and Kuang Xu, "Fairness analysis of routing in opportunistic mobile networks," IEEE Transactions on Vehicular Technology, vol.63, no.3, pp.1282-1295, March 2014. https://doi.org/10.1109/TVT.2013.2282341
  18. Takahashi A, Nishiyama H, and Kato N, "Fairness issue in message delivery in delay-and disruption-tolerant networks for disaster areas," in Proc. of 2013 International Conference on Computing, Networking and Communications, pp.890-894, January 28-31, 2013.
  19. Mtibaa, Abderrahmen, and Khaled A. Harras, "Fairness-related challenges in mobile opportunistic networking," Computer Networks, vol.57, no.1, pp.228-242, January 2013. https://doi.org/10.1016/j.comnet.2012.08.019
  20. Pujol, J. M., Toledo, A. L., and Rodriguez, P, "Fair routing in delay tolerant networks," In Proc. of IEEE INFOCOM 2009, IEEE, pp. 837-845, April 19-25, 2009.
  21. Yang C, Stoleru R, "On balancing the energy consumption of routing protocols for opportunistic social networks," In Proc. of 2015 IEEE 34th International Performance Computing and Communications Conference, pp.1-9, December 14-16, 2015.
  22. Le T, Kalantarian H, abd Gerla M, "A novel social contact graph based routing strategy for workload and throughput fairness in delay tolerant networks," Wireless Communications and Mobile Computing, vol,16, no.11, pp. 1352-1362, August 2016. https://doi.org/10.1002/wcm.2694
  23. Zanakis, S. H., Solomon, A., Wishart, N., and Dublish, S., "Multi-attribute decision making: A simulation comparison of select methods," European journal of operational research, vol.107, no.3, pp. 507-529, June 1998. https://doi.org/10.1016/S0377-2217(97)00147-1
  24. Shannon, C.E., "A mathematical theory of communication," The Bell System Technical Journal, vol.27, no.3, pp.379-423, July 1948. https://doi.org/10.1002/j.1538-7305.1948.tb01338.x
  25. http://www.haggleproject.org
  26. W.-j. Hsu, T. Spyropoulos, K. Psounis, and A. Helm, "Modeling time-variant user mobility in wireless mobile networks," In Proc. of IEEE INFOCOM 2007, pp.758-766, May 6-12, 2007.
  27. http://www.shigs.co.uk/index.php?page=traces'
  28. Anh N H M, and Hu C L, "Using Stationary Relay Nodes (Thrown Boxes) to Maximize Message Forwarding Performance in Delay-Tolerant Networks," International Journal of Science and Engineering, vol.4, no.4, pp. 33-40, 2014.
  29. Spyropoulos T, and Sermpezis P, "Soft cache hits and the impact of alternative content recommendations on mobile edge caching," In Proc. of the Eleventh ACM Workshop on Challenged Networks, pp.51-56, October 3-7, 2016.
  30. Jindal, A. and Psounis, K, "Performance analysis of epidemic routing under contention," In Proc. of the 2006 international conference on Wireless communications and mobile computing , pp. 539-544, July3-6, 2006.
  31. H.Ma, G.Zheng, H.Wu, B.Ji, and J.Li, "EBRP: An Energy-Efficient and Buffer-Aware Routing Protocol for Mobile Crowdsensing Network," International Journal of Distributed Sensor Networks , vol.2016, pp. 1-14, February 2016.
  32. Jain R, Chiu DM, and Hawe WR, A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer System, MA, Hudson, 1984.

피인용 문헌

  1. Evaluating Forwarding Protocols in Opportunistic Networks: Trends, Advances, Challenges and Best Practices vol.11, pp.5, 2018, https://doi.org/10.3390/fi11050113