PROJECT SEMINAR ON

PRESENTED BY: PROJECT GUIDE:

Subrat Kumar Nayak, Lecturer,CSE
SANJEEV MISHRA 8th SEMESTER CSE,0811012026

INTRODUCTION LITERATURE REVIEW ASSUMPTIONS TAKEN DCLA ALGORITHM OUTPUTS ADVANTAGES FUTURE WORK CONCLUSION

 Main

objective is to minimize duty cycle for energy conservation for wireless sensor networks using DCLA algorithm The smaller the duty cycle the lower is the energy consumption By analysis, DCLA algorithm proved to be the most efficient DCLA algorithm is implemented using MATLAB, for single node

Name of the paper

Duty cycle learning algorithm (DCLA) for IEEE 802.15.4 beacon-enabled wireless sensor networks
Author
Rodolfo de Paz Alberola, M.Eng. Miguel Hernandez University, Spain Dirk Pesch, Director at Nimbus Centre for EmbeddedSystems Research at Cork Institute of Technology

 Duty

cycle learning algorithm reduces the energy consumption by reducing the duty cycle, that is, lower the duty cycle lower is the energy consumption. The DCLA algorithm is implemented as a software component with IEEE 802.15.4 networks that configures the duty cycle during run time, without the need for human intervention

 Beacon

Interval(BI) Superframe Duration(SD) Duty Cycle(DC) BEACON Q-value Reward Idle Listening(IL) Beacon Order(BO) Superframe Order(SO)

 Greedy

strategy strategy

Random Round

Robin strategy

 Delay(D)-

3 seconds(OFF STATE) 1 second(IDLE STATE) 0.3 second(ACTIVE STATE) Overflow(O)0.4 to 0.6, Omax=0.8 Idle listening(IL)0.4 to 0.6

This is implemented in MATLAB

DC:Duty Cycle- 0.0625 The Quality for this set of values is: Columns 1 through 7 0 -0.8000 -1.6000 -2.4000 -3.2000 -4.0000 -4.8000 Columns 8 through 11 -5.6000 -6.4000 -7.2000 -8.0000 The Maximum Q-value is: -8 PIE VALUE i.e. strategy where action value has highest DC value IS: 0.4152 0.4480 0.4247 0.4368 0.4480 For the action_set value of 10 Current action value is : 0.3000 AT THE END, t VALUE IS: 3

Duty Cycle- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0.0566 The Quality for this set of values is: Columns 1 through 7 0 -0.8000 -1.6000 -2.4000 -3.2000 -4.0000 -4.8000 Columns 8 through 11 -5.6000 -6.4000 -7.2000 -8.0000 The Maximum Q-value is: -8 PIE VALUE i.e. strategy where action value has highest DC value IS: 0.4917 0.5324 0.5541 0.4700 0.5324 For the action_set value of 10 Current action value is : 0.3000 AT THE END, t VALUE IS: 3

........................................... HERE, BO<SO i.e. DC>1.SO, PLEASE TRY AGAIN! ...........................................

 DCLA

has low memory and processing requirements making it suitable for typical wireless sensor platforms. and graphs show that DCLA achieves the best overall performance as compared to other algorithms. the time and cost of the wireless sensor network deployment, operation and management phases.

Simulations

Reduces

 The

work presented here is meant only for single source node . Some part of the algorithm has been skipped due to unavailability of data and resources. In place of that, I have taken certain assumptions. would like to improve the results and reduce the assumptions .

The proposed adaptive algorithm is easily implementable by collecting the statistics that aid estimating the traffic, updating the quality of the actions and selecting the next duty cycle.
Memory requirements of the algorithm show that it is suitable for typical sensor nodes.

Proposed scheme is more energy efficient and ensures a longer network lifetime when compared to existing approaches.

 Duty

cycle learning algorithm (DCLA) for IEEE 802.15.4 beacon-enabled wireless sensor networks www.journals.elsevier.com/ad-hocnetworks Google scholar