Issue No.03 - May/June (2005 vol.4)
Daniel H. Ho , IEEE
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2005.42
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.
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.
Daniel H. Ho, "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