Testbed Experimentation of a Meshed Tree Routing with Local Link State for Wireless PAN Mesh
Rui Zhang, Taerim Park, M.J. Lee, Hye Soo Jung, J. Ryu · 2008
This paper focus on the testbed experimentation of a meshed tree routing algorithm with local link state for wireless personal area networks (WPANs) based on current IEEE 802.15.4 MAC and PHY. The meshed tree uses a block addressing scheme based on tree structure and local link state information for mesh routing. Our approach exploits the information from the global tree structure for the direction of packet forwarding and local link state for choosing the next hop toward the destination. It has two prominent features: scalability and fault tolerance. Each node maintains a local link state of k-hop(usually 2-hop) information regardless of network size, which makes the approach scalable. Being a mesh, our approach shows good fault tolerance and load balancing. Testbed experiments show that the meshed tree displays superior performance when compared with AODV and a tree based algorithm. Comparisons were made with respect to packet deliver ratio, energy consumption and memory usage. The proposed algorithm is being considered as the routing algorithm for IEEE 802.15.5 WPANMesh standard.