Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Reliable broadband communication using a burst erasure correcting code
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Efficient integration of multi-hop wireless and wired networks with QoS constraints
Proceedings of the 8th annual international conference on Mobile computing and networking
Introduction to Algorithms
IEEE Spectrum
Transportation: faster than a speeding bullet train
IEEE Spectrum
IEEE Transactions on Information Theory
Combined array processing and space-time coding
IEEE Transactions on Information Theory
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
Joint power control and intracell scheduling of DS-CDMA nonreal time data
IEEE Journal on Selected Areas in Communications
Integrated cellular and ad hoc relaying systems: iCAR
IEEE Journal on Selected Areas in Communications
Cooperative content dissemination in multi-channel WLAN hotspots
Computer Networks: The International Journal of Computer and Telecommunications Networking
A link adaptation scheme for the downlink of mobile hotspot
Wireless Communications & Mobile Computing
Cyclic stable matching for three-sided networking services
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.