1 / 20

Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks

Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks. Zijian Wang, Eyuphan Bulut , and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic Institute Troy , USA.

ashby
Télécharger la présentation

Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks

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. Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks Zijian Wang, EyuphanBulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic Institute Troy , USA IEEE International Conference on Communications (ICC), 2009

  2. Outline • Introduction • Assumption • Protocol • Simulation • Conclusion

  3. Introduction Collision Aware Energy Efficient Multipath Routing

  4. Assumption • The sensor network consists of N nodes deployed randomly with uniform distribution. • Each node can adjust radio transmit power to vary its communication range from 0 to the maximum transmit range, denoted as R. • We assume that each node knows its position. • Additionally, we assume that each node knows the position of the destination node.

  5. Protocol • Route Request • 1) all those nodes are closer to the destination. • 2) nodes in each group lay at one side of the source-destination line. • 3) each node is distanced more than R/2 from the source destination line.

  6. Protocol

  7. Protocol Local reply(Power ) Neighbor Previous Node Route Request(Power ??) Shut Up (Power ??)

  8. Protocol

  9. Increasing order of distance i+1 is bad

  10. Protocol • Back-off time calculation • Progress length • Distance to the source-destination line • Residual energy

  11. Protocol

  12. Protocol • Route requests failure

  13. Protocol • Route requests failure

  14. Protocol • Route requests failure

  15. Simulation • NS-2.33 simulator • 1000 m by 1000 m area • 100 static nodes deployed uniformly randomly • maximum transmit range 250M • The power drained for each transmission is 1.6 W. • The power drained for reception is 1.2 W. • All packets are of the same size of 512 bytes.

  16. Simulation

  17. Simulation

  18. Simulation

  19. Simulation

  20. Conclusion • They have studied the performance of EECA protocol relative to AODV under a group of network topologies and traffic scenarios. They observed that EECA achieved better performance in energy conservation and data transfer efficiency in all cases.

More Related