File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Auction-based resource allocation for hierarchical wireless mesh networks in rural areas

TitleAuction-based resource allocation for hierarchical wireless mesh networks in rural areas
Authors
KeywordsAuction algorithms
IEEE 802.16
Resource allo-cation
Wireless mesh networks
Issue Date2009
PublisherAssociation for Computing Machinery (ACM).
Citation
The 4th ACM Workshop on Challenged Networks (Mobicom CHANTS 2009), Beijing, China, 25 September 2009. In Proceedings of the 4th ACM Workshop on Challenged networks, 2009 How to Cite?
AbstractHierarchical wireless mesh networks (WMNs), in which multiple layers of mesh routers (MRs) share one centralized gateway, are gaining importance in providing broadband Internet services in rural areas. Such WMNs are effective in that they can provide a wide coverage area in a cost effective manner. However, more often than not, such MRs are owned and operated by different autonomous entities, which might not have the incentive to comply with a central rule. Thus, in such a competitive non-cooperative environment, effective resource allocation is a notoriously difficult problem. In this paper, we propose a novel auction based framework, in which the gateway, equipped with the precious high speed Internet connection, serves as the auctioneer, while the first-level MRs (i.e., those with direct wireless connections to the gateway) act as bidders competing resources among each other. Specifically, a major novelty of our framework is that the valuation and payment functions are derived based on practical considerations and have realistic physical significance. Based on this framework, we first present the Vickrey-Clarke-Groves (VCG) based auction approaches. To further improve performance, we then propose two novel relay auction (RA) algorithms and analyze the effectiveness of their bidding strategies using the game theoretic solution concept of Nash equilibrium (NE). To realize the NE in a practical distributed computing fashion, we also design an iterative bid updating algorithm. Through simulations, we find that the proposed RA algorithms can achieve competitive performance in terms of resource allocation efficiency as the VCG ones, while giving much better connection blocking probability performance, and also having the capability to balance the efficiency and fairness by adjusting the payment function. Copyright 2009 ACM.
Persistent Identifierhttp://hdl.handle.net/10722/126118
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorKong, Zen_HK
dc.contributor.authorKwok, YKen_HK
dc.date.accessioned2010-10-31T12:10:46Z-
dc.date.available2010-10-31T12:10:46Z-
dc.date.issued2009en_HK
dc.identifier.citationThe 4th ACM Workshop on Challenged Networks (Mobicom CHANTS 2009), Beijing, China, 25 September 2009. In Proceedings of the 4th ACM Workshop on Challenged networks, 2009en_HK
dc.identifier.isbn978-1-60558-741-7-
dc.identifier.urihttp://hdl.handle.net/10722/126118-
dc.description.abstractHierarchical wireless mesh networks (WMNs), in which multiple layers of mesh routers (MRs) share one centralized gateway, are gaining importance in providing broadband Internet services in rural areas. Such WMNs are effective in that they can provide a wide coverage area in a cost effective manner. However, more often than not, such MRs are owned and operated by different autonomous entities, which might not have the incentive to comply with a central rule. Thus, in such a competitive non-cooperative environment, effective resource allocation is a notoriously difficult problem. In this paper, we propose a novel auction based framework, in which the gateway, equipped with the precious high speed Internet connection, serves as the auctioneer, while the first-level MRs (i.e., those with direct wireless connections to the gateway) act as bidders competing resources among each other. Specifically, a major novelty of our framework is that the valuation and payment functions are derived based on practical considerations and have realistic physical significance. Based on this framework, we first present the Vickrey-Clarke-Groves (VCG) based auction approaches. To further improve performance, we then propose two novel relay auction (RA) algorithms and analyze the effectiveness of their bidding strategies using the game theoretic solution concept of Nash equilibrium (NE). To realize the NE in a practical distributed computing fashion, we also design an iterative bid updating algorithm. Through simulations, we find that the proposed RA algorithms can achieve competitive performance in terms of resource allocation efficiency as the VCG ones, while giving much better connection blocking probability performance, and also having the capability to balance the efficiency and fairness by adjusting the payment function. Copyright 2009 ACM.en_HK
dc.languageengen_HK
dc.publisherAssociation for Computing Machinery (ACM).-
dc.relation.ispartofAnnual International Conference on Mobile Computing and Networking Workshops, MobiCom'09 - Proceedings of the 4th ACM Workshop on Challenged Networks, CHANTS'09en_HK
dc.subjectAuction algorithmsen_HK
dc.subjectIEEE 802.16en_HK
dc.subjectResource allo-cationen_HK
dc.subjectWireless mesh networksen_HK
dc.titleAuction-based resource allocation for hierarchical wireless mesh networks in rural areasen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturelink_to_OA_fulltext-
dc.identifier.doi10.1145/1614222.1614232en_HK
dc.identifier.scopuseid_2-s2.0-70350633646en_HK
dc.identifier.hkuros175081en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70350633646&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage51en_HK
dc.identifier.epage58en_HK
dc.publisher.placeUnited States-
dc.description.otherThe 4th ACM Workshop on Challenged Networks (Mobicom CHANTS 2009), Beijing, China, 25 September 2009. In Proceedings of the 4th ACM Workshop on Challenged networks, 2009-
dc.identifier.scopusauthoridKong, Z=7006536683en_HK
dc.identifier.scopusauthoridKwok, YK=7101857718en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats