2,870 research outputs found
A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks
This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST),
Pakistan, and the Higher Education Commission, Pakistan
Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks
This paper introduces a new channel selection strategy for reliable
contentionaware data dissemination in multi-hop cognitive radio network. The
key challenge here is to select channels providing a good tradeoff between
connectivity and contention. In other words, channels with good opportunities
for communication due to (1) low primary radio nodes (PRs) activities, and (2)
limited contention of cognitive ratio nodes (CRs) acceding that channel, have
to be selected. Thus, by dynamically exploring residual resources on channels
and by monitoring the number of CRs on a particular channel, SURF allows
building a connected network with limited contention where reliable
communication can take place. Through simulations, we study the performance of
SURF when compared with three other related approaches. Simulation results
confirm that our approach is effective in selecting the best channels for
efficient and reliable multi-hop data dissemination
E2XLRADR (Energy Efficient Cross Layer Routing Algorithm with Dynamic Retransmission for Wireless Sensor Networks)
The main focus of this article is to achieve prolonged network lifetime with
overall energy efficiency in wireless sensor networks through controlled
utilization of limited energy. Major percentage of energy in wireless sensor
network is consumed during routing from source to destination, retransmission
of data on packet loss. For improvement, cross layered algorithm is proposed
for routing and retransmission scheme. Simulation and results shows that this
approach can save the overall energy consumptio
Energy Efficient and Reliable Wireless Sensor Networks - An Extension to IEEE 802.15.4e
Collecting sensor data in industrial environments from up to some tenth of
battery powered sensor nodes with sampling rates up to 100Hz requires energy
aware protocols, which avoid collisions and long listening phases. The IEEE
802.15.4 standard focuses on energy aware wireless sensor networks (WSNs) and
the Task Group 4e has published an amendment to fulfill up to 100 sensor value
transmissions per second per sensor node (Low Latency Deterministic Network
(LLDN) mode) to satisfy demands of factory automation. To improve the
reliability of the data collection in the star topology of the LLDN mode, we
propose a relay strategy, which can be performed within the LLDN schedule.
Furthermore we propose an extension of the star topology to collect data from
two-hop sensor nodes. The proposed Retransmission Mode enables power savings in
the sensor node of more than 33%, while reducing the packet loss by up to 50%.
To reach this performance, an optimum spatial distribution is necessary, which
is discussed in detail
Reliable routing scheme for indoor sensor networks
Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may create long hops routes, and the high quality paths will be frequently used. This leads to shorter lifetime of such paths; thereby the entire network's lifetime will be significantly minimized. This paper briefly presents a reliable load-balanced routing (RLBR) scheme for indoor ad hoc wireless sensor networks, which integrates routing information from different layers. The proposed scheme aims to redistribute the relaying workload and the energy usage among relay sensor nodes to achieve balanced energy dissipation; thereby maximizing the functional network lifetime. RLBR scheme was tested and benchmarked against the TinyOS-2.x implementation of MintRoute on an indoor testbed comprising 20 Mica2 motes and low power listening (LPL) link layer provided by CC1000 radio. RLBR scheme consumes less energy for communications while reducing topology repair latency and achieves better connectivity and communication reliability in terms of end-to-end packets delivery performance
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
- …