1,154 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
Power aware routing algorithms (PARA) in wireless mesh networks for emergency management
Wireless Mesh Networks (WMNs) integrate the advantages of WLANs and mobile Ad Hoc networks, which have become the key techniques of next-generation wireless networks in the context of emergency recovery. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with instant deployment, self-healing, self-organization and self-configuration features. These capabilities make WMNs a promising technology for incident and emergency communication. An incident area network (IAN) needs a reliable and lively routing path during disaster recovery and emergency response operations when infrastructure-based communications and power resources have been destroyed and no routes are available. Power aware routing plays a significant role in WMNs, in order to provide continuous efficient emergency services. The existing power aware routing algorithms used in wireless networks cannot fully fit the characteristics of WMNs, to be used for emergency recovery. This paper proposes a power aware routing algorithm (PARA) for WMNs, which selects optimal paths to send packets, mainly based on the power level of next node along the path. This algorithm was implemented and tested in a proven simulator. The analytic results show that the proposed power node-type aware routing algorithm metric can clearly improve the network performance by reducing the network overheads and maintaining a high delivery ratio with low latency
Rare: Resource Aware Routing for mEsh
An important element of any routing protocol used for Wireless Mesh Networks (WMNs) is the link cost function used to represent the radio link characteristic. The majority of the routing protocols for WMNs attempt to accurately characterise the radio link quality by constructing the link cost function from the measurements obtained using active probing techniques, which introduces overhead. In this paper we propose a new approach called Resource Aware Routing for mEsh (RARE) which instead employs passive monitoring to gather radio link information. This results in a smaller overhead than the other methods that require active network probing, and is load independent since it does not require an access to the medium. Moreover, se show that our RARE approach performs well in a real radio environment through a number of experiments performed on a static 17 node WLAN mesh testbed
- …