10,782 research outputs found
Identifying Design Requirements for Wireless Routing Link Metrics
In this paper, we identify and analyze the requirements to design a new
routing link metric for wireless multihop networks. Considering these
requirements, when a link metric is proposed, then both the design and
implementation of the link metric with a routing protocol become easy.
Secondly, the underlying network issues can easily be tackled. Thirdly, an
appreciable performance of the network is guaranteed. Along with the existing
implementation of three link metrics Expected Transmission Count (ETX), Minimum
Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with
Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show
that how the computational burden of a metric degrades the performance of the
respective protocol and how a metric has to trade-off between different
performance parameters
On using Multiple Quality Link Metrics with Destination Sequenced Distance Vector Protocol for Wireless Multi-Hop Networks
In this paper, we compare and analyze performance of five quality link
metrics forWireless Multi-hop Networks (WMhNs). The metrics are based on loss
probability measurements; ETX, ETT, InvETX, ML and MD, in a distance vector
routing protocol; DSDV. Among these selected metrics, we have implemented ML,
MD, InvETX and ETT in DSDV which are previously implemented with different
protocols; ML, MD, InvETX are implemented with OLSR, while ETT is implemented
in MR-LQSR. For our comparison, we have selected Throughput, Normalized Routing
Load (NRL) and End-to-End Delay (E2ED) as performance parameters. Finally, we
deduce that InvETX due to low computational burden and link asymmetry
measurement outperforms among all metrics
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
- …