536 research outputs found
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
Survey on Data-Centric based Routing Protocols for Wireless Sensor Networks
The great concern for energy that grew with the technological advances in the
field of networks and especially in sensor network has triggered various
approaches and protocols that relate to sensor networks. In this context, the
routing protocols were of great interest. The aim of the present paper is to
discuss routing protocols for sensor networks. This paper will focus mainly on
the discussion of the data-centric approach (COUGAR, rumor, SPIN, flooding and
Gossiping), while shedding light on the other approaches occasionally. The
functions of the nodes will be discussed as well. The methodology selected for
this paper is based on a close description and discussion of the protocol. As a
conclusion, open research questions and limitations are proposed to the reader
at the end of this paper
Energy aware routing scheme for mobile ad hoc network using variable range transmission
This paper discusses a new energy aware routing scheme which uses variable
transmission range. The protocol has been incorporated along with the route
discovery procedure of AODV as a case study. Both the protocols are simulated
using Network Simulator and comparisons are made to analyze their performance
based on energy consumption, network lifetime and number of alive nodes metrics
for different network scenarios. The results show that EAR makes effective node
energy utilization.Comment: 11 page
An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications
Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes
or terminals with wireless communications and networking capability that
communicate with each other without the aid of any centralized administrator
also the wireless nodes that can dynamically form a network to exchange
information without using any existing fixed network infrastructure. And it's
an autonomous system in which mobile hosts connected by wireless links are free
to be dynamically and some time act as routers at the same time, and we discuss
in this paper the distinct characteristics of traditional wired networks,
including network configuration may change at any time, there is no direction
or limit the movement and so on, and thus needed a new optional path Agreement
(Routing Protocol) to identify nodes for these actions communicate with each
other path, An ideal choice way the agreement should not only be able to find
the right path, and the Ad Hoc Network must be able to adapt to changing
network of this type at any time. and we talk in details in this paper all the
information of Mobile Ad Hoc Network which include the History of ad hoc,
wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc
networks, and then we present more than 13 types of the routing Ad Hoc Networks
protocols have been proposed. In this paper, the more representative of routing
protocols, analysis of individual characteristics and advantages and
disadvantages to collate and compare, and present the all applications or the
Possible Service of Ad Hoc Networks.Comment: 24 Pages, JGraph-Hoc Journa
A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds
Motivated by the benefits of small world networks, we propose a
self-organization framework for wireless ad hoc networks. We investigate the
use of directional beamforming for creating long-range short cuts between
nodes. Using simulation results for randomized beamforming as a guideline, we
identify crucial design issues for algorithm design. Our results show that,
while significant path length reduction is achievable, this is accompanied by
the problem of asymmetric paths between nodes. Subsequently, we propose a
distributed algorithm for small world creation that achieves path length
reduction while maintaining connectivity. We define a new centrality measure
that estimates the structural importance of nodes based on traffic flow in the
network, which is used to identify the optimum nodes for beamforming. We show,
using simulations, that this leads to significant reduction in path length
while maintaining connectivity.Comment: Submitted to IEEE Transactions on Vehicular Technolog
Improving the Performance of Multi-Hop Wireless Networks by Selective Transmission Power Control
In a multi-hop wireless network, connectivity is determined by the link that is established by the receiving signal strength computed by subtracting the path loss from the transmission power. Two path loss models are commonly used in research namely two-ray ground and shadow fading, which determine the receiving signal strength and affect the link quality. Link quality is one of the key factors that affect network performance. In general, network performance improves with better link quality in a wireless network. In this study, we measure the connectivity and performance in a shadow fading path loss model, and our observations shows that both are severely degraded in this path loss model. To improve network performance, we propose power control schemes utilizing link quality to identify the set of nodes required to adjust the transmission power in order to improve the network throughput in both homogeneous and heterogeneous multi-hop wireless networks. Numerical studies to evaluate the proposed schemes are presented and compared.\ud
\ud
\ud
\ud
\ud
\u
Distributed optimal congestion control and channel assignment in wireless mesh networks
Wireless mesh networks have numerous advantages in terms of connectivity as well as reliability. Traditionally the nodes in wireless mesh networks are equipped with single radio, but the limitations are lower throughput and limited use of the available wireless channel. In order to overcome this, the recent advances in wireless mesh networks are based on multi-channel multi-radio approach. Channel assignment is a technique that selects the best channel for a node or to the entire network just to increase the network capacity. To maximize the throughput and the capacity of the network, multiple channels with multiple radios were introduced in these networks. In the proposed system, algorithms are developed to improve throughput, minimise delay, reduce average energy consumption and increase the residual energy for multi radio multi-channel wireless mesh networks. In literature, the existing channel assignment algorithms fail to consider both interflow and intra flow interferences. The limitations are inaccurate bandwidth estimation, throughput degradation under heavy traffic and unwanted energy consumption during low traffic and increase in delay. In order to improve the performance of the network distributed optimal congestion control and channel assignment algorithm (DOCCA) is proposed. In this algorithm, if congestion is identified, the information is given to previous node. According to the congestion level, the node adjusts itself to minimise congestion
- …