Loading...
Please wait, while we are loading the content...
Dynamic centralized scheduler for time-slotted channel hopping wireless sensor networks
| Content Provider | Semantic Scholar |
|---|---|
| Author | Naeem, Farooq |
| Copyright Year | 2016 |
| Abstract | In the increasingly evolving world of technology, communication over wireless medium has become a very popular choice. Wireless technology is gaining significant grounds in almost every field of life giving rise to very interesting applications. In the automotive industry there is a significant interest in converting the in vehicle sensors to communicate with wireless technology. This is because of some of the prominent benefits that a wireless network has over wired networks like reduction of weight, freedom from wiring as well as flexibility and ease in maintaining the sensors and the system. The same is true for other technological domains giving rise to new innovative applications in healthcare, environmental monitoring, smart homes and industries. There are several available wireless standards like Bluetooth,Wi-Fi and GSM. Apart from these IEEE 802.15.4 standard is especially designed based on the requirements of Low Rate Wireless Personal Area Networks (LR-WPAN). This standard defines the requirements of the Physical and Mac layer of the OSI model. In 2012, an amendment was made in this standard (IEEE 802.15.4e) introducing a new feature named Time-slotted and Channel Hopping (TSCH). TSCH combines time slots with channel (frequency) hopping scheme. In this way, the wireless nodes not only gain a contention free access to the wireless medium but also are secured from multi-path fading effects. Thus, in this manner wireless communication is made more reliable with reduced packet error by coping better with contention. The IEEE 802.15.4e standard only defines how a TSCH network should operate and provides the basis for the implementation. However the standard does not specify how a list of nodes should be scheduled to operate within the TSCH network. According to the standard this task is left for the upper layers of the stack to manage. This thesis work focuses on the design and implementation of a centralized TSCH scheduler. Provided a list of wireless links with source, destination and bandwidth requirements, the scheduler aims to satisfy not only the bandwidth requirements but also is able to obtain a contention free schedule, considering the wireless medium access constraints. Moreover, the designed scheduler makes use of Binomial Theorem to compute the probability for a transmission to be successful based on the network quality parameters, e.g. Packet Reception Ratio (PRR). In this way the scheduler is able to respond to run-time variations in the network communication quality and assign extra timeslots to a link in order to increase the chances of a successful transmission. The scheduler software library is designed to enable applications running on the CompSOC (Composable and Predictable Multi-Processor System on Chip) research platform to communicate through wireless medium. However, due to time limitation, the evaluation was done by running the scheduler library on a PC as a Windows based application. Furthermore, NXP JN5168 wireless dongles were used as sensor nodes for the network in the evaluation. A small Contiki OS (Real time operating system for wireless sensors) based test application was developed for the JN5168 wireless dongles. The focus of the evaluation was to observe how the scheduler responds to the changes in average PRR of the network. Further the complexity of the scheduler algorithm was computed and is of the order of O(N) where N is the total number of nodes in the network. Dynamic Centralized Scheduler for Time-Slotted Channel Hopping Wireless Sensor Networks iii |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://pure.tue.nl/ws/files/46944959/855336-1.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
