Abstract:
Industrial wireless mesh networks are deployed in harsh and noisy environments for process measurement and control applications. Compared with wireless community networks...Show MoreMetadata
Abstract:
Industrial wireless mesh networks are deployed in harsh and noisy environments for process measurement and control applications. Compared with wireless community networks, they have more stringent requirements on communication reliability and real-time performance. Missing or delaying of the process data by the network may severely degrade the overall control performance. In this paper, we abstract the primary reliability requirements in typical industrial wireless mesh networks and define three types of reliable routing graphs for different communication purposes. We present efficient algorithms to construct them and describe the recovery mechanisms in the event of component failures. Based on these graphs, data link layer communication schedules are generated to achieve end-to-end real-time performance. We demonstrate through extensive experimental results that our algorithms can achieve highly reliable routing, improved communication latency and stable real-time communication in large-scale networks at the cost of modest overhead in device configuration.
Date of Conference: 11-14 April 2011
Date Added to IEEE Xplore: 12 May 2011
Print ISBN:978-1-61284-326-1
Print ISSN: 1545-3421
References is not available for this document.
Contents Select All
1.
A. Willig, “Recent and emerging topics in wireless industrial communications: A selection,” IEEE Trans. on Industrial Informatics, 2007.
2.
D. Caro, Wireless Networks for Industrial Automation, ISA Press, 2004.
3.
J. Song, S. Han, A. K. Mok, D. Chen, M. Lucas, M. Nixon, and W. Pratt, “WirelessHART: Applying wireless technology in real-time industrial process control,” in RTAS, 2008.
4.
R. Alur, A. DInnocenzo, K. H. Johansson, G. J. Pappas, and G. Weiss, “Modeling and analysis of multi-hop control networks,” in RTAS, 2009.
5.
G. Weiss, R. Alur, A. J. Isaksson, and K. H. Johansson, “Scalable scheduling algorithms for wireless networked control systems,” in CASE, 2009.
6.
“ISA,” http://www.isa.org/.
7.
“HART communication,” http://www.hartcomm.org.
8.
“ZigBee Alliance,” http://www.zigbee.org.
9.
“WirelessHART,” http://www.hartcomm.org/protocol/wihart/wireless_technology.html.
10.
G. Fiore, V. Ercoli, A. J. Isaksson, K. Landernäs, and Maria D. Di B., “Multihop multi-channel scheduling for wireless control in WirelessHART networks,” in ETFA, 2009.
11.
A. Saifulah, C. Lu, Y. Xu, and Y. Chen, “Real-time scheduling for WirelessHART networks,” in RTSS, 2010.
12.
P. Soldati, H. Zhang, and M. Johansson, “Deadline-constrained transmission scheduling and data evacuation in wirelesshart networks,” in Technical Report TRITA-EE 2008:060, 2008.
13.
H. Zhang, P. Soldati, and M. Johansson, “Optimal link scheduling and channel assignment for convergecast in linear wirelesshart networks,” in Technical Report TRITA-EE 2009:018, 2009.
14.
S. Han, X. Zhu, D. Chen, A. K. Mok, and M. Nixon, “Reliable and real-time communication in industrial wireless mesh networks,” UTCS Technical Report #TR-10–34. www.CS.utexas.edu/forms/tech_reports/reports/tr/TR-1994.pdf.
15.
M. Medard, S.G. Finn, R.A. Barry, and R.G. Gallager, “Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs,” IEEE/ACM Transactions on Networking, vol. 7, no. 5, 1999.
16.
S. Mueller, R. Tsang, and D. Ghosal, “Multipath routing in mobile ad hoc networks: Issues and challenges,” Performance Tools and Applications to Networked Systems, 2004.
17.
M. Tariquea, K. E. Tepeb, S. Adibic, and S. Erfanib, “Survey of multipath routing protocols for mobile ad hoc networks,” Journal of Network and Computer Applications, vol. 32, no. 6, 2009.
18.
D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, “Highly-resilient, energy-efficient multipath routing in wireless sensor networks,” SIG-MOBILE Mob. Comput. Commun. Rev., vol. 5, no. 4, 2001.
19.
S.J. Lee and M. Gerla, “Split multipath routing with maximally disjoint paths in ad hoc networks,” in ICC, 2001.
20.
M. K. Marina and S. R. Das, “On-demand multipath distance vector routing in ad hoc networks,” in ICNP, 2001.
21.
Z. Ye, S.V. Krishnamurthy, and S.K. Tripathi, “A framework for reliable routing in mobile ad hoc networks,” in INFOCOM, 2003.
