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

Wireless Heterogeneous Networks and Next Generation Internet

The recent advances in wireless access technologies as well as the increasing number of mobile applications have made Wireless Internet a reality. A wide variety of bandwidth demanding services including high speed data delivery and multimedia communication have been materialized through the convergence of the next generation Internet and heterogeneous wireless networks. However, providing even higher bandwidth and richer applications necessitates a fundamental understanding of wireless Internet architecture and the interactions between heterogeneous users. Consequently, fundamental advances in many concepts of the wireless Internet are required for the ultimate goal of communication anytime anywhere. This special issue of the ACM Mobile Networks and Applications Journal is dedicated to the recent advances in the area of Wireless Internet. We accepted 10 papers out of 59 submissions from all over the world with a 17% acceptance rate. Papers describing management schemes, protocols, models, evaluation methods, and experimental studies of Wireless Internet are included in this special issue to provide a broad view of recent advances in this field

Class-Based Weighted Window for TCP Fairness in WLANs

The explosive growth of the Internet has extended to the wireless domain. The number of Internet users and mobile devices with wireless Internet access is continuously increasing. However, the network resource is essentially limited, and fair service is a key issue in bandwidth allocation. In this research, the focus is on the issue of fairness among wireless stations having different number and direction of flows for different required bandwidth to ensure that fair channel is fairly shared between wireless stations in the same class of bandwidth. It is shown that the current WLANs allocate bandwidth unfairly. It is also identified that the cause of this problem of unfairness is the TCP cumulative ACK mechanism combined with the packet dropping mechanism of AP queue and the irregular space for each wireless station in AP queue. The proposed method allocate converged bandwidth by introducing a Class-Based Weighted Window method which adjusts the TCP window size based on the current conditions of the network and according to the network’s requirements. This method works in wireless stations without requiring any modification in MAC. It can guarantee fair service in terms of throughput among wireless users whether they require the same or different bandwidth.Wireless LAN, TCP, Fairness

Building Programmable Wireless Networks: An Architectural Survey

In recent times, there have been a lot of efforts for improving the ossified Internet architecture in a bid to sustain unstinted growth and innovation. A major reason for the perceived architectural ossification is the lack of ability to program the network as a system. This situation has resulted partly from historical decisions in the original Internet design which emphasized decentralized network operations through co-located data and control planes on each network device. The situation for wireless networks is no different resulting in a lot of complexity and a plethora of largely incompatible wireless technologies. The emergence of "programmable wireless networks", that allow greater flexibility, ease of management and configurability, is a step in the right direction to overcome the aforementioned shortcomings of the wireless networks. In this paper, we provide a broad overview of the architectures proposed in literature for building programmable wireless networks focusing primarily on three popular techniques, i.e., software defined networks, cognitive radio networks, and virtualized networks. This survey is a self-contained tutorial on these techniques and its applications. We also discuss the opportunities and challenges in building next-generation programmable wireless networks and identify open research issues and future research directions.Comment: 19 page

Auction-based Bandwidth Allocation Mechanisms for Wireless Future Internet

An important aspect of the Future Internet is the efficient utilization of (wireless) network resources. In order for the - demanding in terms of QoS - Future Internet services to be provided, the current trend is evolving towards an "integrated" wireless network access model that enables users to enjoy mobility, seamless access and high quality of service in an all-IP network on an "Anytime, Anywhere" basis. The term "integrated" is used to denote that the Future Internet wireless "last mile" is expected to comprise multiple heterogeneous geographically coexisting wireless networks, each having different capacity and coverage radius. The efficient management of the wireless access network resources is crucial due to their scarcity that renders wireless access a potential bottleneck for the provision of high quality services. In this paper we propose an auction mechanism for allocating the bandwidth of such a network so that efficiency is attained, i.e. social welfare is maximized. In particular, we propose an incentive-compatible, efficient auction-based mechanism of low computational complexity. We define a repeated game to address user utilities and incentives issues. Subsequently, we extend this mechanism so that it can also accommodate multicast sessions. We also analyze the computational complexity and message overhead of the proposed mechanism. We then show how user bids can be replaced from weights generated by the network and transform the auction to a cooperative mechanism capable of prioritizing certain classes of services and emulating DiffServ and time-of-day pricing schemes. The theoretical analysis is complemented by simulations that assess the proposed mechanisms properties and performance. We finally provide some concluding remarks and directions for future research

Common security issues and challenges in wireless sensor networks and IEEE 802.11 wireless mesh networks

Both Wireless Mesh Network (WMN) and Wireless Sensor Network (WSN) are multi-hop wireless networks. WMN is an emerging community based integrated broadband wireless network which ensures high bandwidth ubiquitous internet provision to users, while, WSN is application specific and ensures large scale real-time data processing in complex environment. Both these wireless networks have some common vulnerable features which may increase the chances of different sorts of security attacks. Wireless sensor nodes have computation, memory and power limitations, which do not allow for implementation of complex security mechanism. In this paper, we discuss the common limitations and vulnerable features of WMN and WSN, along with the associated security threats and possible countermeasures. We also propose security mechanisms keeping in view the architecture and limitations of both. This article will serve as a baseline guide for the new researchers who are concern with the security aspects of WMN and WSN

Speeding up Future Video Distribution via Channel-Aware Caching-Aided Coded Multicast

Future Internet usage will be dominated by the consumption of a rich variety of online multimedia services accessed from an exponentially growing number of multimedia capable mobile devices. As such, future Internet designs will be challenged to provide solutions that can deliver bandwidth-intensive, delay-sensitive, on-demand video-based services over increasingly crowded, bandwidth-limited wireless access networks. One of the main reasons for the bandwidth stress facing wireless network operators is the difficulty to exploit the multicast nature of the wireless medium when wireless users or access points rarely experience the same channel conditions or access the same content at the same time. In this paper, we present and analyze a novel wireless video delivery paradigm based on the combined use of channel-aware caching and coded multicasting that allows simultaneously serving multiple cache-enabled receivers that may be requesting different content and experiencing different channel conditions. To this end, we reformulate the caching-aided coded multicast problem as a joint source-channel coding problem and design an achievable scheme that preserves the cache-enabled multiplicative throughput gains of the error-free scenario,by guaranteeing per-receiver rates unaffected by the presence of receivers with worse channel conditions.Comment: 11 pages,6 figures,to appear in IEEE JSAC Special Issue on Video Distribution over Future Interne

Serially Concatenated Luby Transform Coding and Bit-Interleaved Coded Modulation Using Iterative Decoding for the Wireless Internet

In Bit-Interleaved Coded Modulation (BICM) the coding and modulation schemes were jointly optimized for the sake of attaining the best possible performance when communicating over fading wireless communication channels. The iterative decoding scheme of BICM (BICM-ID) invoking an appropriate bit-to-symbol mapping strategy enhances its achievable performance in both AWGN and Rayleigh channels. BICM-ID may be conveniently combined with Luby Transform (LT) codes, which were designed for handling packetized wireless Internet data traffic in erasure channels without retransmitting the corrupted packets. By jointly designing a serially concatenated LT-BICM-ID code, an infinitesimally low Bit Error Rate (BER) is achieved for Signal to Noise Ratios (SNR) in excess of 7.5dB over wireless Internet type erasure channels contaminated by AWGN