network

1. Kautz-based Wireless Sensor
and Actuator
Network for Real-time, Fault-
Tolerant and
Energy-Efficient Transmission

2. Objective
• To study routing paths in the Kautz graph in order
to develop an efficient fault-tolerant routing
protocol.
• To provide a quick and efficient identification of
the next shortest path by the relay from itself to
the destination based on node IDs upon routing
failure, rather than on retransmission from the
source.
• To preserve the consistency between the overlay
and physical topology.

3. Introduction
• The proposed method initially embeds Kautz graphs
into the physical topology of a WSAN for real-time
communication and connects the Kautz graphs using
Distributed Hash Table (DHT) for high scalability.
• Actuators and several selected active sensors in each
cell form a Kautz graph and the actuators further
constitute a DHT structure.
•

4. Literature survey
Title Year Author Description Demerits
Highly dynamic
destination
sequenced
distance vector
routing (DSDV)
for mobile
computers.
1994 E. P. Charles et al DSDV proactive routing
algorithm is used in
which each node
maintains and
periodically
updates a routing table
by message flooding.
low scalability
Virtual ring
routing:
network
routing
inspired by
DHTs.
2006 Caesar et al a virtual coordination
method is used to
choose the node
closest to the
destination by
relying on the position
information generated
by GPS
High energy
consumption

5. Evaluating
Service
Disciplines for
On-Demand
Mobile Data
Collection in
Sensor
Networks.
2014 Yang et
al
data collection requests arrive
at the mobile element
progressively, and modeled the
data collection process
as a queuing system.
Low scalability
Snapshot and
Continuous
Data Collection
in Probabilistic
Wireless
Sensor
Networks.
2014 Beyah et
al
Cell-based Path Scheduling
(CPS) algorithm is proposed for
snapshot data collection, and
a Zone-based Pipeline
Scheduling (ZPS) algorithm is
proposed for continuous data
collection
Less fault
tolerant

6. Proposed work
• A kautz graph is developed for the network.
• The graph is embedded with real sensor
topology using distributed hash table.
• Actuator id and sensor id are assigned to
respective nodes.
• Triangulation is used to identify the actuators.
• A fuzzy based approach is used select the
most reliable paths.

7. Methodology
• The DHT facilitates the information transmission between
cells.
• The constructed DHT preserves the physical topology to
enable the DHT routing algorithm to transmit data along
physically close actuators to its destination, thus leading to
fast and energy-efficient routing.
• Each node maintains a neighbor set including those nodes
that hold coordinate zones adjoining its own zone.
• Using its neighbor set, a node routes a message by simply
forwarding it to the neighbor with coordinates closest to
the destination coordinates.