15,460 research outputs found
Routing and Broadcast Development for Minimizing Transmission Interruption in Multi rate Wireless Mesh Networks using Directional Antennas
Using directional antennas to reduce interference and improve throughput in multi hop wireless networks has attracted much attention from the research community in recent years. In this paper, we consider the issue of minimum delay broadcast in multi rate wireless mesh networks using directional antennas. We are given a set of mesh routers equipped with directional antennas, one of which is the gateway node and the source of the broadcast. Our objective is to minimize the total transmission delay for all the other nodes to receive a broadcast packet from the source, by determining the set of relay nodes and computing the number and orientations of beams formed by each relay node. We propose a heuristic solution with two steps. Firstly, we construct a broadcast routing tree by defining a new routing metric to select the relay nodes and compute the optimal antenna beams for each relay node. Then, we use a greedy method to make scheduling of concurrent transmissions without causing beam interference. Extensive simulations have demonstrated that our proposed method can reduce the broadcast delay significantly compared with the methods using omnidirectional antennas and single-rate transmission. In addition, the results also show that our method performs better than the method with fixed antenna beams. Keywords: Multihop, Wireless, Mesh, Omnidirectional
Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting
In a multihop wireless network, it is crucial but challenging to schedule
transmissions in an efficient and fair manner. In this paper, a novel
distributed node scheduling algorithm, called Local Voting, is proposed. This
algorithm tries to semi-equalize the load (defined as the ratio of the queue
length over the number of allocated slots) through slot reallocation based on
local information exchange. The algorithm stems from the finding that the
shortest delivery time or delay is obtained when the load is semi-equalized
throughout the network. In addition, we prove that, with Local Voting, the
network system converges asymptotically towards the optimal scheduling.
Moreover, through extensive simulations, the performance of Local Voting is
further investigated in comparison with several representative scheduling
algorithms from the literature. Simulation results show that the proposed
algorithm achieves better performance than the other distributed algorithms in
terms of average delay, maximum delay, and fairness. Despite being distributed,
the performance of Local Voting is also found to be very close to a centralized
algorithm that is deemed to have the optimal performance
A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wireless Access Systems
This paper proposes a fair and efficient QoS scheduling scheme for IEEE
802.16 BWA systems that satisfies both throughput and delay guarantee to
various real and non-real time applications. The proposed QoS scheduling scheme
is compared with an existing QoS scheduling scheme proposed in literature in
recent past. Simulation results show that the proposed scheduling scheme can
provide a tight QoS guarantee in terms of delay, delay violation rate and
throughput for all types of traffic as defined in the WiMAX standard, thereby
maintaining the fairness and helps to eliminate starvation of lower priority
class services. Bandwidth utilization of the system and fairness index of the
resources are also encountered to validate the QoS provided by our proposed
scheduling scheme
- …