News Column

Investigators from Daegu University Report New Data on Parallel and Distributed Computing

May 28, 2014



By a News Reporter-Staff News Editor at Telecommunications Weekly -- A new study on Parallel and Distributed Computing is now available. According to news reporting out of Gyongsan, South Korea, by VerticalNews editors, research stated, "The ZigBee tree routing is widely used in many resource-limited devices and applications, since it does not require any routing table and route discovery overhead to send a packet to the destination. However, the ZigBee tree routing has the fundamental limitation that a packet follows the tree topology; thus, it cannot provide the optimal routing path."

Our news journalists obtained a quote from the research from Daegu University, "In this paper, we propose the shortcut tree routing (STR) protocol that provides the near optimal routing path as well as maintains the advantages of the ZigBee tree routing such as no route discovery overhead and low memory consumption. The main idea of the shortcut tree routing is to calculate remaining hops from an arbitrary source to the destination using the hierarchical addressing scheme in ZigBee, and each source or intermediate node forwards a packet to the neighbor node with the smallest remaining hops in its neighbor table. The shortcut tree routing is fully distributed and compatible with ZigBee standard in that it only utilizes addressing scheme and neighbor table without any changes of the specification. The mathematical analysis proves that the 1-hop neighbor information improves overall network performances by providing an efficient routing path and distributing the traffic load concentrated on the tree links."

According to the news editors, the research concluded: "In the performance evaluation, we show that the shortcut tree routing achieves the comparable performance to AODV with limited overhead of neighbor table maintenance as well as overwhelms the ZigBee tree routing in all the network conditions such as network density, network configurations, traffic type, and the network traffic."

For more information on this research see: Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks. IEEE Transactions on Parallel and Distributed Systems, 2014;25(3):706-716. IEEE Transactions on Parallel and Distributed Systems can be contacted at: Ieee Computer Soc, 10662 Los Vaqueros Circle, PO Box 3014, Los Alamitos, CA 90720-1314, USA. (Institute of Electrical and Electronics Engineers - www.ieee.org/; IEEE Transactions on Parallel and Distributed Systems - ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71)

Our news journalists report that additional information may be obtained by contacting T. Kim, Daegu Univ, Sch Comp & Commun Engn, Gyongsan 712714, Gyeongbuk, South Korea. Additional authors for this research include S.H. Kim, J. Yang, S.E. Yoo and D. Kim.

Keywords for this news article include: Asia, Gyongsan, South Korea, Wireless Network, Wireless Technology, Parallel and Distributed Computing

Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC


For more stories covering the world of technology, please see HispanicBusiness' Tech Channel



Source: Telecommunications Weekly


Story Tools






HispanicBusiness.com Facebook Linkedin Twitter RSS Feed Email Alerts & Newsletters