Energy optimization for mobile nodes in a cluster tree IEEE 802.15.4/ZigBee network

2012 ◽  
Author(s):  
Chiraz Chaabane ◽  
Alain Pegatoquet ◽  
Michel Auguin ◽  
Maher Ben Jemaa
Keyword(s):  
Ieee 802.15.4 ◽  
Energy Optimization ◽  
Cluster Tree ◽  
Mobile Nodes ◽  
Zigbee Network

scholarly journals Collision-Free Advertisement Scheduling for IEEE 802.15.4-TSCH Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1789 ◽  
Author(s):  
Apostolos Karalis ◽  
Dimitrios Zorbas ◽  
Christos Douligeris
Keyword(s):  
Power Consumption ◽  
Ieee 802.15.4 ◽  
Mac Protocol ◽  
High Reliability ◽  
Mobile Nodes ◽  
Medium Access ◽  
Worst Case ◽  
Channel Hopping ◽  
Transmission Schedule ◽  
Scheduling Method

IEEE802.15.4-time slotted channel hopping (TSCH) is a medium access control (MAC) protocol designed to support wireless device networking, offering high reliability and low power consumption, two features that are desirable in the industrial internet of things (IIoT). The formation of an IEEE802.15.4-TSCH network relies on the periodic transmissions of network advertising frames called enhanced beacons (EB). The scheduling of EB transmissions plays a crucial role both in the joining time and in the power consumption of the nodes. The existence of collisions between EB is an important factor that negatively affects the performance. In the worst case, all the neighboring EB transmissions of a node may collide, a phenomenon which we call a full collision. Most of the EB scheduling methods that have been proposed in the literature are fully or partially based on randomness in order to create the EB transmission schedule. In this paper, we initially show that the randomness can lead to a considerable probability of collisions, and, especially, of full collisions. Subsequently, we propose a novel autonomous EB scheduling method that eliminates collisions using a simple technique that does not increase the power consumption. To the best of our knowledge, our proposed method is the first non-centralized EB scheduling method that fully eliminates collisions, and this is guaranteed even if there are mobile nodes. To evaluate our method, we compare our proposal with recent and state-of-the-art non-centralized network-advertisement scheduling methods. Our evaluation does not consider only fixed topology networks, but also networks with mobile nodes, a scenario which has not been examined before. The results of our simulations demonstrate the superiority of our method in terms of joining time and energy consumption.

Sequential Beacon Scheduling Mechanism for Cluster-Tree WSNs

2012 ◽  
Vol 263-266 ◽  
pp. 932-938
Author(s):  
Hao Ru Su ◽  
Zhi Guo Shi ◽  
Zhi Liang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ieee 802.15.4 ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Cluster Tree ◽  
Collision Problem ◽  
Interference Range ◽  
Scheduling Mechanisms ◽  
Simulation Results

To solve the beacon collision problem in IEEE 802.15.4/ZigBee cluster-tree Wireless Sensor Networks, we proposed a Sequential Beacon Scheduling (SBS) mechanism. In this mechanism, the Cluster Headers (CHs) choose the beacon transmission time in a certain order. The CH which finishes the sequence chosen sends out control frame to inform other CHs in its interference range. The simulation results indicate that SBS general has better delivery ratio, latency, and throughput than three other beacon scheduling mechanisms.

Sign in / Sign up

Export Citation Format

Share Document