Effective video multicast over wireless internet

With the rapid growth of wireless networks and great success of Internet video, wireless video services are expected to be widely deployed in the near future. As different types of wireless networks are converging into all IP networks, i.e., the Internet, it is important to study video delivery over the wireless Internet. This paper proposes a novel end-system based adaptation protocol calledWireless Hybrid Adaptation Layered Multicast (WHALM) protocol for layered video multicast over wireless Internet. In WHALM the sender dynamically collects bandwidth distribution from the receivers and uses an optimal layer rate allocation mechanism to reduce the mismatches between the coarse-grained layer subscription levels and the heterogeneous and dynamic rate requirements from the receivers, thus maximizing the degree of satisfaction of all the receivers in a multicast session. Based on sampling theory and theory of probability, we reduce the required number of bandwidth feedbacks to a reasonable degree and use a scalable feedback mechanism to control the feedback process practically. WHALM is also tuned to perform well in wireless networks by integrating an end-to-end loss differentiation algorithm (LDA) to differentiate error losses from congestion losses at the receiver side. With a series of simulation experiments over NS platform, WHALM has been proved to be able to greatly improve the degree of satisfaction of all the receivers while avoiding congestion collapse on the wireless Internet

Power-Efficient Radio Resource Allocation for Low-Medium -Altitude Aerial Platform Based TD-LTE Networks

In order to provide an increased capacity, throughput and QoS guarantee for terrestrial users in emergency scenarios, a low-medium-altitude aerial platform based time-division-duplex long term evolution (TD-LTE) system referred to as Aerial LTE, is presented in this paper. Additionally a power-efficient radio resource allocation mechanism is proposed for both the Aerial LTE downlink and uplink, which is modeled as a cooperative game. Our simulation results demonstrate that the proposed algorithm imposes an attractive tradeoff between the achievable throughput and the power consumption while ensuring fairness among users

PACE: Simple Multi-hop Scheduling for Single-radio 802.11-based Stub Wireless Mesh Networks

IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC. PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned

Exploiting Regional Differences: A Spatially Adaptive Random Access

In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access (SARA) scheme in which the transmitters in the network utilize different transmit probabilities depending on the local situation. In our proposed scheme, the transmit probability is adaptively updated by the ratio of the received SINR and the target SINR. We investigate the performance of the spatially adaptive random access scheme. For the comparison, we derive an optimal transmit probability of ALOHA random access scheme in which all transmitters use the same transmit probability. We illustrate the performance of the spatially adaptive random access scheme through simulations. We show that the performance of the proposed scheme surpasses that of the optimal ALOHA random access scheme and is comparable with the CSMA/CA scheme.Comment: 10 pages, 10 figure