Sensor Networks on Defense SNoD

1
Sensor Networks on Defense(SNoD)

• Kaustubh Supekar ,Gaurav Sharma
• Brijraj Vaghani ,Omer Hashmi
• Sujaa Mohan ,Deepti Agarwal
• Aditya Barve, Gautam Kaushal
• Debasis Haldar

2
TinyOS Packet Format
3
TinyOS Packet Format (contd)

• Packet Format
• Destination ID is the node ID of the next hop
• Group ID is used to prevent interference between
  different sensor networks
• CRCif this passes then a 1 byte acknowledgement
  is sent to the sender

4
Simulating the Clustering Algorithm

• ? We deploy a fixed number of sensors in the
  given terrain and start a timer known as the wait
  timer .This wait timer is directly proportional
  to the radius which is assumed to be the same for
  all sensor nodes .
• ? At a certain time t we have all the sensors
  broadcast with some predefined energy. The
  sensor nodes broadcast their mote ID s.
• ? Each sensor node builds a list of sensor ids
  corresponding to the sensor nodes it can talk to
  .
• ?At the end of the wait timer each sensor node
  starts a promotional timer inversely proportional
  to its unused energy and the number of
  advertisements it has received .
• ? At the end of its promotional timer if a
  sensor has not received any advertisement from
  any other sensor node it declares itself the
  cluster head
• ?Once a cluster head it broadcasts a message
  announcing itself as the cluster head and a list
  of IDs corresponding to all the sensor nodes it
  can talk to .

5
Simulating the Clustering Algorithm(contd..)

• ? Depending upon the advertisement received from
  the cluster head each individual sensor node
  builds a list of all sensor nodes they can talk
  to The list is built such that if a particular
  sensor node has an ID in the list which does not
  appear in the cluster heads list , it means
  ,that particular sensor node does not belong to
  the same cluster. This is because to be a part of
  the same cluster head the sensor nodes need to be
  in direct communication with each other .Each
  sensor node then sends this updated list(ID s
  which are not in his list ) as well as the
  remaining energy to the cluster head .
• ? Depending upon the updated lists received from
  the sensor nodes the cluster head updates its
  list of sensor nodes it can talk to and elects a
  successor such that the successor has the
  highest remaining energy .
• ? The cluster head then broadcasts this list to
  all nodes within the cluster and informs that in
  event of the cluster head dying out who will be
  their successor .In this manner a cluster is
  formed such that all sensor nodes in the cluster
  are in direct communication with each other .

6
Thank you !!!