By Topic

Time slot schedule based minimum delay graph in TDMA supported wireless industrial system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yonghoon Chung ; Dept. of Comput. Eng., Ajou Univ., Suwon, South Korea ; Ki-Hyung Kim ; Seung-wha Yoo

The graph routing is one of routing methods which is used in the wireless industrial automation system. It is also one of the main components in the ISA100.11a standard. However, the graph generating rule is not specified in this standard. The ISA advises to define the graph generation method after considering the reliability services for each industrial system environment. This paper proposes the graph generation method by considering the schedule of time slot in superframe. Our method communicates quickly from the source to the destination in ISA100.11a network without reducing network reliability. With our defined approach, we can make the monitoring system much more efficient which can help in fire detection, prevention of crime etc. We have analyzed end-to-end and round-trip delay time with the help of Qualnet 5.0 simulations and some case studies. We have also considered the topology of a network and time slots. We prove that network delay is much less in our proposed algorithm as compared to other methods.

Published in:

Computer Information Systems and Industrial Management Applications (CISIM), 2010 International Conference on

Date of Conference:

8-10 Oct. 2010