356 research outputs found
A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks
Flooding is an essential and critical service in computer networks that is
used by many routing protocols to send packets from a source to all nodes in
the network. As the packets are forwarded once by each receiving node, many
copies of the same packet traverse the network which leads to high redundancy
and unnecessary usage of the sparse capacity of the transmission medium.
Gossip routing is a well-known approach to improve the flooding in wireless
multi-hop networks. Each node has a forwarding probability p that is either
statically per-configured or determined by information that is available at
runtime, e.g, the node degree. When a packet is received, the node selects a
random number r. If the number r is below p, the packet is forwarded and
otherwise, in the most simple gossip routing protocol, dropped. With this
approach the redundancy can be reduced while at the same time the reachability
is preserved if the value of the parameter p (and others) is chosen with
consideration of the network topology. This technical report gives an overview
of the relevant publications in the research domain of gossip routing and
gives an insight in the improvements that can be achieved. We discuss the
simulation setups and results of gossip routing protocols as well as further
improved flooding schemes. The three most important metrics in this
application domain are elaborated: reachability, redundancy, and management
overhead. The published studies used simulation environments for their
research and thus the assumptions, models, and parameters of the simulations
are discussed and the feasibility of an application for real world wireless
networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the
focus of this survey but publications about other network types and
technologies are also included. As percolation theory, epidemiological models,
and delay tolerant networks are often referred as foundation, inspiration, or
application of gossip routing in wireless networks, a brief introduction to
each research domain is included and the applicability of the particular
models for the gossip routing is discussed
EDDA: An Efficient Distributed Data Replication Algorithm in VANETs
Efficient data dissemination in vehicular ad hoc networks (VANETs) is a challenging issue due to the dynamic nature of the network. To improve the performance of data dissemination, we study distributed data replication algorithms in VANETs for exchanging information and computing in an arbitrarily-connected network of vehicle nodes. To achieve low dissemination delay and improve the network performance, we control the number of message copies that can be disseminated in the network and then propose an efficient distributed data replication algorithm (EDDA). The key idea is to let the data carrier distribute the data dissemination tasks to multiple nodes to speed up the dissemination process. We calculate the number of communication stages for the network to enter into a balanced status and show that the proposed distributed algorithm can converge to a consensus in a small number of communication stages. Most of the theoretical results described in this paper are to study the complexity of network convergence. The lower bound and upper bound are also provided in the analysis of the algorithm. Simulation results show that the proposed EDDA can efficiently disseminate messages to vehicles in a specific area with low dissemination delay and system overhead
Bio-Inspired Tools for a Distributed Wireless Sensor Network Operating System
The problem which I address in this thesis is to find a way to organise and manage a network
of wireless sensor nodes using a minimal amount of communication. To find a solution I explore
the use of Bio-inspired protocols to enable WSN management while maintaining a low
communication overhead. Wireless Sensor Networks (WSNs) are loosely coupled distributed
systems comprised of low-resource, battery powered sensor nodes. The largest problem with
WSN management is that communication is the largest consumer of a sensor node’s energy.
WSN management systems need to use as little communication as possible to prolong their operational
lifetimes. This is the Wireless Sensor Network Management Problem. This problem
is compounded because current WSN management systems glue together unrelated protocols
to provide system services causing inter-protocol interference. Bio-inspired protocols provide a
good solution because they enable the nodes to self-organise, use local area communication, and
can combine their communication in an intelligent way with minimal increase in communication.
I present a combined protocol and MAC scheduler to enable multiple service protocols to
function in a WSN at the same time without causing inter-protocol interference. The scheduler
is throughput optimal as long as the communication requirements of all of the protocols remain
within the communication capacity of the network. I show that the scheduler improves a dissemination
protocol’s performance by 35%. A bio-inspired synchronisation service is presented
which enables wireless sensor nodes to self organise and provide a time service. Evaluation of
the protocol shows an 80% saving in communication over similar bio-inspired synchronisation
approaches. I then add an information dissemination protocol, without significantly increasing
communication. This is achieved through the ability of our bio-inspired algorithms to combine
their communication in an intelligent way so that they are able to offer multiple services
without requiring a great deal of inter-node communication.Open Acces
Concepts and evolution of research in the field of wireless sensor networks
The field of Wireless Sensor Networks (WSNs) is experiencing a resurgence of
interest and a continuous evolution in the scientific and industrial community.
The use of this particular type of ad hoc network is becoming increasingly
important in many contexts, regardless of geographical position and so,
according to a set of possible application. WSNs offer interesting low cost and
easily deployable solutions to perform a remote real time monitoring, target
tracking and recognition of physical phenomenon. The uses of these sensors
organized into a network continue to reveal a set of research questions
according to particularities target applications. Despite difficulties
introduced by sensor resources constraints, research contributions in this
field are growing day by day. In this paper, we present a comprehensive review
of most recent literature of WSNs and outline open research issues in this
field
A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks
The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET
- …