Mobile offloading in wireless ad hoc networks: the tightness strategy

Abstract

This paper describes a strategy that was designed, implemented, and presented at the Mobile Ad Hoc Networking Interoperability and Cooperation (MANIAC) Challenge 2013. The theme of the challenge was "Mobile Data Offloading," and consisted on developing and comparatively evaluating strategies to offload infrastructure access points via customer ad hoc forwarding using handheld devices. According to the challenge rules, a hop-by-hop bidding contest should decide the path of each data packet towards its destination. Consequently, each team should rely on other teams' willingness to forward packets for them in order to get their traffic across the network. Following these rules, this paper proposes a strategy that is based on the concept of how "tight" a node is to successfully deliver a packet to its destination within a given deadline. This "tightness" idea relies on a shortest-path analysis of the underlying network graph, and it is used to define three sub-strategies that specify a) how to participate in an auction; b) how to announce an auction; and c) how to decide who wins the announced auction. The proposed strategy seeks to minimize network resource utilization and to promote cooperative behavior among participant nodes.

References

1. "Mobile data traffic surpasses voice," http://www.cellular-news.com/story/42543.php.
2. B. Han, P. Hui, A. Kumar, M. Marathe, J. Shao, and A. Srinivasan, "Mobile data offloading through opportunistic communications and social participation," IEEE Trans. on Mobile Computing, vol. 11, no. 5, pp. 821--834, 2012.
3. G. Iosifidis, L. Gao, J. Huang, and L. Tassiulas, "An iterative double auction for mobile data offloading," in Proc. WiOpt, 2013, pp. 154--161.
4. X. Zhuo, W. Gao, G. Cao, and S. Hua, "An incentive framework for cellular traffic offloading," IEEE Trans. on Mobile Computing, vol. 13, no. 3, pp. 541--555, 2014.
5. S. Singh, H. Dhillon, and J. Andrews, "Offloading in heterogeneous networks: Modeling, analysis, and design insights," IEEE Trans. on Wireless Communications, vol. 12, no. 5, pp. 2484--2497, 2013.
6. "MANIAC challenge 2013," http://2013.maniacchallenge.org/.
7. "GitHub -- MANIAC challenge 2013 code," http://github.com/maniacchallenge.
8. T. Clausen, P. Jacquet, C. Adjih, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, L. Viennot, et al., "Optimized link state routing protocol (OLSR)," Oct 2003, RFC 3626.
9. E. Baccelli, F. Juraschek, O. Hahm, T. Schmidt, H. Will, and M. Wahlisch, "The MANIAC challenge at IETF -- student competition makes network problem solving fun," The IETF Journal, vol. 9, no. 2, pp. 27--29, 2013.
10. S. Zhong, J. Chen, and Y. Yang, "Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks," in Proc. INFOCOM, 2003, pp. 1987--1997.
11. V. Srivastava, J. Neel, A. MacKenzie, L. DaSilva, J. Hicks, J. Reed, and R. Gilles, "Using game theory to analyze wireless ad hoc networks," IEEE Communications Surveys and Tutorials, vol. 7, no. 4, pp. 46--56, 2005.
12. M. Shafiq, L. Ji, A. Liu, J. Pang, S. Venkataraman, and J. Wang, "A first look at cellular network performance during crowded events," in Proc. SIGMETRICS, 2013, pp. 17--28.

Index Terms

• Computer systems organization

  • Architectures

    • Distributed architectures

• Networks

  • Network architectures

  • Network protocols

    • Network layer protocols

      • Routing protocols

  • Network types

    • Mobile networks

    • Wireless access networks