Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks

Multi-channel multi-interface Wireless Mesh Networks permit to spread the load across orthogonal channels to improve network capacity. Although broadcast is vital for many layer-3 protocols, proposals for taking advantage of multiple channels mostly focus on unicast transmissions. In this paper, we propose broadcast algorithms that fit any channel and interface assignment strategy. They guarantee that a broadcast packet is delivered with a minimum probability to all neighbors. Our simulations show that the proposed algorithms efficiently limit the overhead

Cross-Layer Optimization in OFDM Wireless Communication Network

The wide use of OFDM systems in multiuser environments to overcome problem of communication over the wireless channel has gained prominence in recent years. Cross-layer Optimization technique is aimed to further improve the efficiency of this network. This chapter demonstrates that significant improvements in data traffic parameters can be achieved by applying cross-layer optimization tech- niques to packet switched wireless networks. This work compares the system capacity, delay time and data throughput of QoS traffic in a multiuser OFDM system using two algorithms. The first algorithm, Maximum Weighted Capacity, uses a cross-layer design to share resources and schedule traffic to users on the network, while the other algorithm (Maximum Capacity) simply allocates resources based only on the users channel quality. The results of the research shows that the delay time and data throughput of the Maximum Weighted Capacity algorithm in cross layer OFDM system is much better than that of the Maximum Capacity in simply based users channel quality system. The cost incurred for this gain is the increased complexity of the Maximum Weighted Capacity scheme

Optimal transport on wireless networks

We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on wireless networks. Our algorithm iteratively balances network traffic by minimizing the maximum node betweenness on the network. The variant we consider specifically accounts for the broadcast restrictions imposed by wireless communication by using a different betweenness measure. We compare the performance of our algorithm to two other known algorithms and find that our algorithm achieves the highest transport capacity both for minimum node degree geometric networks, which are directed geometric networks that model wireless communication networks, and for configuration model networks that are uncorrelated scale-free networks.Comment: 5 pages, 4 figure

Scheduling algorithms in broadband wireless networks

Scheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development of broadband wireless networks. Wireless communication poses special problems that do not exist in wireline networks, such as time-varying channel capacity and location-dependent errors. Although many mature scheduling algorithms are available for wireline networks, they are not directly applicable in wireless networks because of these special problems. This paper provides a comprehensive and in-depth survey on recent research in wireless scheduling. The problems and difficulties in wireless scheduling are discussed. Various representative algorithms are examined. Their themes of thoughts and pros and cons are compared and analyzed. At the end of the paper, some open questions and future research directions are addressed.published_or_final_versio