• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Real-Time Scheduling for WirelessHART Networks

Cached

  • Download as a PDF

Download Links

  • [www.cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [web.mst.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Abusayeed Saifullah , You Xu , Chenyang Lu , Yixin Chen
Citations:48 - 21 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Saifullah_real-timescheduling,
    author = {Abusayeed Saifullah and You Xu and Chenyang Lu and Yixin Chen},
    title = {Real-Time Scheduling for WirelessHART Networks},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

WirelessHART is an open wireless sensor-actuator network standard for industrial process monitoring and control that requires real-time data communication between sensor and actuator devices. Salient features of a WirelessHART network include a centralized network management architecture, multi-channel TDMA transmission, redundant routes, and avoidance of spatial reuse of channels for enhanced reliability and real-time performance. This paper makes several key contributions to real-time transmission scheduling in WirelessHART networks: (1) formulation of the end-to-end real-time transmission scheduling problem based on the characteristics of WirelessHART; (2) proof of NP-hardness of the problem; (3) an optimal branch-and-bound scheduling algorithm based on a necessary condition for schedulability; and (4) an efficient and practical heuristic-based scheduling algorithm called Conflict-aware Least Laxity First (C-LLF). Extensive simulations based on both random topologies and real network topologies of a physical testbed demonstrate that C-LLF is highly effective in meeting end-to-end deadlines in WirelessHART networks, and significantly outperforms common real-time scheduling policies. 1

Keyphrases

wirelesshart network    real-time scheduling    end-to-end deadline    real network topology    redundant route    conflict-aware least laxity first    enhanced reliability    actuator device    physical testbed demonstrate    necessary condition    random topology    salient feature    optimal branch-and-bound    extensive simulation    spatial reuse    outperforms common real-time scheduling policy    several key contribution    practical heuristic-based scheduling algorithm    centralized network management architecture    industrial process monitoring    multi-channel tdma transmission    open wireless sensor-actuator network standard    end-to-end real-time transmission    real-time data communication    real-time transmission scheduling    real-time performance   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University