1 / 15

Tree-Based Self-Initialization with Unique ID Assignment for Sensor Networks

Tree-Based Self-Initialization with Unique ID Assignment for Sensor Networks. By: ElMoustapha Ould-Ahmed-Vall For: ECE 8020 B Instructor: Gail Palmer April 7, 2005. Outline. Introduction: Sensor Network Motivation: Unique ID Assignment Proposed Algorithm Theoretical Analysis Future Work.

shaylee
Télécharger la présentation

Tree-Based Self-Initialization with Unique ID Assignment for 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. Tree-Based Self-Initialization with Unique ID Assignment for Sensor Networks By: ElMoustapha Ould-Ahmed-Vall For: ECE 8020 B Instructor: Gail Palmer April 7, 2005

  2. Outline • Introduction: Sensor Network • Motivation: Unique ID Assignment • Proposed Algorithm • Theoretical Analysis • Future Work

  3. Introduction: Sensor Networks • Sensor Network (SN): A set of smart sensor nodes • Properties: • Powered by batteries • Deployed in hard to reach environments • Importance of energy saving and lifetime maximization

  4. Motivation: Unique Identification • Identification of the destination node for unicast packets • Impossibility of hard-coding unique IDs • Cost and difficulty of a solution with global identifiers at manufacturing • Security applications

  5. Unique ID Assignment Algorithm • Assumptions • Phase 1: Temporary ID assignment and tree-building • Phase 2: Collection of sub-tree sizes • Phase 3: Final short ID assignment

  6. Phase 1: Temporary ID Assignment and Tree-Building • Assignment of long temporary ID • Operation in a hierarchical manner from root to leaves • Assignment of one-hop integer IDs • Building of a tree structure • Communication in a reliable way

  7. Initialization message Four-byte ID message One-byte ID message Confirmation message Phase 1: Temporary ID Assignment and Tree-Building (2) Figure 1: Phase 1 message exchange. Child Node Parent Node TempID: 0.10.8 TempID: 0.10.8.1

  8. Phase 2: Sub-Tree Sizes Collection • Collection of sub-tree sizes • Hierarchical operation from leaves to root • Determination of required number of bytes • Communication in a reliable way

  9. Size message Confirmation message Size message Confirmation message Size message Confirmation message Phase 2: Sub-Tree Sizes Collection (2) Figure 2: Phase 2 message exchange. TempID: 0.10.8.1 Size: 120 TempID: 0.10 TempID: 0.10.8 Size: 955 Size: 121 Size: 1 Size: 1200 Size: 245 TempID: 0.10.8.2 Size: 124

  10. Phase 3: Final ID Assignment • Assignment of final short IDs • Hierarchical operation from root to leaves • Parallel execution • Communication in a reliable way

  11. Final ID message Confirmation message Final ID message Confirmation message Final ID message Confirmation message Phase 3: Final ID Assignment (2) Figure 3: Phase 3 message exchange. TempID: 0.10.8.1 Size: 120 FinID: 1056 TempID: 0.10 TempID: 0.10.8 Size: 1200 Final ID: 101 Size: 245 FinID: 1056 TempID: 0.10.8.2 Size: 124 FinID: 1056

  12. Collision Handling • Prevention: random scheduling of sending • Detection: implicit and explicit message confirmation • Recovery: retransmission of lost messages

  13. Algorithm Properties • Correctness • Termination • Collision probability • Leaving out a node • Energy consumption

  14. Future Work • Simulation tests • Experimental tests • Extension to dynamic sensor networks • Expected completion: en of April 2005

  15. Conclusion • Solution to the problem of unique ID assignment • Properties of the proposed algorithm • Future extension to the case of dynamic sensor networks

More Related