802.15.5 mesh topology
1 like2,387 views
The document discusses IEEE 802.15.5 mesh topologies, including the goals of developing mesh standards. It describes key features of mesh networks like easier configuration, discovery, power saving, and routing. It explains terms like mesh coordinator, coordinator, and end device. It also provides overviews of low-rate and high-rate mesh networks, addressing and routing techniques, and potential applications of mesh technologies.
802.15.5 mesh topology
- 1. 802.15.5 MESH TOPOLOGY Y SUNIL RAJ KUMAR MTECH ECE, REG NO 14043029 DEPT OF ELECTRONICS ENGINEERING, PONDICHERRY UNIVERSITY
- 2. Goal of mesh topology • The purpose of developing IEEE 802.15.5 is to “provide the architectural framework enabling WPAN devices to promote interoperable, stable, and scalable wireless mesh topologies and, if needed, to provide the amendment text to the current WPAN standards that is required to implement this recommended practice.” 11/04/15 Dept of electronics engineering, Pondicherry University 2
- 3. FEATURES • Easier network configuration, • Node discovery, • Multicast, • Reliable broadcast, • Synchronized and unsynchronized operations, • Power saving (ON/OFF scheduling strategy) route tracing. 11/04/15 Dept of electronics engineering, Pondicherry University 3
- 4. 11/04/15 Dept of electronics engineering, Pondicherry University 4
- 5. TERMS DESCRIPTIONS • Mesh coordinator: An entity that manages the mesh network. It refers to the root of the logical tree of a mesh network whose tree level equals zero. • Coordinator: A device that is capable of relaying data frames for other devices. • End device: A device that is not capable of relaying data frames for other devices. 11/04/15 Dept of electronics engineering, Pondicherry University 5
- 6. Mesh frame format OCTAETS 12 MESH FRAME PAYLOAD MESH HEADER 11/04/15 Dept of electronics engineering, Pondicherry University 6 1 2 1 1 2 2 2 1 TTL MESH SEQUUEN CE NUMBER DESTI NATIO N ID SOURCE ID DESTIN ATION TREEID SOURCE TREEID MESH ID MESH FRAME CONTROL MESH HEADER
- 7. OPERATIONAL OVERVIEW 11/04/15 Dept of electronics engineering, Pondicherry University 7 802.15.5 Low-rate WPAN mesh High-rate WPAN mesh
- 8. HIGH RATE MESH OVER 802.15.3B MAC LOW RATE MESH OVER 802.15.4 MAC 11/04/15 Dept of electronics engineering, Pondicherry University 8
- 9. Challenges of LR WPAN Mesh • Reliable • Large Scale • Low Duty Cycle • Resource Limited • Mostly Battery-Powered • Simplicity yet Robustness • Self-Configuration and Self-Healing 11/04/15 Dept of electronics engineering, Pondicherry University 9
- 10. 11/04/15 Dept of electronics engineering, Pondicherry University 10 The reference model for low-rate WPAN mesh
- 11. Tree Formation and Addressing In a LR-WPAN mesh network, a tree is formed for both addressing and routing purposes. • Adaptive Tree (AT) a. Initialization Phase b. Operation Phase • Meshed Adaptive Tree (MAT) 11/04/15 Dept of electronics engineering, Pondicherry University 11
- 12. Adaptive Tree Formation Initialization Phase • Stage 1: Association • Stage 2: Reporting number of children • Stage 3: Address assignment a. An AT is formed. b. Additional addresses can be reserved 11/04/15 Dept of electronics engineering, Pondicherry University 12
- 13. Adaptive Tree Formation Operation Phase • Normal data transmissions i.Look at the address blocks for the destination address and route the packet accordingly. ii.If not found, route through parent • Nodes are still allowed to join the network 11/04/15 Dept of electronics engineering, Pondicherry University 13
- 14. Meshed AT Formation • Neighbors treat each other as a child. • Advantages I. Shorter paths II.Elimination of SPOFs 11/04/15 Dept of electronics engineering, Pondicherry University 14
- 15. Unicast Routing • Meshed Adaptive Tree I.Provides the basic functions of routing. II.Immediately available after MAT is formed. • Distributed Link State I.More efficient routing can be achieved. II.Requires exchange of neighbor information. III.Note global link state information is NOT needed 11/04/15 Dept of electronics engineering, Pondicherry University 15
- 16. Unicast Routing –Summary • Simplicity I.No route discovery. II.No route repair. • Adaptive Address Assignment (AAA) I.avoiding “running out of addresses” problem. 11/04/15 Dept of electronics engineering, Pondicherry University 16
- 17. • Meshed AT (MAT) i.shorter path. ii.Robustness. • Distributed Link State i.Scalability ii.multiple paths iii. robustness iv.shorter path 11/04/15 Dept of electronics engineering, Pondicherry University 17
- 18. Multicast Routing • This multicast routing proposal is based on the Adaptive Tree protocol for the unicast routing. • The Adaptive Tree (AT) algorithm constructs a shared tree which spans all the nodes in a WPAN mesh network. • Our goal is to find a minimum sub-tree of the Adaptive Tree which covers all multicast members within each multicast group. 11/04/15 Dept of electronics engineering, Pondicherry University 18
- 19. IEEE 802.15.5-HR • Layer architecture. • Network architecture. • Super frame architecture Single. 11/04/15 Dept of electronics engineering, Pondicherry University 19
- 20. 11/04/15 Dept of electronics engineering, Pondicherry University 20
- 21. The reference model for high-rate WPAN mesh 11/04/15 Dept of electronics engineering, Pondicherry University 21
- 22. High Rate Mesh Service Support WPS • Network Setup • Tree Topology Discovery • ID Assignment • Neighborhood-based Wireless Path Selection • Tree-based Wireless Path Selection • Centralized Wireless Path Selection 11/04/15 Dept of electronics engineering, Pondicherry University 22
- 23. Network Setup • Mesh Coordinator (MC) initializes the mesh network • Regularly announces mesh capability in its beacon • New MPN Cs scan for beacons • MPNCs choose free time to send beacons 11/04/15 Dept of electronics engineering, Pondicherry University 23
- 24. Tree Topology Discovery 11/04/15 Dept of electronics engineering, Pondicherry University 24 • Each Mesh Pico net Controller (MPNC)belonging to the tree i.Waits for descendant report(s) from its children. ii.Estimates the number of own descendants. iii.Reports number of descendants to parent. • Process is repeated upon i.Topology discovery request from MC
- 25. ID Assignment • After receiving topology update frames from all children i.MC reserves a block of IDs. ii.Assigns intervals of IDs to children. iii.Size of interval is proportional to reported number of children. • MPNC receives an ID block. • MPNC assigns ID to himself and its DEVs 11/04/15 Dept of electronics engineering, Pondicherry University 25
- 26. APPLICATIONS Multimedia home network 11/04/15 Dept of electronics engineering, Pondicherry University 26
- 27. Interconnection among PC and peripherals 11/04/15 Dept of electronics engineering, Pondicherry University 27
- 28. • Interconnection among handheld devices • Automation and Control • Etc…. 11/04/15 Dept of electronics engineering, Pondicherry University 28
- 29. 11/04/15 Dept of electronics engineering, Pondicherry University 29