313 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
Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols
In this paper, we present a detailed framework consisting of modeling of
routing overhead generated by three widely used proactive routing protocols;
Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and
Optimized Link State Routing (OLSR). The questions like, how these protocols
differ from each other on the basis of implementing different routing
strategies, how neighbor estimation errors affect broadcast of route requests,
how reduction of broadcast overhead achieves bandwidth, how to cope with the
problem of mobility and density, etc, are attempted to respond. In all of the
above mentioned situations, routing overhead and delay generated by the chosen
protocols can exactly be calculated from our modeled equations. Finally, we
analyze the performance of selected routing protocols using our proposed
framework in NS-2 by considering different performance parameters; Route
REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized
Routing Load (NRL) with respect to varying rates of mobility and density of
nodes in the underlying wireless network
SIMPLE: Stable Increased-throughput Multi-hop Protocol for Link Efficiency in Wireless Body Area Networks
In this work, we propose a reliable, power efficient and high throughput
routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop
topology to achieve minimum energy consumption and longer network lifetime. We
propose a cost function to select parent node or forwarder. Proposed cost
function selects a parent node which has high residual energy and minimum
distance to sink. Residual energy parameter balances the energy consumption
among the sensor nodes while distance parameter ensures successful packet
delivery to sink. Simulation results show that our proposed protocol maximize
the network stability period and nodes stay alive for longer period. Longer
stability period contributes high packet delivery to sink which is major
interest for continuous patient monitoring.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Hop-by-hop routing in wireless mesh networks with bandwidth guarantees
Wireless Mesh Network (WMN) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-of-service in WMNs. Due to interference among links, bandwidth, a well-known bottleneck metric in wired networks, is neither concave nor additive in wireless networks. We propose a new path weight which captures the available path bandwidth information. We formally prove that our hop-by-hop routing protocol based on the new path weight satisfies the consistency and loop-freeness requirements. The consistency property guarantees that each node makes a proper packet forwarding decision, so that a data packet does traverse over the intended path. Our extensive simulation experiments also show that our proposed path weight outperforms existing path metrics in identifying high-throughput paths. © 2012 IEEE.published_or_final_versio
- …