Cluster Based Routing (CBR) Protocol with Adaptive Scheduling for - - PowerPoint PPT Presentation

cluster based routing cbr protocol with adaptive
SMART_READER_LITE
LIVE PREVIEW

Cluster Based Routing (CBR) Protocol with Adaptive Scheduling for - - PowerPoint PPT Presentation

Cluster Based Routing (CBR) Protocol with Adaptive Scheduling for Mobility and Energy Awareness in Wireless Sensor Network Samer A. B. Awwad, Chee Kyun Ng* and Nor K. Noordin Department of Computer and Communication Systems Faculty of


slide-1
SLIDE 1

Department of Computer and Communication Systems Faculty of Engineering University Putra Malaysia

Cluster Based Routing (CBR) Protocol with Adaptive Scheduling for Mobility and Energy Awareness in Wireless Sensor Network

Samer A. B. Awwad, Chee Kyun Ng* and Nor K. Noordin

slide-2
SLIDE 2

Wireless Sensor Network

The WSN consists of a large number of randomly distributed sensor nodes that are densely deployed either inside a phenomenon or around it. The WSN consists of the following components:

  • Sensor nodes.
  • Sensor field.
  • Event.
  • Sink node.
  • Observer node.
slide-3
SLIDE 3

Wildlife monitoring Health care monitoring Battlefield monitoring

Mobility in WSN

Some applications like habitat monitoring, wildlife (animal) tracking, health care monitoring, and search and rescue call for mobile sensor. WSN sensor nodes trend to be mobile.

slide-4
SLIDE 4

Mobility has only recently been introduced in WSN. It is becoming increasingly useful in a variety of applications.

Problem Statement

In static WSNs, the research community generally ignores the mobility of sensor nodes. Some protocols to support mobility have been proposed:

  • Mobility Adaptive Hybrid MAC (MH-MAC) protocol

but mobility information beacon message overhead.

  • Low Energy Adaptive Clustering Hierarchy (LEACH) protocol

but relies on weighing k-density, residual energy and mobility parameters in the cluster head election.

  • LEACH-Mobile protocol

but it needs membership declaration

  • LEACH-Mobile Enhanced (LEACH-ME) protocol

but minimum mobility factor is elected as cluster head

slide-5
SLIDE 5
  • Mobility and traffic adaptive.

Cluster heads adaptively reassigning the timeslots according to sensor nodes mobility and traffic.

  • Two owners are created for each timeslot

Original owner and alternative owner. This protocol keeps the new mobile sensor nodes in the simple database tables and serves these nodes whenever the free or unused timeslot is available.

Cluster Based Routing for Mobile Nodes (CBR-Mobile) Protocol

slide-6
SLIDE 6

N4

Cluster 1 Cluster 2

N1 N2 N3 N5 N4 N6 N7

N5 N3 N2 N7 N1 N6

The timeslots assigned to the mobile sensor nodes that moved

  • ut of the cluster remain waste.

Mobility and Traffic Adaptive

N4 N5 N3 N2 N7 N1 N6 N1 N3 N7

N1 N2 N3 N5 N4 N6 N7

Sensors have no data

Mobility Traffic The timeslots assigned to the sensor nodes that have no data to send remain waste.

N1 N3 N7

slide-7
SLIDE 7

Exploits these two groups of unused timeslots to support sensor nodes mobility two simple database (tables) :

Alternative Schedule Database (ALT_SCH) . Membership Requesters Database (NEW_MEM_REQs).

N1 N2 N3 N5 N4 N6 N7 N8 N9 N1 N2 N3 N5 N4 N6 N7 N8 N9 N10 N10

New cluster

MSN 1

Old Cluster CH

NEW_MEM_RE Qs Sensor ID

MSN1

Original Schedule ALT_SCH

Two Simple Databases

slide-8
SLIDE 8

Simulation Scenario

Parameter Value

TOUT2_DATA_REQ 0.014984000040001 Timeslot 0.166128550180004 Traffic Model CBR and Poisson Queuing Model FIFO with Drop Tail

Idle Power 2.4 mW Rx Power 67.2 mW Tx Power 76.8 mW Sleep Power 0.0048 mW

Parameter and Models Value

Channel bandwidth 40 Kbps Network (field) Size (L*W) 50* 50 m Number of Sensor Nodes 100 Location of the Sink Node (25,25) Simulation Size 12K + Maximum Transmission R 19 m Percentage of Cluster Head 5 % Percentage of Mobile Sensor 0 – 90 % Data Size 2000 bits Mobility Model Random Way Point speed (1-10) m/s Radio Model Two-Ray Ground model NEW_MEM_REQs Initially is empty Battery Initial const(13,000J) Sensor Nodes Deployment Random Deployment TOUT_DATA 0.007392100040001 TOUT_DATA_REQ (0-0.007392100020001)

CH CH CH CH CH

50 50

slide-9
SLIDE 9

Evaluation Metrics

Average Delay [s] =

Total Packet Delay Total number of received packets

Packet Delivery Ratio =

Number of Received Packets at Sink Node Number of Generated Packets at Sensor Nodes

Total Energy consumption [J] = Average Energy consumption [J] =

Total Energy Consumption Total number of received packets

Total Packet Delay [s] =

slide-10
SLIDE 10

43% CBR-Mobile applies additional overhead The disconnection period of mobile sensor for CBR- Mobile is shorter than the LEACH-Mobile one

Packet Delivery versus Percentage of Mobile Sensor Nodes

slide-11
SLIDE 11

16%

Average Energy Consumption versus Percentage of Mobile Sensor Nodes

slide-12
SLIDE 12

In static environment, LEACH-Mobile maintains the steady state situation to 0.27 Pkt/s, while it drops to 0.19 Pkt/s in mobility environment. In static environment, CBR-Mobile maintains the steady state situation to 0.25, and keep the same value in mobility environment. LEACH-Mobile shortens the life of steady state situation by 30 %, while CBR- Mobile maintains the same steady state situation. 30 % Packet Delivery Ratio for LEACH-Mobile drops by 30 % in mobility environment compared to static one, while it drops by 13 % for CBR-Mobile.

30 % 13 % 0.27 0.25 0.19

Packet Delivery Ratio versus Generated Traffic in Static & Mobility Environments

slide-13
SLIDE 13

CBR-Mobile achieves less average delay for both CBR and poisson traffic. It has the advantage of 30 % less average delay for CBR traffic and 13-47 % for the Poisson one.

CBR Traffic Poisson Traffic

Average Delay versus Generated Traffic for CBR and Poisson Traffic types

13 % 47 % 30 %

slide-14
SLIDE 14

Conclusions

A mobility and traffic adaptive cluster based routing has been designed to support sensor nodes mobility in WSN. The protocol improve the packet delivery ratio and decrease the energy consumption. By reusing the unused timeslots, mobile sensor nodes can rejoin the network within short time and considerable increment in packet delivery ratio can be obtained. This can be achieved by mobility-, and traffic-adaptive scheduling.

slide-15
SLIDE 15

Samer A. B. Awwad, Chee Kyun Ng

samer_awwad80@yahoo.com, mpnck@ eng.upm.edu.my