1 / 28

IEEE Transactions on Computers , vol. 60, no. 11, November 2011

A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks. Chih-Hsun Anthony Chou 1 , Kuo-Feng Ssu 2 , Hewijin Christine Jiau 2 , Wei-Tong Wang 2 and Chao Wang 2 1 Institute for Information Industry , Taiwan 2 National Cheng Kung University , Taiwan.

ruth-baldwin
Download Presentation

IEEE Transactions on Computers , vol. 60, no. 11, November 2011

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. A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks Chih-Hsun Anthony Chou1, Kuo-Feng Ssu2, Hewijin Christine Jiau2, Wei-Tong Wang2 and Chao Wang2 1Institute for Information Industry, Taiwan 2National Cheng Kung University, Taiwan IEEE Transactions on Computers, vol. 60, no. 11, November2011

  2. Outline • Introduction • Assumptions and Background • Dead-End Free Topology Maintenance (DFTM) Protocol • Discussions and Analysis • Experimental Results • Conclusion

  3. Introduction • Topology management schemes have emerged as a promising strategy • for prolonging the lifetimes of wireless sensor networks. • Several schemes construct a virtual communication backbone • by turning off redundant sensor nodes. • a connected dominating set (CDS)

  4. Introduction • The CDS is constructed in such a way • Each node is either a member of the subset or is a neighbor of one of the nodes in the subset. S D

  5. Introduction • Dead-End Node Problem • This paper proposes a topology maintenance scheme • for the construction of dead-end free topologies in WSNs.

  6. Assumptions and Background • There are many stationary sensors distributed over the monitoring region. • The network is assumed to be sufficiently dense to construct a dead-end free topology. • Each sensor can be in either an active mode or a sleep mode. • Each sensor knows both its own and all its neighbors’ coordinates.

  7. DFTM Scheme • Dead-End Free Verification • Dead-End Free Topology Construction • Dead-End Free Topology Maintenance

  8. Dead-End Free Verification • Global Dead-End Free (GDF) Condition • The dead-end situation does not occur at any node in the network • Local Dead-End Free (LDF) Condition Node Nsatisfies the LDF condition. Node Ndoes not satisfy the LDF condition. N A Transmission range Sleeping neighbors Active neighbors

  9. Dead-End Free Topology Construction Active Neighbor Set (ANS) F A B C C E N A Tentative Neighbor Set (TNS) D E F D Transmission range B Sleeping neighbors Node Ndoes not satisfy the LDF condition. Active neighbors Undecided neighbors Active Node Selection Algorithm

  10. Dead-End Free Topology Construction Active Neighbor Set (ANS) F F A B C F C E N A Tentative Neighbor Set (TNS) D E D Transmission range B Sleeping neighbors Active neighbors Undecided neighbors

  11. Active Node Selection Algorithm • Ruled • The distance between the candidate node and the initiator F F C E N A D B

  12. Active Node Selection Algorithm • Rules • The length of the new covered segment F F C N E A D B

  13. Active Node Selection Algorithm • Preference weighting rules ruled i: initiator r: the node’s transmission range ncsa: the length of the new covered segment of node a : the distance from node i to node a

  14. Dead-End Free Topology Maintenance • Global Topology Maintenance • For energy balancing • All nodes change modes to undecided every Tglobal seconds. • The sink node randomly chooses a node to be the initiator. • Every node has an equal probability of becoming an active node.

  15. Dead-End Free Topology Maintenance • Local Topology Maintenance • Some of the active nodes may suddenly become unavailable. F C E E N A D B

  16. Discussions and Analysis • Discussions • Lemma 1. A network topology is fully connected if it satisfies the Global Dead-End Free (GDF) condition. • Theorem 1. A network topology constructed by the proposed DFTM scheme is fully connected.

  17. Discussions and Analysis • Analysis • The total number of active nodes required in GAF and DFTM. GAF

  18. Discussions and Analysis • Analysis • The total number of active nodes required in GAF and DFTM. DFTM – Best Case

  19. Discussions and Analysis • Analysis • The total number of active nodes required in GAF and DFTM. DFTM – Worst Case

  20. Discussions and Analysis • Analysis • The total number of active nodes required in GAF and DFTM. d

  21. Experimental Results • ns2 Simulator • 50, 75, or 100 static nodes were randomly distributed within a sensing area measuring 60*30 m. • Transmission range of each node: 15 m. • Comparisons: GPSR, GAF and SPAN • The length of each GAF square was set to m. • SPAN: backbone infrastructure

  22. Number of Active Nodes 75 nodes 50 nodes 100 nodes

  23. Number of Survived Nodes 75 nodes 50 nodes 100 nodes

  24. Packet Delivery Ratio 75 nodes 50 nodes 100 nodes

  25. Energy Consumption and Path Length

  26. Comparison for Dead-End Occurrence 100 nodes 50 nodes

  27. Conclusion • This paper presented a distributed dead-end free topology maintenance protocol, namely DFTM. • DFTM can be integrated with any geographic routing • Low energy consumption • A minimum number of dead-end events • The performance of DFTM has been benchmarked against that of GAF and SPAN using the ns2 simulator.

  28. Thank You ~

More Related