1 / 15

Off By One Power-Save Protocols Presentation #3

Off By One Power-Save Protocols Presentation #3. Corey Andalora Keith Needels. Agenda. Design Update Algorithm Recap Demo & Comparisons Future Work Conclusion. Design Update. Movement Point – speed in x and y directions Double – distance to travel before changing directions GPS

galia
Download Presentation

Off By One Power-Save Protocols Presentation #3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Off By OnePower-Save ProtocolsPresentation #3 Corey Andalora Keith Needels

  2. Agenda • Design Update • Algorithm Recap • Demo & Comparisons • Future Work • Conclusion

  3. Design Update • Movement • Point – speed in x and y directions • Double – distance to travel before changing directions • GPS • For GAF, consumes additional power • AdHocNode • Virtual method makeDecision() that allows children to decide when to turn radio on and off.

  4. AdHocNode +void makeDecision() SpanNode GAFNode AFECANode -Vector<SpanNode> coordinators -boolean isDelaying -boolean isTentative -boolean isSleeping -double coordinatorProportion -GAFState state -long activeTime -long discoveryTime -long sleepingTime TBD AdHocNode Child Classes

  5. Power consumption • Radio on consumption = 0.83 Watts • Radio off consumption = 0.13 Watts • GPS in power save mode = 0.033 Watts

  6. Algorithm Recap: Baseline • All nodes’ radios on entire time.

  7. Algorithm Recap: GAF • Nodes know their position. • Nodes determine grid cell based on position. • Each grid cell elects a single coordinator.

  8. Algorithm Recap: Span • Nodes determine coordinator status based on connectivity of neighbors. • Nodes announce coordinator status using delay calculated from power remaining and number of pairs it can connect. • Nodes become tentative after coordinator term until another coordinator takes over.

  9. Preview Define number of nodes Maximum speed a node may travel in X and Y directions File Menu: Load and Save models Choose types of nodes Updates the graph with new selections Radio transmission range Ad-hoc world view Change scale of graph Start and stop simulation Duration of simulation (seconds)

  10. Demo • 100 Nodes, Range=100, No movement • Duration of Baseline • Duration of GAF • Duration of Span • 300 Nodes, Range=100, Max movement=3 • GAF vs Span • 100 Nodes, Range=200, No movement • GAF vs Span • Audience requests (within reason)

  11. GUI Key • State (Span & GAF) • * = Coordinator • + = Non-coordinator • Battery Power • Gray = Radio off • Green > 60% • Yellow > 20% and <= 60% • Red < 20%c • Magenta = DEAD • Connections • Gray = normal connection (Baseline) • Blue = connection between coordinators • Orange = connection involving a tentative coordinator (Span)

  12. Enough Already, Let’s See It! • Proceed with demo http://learning.cc.hccs.edu/Members/cschweitzer/images/angryal.jpg

  13. Future Work • Create configuration file • Initializes world parameters • Model packet transfers • Power consumption • Transfer rate • Test cases • Create networks to run on all algorithms • Save and graph results

  14. Conclusion • Happy with framework thus far • We were able to easily add different types of nodes • GUI helped significantly in verifying algorithms • Algorithms seem stable • May need minor tweaking • Movement has influential effects on algorithms

  15. Questions? • Ya Xu, John Heidemann, and Deborah Estrin. “Adaptive energy-conserving routing for multi-hop ad hoc networks.” Technical Report 527, USC/Information Sciences Institute, October 2000. • Ya Xu, John Heidemann, and Deborah Estrin. “Geography-informed energy conservation for ad hoc routing,” in Proceedings of 7th Annual International Conference on Mobile Computing and Networking, pp. 70-84, July 2001. • Benjie Chen, Kyle Jamieson, Hari Balakrishnan, and Robert Morris. “Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks.” ACM Wireless Networks Journal, 8(5), 481-494, September 2002. • Stefano Basagni, Marco Conti, Silvia Giordano, and Ivan Stojmenovic. Mobile Ad Hoc Networking. John Wiley & Sons, 2004. ISBN 0-471-37313-3.

More Related