<month year> September 2012 Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Introduction to 15.5 Low Rate WPAN Mesh] Date Submitted: [September 18, 2012] Source: [ Myung Lee] Company [CUNY] Address [Electrical & Computer Engineering, City University of New York, New York, NY 10031, USA] Voice:[+1-212-650-7260], FAX: [+1-212-650-8249], E-Mail:[lee@ccny.cuny.edu] Re: [] Abstract: [Introduction to 15.5 Low Rate WPAN Mesh] Purpose: [This presentation is provided to help the discussion for L2R group] Notice: This document has been prepared to assist the IEEE P802.15. It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release: The contributor acknowledges and accepts that this contribution becomes the property of IEEE and may be made publicly available by P802.15. Myung Lee @ CUNY Myung Lee @ CUNY

Introduction to 15.5 Low-Rate WPAN Mesh <month year> September 2012 Introduction to 15.5 Low-Rate WPAN Mesh Myung Lee CUNY Myung Lee @ CUNY Myung Lee @ CUNY

WPAN Mesh Networking November 2006 Mesh/Network Coordinator End Device Coordinator Mesh/Network Coordinator Mesh Link Star Link IEEE802.15.5 TG

November 2006 Purpose of the project This project facilitates wireless mesh topologies optimized for IEEE 802.15 WPANs. -Extension of network coverage without increasing transmit power or receive sensitivity -Enhanced reliability via route redundancy -Easier network configuration -Better device battery life due to fewer retransmissions IEEE802.15.5 TG

November 2006 Scope of the project To provide a Recommended Practice to provide the architectural framework enabling WPAN devices to promote interoperable, stable, and scaleable wireless mesh topologies. Including mesh support for both High-Rate and low-rate WPANs. High Rate Mesh over 802.15.3b MAC Low Rate Mesh over 802.15.4b MAC IEEE802.15.5 TG

LR-WPAN Reference Model In order not to change the existing implementations of SSCS and MAC, we need to make these two interfaces identical. SSCS: Service Specific convergence sublayer MCPS: MAC Common Part Sublayer MLME: MAC sublayer Managmenet Entity

Challenge for design Scalability Reliability Lightweight Distributed capability to support large scale network Reliability Redundancy is needed to compensate the fragile wireless node Lightweight Resource constraint Memory, battery power, processing Distributed

Functionality Mandatory functions Enhanced functions Network formation Tree formation and Addressing Establishment of Local link state information Unicast Routing Enhanced functions Multicasting Energy Saving Portability(mobility) Support Reliable Broadcast Time Synchronization

Initialization Stage 1: Association Use of 64bit IEEE address [children#][children#]=[8][6] A [beg,end,next]=[1,16,1] [beg,end,next]=[17,28,17] [5][2] [5] B J Stage 2: Reporting number of children [3,12,3] [13,16,13] [19,28,19] C H K [1][2][1] [3][1] [1] Stage 3: Address assignment Two Byte logical adrs Block address Additional adrs can be reserved. [5,6,5] [7,10,7] [11,12,11] [21,26,21] [27,28,27] [15,16,15] D E G I L O [1][1] [0] [0] [1] [0] [0] [23,24,23] [25,26,25] [9,10,9] F M N [0] [0] [0]

Meshed Tree Neighbors treat each other as a child. Shorter path [8][6] [1,16,1] [17,28,17] A 0 [5][2] [5] Shorter path [3,12,3] [13,16,13] [19,28,19] B 1 J 17 [1,16,1] [17,28,17] [13,16,13] Elimination of SPOFs C H 13 [1] K [15,16,15] [17,28,17] …… D E G I L O F M N

Network Formation(Local Link state) Exchange hello messages in a k-hop local region 2 hop local information in this example Hello message: My block address and my one hop neighbor block addresses Mesh link built after the hello message exchanges Neighbor Table

Network Formation(Local Link state) Connectivity Matrix Represent the 2-hop neighbor information “+” means directly connected “-” means 2-hop away Example of J’s connectivity matrix A B J E D C I H K L O G F M N 2-hop Link State (view of node J)

Basics for Unicast Forwarding Two Cases (k-hop neighbor information) 1) The relay node has some ideas about the destination One of its neighbor A descendant A descendant of one of its neighbors 2) No idea A heuristics: Forward the packet to a node (anchor node) that has smallest sum of tree level and the hop distance from the relay node Basics for Unicast Forwarding

Pseudo-code for Unicast Routing

Routing Check anchor node Find local path Destination information based One of my neighbors Or go towards root Ex: Node E Node N [9,12,9] [25,26, 25] Find local path using connectivity matrix Example: Node E->N A [1,30,1] B J [19,30,19] [3,18,3] C H K [5,14,5] [15,18,15] [21,30,21] D E G I L O [9,12,9] [23,26,23] F M N [25,26,25]

Test-bed implementation Located in 5-th floor in Engineering Building 55 Micaz nodes, Accessible via internet. Refer to: Myung Lee, et al, “IEEE 802.15.5 WPAN Mesh Standard Low rate Part: Meshing the wireless sensor netowrks,”, IEEE Journal of Select Area of Comm(JSAC), Vol.28, No 7, September 2010.

Experimental Analysis (PDR)

Data Deliver Cost Further Reference: M. Lee, et. al, “IEEE 802.15.5 WPAN Mesh Standard-Low Rate Part: Meshing the Wireless Sensor networks,” IEEE Journal of Select Area of Comm (JSAC), Vol 28, No. 7. 2010