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

Cross Layer Aware Adaptive MAC based on Knowledge Based Reasoning for Cognitive Radio Computer Networks

In this paper we are proposing a new concept in MAC layer protocol design for Cognitive radio by combining information held by physical layer and MAC layer with analytical engine based on knowledge based reasoning approach. In the proposed system a cross layer information regarding signal to interference and noise ratio (SINR) and received power are analyzed with help of knowledge based reasoning system to determine minimum power to transmit and size of contention window, to minimize backoff, collision, save power and drop packets. The performance analysis of the proposed protocol indicates improvement in power saving, lowering backoff and significant decrease in number of drop packets. The simulation environment was implement using OMNET++ discrete simulation tool with Mobilty framework and MiXiM simulation library.Comment: 8 page

Understanding the Paradoxical Effects of Power Control on the Capacity of Wireless Networks

Recent works show conflicting results: network capacity may increase or decrease with higher transmission power under different scenarios. In this work, we want to understand this paradox. Specifically, we address the following questions: (1)Theoretically, should we increase or decrease transmission power to maximize network capacity? (2) Theoretically, how much network capacity gain can we achieve by power control? (3) Under realistic situations, how do power control, link scheduling and routing interact with each other? Under which scenarios can we expect a large capacity gain by using higher transmission power? To answer these questions, firstly, we prove that the optimal network capacity is a non-decreasing function of transmission power. Secondly, we prove that the optimal network capacity can be increased unlimitedly by higher transmission power in some network configurations. However, when nodes are distributed uniformly, the gain of optimal network capacity by higher transmission power is upper-bounded by a positive constant. Thirdly, we discuss why network capacity in practice may increase or decrease with higher transmission power under different scenarios using carrier sensing and the minimum hop-count routing. Extensive simulations are carried out to verify our analysis.Comment: I refined the previous version in many places, including the title. to appear in IEEE Transactions on Wireless Communication

Characterization of the fundamental properties of wireless CSMA multi-hop networks

A wireless multi-hop network consists of a group of decentralized and self-organized wireless devices that collaborate to complete their tasks in a distributed way. Data packets are forwarded collaboratively hop-by-hop from source nodes to their respective destination nodes with other nodes acting as intermediate relays. Existing and future applications in wireless multi-hop networks will greatly benefit from better understanding of the fundamental properties of such networks. In this thesis we explore two fundamental properties of distributed wireless CSMA multi-hop networks, connectivity and capacity. A network is connected if and only if there is at least one (multi-hop) path between any pair of nodes. We investigate the critical transmission power for asymptotic connectivity in large wireless CSMA multi-hop networks under the SINR model. The critical transmission power is the minimum transmission power each node needs to transmit to guarantee that the resulting network is connected aas. Both upper bound and lower bound of the critical transmission power are obtained analytically. The two bounds are tight and differ by a constant factor only. Next we shift focus to the capacity property. First, we develop a distributed routing algorithm where each node makes routing decisions based on local information only. This is compatible with the distributed nature of large wireless CSMA multi-hop networks. Second, we show that by carefully choosing controllable parameters of the CSMA protocols, together with the routing algorithm, a distributed CSMA network can achieve the order-optimal throughput scaling law. Scaling laws are only up to order and most network design choices have a significant effect on the constants preceding the order while not affecting the scaling law. Therefore we further to analyze the pre-constant by giving an upper and a lower bound of throughput. The tightness of the bounds is validated using simulations

Local heuristic for the refinement of multi-path routing in wireless mesh networks

We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR, as well as their multi-path variants, as underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern