1 grid-based access scheduling for mobile data intensive sensor networks c.-k. lin, v. zadorozhny...

23
1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on Mobile Data Management, 2008

Upload: melvin-stokes

Post on 18-Jan-2018

213 views

Category:

Documents


0 download

DESCRIPTION

3 Introduction MSN applications have stringent requirements on the response time Minimizing sensor response time and minimizing energy consumption is crucial Even high rate wireless networks (e.g., IEEE ) use best-effort service that can lead to packet loss (from collisions)

TRANSCRIPT

Page 1: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

1

Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks

C.-K. Lin, V. Zadorozhny and P. Krishnamurthy

IEEE International Conference on Mobile Data Management, 2008

Page 2: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

2

Outline

Introduction GLASS protocol description GLASS analysis Simulation results Conclusion

Page 3: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

3

Introduction

MSN applications have stringent requirements on the response time

Minimizing sensor response time and minimizing energy consumption is crucial

Even high rate wireless networks (e.g., IEEE 802.11) use best-effort service that can lead to packet loss (from collisions)

Page 4: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

4

Grid based Latin Squares Scheduling Access (GLASS) protocol description System model GLASS protocol Time slot assignment

Page 5: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

5

System model

Sensors are evenly deployed in a field Every sensor transmits or receives on a

common carrier frequency Time synchronization is managed by a Base

Station (BS) using beacons

Page 6: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

6

GLASS protocol

Grid searching Transmission frame assignment Time slots assignment

Page 7: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

7

Grid searching

Page 8: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

8

Transmission frame assignment

Page 9: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

9

Transmission frame

We define a TF as a group of continuous time slots

The length of TF is configured differently for different sensor distributions

If the sensors are not evenly distributed, α will increase

Page 10: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

10

Time slots assignment

Each sensor performs neighborhood discovery to prepare for time slots scheduling

We use Latin Squares (LS) to assign time slots for sensors

Page 11: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

11

Example

1 4

2

53

14

2

5

3

1 4

2

5 3

1 4

253

1 4

2

5 3

1 4

25

3

14

2

53

14

2 5

3

1 4

2

5

3

Page 12: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

12

Collision avoidance near intersection of grids

Page 13: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

13

Example

3

2

1

1

4

23

1

2

5

62

Page 14: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

14

GLASS analysis

Theorem 3.1: There is no conflicting time slot assignment between any two sensors within any grid cell when the protocol converges. (Proof omitted).

Theorem 3.2: There is no conflicting time slot assignment between any two sensors from any two different grid cells when the protocol converges. (Proof omitted).

Theorem 3.3: There is no conflicting time slot assignment between any two sensors when the protocol converges. (Proof omitted).

Page 15: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

15

Simulation results

Simulator: NS-2 Compare the GLASS protocol with the IEEE

802.15.4 CAP mode and DRAND Set the channel data rate to 250 Kbps Set the sensor transmission range to 15

meters The packet size is 70 bytes

Page 16: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

16

Distributed Randomized TDMA Scheduling (DRAND)

Page 17: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

17

Transmission efficiency(1/2)

Page 18: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

18

Transmission efficiency(2/2)

Page 19: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

19

Scalable network

Page 20: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

20

Overhead evaluation

Page 21: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

21

Impact of sensor mobility(1/2)

Page 22: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

22

Impact of sensor mobility(2/2)

Page 23: 1 Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks C.-K. Lin, V. Zadorozhny and P. Krishnamurthy IEEE International Conference on

23

Conclusion

GLASS efficiently alleviates conflicting time slots schedules

This approach is especially suitable for the mobile data intensive sensor network with frequently changing topology