Subscribe

Issue No.01 - January (2009 vol.8)

pp: 109-125

De-Nian Yang , National Taiwan University, Taipei

Ming-Syan Chen , National Taiwan University, Taipei

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.97

ABSTRACT

In this paper, we propose a new data broadcast mechanism with network coding in heterogeneous wireless networks. Our mechanism adaptively clusters the mobile hosts in fewer cells to minimize the bandwidth consumption. In addition, we adaptively code the data according to the data temporarily stored in each mobile host with a distributed manner. Our mechanism allows each delivered message to be coded from only a subset of data to further reduce the number of required messages. We formulate the cell selection and broadcast coding problem with integer programming and prove that the problem is NP-hard. We design a distributed algorithm based on Lagrangean relaxation. Our algorithm needs no server to record the location, queried, and stored information of receivers. Moreover, our algorithm is adaptive to the dynamic group membership, mobility, queried, and stored data of receivers.

INDEX TERMS

Multicast, Network Architecture and Design

CITATION

De-Nian Yang, Ming-Syan Chen, "Data Broadcast with Adaptive Network Coding in Heterogeneous Wireless Networks",

*IEEE Transactions on Mobile Computing*, vol.8, no. 1, pp. 109-125, January 2009, doi:10.1109/TMC.2008.97REFERENCES

- [1] H. Hsieh and R. Sivakumar, “A Transport Layer Approach for Achieving Aggregate Bandwidths on Multi-Homed Mobile Hosts,”
Proc. ACM MobiCom, 2002.- [2] H. Huang, J. Cai, A.J. Kassler, and C. Fu, “Load-Sharing in Wireless Multi-Homed Systems,”
Proc. IEEE Int'l Conf. Comm. (ICC '05), vol. 5, pp. 16-20, 2005.- [3] 3GPP TS 23.234,
3GPP System to Wireless Local Area Network (WLAN) Interworking, 2008.- [4]
Unlicensed Mobile Access (UMA), http://www.umatechnology. orgindex.htm, 2008.- [13] T. Ho, M. Médard, M. Effros, and D. Karger, “The Benefits of Coding over Routing in a Randomized Setting,”
Proc. IEEE Int'l Symp. Information Theory, June/July 2003.- [15] C. Fragouli, J.-Y.L. Boudec, and J. Widmer, “Network Coding: An Instant Primer,”
ACM SIGCOMM Computer Comm. Rev., vol. 36, no. 1, pp. 63-68, Jan. 2006.- [25] P.A. Chou, Y. Wu, and K. Jain, “Practical Network Coding,”
Proc. 51st Ann. Allerton Conf. Comm., Control, and Computing, Oct. 2003.- [26] C. Gkantsidis, J. Miller, and P. Rodriguez, “Comprehensive View of a Live Network Coding P2P System,”
Proc. Sixth ACM SIGCOMM Conf. Internet Measurement, pp. 177-188, 2006.- [29] G.L. Nemhauser and L.A. Wosley,
Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Math. and Optimization, 1999.- [42] F. Harary,
Graph Theory. Westview Press, 1994.- [44] C.H. Papadimitriou and K. Steiglitz,
Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998.- [45]
CPLEX Mathematical Programming Optimizer, http://www.ilog. com/productscplex/, 2008.- [47] V.N. Padmanabhan and L. Qiu, “The Content and Access Dynamics of a Busy Web Site: Findings and Implications,”
Proc. ACM SIGCOMM '00, pp. 111-123, 2000. |