1 / 11

Energy-Balanced m-Coverage and n-Connectivity Routing Algorithm for WSN

Energy-Balanced m-Coverage and n-Connectivity Routing Algorithm for WSN. Yuping Dong, Hwa Chang, Zhongjian Zou , Sai Tang ICHIT2010. WSN Power Issue. Tiny sensor nodes do not carry much energy . Long-lasting WSNs reduce cost .

melita
Download Presentation

Energy-Balanced m-Coverage and n-Connectivity Routing Algorithm for WSN

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-Balanced m-Coverage and n-Connectivity Routing Algorithm for WSN Yuping Dong, Hwa Chang, ZhongjianZou, Sai Tang ICHIT2010

  2. WSN Power Issue • Tiny sensor nodes do not carry much energy. • Long-lasting WSNs reduce cost. • Extreme environment and dense distribution of sensors prohibit battery recharge or replacement.

  3. Energy Efficient Routing Protocols • Data Centric • Hierarchical • Location-based

  4. m-Coverage and n-Connectivity • m-Coverage => Full coverage of area • n-Connectivity => Never lost information

  5. Power Model

  6. Energy-Balanced Routing Algorithm • Routing Setup • Calculate # of sets • Determine node’s hop count • Construct paths • Data Transmission

  7. Simulation Results and Comparison Number of Active Nodes vs. Coverage Ratio Nodes Usage vs. Hop Count

  8. Energy-Aware Routing Algorithm for WSN Applications in Border Surveillance Yuping Dong, Hwa Chang, ZhongjianZou, Sai Tang HST2010

  9. Multiple Sink Nodes • Further distribute energy consumption. • Evenly divide the whole area. • Save setup time and transmission energy. • Shorter latency. • Assign local max hop count nodes with random set #s.

  10. Example Networks EBCCR EAR

  11. Simulation Results Number of Active Nodes vs. Coverage Ratio Nodes Usage vs. Hop Count

More Related