Beruflich Dokumente
Kultur Dokumente
by
Ananth Ravindran
Assistant Professor
EC
20 43
W IR
EL
ES S
NE
TW
KS
UNIT IV
Ananth.R
EC
20 43
W IR
EL
Model
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
Data takes multiple hops before reaching destination. each node communicates with other nodes directly or indirectly through intermediate nodes.
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
W IR
itself.
EL
ES S
NE
TW
OR
KS
wireless networks in
intermediate nodes
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
DIFFICULTIES:
EC
20 43
environments.
W IR
EL
ES S
NE
TW
OR
KS
Characteristics of MANETs
Nodes are free to move arbitrarily; thus, the network topology
noise, interference conditions, etc.. But MANETs are expected to provide a reasonable amount of data rate
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
W IR
networks
EL
ES S
NE
TW
OR
KS
1. Dynamic topologies:
3. Energy-constrained operation:
means for their energy.
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Applications
TW
MANETs can be formed among soldiers on the ground or
EC
20 43
W IR
2. Crisis-management applications:
EL
ES S
NE
OR
1. Defense applications:
KS
3. Telemedicine:
MANETS may be useful for many medical applications from data gathering to surgical methods
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Blocks of this database are transmitted in rapid sequence to a visualize the needed environment ahead of time
EC
20 43
W IR
EL
ES S
NE
6. Virtual navigation:
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
Routing
NE
TW
OR
Ananth.R
KS
Routing
TW
packets from the source to the destination node
EC
20 43
W IR
itself.
EL
ES S
NE
OR
KS
Ananth.R
Routing in a MANET depends on many factors, including of a route request, and specific underlying characteristics that could serve as heuristics in finding the path efficiently.
EC
destination
20 43
of
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
3. Give the nodes the best possible response time and sessions between user applications.
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
W IR
EL
ES S
NE
OR
KS
Types
TW
1. Proactive or table-driven routing protocols 2. Reactive or on-demand routing protocols.
EC
20 43
W IR
EL
ES S
NE
OR
KS
Ananth.R
changes in network topology It is proactive in the sense that when a packet needs to be immediately used.
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
W IR
EL
ES S
NE
network.
TW
OR
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
The route is discovered by sending route-request will forward the request to their neighbors,and so on
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Dis Advantages
route requests.
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
Once a route has been established the searching process will be halted
EC
20 43
W IR
EL
ES S
NE
OR
KS
Ananth.R
EC
20 43
W IR
2. Hop-by-hop routing
EL
ES S
NE
TW
OR
KS
In Source routed on-demand protocols each data destination. Therefore, each intermediate node forwards of each packet
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Hop-by-hop routing
the destination address and the next hop address. So each intermediate node uses its routing table to
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
EC
20 43
W IR
EL
ES S
NE
PROTOCOLS
TW
OR
Ananth.R
KS
Types
TW
Destination-Sequenced Distance-Vector Routing
EC
20 43
W IR
EL
ES S
NE
OR
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
The sequence number of the information received about the destination and a new sequence number unique to the broadcast
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
W IR
EL
destination
ES S
NE
TW
OR
KS
If multiple routes are available for the same destination the Any updates in the routing tables are periodically broadcast in The amount of traffic generated by these updates can be huge types of packets (a) Full Dump (b) Incremental dump A full dump packet carries all the available routing units (NPDUs). information and can require multiple network protocol data
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
When there is only occasional movement, smaller information since the last full dump.
The incremental packets fit into a standard NPDU and hence decrease the amount of traffic generated.
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
TW
OR
Ananth.R
KS
access, routing, and bandwidth allocation. Identification of appropriate clusters and selection of CHs is
EC
20 43
W IR
quite complex
EL
ES S
NE
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
When two CHs come into contact, or When a node moves out of contact with all other CHs.
EC
20 43
W IR
EL
ES S
algorithm is used
NE
TW
OR
KS
Ananth.R
another CH, and so on until the packet reaches the CH of the destination
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
EC
destination
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
TW
OR
Ananth.R
KS
Routing table
EC
20 43
W IR
Link-cost table
EL
ES S
NE
Distance table
TW
OR
KS
Ananth.R
EC
20 43
Link-cost table
W IR
EL
ES S
Routing table
NE
TW
OR
KS
Distance table
EC
20 43
W IR
a retransmission counter,
EL
ES S
NE
MRL has a
TW
OR
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
EC
20 43
W IR
EL
ES S
TW
OR
Ananth.R
KS
This maintains information only for active routes discovery process is initiated
EC
20 43
table exchanges
W IR
EL
ES S
NE
TW
OR
KS
When a source needs to send a message to a destination it Source sends a route request (RREQ) packet to all its neighbors, and so on, until either the destination
number and a broadcast ID, which is incremented each time Sequence numbers are used to ensure that all routes are loop-free
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
EC
20 43
W IR
EL
ES S
destination.
NE
TW
OR
KS
Ananth.R
EC
20 43
route maintenance
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
When a mobile has a message to send, it consults the destination the message
broadcasting a route-request packet The route request contains the destination address, the source address, and a unique identification number
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
packet only if it has not seen the packet before and its own
EC
20 43
W IR
EL
ES S
links
NE
TW
OR
KS
EC
20 43
W IR
EL
ES S
TW
OR
Ananth.R
KS
A single sensor may have a limited sensing range, and phenomenon in a given area might require deployment
least one adjacent sensor can receive the data correctly. So node deployment plays a vital role in the lifetime of a network.
EC
20 43
W IR
EL
ES S
covered.
NE
TW
OR
KS
Ananth.R
Types
TW
1. Randomly Deployed Sensor Networks 2. Regularly Deployed Sensor Networks
EC
20 43
W IR
EL
ES S
NE
OR
KS
Ananth.R
Random
TW EC 20 43
Visit www.agniece.blog.com for further details
W IR
EL
ES S
NE
OR
Ananth.R
KS
Regular
TW EC 20 43
Visit www.agniece.blog.com for further details
W IR
EL
ES S
NE
OR
Ananth.R
KS
In this scheme, the nodes react immediately to sudden and drastic changes in the value of a sensed attribute. As such, these are well suited for time-critical applications.
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
2. Reactive networks:
W IR
EL
ES S
NE
TW
OR
KS
1. Proactive networks:
EC
20 43
W IR
EL
ES S
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
Scalability
NE
TW
Energy Efficient
OR
Ananth.R
KS
Harnessing the potential benefits of WSNs requires a high-level of self-organization and coordination among the sensors
for WSNs becomes crucial for wireless sensor nodes to carry out successfully the mission for which they are deployed
Visit www.agniece.blog.com for further details Ananth.R
EC
20 43
W IR
EL
ES S
NE
planning
TW
OR
KS
Communication among wireless sensor nodes is usually characteristic of this channel that only a single node can Therefore, shared access of the channel requires the The objective of the MAC protocol is to regulate access to the shared wireless medium such that the performance
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Protocol Architecture
TW EC 20 43
Visit www.agniece.blog.com for further details
W IR
EL
ES S
NE
OR
Ananth.R
KS
1. Schedule-based protocols
sensors.
EC
allocated on demand
Visit www.agniece.blog.com for further details Ananth.R
20 43
W IR
EL
ES S
NE
TW
OR
KS
EC
20 43
W IR
EL
ES S
NE
Schedule-Based Protocols
TW
OR
Ananth.R
KS
SMACS is a MAC protocol to enable the formation of random synchronization among the network
(Frequency Hopping )method. Each node in the network maintains a TDMA-like frame, neighbors.
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
The size of each frame is not fixed and may vary in time for a
assigning a time slot to this link. The selection of time slots is such that the node talks only to
EC
20 43
W IR
EL
ES S
nodes.
NE
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
Only the cluster head transmits data outside the cluster. The cluster head node sets up a TDMA schedule and transmits
EC
20 43
W IR
EL
cluster head.
ES S
NE
clusters
TW
OR
KS
Clusters
TW
Larger Nodes denote Cluster Heads Visit www.agniece.blog.com for further details
EC
20 43
W IR
EL
ES S
NE
OR
Ananth.R
Base Station
KS
EC
20 43
cluster head
W IR
EL
ES S
NE
TW
OR
KS
Upon receiving data packets from its cluster nodes, the cluster head aggregates the data before sending them to the base station.
Before transmitting data to the base station, the cluster head must sense the channel to ensure that no other cluster head is currently transmitting data using the base station spreading code If the channel is sensed busy, the cluster head delays the data transmission until the channel becomes idle
EC
http://en.wikipedia.org/wiki/Low_Energy_Adaptive_Clustering_Hierarchy
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
EC
20 43
transceivers.
W IR
EL
ES S
The protocol combines the use of a busy tone with RTS and
NE
TW
OR
KS
EC
20 43
W IR
EL
ES S
NE
A node turns off its data radio channel until communication with
TW
up radio channel
OR
This uses two radio channels: a data radio channel and a wake-
KS
3. Timeout-MAC (T-MAC)
Used for applications characterized by low message rate To avoid collision and ensure reliable transmission, T-MAC communicate with each other listening by transmitting all messages in bursts of variable length.
EC
20 43
W IR
EL
ES S
NE
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
TW
OR
Ananth.R
KS
CEDAR
EC
computation for the links with other core nodes on behalf of the
20 43
W IR
EL
ES S
links.
NE
TW
OR
KS
A core node which needs a route tries to reach the furthest away core The furthest away core node also does a similar route computation. The path along the route is recorded in an array and the path from core node to core node are concatenated to form the final path
EC
20 43
W IR
EL
ES S
Route computation:
NE
TW
OR
Links
between
core
nodes
are
called
KS
virtual
links
Ananth.R
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
+ performs both routing and QoS guarantee. - core nodes becomes performance bottleneck.
NE
TW
OR
Ananth.R
KS
ZRP
Zone Routing Protocol It is either a proactive or reactive protocol
And using a reactive protocol for communication between these neighborhoods (Interzone Routing Protocol(IERP)).
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS
EC
20 43
W IR
EL
Disadvantages
ES S
NE
an on demand protocol
TW
OR
KS
Ananth.R
Advantage
ZHLS
Based On The GPS
On the other hand, the protocol is reactive when the destination Clustering).
EC
20 43
node isn't within the zone from the source node (Interzone
W IR
EL
ES S
NE
TW
OR
KS
EC
20 43
W IR
EL
ES S
NE
Each node only knows the connectivity within its zone and the
TW
OR
KS
Ananth.R
EC
20 43
W IR
EL
ES S
NE
TW
OR
Ananth.R
KS