ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Testbed Experimentation of a Meshed Tree Routing with Local Link State for Wireless PAN Mesh
Cited 9 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
Rui Zhang, Tae Rim Park, Tae Rim Park, Myung J. Lee, 정하경, 류재홍
발행일
200805
출처
International Conference on Communications (ICC) 2008, pp.3060-3065
DOI
https://dx.doi.org/10.1109/ICC.2008.576
협약과제
08MC3700, QoS 및 확장성지원(S-MoRe) 센서네트워크 고도화 기술개발 (표준화연계), 채종석
초록
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 WPAN Mesh standard. ©2008 IEEE.
KSP 제안 키워드
Fault tolerance, IEEE 802.15.4 MAC, Link state, Load balancing, Mesh routing, Packet Forwarding, State information, Testbed experimentation, Tree-based, Wireless personal area network(WPAN), each node