Beruflich Dokumente
Kultur Dokumente
Zena Mohammed
Outline
Introduction
Network Management Requirements
Traditional Network Management Models
Network Management Design Issues
Example of Management Architecture: MANNA
Other Issues Related to Network Management
Naming
Localization
Introduction
Network management is the process of managing,
monitoring, and controlling the behavior of a network.
Application
Transport
Network
Data Link
o Physical devices
Links (wireless or wired link),
Network nodes (hub, bridge, switch, or router), and
Terminals and Servers;
o Protocol; and
o Infor mation that is being carried, including applications.
The collaboration of physical devices and network protocols forms the
underpinning support for the applications. However, the physical devices and
protocols are not sufficient to support effective operation of a communications
network; network management (NM) tools and techniques are also required to
help provision network services and ensure cooperation of entities in the
network.
3.
Role of NMS :
o
o
o
o
Advantages of SNMP:
o
Disadvantages of SNMP :
o
TOM presents a model for telecommunications management for network and service
Levels / Layers
o
Service Fulfilment,
Service Billing.
Basic Issues:
o
o
o
o
o
o
Power efficiency
Data centric
Data aggregation
Attribute-based Addressing
Locationing systems, and
External Networks
MIB for WSNs should contain a general information model for sensor nodes,
features of WSNs, and WSN applications.
Internet
Sink
Manager Node
Sensor nodes
Sensor field
MANNA (a Management Architecture for Wireless Sensor Networks ) is a policybased management system that collects dynamic management information , maps
this into WSN models, and executes management functions and services based on
WSN models.
naming,
localization,
maintenance, and
fault tolerance.
Localization
The
faults
4.1 Naming
Naming is the scheme used to identify a sensor node.
An efficient naming scheme can lower computation overhead
and make routing protocol energy efficient.
4.2 Localization
Localization schemes determine the location of sensor
nodes since such information is important for some sensor
applications.
Advantages of this knowledge are that :
1. some applications, such as those for tracking of objects, are
highly location dependent
2. location-based routing, which may also result in energy
conservation is enabled
3. knowledge of location usually enhances security;
4. locations are helpful for sensor network management and
monitoring
Localization classification
Localization Algorithm
Centralized Schemes
Distributed Schemes
Range-based Scheme
Range-free Schemes
In this scheme Sensor nodes send control messages to a central node whose
location is known.
The central node then computes the location of every sensor node and informs the
nodes of their locations.
Range-free schemes.
Seed nodes know their own locations, and they periodically broadcast a control
message with their location information.
Sensor nodes that receive these control messages can then estimate their own
locations.
CLUSTERING IN WSN
Clusters: grouping of sensors that performing similar tasks are
known as clusters.
Hierarchical clustering is the efficient way to utilize the energy in an
efficient manner.
In hierarchical cluster, it contains Cluster Head, Regular Nodes and
Base Station.
After the cluster head is selected, it collects the data from all of its
member nodes and aggregates it in order to eliminate the redundancy.
Thus it limits the amount of data transmission to Base Station, hence
remaining energy level is increased and network lifetime is
maximized.
the optimal number of cluster head that would lead to minimize the
average energy spends in the network for each round.
An extension of k-means
Hierarchical, k-means generates partitions
each data point can only be assigned in one cluster
Number of clusters = 2
C1 C2
0.8 0.2
0.9 0.1
0.7 0.3
0.3 0.7
0.5 0.5
0.2 0.8
Cluster 1
Cluster 2
1.40
(1,6)
3.88
(2,5)
1.17
(2,5)
3.32
(3,8)
1.99
(3,8)
2.16
(4,4)
2.64
(4,4)
2.91
(5,7)
2.75
(5,7)
0.28
(6,9)
4.62
(6,9)
2.50
C1 C2
0.7 0.3
0.6 0.4
0.5 0.5
0.5 0.5
0.1 0.9
0.3 0.7
Dynamic Topology
Node mobility has a great
effect on the designing of
routing protocols
Dynamic Routing
Route Maintenance
SPIN-BC
It
sends
meta-data
toitself
neighbors
Sensor
broadcasts
data
A
Neighbor
node
senses
sends
something
a REQ
listing
interesting
allthe
of network
the data it
The
process
repeats
across
Neighbors
aggregate
data
and broadcast
would like meta-data
to acquire
(advertise)
ADV
REQ
DATA
SPIN-BC
Advertise meta-data
Send data
Advertise
Send data
I am tired
Send
I need to
sleep
data
Advertise
meta-data
Advertise
Send
Request
Nodes doRequest
data
need data
not
to
data
participate in the
process
Request data
Directed Diffusion
Gradient
represents
both
direction
towards
data
matching
Uses
application-aware
communication
primitives
This
Consumer
Nodes
The
process
choice
diffuse
ofsets
of
data
path
the
upinitiates
interest
gr
isadients
made
interest
towards
locally
in the
inproducers
at
network
data
every
with
node
tovia
certain
draw
afor
Every
route
has agyprobability
being
chosen
Probability
1/ener
gyofcost
Collect
ener
metr
ics along
the way
and status
of demand
with
expressed
terms
ofdesired
namedupdate
data rate
sequence
events
matching
every
ofin
attributes
local
packet
interactions
the
interest
Four-legged
animal
Source
Sink
Directed Diffusion
Reinforcement
andtolerance
negativetoreinforcement
Has built-in
nodes movingused
to converge
to refficient
out of
ange or distribution
dying
Source
Sink
Smart roads
Traffic monitoring, accident detection,
recovery assistance
Examples: ATON project (UCSD)
highway
camera
Contaminants detection
Examples: Multipurpose Sensor Program
(Boise State University)
microphone