Guaranteeing Real-Time Services for Industrial Wireless Sensor Networks With IEEE 802.15.4

Industrial applications of wireless sensor networks require timeliness in exchanging messages among nodes. Although IEEE 802.15.4 provides a superframe structure for real-time communication, a real-time message-scheduling algorithm is still required to schedule a large number of real-time messages t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on industrial electronics (1982) Ročník 57; číslo 11; s. 3868 - 3876
Hlavní autoři: Yoo, Seong-eun, Chong, Poh Kit, Kim, Daeyoung, Doh, Yoonmee, Pham, Minh-Long, Choi, Eunchang, Huh, Jaedoo
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:0278-0046, 1557-9948
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Industrial applications of wireless sensor networks require timeliness in exchanging messages among nodes. Although IEEE 802.15.4 provides a superframe structure for real-time communication, a real-time message-scheduling algorithm is still required to schedule a large number of real-time messages to meet their timing constraints. We propose a distance-constrained real-time offline message-scheduling algorithm which generates the standard specific parameters such as beacon order, superframe order, and guaranteed-time-slot information and allocates each periodic real-time message to superframe slots for a given message set. The proposed scheduling algorithm is evaluated and analyzed extensively through simulations. In addition, a guaranteed time service is implemented in a typical industrial sensor node platform with a well-known IEEE 802.15.4-compliant transceiver CC2420 and ATmega128L to verify the feasibility of the guaranteed time service with the schedule generated by the proposed scheduling algorithm. Through experiments, we prove that the real system runs accurately according to the schedule calculated by the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0278-0046
1557-9948
DOI:10.1109/TIE.2010.2040630