Conference Paper: Stochastic optimal multirate multicast in socially selfish wireless networks

File Download

Content.pdf

Links for fulltext
(May Require Subscription)

Publisher Website: 10.1109/INFCOM.2012.6195545
Scopus: eid_2-s2.0-84861587091

Supplementary

Bookmarks:
- CiteULike:
  3
Citations:
- Scopus:
- Web of Science:
- PubMed Central:
Item Statistics (The Hub)
Appears in Collections:
- Computer Science: Conference papers

Title	Stochastic optimal multirate multicast in socially selfish wireless networks
Authors	Li, H1 Wu, C1 Li, Z2 Huang, W1 Lau, FCM1
Keywords	Bandwidth availability Capacity allocation Data dissemination Distributed implementation Empirical studies
Issue Date	2012
Publisher	IEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
Citation	The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 172-180 [How to Cite?] DOI: http://dx.doi.org/10.1109/INFCOM.2012.6195545
Abstract	Multicast supporting non-uniform receiving rates is an effective means of data dissemination to receivers with diversified bandwidth availability. Designing efficient rate control, routing and capacity allocation to achieve optimal multirate multicast has been a difficult problem in fixed wireline networks, let alone wireless networks with random channel fading and volatile node mobility. The challenge escalates if we consider also the selfishness of users who prefer to relay data for others with strong social ties. Such social selfishness of users is a new constraint in network protocol design. Its impact on efficient multicast in wireless networks has yet to be explored especially when multiple receiving rates are allowed. In this paper, we design an efficient, social-aware multirate multicast scheme that can maximize the overall utility of socially selfish users in a wireless network, and its distributed implementation. We model social preferences of users as differentiated costs for packet relay, which are weighted by the strength of social tie between the relay and the destination. Stochastic Lyapunov optimization techniques are utilized to design optimal scheduling of multicast transmissions, which are combined with multi-resolution coding and random linear network coding. With rigorous theoretical analysis, we study the optimality, stability, and complexity of our algorithm, as well as the impact of social preferences. Empirical studies further confirm the superiority of our algorithm under different social selfishness patterns. © 2012 IEEE.
Description	TS39: Wireless cross-layer design 1
ISBN	978-1-4673-0775-8
ISSN	0743-166X 2011 SCImago Journal Rankings: 0.047
DOI	http://dx.doi.org/10.1109/INFCOM.2012.6195545
References	References in Scopus

DC Field	Value
dc.contributor.author	Li, H
dc.contributor.author	Wu, C
dc.contributor.author	Li, Z
dc.contributor.author	Huang, W
dc.contributor.author	Lau, FCM
dc.date.accessioned	2012-06-26T06:32:51Z
dc.date.available	2012-06-26T06:32:51Z
dc.date.issued	2012
dc.description.abstract	Multicast supporting non-uniform receiving rates is an effective means of data dissemination to receivers with diversified bandwidth availability. Designing efficient rate control, routing and capacity allocation to achieve optimal multirate multicast has been a difficult problem in fixed wireline networks, let alone wireless networks with random channel fading and volatile node mobility. The challenge escalates if we consider also the selfishness of users who prefer to relay data for others with strong social ties. Such social selfishness of users is a new constraint in network protocol design. Its impact on efficient multicast in wireless networks has yet to be explored especially when multiple receiving rates are allowed. In this paper, we design an efficient, social-aware multirate multicast scheme that can maximize the overall utility of socially selfish users in a wireless network, and its distributed implementation. We model social preferences of users as differentiated costs for packet relay, which are weighted by the strength of social tie between the relay and the destination. Stochastic Lyapunov optimization techniques are utilized to design optimal scheduling of multicast transmissions, which are combined with multi-resolution coding and random linear network coding. With rigorous theoretical analysis, we study the optimality, stability, and complexity of our algorithm, as well as the impact of social preferences. Empirical studies further confirm the superiority of our algorithm under different social selfishness patterns. © 2012 IEEE.
dc.description.nature	published_or_final_version
dc.description	TS39: Wireless cross-layer design 1
dc.description.other	The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 172-180
dc.identifier.citation	The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 172-180 [How to Cite?] DOI: http://dx.doi.org/10.1109/INFCOM.2012.6195545
dc.identifier.citeulike	10794576
dc.identifier.doi	http://dx.doi.org/10.1109/INFCOM.2012.6195545
dc.identifier.epage	180
dc.identifier.hkuros	202423
dc.identifier.isbn	978-1-4673-0775-8
dc.identifier.issn	0743-166X 2011 SCImago Journal Rankings: 0.047
dc.identifier.scopus	eid_2-s2.0-84861587091
dc.identifier.spage	172
dc.identifier.uri	http://hdl.handle.net/10722/152046
dc.language	eng
dc.publisher	IEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
dc.publisher.place	United States
dc.relation.ispartof	IEEE Infocom Proceedings
dc.relation.references	References in Scopus
dc.rights	IEEE Infocom Proceedings. Copyright © IEEE Computer Society.
dc.rights	©2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
dc.rights	Creative Commons: Attribution 3.0 Hong Kong License
dc.subject	Bandwidth availability
dc.subject	Capacity allocation
dc.subject	Data dissemination
dc.subject	Distributed implementation
dc.subject	Empirical studies
dc.title	Stochastic optimal multirate multicast in socially selfish wireless networks
dc.type	Conference_Paper

<?xml encoding="utf-8" version="1.0"?><item><contributor.author>Li, H</contributor.author><contributor.author>Wu, C</contributor.author><contributor.author>Li, Z</contributor.author><contributor.author>Huang, W</contributor.author><contributor.author>Lau, FCM</contributor.author><date.accessioned>2012-06-26T06:32:51Z</date.accessioned><date.available>2012-06-26T06:32:51Z</date.available><date.issued>2012</date.issued><identifier.citation>The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 172-180</identifier.citation><identifier.isbn>978-1-4673-0775-8</identifier.isbn><identifier.issn>0743-166X</identifier.issn><identifier.uri>http://hdl.handle.net/10722/152046</identifier.uri><description>TS39: Wireless cross-layer design 1</description><description.abstract>Multicast supporting non-uniform receiving rates is an effective means of data dissemination to receivers with diversified bandwidth availability. Designing efficient rate control, routing and capacity allocation to achieve optimal multirate multicast has been a difficult problem in fixed wireline networks, let alone wireless networks with random channel fading and volatile node mobility. The challenge escalates if we consider also the selfishness of users who prefer to relay data for others with strong social ties. Such social selfishness of users is a new constraint in network protocol design. Its impact on efficient multicast in wireless networks has yet to be explored especially when multiple receiving rates are allowed. In this paper, we design an efficient, social-aware multirate multicast scheme that can maximize the overall utility of socially selfish users in a wireless network, and its distributed implementation. We model social preferences of users as differentiated costs for packet relay, which are weighted by the strength of social tie between the relay and the destination. Stochastic Lyapunov optimization techniques are utilized to design optimal scheduling of multicast transmissions, which are combined with multi-resolution coding and random linear network coding. With rigorous theoretical analysis, we study the optimality, stability, and complexity of our algorithm, as well as the impact of social preferences. Empirical studies further confirm the superiority of our algorithm under different social selfishness patterns. &#169; 2012 IEEE.</description.abstract><language>eng</language><publisher>IEEE Computer Society. The Journal&apos;s web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359</publisher><relation.ispartof>IEEE Infocom Proceedings</relation.ispartof><rights>IEEE Infocom Proceedings. Copyright &#169; IEEE Computer Society.</rights><rights>&#169;2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</rights><rights>Creative Commons: Attribution 3.0 Hong Kong License</rights><subject>Bandwidth availability</subject><subject>Capacity allocation</subject><subject>Data dissemination</subject><subject>Distributed implementation</subject><subject>Empirical studies</subject><title>Stochastic optimal multirate multicast in socially selfish wireless networks</title><type>Conference_Paper</type><description.nature>published_or_final_version</description.nature><identifier.doi>10.1109/INFCOM.2012.6195545</identifier.doi><identifier.scopus>eid_2-s2.0-84861587091</identifier.scopus><identifier.hkuros>202423</identifier.hkuros><relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-84861587091&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references><identifier.spage>172</identifier.spage><identifier.epage>180</identifier.epage><publisher.place>United States</publisher.place><description.other>The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 172-180</description.other><identifier.citeulike>10794576</identifier.citeulike><bitstream.url>http://hub.hku.hk/bitstream/10722/152046/1/Content.pdf</bitstream.url></item>

Author Affiliations

The University of Hong Kong
University of Calgary