1 / 9

Energy and Coverage Aware Routing Algorithm in Sensor Networks

Explore a novel routing algorithm for self-organized sensor networks focusing on energy efficiency and optimal coverage. The algorithm includes clustering strategies and role changes for extended network lifetime. Implementation and outcomes discussed.

jezell
Download Presentation

Energy and Coverage Aware Routing Algorithm in 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. Institute of Applied Microelectronics and Computer Engineering Energy and Coverage Aware Routing Algorithm in Self Organized Sensor NetworksJakob SalzmannINSS 2007,07.06.2007, Braunschweig University of Rostock

  2. Outline • Motivation • Clustering • Routing • Conclusion & Outlook

  3. Photo: Jason Hill, UCB Motivation Cheaper and smaller, but more nodes Main problem: energy consumption

  4. Clusterhead Clustering I • Dividing the network into clusters • Less Communication • Hierarchical Structure Clusterhead consumes more energy Lifetime increase by role changing Sensor node Sink • Problem: • Different position in a cluster à Different transmission range • New Clusterheads have to check for connections à Communication overhead • Our goal: Limits for clusters which allow unconditional role changes

  5. Clustering II • Grid with quadratic cells • Max cell size restricted by • Transmission range • Sensing range L L L SensingRange RS TransmissionRange RT

  6. Clusterhead Switched-off node Clustering III • Estimation of the virtual grid • Determining the Clusterhead in each cell • Temporary switch-off remaining nodes without loss of performance • Emerging of clusters with different lifetimes Low populated Cluster Sensor node Sink Well populated Cluster

  7. Scale Free Networks US airline system Internet Network results from preferred connection Many nodes with few connections, few nodes with many connections Robust against random attacks Our goal: Adoption of Scale free behavior to our developed clustering algorithm

  8. Switched-off node Routing Algorithm • Our approach: • Starting with the sink • After attending the network, nodes connect with all unconnected nodes in range • Built up a network with scale free behavior • Optimizations: • Range Reduction • Limited Connectivity • Wait and See • Well populated cluster become hubs Sink Low populated Cluster Well populated Cluster

  9. Conclusion & Outlook • Results • Developed a clustering algorithm • Unconditional role changing • Considers coverage and connectivity • Applied a routing algorithm • Scale free behavior • Robust against random failures • Future Work • Improvement of cell sizes • Stronger cross linking for improved robustness

More Related