{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:18Z","timestamp":1761611358870,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T00:00:00Z","timestamp":1406505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2014,7,28]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/2656877.2656891","type":"journal-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T20:13:24Z","timestamp":1406924004000},"page":"96-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Mobile offloading in wireless ad hoc networks"],"prefix":"10.1145","volume":"44","author":[{"given":"Gabriel B.T.","family":"Kalejaiye","sequence":"first","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joao A.S.R.","family":"Rondina","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo V.V.L.","family":"Albuquerque","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tais L.","family":"Pereira","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz F.O.","family":"Campos","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael A.S.","family":"Melo","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Mascarenhas","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo M.","family":"Carvalho","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brasilia, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,28]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"\"Mobile data traffic surpasses voice \" http:\/\/www.cellular-news.com\/story\/42543.php.  \"Mobile data traffic surpasses voice \" http:\/\/www.cellular-news.com\/story\/42543.php."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.101"},{"key":"e_1_2_1_3_1","first-page":"154","article-title":"An iterative double auction for mobile data offloading","author":"Iosifidis G.","year":"2013","unstructured":"G. Iosifidis , L. Gao , J. Huang , and L. Tassiulas , \" An iterative double auction for mobile data offloading ,\" in Proc. WiOpt , 2013 , pp. 154 -- 161 . G. Iosifidis, L. Gao, J. Huang, and L. Tassiulas, \"An iterative double auction for mobile data offloading,\" in Proc. WiOpt, 2013, pp. 154--161.","journal-title":"Proc. WiOpt"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2013.15"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.040413.121174"},{"key":"e_1_2_1_6_1","unstructured":"\"MANIAC challenge 2013 \" http:\/\/2013.maniacchallenge.org\/.  \"MANIAC challenge 2013 \" http:\/\/2013.maniacchallenge.org\/."},{"key":"e_1_2_1_7_1","unstructured":"\"GitHub -- MANIAC challenge 2013 code \" http:\/\/github.com\/maniacchallenge.  \"GitHub -- MANIAC challenge 2013 code \" http:\/\/github.com\/maniacchallenge."},{"key":"e_1_2_1_8_1","volume-title":"Optimized link state routing protocol (OLSR)","author":"Clausen T.","year":"2003","unstructured":"T. Clausen , P. Jacquet , C. Adjih , A. Laouiti , P. Minet , P. Muhlethaler , A. Qayyum , L. Viennot , , \" Optimized link state routing protocol (OLSR) ,\" Oct 2003 , RFC 3626. 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."},{"issue":"2","key":"e_1_2_1_9_1","first-page":"27","article-title":"The MANIAC challenge at IETF -- student competition makes network problem solving fun","volume":"9","author":"Baccelli E.","year":"2013","unstructured":"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 . 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.","journal-title":"The IETF Journal"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209220"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1593279"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465754"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2656877.2656891","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2656877.2656891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:43Z","timestamp":1750231183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2656877.2656891"}},"subtitle":["the tightness strategy"],"short-title":[],"issued":{"date-parts":[[2014,7,28]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7,28]]}},"alternative-id":["10.1145\/2656877.2656891"],"URL":"https:\/\/doi.org\/10.1145\/2656877.2656891","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2014,7,28]]},"assertion":[{"value":"2014-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}