Modified Greedy Physical Link Scheduling Algorithm for Improving Wireless Mesh Network Performance

The algorithm to allocate mesh active link to radio resource timeslot in wireless mesh network (WMN) is investigated. This paper proposes the novel method to allocate multiple links in one timeslot for improving the wireless mesh network throughput via spatial time division multiple access (STDMA) protocol. The throughput improvement is obtained by modifying greedy based algorithm that is widely known as a low complexity algorithm. We propose and investigate new parameters in the greedy based algorithm that can be used as scheduling control parameters, i.e. interference weight, scheduling weight, and the sum of link’s degree. Simulation results indicate that this approximation increases network performance in throughput and length of scheduling performance closed to the upper bound performance that is achieved by the algorithm that uses the physical interference model.

On Wireless Scheduling Using the Mean Power Assignment

In this paper the problem of scheduling with power control in wireless networks is studied: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done in a minimum time, taking into account the signal interference of concurrently transmitting nodes. The signal interference is modeled by SINR constraints. Approximation algorithms are given for this problem, which use the mean power assignment. The problem of schduling with fixed mean power assignment is also considered, and approximation guarantees are proven

Joint Link Scheduling and Routing for Load Balancing in STDMA Wireless Mesh Networks

In wireless mesh networks, it is known to be effective to use a TDMA based MAC than a contention-based CSMA. In addition, if spatial TDMA is used, network performance can be improved further because of its spatial reuse effect. However this scheme still has a disadvantage in the system performance aspect without a load-balanced routing because the resource of links that are not used is wasted and frequently used links are out of resources. That is, the number of available flows in network is limited because load balancing is not performed. In this paper, we propose joint link scheduling and routing through a cross-layer scheme. For this, we propose a load balancing routing method to maximize available resources under the given traffic pattern and scheduling method for maximizing link utilization on the given route. These two methods are iterated until an optimized solution can be obtained. The proposed algorithm can be formulated using a mathematical LP problem and we show that it is very effective for load balancing compared to simple adoption of IEEE 802.11s which is a standard TDMA protocol in wireless mesh network. If the proposed algorithm is applied to initial design solution such as Smart Grid, the number of available flows can be increased and the load on each link can be balanced

Wireless Scheduling with Power Control

We consider the scheduling of arbitrary wireless links in the physical model of interference to minimize the time for satisfying all requests. We study here the combined problem of scheduling and power control, where we seek both an assignment of power settings and a partition of the links so that each set satisfies the signal-to-interference-plus-noise (SINR) constraints. We give an algorithm that attains an approximation ratio of $O(\log n \cdot \log\log \Delta)$, where $n$ is the number of links and $\Delta$ is the ratio between the longest and the shortest link length. Under the natural assumption that lengths are represented in binary, this gives the first approximation ratio that is polylogarithmic in the size of the input. The algorithm has the desirable property of using an oblivious power assignment, where the power assigned to a sender depends only on the length of the link. We give evidence that this dependence on $\Delta$ is unavoidable, showing that any reasonably-behaving oblivious power assignment results in a $\Omega(\log\log \Delta)$-approximation. These results hold also for the (weighted) capacity problem of finding a maximum (weighted) subset of links that can be scheduled in a single time slot. In addition, we obtain improved approximation for a bidirectional variant of the scheduling problem, give partial answers to questions about the utility of graphs for modeling physical interference, and generalize the setting from the standard 2-dimensional Euclidean plane to doubling metrics. Finally, we explore the utility of graph models in capturing wireless interference.Comment: Revised full versio

Centralized Control for Dynamic Channel Allocation in IEEE 802.15.4 Based Wireless Sensor Networks

Coexistence problem is one of the most important issues in the IEEE 802.15.4 based Wireless Sensor Networks (WSNs), since the system operates on the highly populated 2.4 GHz ISM band. As a result, system performance of WSNs can be greatly impaired by the interference from over powering signal from other systems such as WLAN and Bluetooth. This paper proposes an approach based on centralized control for dynamic channel allocation. The proposed method offers multi-channel utilization with intelligent controlling mechanism in order to provide system performance enhancement in order to cope with variation of interfered environment. Based on centralized control, decision making process is performed by the network coordinator allowing such system flexibility. Simulation model has been developed and it is embedded with this proposed mechanism in order to test the system performance. To observe the system performance under the proposed method, variety of simulation scenarios are performed with the variation of two major factors affecting system performance including the size of the network topology and the scale of interference. Proposed method is evaluated and the simulation results are compared against tradition system as well as system with multi-channel utilization method with channel scheduling. The flexibility of the method proposed here allows the system to have better system performance under different test scenarios both in terms of average packet end-to-end delay and system throughput

Evaluation of the Accuracy of a Bounded Physical Interference Model for Multi-Hop Wireless Networks

In this paper, we consider the accuracy of bounded physical interference models for use in multi-hop wireless networks. In these models, physical interference is accounted for but only for a subset of nodes around each receiver, and interference from farther transmitters is ignored. These models are very often used, both in theoretical analyses and simulations, with an "interference range" that defines the distance from a receiver beyond which interference is ignored. In this paper, we prove that, if the interference range is chosen as any unbounded increasing function of the number of nodes in the network, the total ignored interference converges to zero as the number of nodes approaches infinity. This result is proven under both constant node density and uniform random node distribution assumptions. We also prove that, if the interference range is considered to be a constant, e.g. a multiple of the transmission range, the total ignored interference does not converge to zero and, in fact, can be several orders of magnitude greater than the noise for networks of moderate size. The theoretical results are enhanced by simulations, which evaluate the bounded models relative to the true physical interference model and demonstrate, empirically, that slowly increasing interference ranges are necessary and sufficient to achieve good accuracy. Our results also demonstrate that a scheduling algorithm that considers a fixed interference range will produce schedules with a very high percentage of failing transmissions, which would have substantial negative impacts on performance and fairness in such networks

The SCREAM Approach for Efficient Distributed Scheduling with Physical Interference in Wireless Mesh Networks

It is known that CSMA/CA channel access schemes are not suitable to meet the high traffic demand of wireless mesh networks. One possible way to increase traffic carrying capacity is to use a spatial TDMA (STDMA) approach in conjunction with the physical interference model, which allows more aggressive scheduling than the protocol interference model on which CSMA/CA is based. However, a major difficulty in using STDMA with physical interference is the inherent complexity of this interference model. While an efficient, centralized solution for STDMA with physical interference has been recently proposed, no satisfactory distributed approaches have been introduced so far. In this paper, we first prove that no localized distributed algorithm can solve the problem of building a feasible schedule under the physical interference model. Motivated by this, we design a global primitive, called SCREAM, which is used to verify the feasibility of a schedule during an iterative distributed scheduling procedure. Based on this primitive, we present two distributed protocols for efficient, distributed scheduling under the physical interference model, and we prove an approximation bound for one of the protocols. We also present extensive packet-level simulation results, which show that our protocols achieve schedule lengths very close to those of the centralized algorithm and have running times that are practical for mesh networks