Host migration transparency in IP networks: the VIP approach
ACM SIGCOMM Computer Communication Review
M-UDP: UDP for mobile cellular networks
ACM SIGCOMM Computer Communication Review
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Mobile Computing
I-TCP: indirect TCP for mobile hosts
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
RelM: reliable multicast for mobile networks
Computer Communications
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
An adaptive strategy for maximizing throughput in MAC layer wireless multicast
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Energy-efficient broadcasting in all-wireless networks
Wireless Networks
High throughput MAC layer multicasting over time-varying channels
Computer Communications
Hi-index | 0.00 |
We consider the problem of multicasting data to mobile users in a cellular mobile network. In the absence of mobility, a single channel can be used to multicast to all mobile users within a cell. However, mobility combined with the effects of fading necessitates a more complex channel allocation policy. In this paper we develop theoretical bounds on the maximum obtainable efficiency and present algorithms that acheive this bound. Our results hold for the case when mobiles travel on a highway, as well as for the more general case where mobiles roam in a two-dimensional region.