1104/18/23

EFFICIENT PARKING METER EFFICIENT PARKING METER MANAGEMENT SYSTEMMANAGEMENT SYSTEM

APRIL 26, 2006APRIL 26, 2006

STEPHEN DABIDEENSTEPHEN DABIDEENYIZENIA MORAYIZENIA MORA

ADVISORS: DR. ROCH GUERIN AND DR. SALEEM KASSAM

2204/18/23

Project OverviewProject Overview

AssumptionsAssumptions City-wide wireless networkCity-wide wireless network Parking meters with wireless and sensing capabilitiesParking meters with wireless and sensing capabilities

GoalGoal Get information about the meters’ status to a central Get information about the meters’ status to a central

officeoffice

ObjectivesObjectives Design and implement communication protocolDesign and implement communication protocol Evaluation metrics: reliability and energy efficiencyEvaluation metrics: reliability and energy efficiency

3304/18/23

Central StationCentral Station

4404/18/23

Statement of ProblemStatement of Problem

5504/18/23

HardwareHardware

PARKING METER

SENSOR

HARDWARE SETUP

StarEast Board: 256 MB RAM, 32 MB Flash, Intel IXP425 Processor

NL-2511-MP Prism 2.5 802.11b 200mW miniPCI Wireless Card

RE05T-RSP Antenna

PARKING METER

SENSOR

HARDWARE SETUP

StarEast Board: 256 MB RAM, 32 MB Flash, Intel IXP425 Processor

NL-2511-MP Prism 2.5 802.11b 200mW miniPCI Wireless Card

RE05T-RSP Antenna

6604/18/23

HardwareHardware

7704/18/23

Head Meter RotationHead Meter Rotation

Goal: maximize the life of the systemGoal: maximize the life of the system Transmitter with two levels of powerTransmitter with two levels of power Evenly distribute role of head meterEvenly distribute role of head meter

• Option 1: fixed, predefined rotationOption 1: fixed, predefined rotation• Option 2: dynamically determined Option 2: dynamically determined

rotationrotation Pick the neighbor with highest battery levelPick the neighbor with highest battery level

8804/18/23

SAFESAFE

Goal Goal Reliably and Efficiently route information to the Reliably and Efficiently route information to the

current head metercurrent head meter Routing tableRouting table

LocalLocal Next hopNext hop

A function of distance and reliabilityA function of distance and reliability Link QualityLink Quality

Additive Increase Multiplicative decreaseAdditive Increase Multiplicative decrease SynchronizationSynchronization

Store & Forward - single transmission per cycleStore & Forward - single transmission per cycle

9904/18/23

Single-Path, Best-Effort RoutingSingle-Path, Best-Effort Routing Data sent to best next hop and forwarded if Data sent to best next hop and forwarded if

receivedreceived

101004/18/23

Single-Path, Best-Effort RoutingSingle-Path, Best-Effort Routing Packets lost due to collisionsPackets lost due to collisions Data loss cumulativeData loss cumulative Data Missed

111104/18/23

Cost to send a packet of size b (b = 8):Cost to send a packet of size b (b = 8): Energy = 1.9 * b + 266 Energy = 1.9 * b + 266 μμJJ Incremental cost fixed costIncremental cost fixed cost

Cost to send Cost to send xx times: times: Energy = [1.9*b + 266]*Energy = [1.9*b + 266]*x x μμJJ

Cost to send through Cost to send through xx Paths Paths• Since data piggy-backs on other packets:Since data piggy-backs on other packets:

Energy = [1.9*b]*Energy = [1.9*b]*x x + 266 + 266 μμJJ

Multi-Transmission vs. Multi-PathMulti-Transmission vs. Multi-Path

121204/18/23

Full Multi-Path RoutingFull Multi-Path Routing

Improves reliability Improves reliability More paths = More energyMore paths = More energy Data Missed

131304/18/23

SAFESAFE

Synchronized Adaptive-Forwarding Synchronized Adaptive-Forwarding Efficient Routing ProtocolEfficient Routing Protocol

Defines two types of pathsDefines two types of paths Primary: Deterministic Best-EffortPrimary: Deterministic Best-Effort Secondary: ProbabilisticSecondary: Probabilistic

Central station provides feedbackCentral station provides feedback Adaptive-Forwarding: Probability Matrix Adaptive-Forwarding: Probability Matrix

used to create secondary paths as neededused to create secondary paths as needed SynchronizationSynchronization

141404/18/23

Probabilistic Multi-Path RoutingProbabilistic Multi-Path Routing Reduces redundancy without sacrificing reliabilityReduces redundancy without sacrificing reliability Uses multi-path only when neededUses multi-path only when needed Primary Path

Secondary Path

151504/18/23

Probabilistic Multi-Path RoutingProbabilistic Multi-Path Routing

Primary Path Secondary Path

Fewer Paths, Same level of reliabilityFewer Paths, Same level of reliability

161604/18/23

The SAFE Probability MatrixThe SAFE Probability Matrix

3-D matrix3-D matrix• Meter, Current Head Meter, ProbabilityMeter, Current Head Meter, Probability

DeterminationDetermination• Proactive Response Proactive Response

Long term, time-of-day variationsLong term, time-of-day variations

• Reactive ResponseReactive Response Temporary, unpredicted periods of unreliabilityTemporary, unpredicted periods of unreliability

User chooses tradeoffUser chooses tradeoff• Reliability vs. energy consumptionReliability vs. energy consumption

171704/18/23

Failure RecoveryFailure Recovery

Loss of a head meterLoss of a head meter• Transient loop => count to infinityTransient loop => count to infinity

Loss of a non-head meterLoss of a non-head meter• Link Quality decreasesLink Quality decreases

FragmentationFragmentation• Head meter in each groupHead meter in each group

DefragmentationDefragmentation• Single head meter Single head meter

181804/18/23

Experimental ResultsExperimental Results

Energy calculations for transmitting and receiving onlyEnergy calculations for transmitting and receiving only Group of 6 metersGroup of 6 meters

Routing TypeRouting TypeReliabilityReliability

(% data loss)(% data loss)

Energy Energy Consumption Consumption

(J/cycle)(J/cycle)

Best-Effort, Single PathBest-Effort, Single Path 17.717.7 0.006000.00600

SAFE: 10% responseSAFE: 10% response 3.73.7 0.006010.00601

SAFE: 30% responseSAFE: 30% response 2.02.0 0.006060.00606

Full Multi-PathFull Multi-Path 1.41.4 0.006170.00617

191904/18/23

ConclusionConclusion

Goal and ObjectivesGoal and Objectives SAFE routing protocolSAFE routing protocol

Two types of paths: primary and secondaryTwo types of paths: primary and secondary Probabilities determined by the central Probabilities determined by the central

stationstation Allows the user to trade reliability for energy Allows the user to trade reliability for energy

efficiencyefficiency Designed for our project but easily Designed for our project but easily

adaptableadaptable

202004/18/23

AcknowledgementsAcknowledgements

Prof. Roch Guerin Prof. Roch Guerin (Advisor)(Advisor) Prof. Saleem Kassam Prof. Saleem Kassam (Advisor)(Advisor) Prof. CJ Taylor Prof. CJ Taylor (Instructor)(Instructor) Prof. Ken Laker Prof. Ken Laker (Instructor)(Instructor) Mr. Phil Farnum Mr. Phil Farnum (Instructor)(Instructor) Mr. Sid Deliwala Mr. Sid Deliwala (Gismos & Gadgets)(Gismos & Gadgets) TCOM Lab TCOM Lab (StarEast Boards)(StarEast Boards) CIS & ESE Departments CIS & ESE Departments (Funding)(Funding)