11,363 research outputs found
AN APPROACH FOR FAULT DETECTION AND FAULT MANAGEMENT IN THE WIRELESS SENSOR NETWORK TO EXTEND NETWORK LIFETIME
A mobile wireless ad hoc sensor network (MANET) consists of a group of homogeneous or heterogeneous mobile communicating hosts that form an arbitrary network interconnected via by means of several wireless communication media without any fixed infrastructure. In such network the delivery of the data packet from source to destination may fail for various reasons and major due to failure-prone environment of networks. This may happens due to the topology changes, node failure due to battery exhaust, failure of the communication module in the wireless node and results in the link failure. This paper addressed the major problem of link failure in the WSN and with the aim of providing robust solution so as to satisfy the stern end-to-end requirements of QoS-based communication networks. In this paper we modifies existing fully distributed cluster-based routing algorithm by addressing local recovery for the link failure. Performance of this new fault-tolerant fully distributed cluster-based routing algorithm is evaluated by simulating it in NS2 environment and we show that it performs better than the existing algorithm and provide better solution for fault detection and fault management along the QoS paths
AN APPROACH FOR FAULT DETECTION AND FAULT MANAGEMENT IN THE WIRELESS SENSOR NETWORK TO EXTEND NETWORK LIFETIME
A mobile wireless ad hoc sensor network (MANET) consists of a group of homogeneous or heterogeneous mobile communicating hosts that form an arbitrary network interconnected via by means of several wireless communication media without any fixed infrastructure. In such network the delivery of the data packet from source to destination may fail for various reasons and major due to failure-prone environment of networks. This may happens due to the topology changes, node failure due to battery exhaust, failure of the communication module in the wireless node and results in the link failure. This paper addressed the major problem of link failure in the WSN and with the aim of providing robust solution so as to satisfy the stern end-to-end requirements of QoS-based communication networks. In this paper we modifies existing fully distributed cluster-based routing algorithm by addressing local recovery for the link failure. Performance of this new fault-tolerant fully distributed cluster-based routing algorithm is evaluated by simulating it in NS2 environment and we show that it performs better than the existing algorithm and provide better solution for fault detection and fault management along the QoS paths
QoS routing in ad-hoc networks using GA and multi-objective optimization
Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version
Recommended from our members
Performance improvement for mobile ad hoc cognitive packets network
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonIn this thesis, focusing on the quality of service (QoS) improvement using per-packet power control
algorithm in Ad Hoc Cognitive Packet Networks (AHCPN). A power control mechanism creates as a
network-assisted function of ad hoc cognitive packet-based routing and aims at reducing both energy
consumption in nodes and QoS requirements. The suggested models facilitate transmission power
adjustments while also taking into account the effects on network performance.
The thesis concentrate on three main contributions. Firstly, a power control algorithm, namely the
adaptive Distributed Power management algorithm (DISPOW) was adopted. Performance of DISPOW
was compared to existing mechanisms and the results showed 27, 13, 9, and 40 percent improvements
in terms of Delay, Throughput, Packet Loss, and Energy Consumption respectively.
Secondly, the DISPOW algorithm was enhanced, namely a Link Expiration Time Aware Distributed
Power management algorithm (LETPOW). This approach periodically checks connectivity, transmission
power, interference level, routing overhead and Node Mobility in AHCPN. The results show
that LETPOW algorithm improves the performance of system. Results show further improvement
from DISPOW by 30,25,30,42 percent in terms of delay, packet loss ratio , path lengths and energy
consumption respectively.
Finally,Hybrid Power Control Algorithm (HLPCA) has presented is a combination of Link Expiration
Time Aware Distributed Power management algorithm (LETPOW) and Load Power Control
Algorithm (LOADPOW); deal with cross-layer power control applied for transmitting information
across the various intermediate layers. LOADPOW emphasis on the concept of transmission Power,
Received Signal Strength Indication (RSSI), and the suitable distance between the receiver and the
sender. The proposed algorithm outperforms DISPOW and LETPOW by 31,15,35,34,44 percent in
terms of Delay, Throughput, Packet Loss,path length and Energy Consumption respectively. From
this work, it can be concluded that optimized power control algorithm applied to Ad-hoc cognitive
packet network results in significant improvement in terms of energy consumption and QoS
Study on QoS support in 802.11e-based multi-hop vehicular wireless ad hoc networks
Multimedia communications over vehicular ad hoc networks (VANET) will play an important role in the future intelligent transport system (ITS). QoS support for VANET therefore becomes an essential problem. In this paper, we first study the QoS performance in multi-hop VANET by using the standard IEEE 802.11e EDCA MAC and our proposed triple-constraint QoS routing protocol, Delay-Reliability-Hop (DeReHQ). In particular, we evaluate the DeReHQ protocol together with EDCA in highway and urban areas. Simulation results show that end-to-end delay performance can sometimes be achieved when both 802.11e EDCA and DeReHQ extended AODV are used. However, further studies on cross-layer optimization for QoS support in multi-hop environment are required
Secure and robust multi-constrained QoS aware routing algorithm for VANETs
Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In Vehicular Ad hoc Networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the Ant Colony Optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented Evolving Graph (VoEG) model to perform plausibility checks on the exchanged routing control messages among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service
Cross-layer design of multi-hop wireless networks
MULTI -hop wireless networks are usually defined as a collection of nodes
equipped with radio transmitters, which not only have the capability to
communicate each other in a multi-hop fashion, but also to route each others’ data
packets. The distributed nature of such networks makes them suitable for a variety of
applications where there are no assumed reliable central entities, or controllers, and
may significantly improve the scalability issues of conventional single-hop wireless
networks.
This Ph.D. dissertation mainly investigates two aspects of the research issues
related to the efficient multi-hop wireless networks design, namely: (a) network
protocols and (b) network management, both in cross-layer design paradigms to
ensure the notion of service quality, such as quality of service (QoS) in wireless mesh
networks (WMNs) for backhaul applications and quality of information (QoI) in
wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of
this Ph.D. dissertation, different network settings are used as illustrative examples,
however the proposed algorithms, methodologies, protocols, and models are not
restricted in the considered networks, but rather have wide applicability.
First, this dissertation proposes a cross-layer design framework integrating
a distributed proportional-fair scheduler and a QoS routing algorithm, while using
WMNs as an illustrative example. The proposed approach has significant performance
gain compared with other network protocols. Second, this dissertation proposes
a generic admission control methodology for any packet network, wired and
wireless, by modeling the network as a black box, and using a generic mathematical
0. Abstract 3
function and Taylor expansion to capture the admission impact. Third, this dissertation
further enhances the previous designs by proposing a negotiation process,
to bridge the applications’ service quality demands and the resource management,
while using WSNs as an illustrative example. This approach allows the negotiation
among different service classes and WSN resource allocations to reach the optimal
operational status. Finally, the guarantees of the service quality are extended to
the environment of multiple, disconnected, mobile subnetworks, where the question
of how to maintain communications using dynamically controlled, unmanned data
ferries is investigated
A new QoS routing algorithm based on self-organizing maps for wireless sensor networks
For the past ten years, many authors have focused
their investigations in wireless sensor networks. Different
researching issues have been extensively developed: power
consumption, MAC protocols, self-organizing network algorithms,
data-aggregation schemes, routing protocols, QoS
management, etc. Due to the constraints on data processing
and power consumption, the use of artificial intelligence
has been historically discarded. However, in some special
scenarios the features of neural networks are appropriate to
develop complex tasks such as path discovery. In this paper,
we explore and compare the performance of two very well
known routing paradigms, directed diffusion and Energy-
Aware Routing, with our routing algorithm, named SIR,
which has the novelty of being based on the introduction of
neural networks in every sensor node. Extensive simulations
over our wireless sensor network simulator, OLIMPO, have
been carried out to study the efficiency of the introduction
of neural networks. A comparison of the results obtained
with every routing protocol is analyzed. This paper attempts
to encourage the use of artificial intelligence techniques in
wireless sensor nodes
- …