This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Information Raining and Optimal Link-Layer Design for Mobile Hotspots
May/June 2005 (vol. 4 no. 3)
pp. 271-284
In this paper, we propose a link layer design for mobile hotspots. We design a novel system architecture that enables high-speed Internet access in railway systems. The proposed design uses a number of repeaters placed along the track and multiple antennas installed on the roof of a vehicle. Each packet is decomposed into smaller fragments and relayed to the vehicle via adjacent repeaters. We also use erasure coding to add parity fragments to original data. This approach is called information raining since fragments are rained upon the vehicle from adjacent repeaters. We investigate two instances of information raining. In blind information raining, all repeaters awaken when they sense the presence of the vehicle. The fragments are then blindly transmitted via awakened repeaters. A vehicle station installed inside the train is responsible for aggregating a large enough number of fragments. In the throughput-optimized information raining, the vehicle station selects a bipartite matching between repeaters and roof-top antennas and activates only a subset of the repeaters. It also dictates the amount of transmission power of each activated repeater. Both the bipartite matching and power allocations are individually shown to be NP-complete. Matching heuristics based on the Hungarian algorithm and Gale-Shapley algorithm are proposed. A simplex-type algorithm is proposed as the power allocation heuristics.

[1] C. Perkins, “IP Mobility Support for IPv4,” RFC 3344, Aug. 2002.
[2] D. Johnson, C. Perkins, and J. Arkko, “Mobility Support in IPv6,” IETF Mobile IP Working Group Internet-Draft, June 2003.
[3] T.S. Rappaport, S.Y. Seidel, and R. Singh, “900 MHz Multipath Propagation Measurements for US Digital Cellular Radiotelephone,” IEEE Trans. Vehicular Technology, vol. 39, pp. 132-139, May 1990.
[4] P. Holmer, “Faster than a Speeding Bullet Train,” IEEE Spectrum, vol. 40, pp. 30-34, Aug. 2003.
[5] N.W. Whinnett, “Tetra High Speed Performance for Police and Rail Applications,” Proc. Seventh IEE European Conf. Mobile and Personal Comm., pp. 104-107, 1993.
[6] H. Hayashi, “1.5GHz Band Wave Propagation Characteristics and Data Transmission Quality from Train to Ground,” Proc. IEEE Vehicular Technology Conf. (VTC '92), pp. 192-195, 1992.
[7] T. Hattori and K. Abe, “Analyses of Propagation Characteristics in Future Railway Communication Systems Using 25GHz Band Radio,” Proc. 49th IEEE Vehicular Technology Conf., pp. 2288-2292, 1999.
[8] T. Hattori, “System Design Technique in the Railway Radio Communication Using Microwave and Millimeter-Wave,” Proc. IEEE Vehicular Technology Conf., pp. 703-707, 2001.
[9] “Stay Connected with Accesszone from Bell Canada,” http://www.viarail.cawirelessinternet/, 2005.
[10] B. Brewin, “Wi-Fi to Ride California Passenger Rails,” http://www.computerworld.com/mobiletopics/ mobile/story0,10801,83930,00.html, 2005.
[11] “Gner Mobile Office— How Does It Work? http://www.gnermo bileoffice.co.uk/GNERMobileOffice howdoesitwork/, 2005.
[12] M. Williams, “Nec Shows Wi-fi at 205mph,” http://www.info world.com/article/03/10/ 20HNnecwifi_1.html, 2005.
[13] E. Kuun and W. Rickard, “Open Standards for CBTC and CCTV Radio-Based Communication,” Alcatel Telecomm. Rev., pp. 243-252, second quarter, 2004.
[14] H. Wu, C. Qiao, S. De, and O. Tonguz, “Integrated Cellular and Ad Hoc Relaying Systems: iCAR,” IEEE J. Selected Areas Comm., vol. 19, pp. 2105-2115, Oct. 2001.
[15] Y. Bejerano, “Efficient Integration of Multi-Hop Wireless and Wired Networks with QoS Constraints,” Proc. Eighth Ann. Int'l Conf. Mobile Computing and Networking, pp. 215-226, 2002.
[16] J. Boyer, D. Falconer, and H. Yanikomeroglu, “A Theoretical Characterization of the Multihop Wireless Communications Channel with Diversity,” Proc. IEEE GLOBECOM, pp. 841-845, 2001.
[17] H. Yanikomeroglu, “Cellular Multihop Communications: Infrastructure-Based Relay Network Architecture for 4G Wireless Systems,” Proc. 22nd Queen's Biennial Symp. Comm. (QBSC '04), pp. 76-78, 2004.
[18] A. Tsirigos and Z.J. Haas, “Multipath Routing in the Presence of Frequent Topological Changes,” IEEE Comm. Magazine, vol. 39, pp. 132-138, Nov. 2001.
[19] E. Ayanoğlu, C.-L. I, R.D. Gitlin, and J.E. Mazo, “Diversity Coding for Transparent Self-Healing and Fault-Tolerant Communication Networks,” IEEE Trans. Comm., vol. 41, pp. 1677-1686, Nov. 1993.
[20] S.M. Cherry, “Broadband a Go-Go,” IEEE Spectrum, vol. 40, pp. 20-25, June 2003.
[21] V. Tarokh, N. Seshadri, and A.R. Calderbank, “Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction,” IEEE Trans. Information Theory, vol. 44, pp. 744-765, Mar. 1998.
[22] V. Tarokh, A. Naguib, N. Seshadri, and A.R. Calderbank, “Combined Array Processing and Space-Time Coding,” IEEE Trans. Information Theory, vol. 45, pp. 1121-1128, May 1999.
[23] P. Djukic, “Optimum Resource Allocation in Multipath Ad Hoc Networks,” MASc thesis, Univ. of Toronto, Toronto, Canada, Aug. 2003.
[24] M.O. Rabin, “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” J. ACM, vol. 36, pp. 335-348, Apr. 1989.
[25] A.J. McAuley, “Reliable Broadband Communication Using a Burst Erasure Correcting Code,” Proc. ACM SIGCOMM '90, special issue computer communication review, pp. 297-306, 1990.
[26] C.H. Papadimitriou, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1982.
[27] H.W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
[28] U. Derigs, “Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms,” Lecture Notes in Economics and Math. Systems, Berlin Heidelberg: Springer-Verlag, 1988.
[29] J.E. Hopcroft and R.M. Karp, “An $n^{5/2}$ Algorithm for Maximum Matchings in Bipartite Graphs,” SIAM J. Computing, pp. 225-231, 1973.
[30] G. Mitra and K. Darby-Dowman, “An Investigation of Algorithms Used in Restructuring of Linear Programming Basis Matrices Prior to Inversion, Studies on Graphs and Discrete Programming,” Annals of Discrete Math., studies on graphs and discrete programming, vol. 11, pp. 69-93, 1981.
[31] D. Gale and L. Shapley, “College Admissions and the Stability of Marriage,” Am. Math. Monthly, vol. 69, pp. 9-15, 1962.
[32] D.E. Knuth, “Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms,” CRM Proc. & Lecture Notes, 1997, originally published in French in 1981; translated by M. Goldstein.
[33] D. Gusfield and R.W. Irving, The Stable Marriage Problem: Structure and Algorithms. Cambridge, Mass.: The MIT Press, 1989.
[34] D. Ho, “Link-Layer Design and Throughput Optimization of Mobile Hotspot in Railway System,” MASc thesis, Univ. of Toronto, Toronto, Canada, 2004.
[35] I. Stancu-Minasian, Fractional Programming: Theory, Methods and Applications. Academic Publishers, 1997.
[36] T.S. Rappaport, Wireless Communications: Principles and Practice. Piscataway, N.J.: IEEE Press, 1996.
[37] A.W. Anpalagan and E.S. Sousa, “A Tagging-Based Medium Access Scheme for Wireless Data Applications in CDMA/TDM Networks,” Proc. IEEE Int'l Symp. Personal, Indoor, and Mobile Radio Comm., pp. E-152-E-156, 2001.
[38] M.L. Honig and U. Madhow, “Hybrid Intra-Cell TDMA/Inter-Cell CDMA with Inter-Cell Interference Suppression for Wireless Networks,” Proc. IEEE Vehicular Technology Conf., pp. 309-312, 1993.
[39] K. Navaie and S. Valaee, “Impact of Heavy Tail Call Duration on Total Interference in Cellular CDMA,” Proc. Eighth Canadian Workshop Information Theory, pp. 208-211, 2003.
[40] F. Berggren, S.-L. Kim, R. Jantti, and J. Zander, “Joint Power Control and Intracell Scheduling of DS-CDMA Nonreal Time Data,” IEEE J. Selected Areas Comm., vol. 19, pp. 1860-1870, Oct. 2001.
[41] A. Bedekar, S. Borst, K. Ramanan, P. Whiting, and E. Yeh, “Downlink Scheduling in CDMA Data Networks,” Proc. IEEE GLOBECOM, pp. 2653-2657, 1999.
[42] R. Knopp and P.A. Humblet, “Information Capacity and Power Control in Single-Cell Multiuser Communications,” Proc. IEEE Int'l Conf. Comm. (ICC '95), pp. 331-335, 1995.
[43] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press and McGraw-Hill, 2001.

Index Terms:
Emerging technologies, network architecture and design, wireless communication, network protocols, mobile communication systems, mobile environments, medium access control, mobile hotspots, graphs and networks, linear programming, constrained optimization, graph theory, combinatorial algorithms.
Citation:
Daniel H. Ho, Shahrokh Valaee, "Information Raining and Optimal Link-Layer Design for Mobile Hotspots," IEEE Transactions on Mobile Computing, vol. 4, no. 3, pp. 271-284, May-June 2005, doi:10.1109/TMC.2005.42
Usage of this product signifies your acceptance of the Terms of Use.