Adaptive energy-efficient registration and online

scheduling for asymmetric wireless sensor networks

Authors : Saravanan Balasubramanian, Demet AksoyPublished : Computer NetworksPublished : Computer NetworksSpeaker : Wen-Chuan HuangSpeaker : Wen-Chuan Huang

OutlineOutline

IntroductionIntroduction AEROSAEROS

Message formatMessage format Channel divisionChannel division Control messageControl message

ExperimentsExperiments ConclusionsConclusions

IntroductionIntroduction

GoalGoal

propose a novel and adaptive sensor registration and scheduling protocol enable adaptive routing paths towards the data coll

ection points minimize the data transmissions such that each obs

ervation is transmitted only once per node using collision-free scheduling that is enabled even

while the network is organizing The chances of data aggregation during routing is

maximized

Message formatMessage format

(temperature, 4, 3, 1, 3, 2, 5, 2, 2)(temperature, 3, 5, 1, 2, 2, 4, 2, 3)

(temperature, 3.375, 8, 1, 2, 2, 5, 2, 3)

屬性 感測值 感測數量 事件範圍 持續時間

(4*3+3*5)/(3+5) 3+5

Channel divisionChannel division

In control channelIn control channel

Snoop state advertise subscribe

schedule

deregister

SchedulingScheduling

Message typeMessage type RequestRequest Request-AckRequest-Ack Request-NackRequest-Nack

Channel statusChannel status FREEFREE CAN RECEIVE ONLYCAN RECEIVE ONLY NEIGHBOR USENEIGHBOR USE SUBSCRIBER RECEIVESUBSCRIBER RECEIVE TRANSMITTRANSMIT

Energy consumptionEnergy consumption

ExperimentsExperiments

Conclusions Conclusions

Divide the communication medium into separate control and data channels

Data communications take place on independent data channels that are organized to be collision-free

Minimize the data communications and to improve the chances of data aggregation during data collection

Q&AQ&A