70 likes | 134 Views
Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Status Update on the High-Rate Editing Progress] Date Submitted: [16 Sep., 2007] Source: [Youngae Jeon, Sung-Woo Park, Seonghee Lee, Sangsung Choi] Company [ETRI/HNU]
E N D
Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Status Update on the High-Rate Editing Progress] Date Submitted: [16 Sep., 2007] Source: [Youngae Jeon, Sung-Woo Park, Seonghee Lee, Sangsung Choi] Company [ETRI/HNU] Address [161, Gajeong-dong, Youseong-gu, Daejeon, Korea] Voice: [+82-42-860-1564], FAX: [+82-42-860-5218], E-Mail: [yajeon@etri.re.kr, swpark@hnu.kr, slee003@etri.re.kr, sschoi@etri.re.kr] Abstract: [This document proposes modifications to mesh routing for the HR-WPAN] Purpose: [This document is submitted for consideration for revisions to the IEEE 802.15.5 draft recommended practice] 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.
Comment • The concept of partial and multiple topology server needsbe described in more detail
Suggested Remedy • Combine the subclause 6.5.2.5 into the subclause 6.5.2.2 and 6.5.2.3
Resolution (1) • 6.5.2.1 Topology server • Allow every MPNC to serve as a local topology server, which provides the optimal route between two any source-destination pairs on the subtree consisting of its descendant MPNCs only • 6.5.2.2 Link state registration • Register link state information at the ancestor MPNCs • A link cost table constructed at each MPNC • Update the routing table by Dijkstra’s algorithm • 6.5.2.3 Route establishment • Optimal route is provided by the common ancestor which is closest to both the source and destination MPNCs • Route discovery/notification/formation
Resolution (2) • Some options • Not all MPNCs necessarily operate as topology servers • The depth of subtree may be set to a certain value to limit the amount of link state information maintained by the MPNC
Examples Server routing with the aid of MC Server routing without the aid of MC