Process Scheduling Policy Based on Rechargeable Power Resource in Wireless Sensor Networks

2006 ◽  
pp. 405-409
Author(s):  
Young-Mi Song ◽  
Kyung-chul Ko ◽  
Byoung-Hoon Lee ◽  
Jai-Hoon Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Process Scheduling ◽  
Power Resource ◽  
Scheduling Policy

Exploitation of the EDF Scheduling in the Wireless Sensors Networks

2013 ◽  
pp. 87-100
Author(s):  
Rym Chéour ◽  
Sébastien Bilavarn ◽  
Mohamed Abid
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Management Policy ◽  
Wireless Sensor ◽  
Periodic Tasks ◽  
Real Time Scheduling ◽  
Scheduling Policy ◽  
Time Scheduling ◽  
Earliest Deadline

Today, due to recent advances in wireless technology, new products using wireless sensor networks are being employed. However, despite the excitement surrounding wireless sensor networks, it is not immune to the problem of energy consumption. To overcome this deficiency and enhance the real time aspect, a growing interest lies in the implementation of an “Earliest Deadline First” (EDF) scheduler. Thus, in this paper, the authors establish a management policy of periodic tasks that is preemptive, multiprocessor, and dynamic. The authors implement a real-time scheduling policy as a part of a user-level threads package under the Linux operating system as Linux does not support EDF. Furthermore, this paper describes the technique of the EDF scheduler and how it can yield to significant power savings.

Hierarchical Clustering-Task Scheduling Policy in Cluster-Based Wireless Sensor Networks

2018 ◽  
Vol 14 (5) ◽  
pp. 1876-1886 ◽  
Author(s):  
Peyman Neamatollahi ◽  
Saeid Abrishami ◽  
Mahmoud Naghibzadeh ◽  
Mohammad Hossein Yaghmaee Moghaddam ◽  
Ossama Younis
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hierarchical Clustering ◽  
Task Scheduling ◽  
Wireless Sensor ◽  
Scheduling Policy

scholarly journals Throughput-Guaranteed Distributed Channel Assignment and Scheduling Algorithms with Low Complexity for Multichannel Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Xinyan Xu ◽  
Fan Zhang ◽  
Gangqiang Yang ◽  
Liguo Xie ◽  
Qing Liu ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Channel Assignment ◽  
Random Access ◽  
Low Complexity ◽  
Throughput Capacity ◽  
Wireless Sensor ◽  
Capacity Region ◽  
Scheduling Policy ◽  
Coupled Channel

In wireless sensor networks, an improved throughput capacity region can be achieved by equipping multiple channels. However, such approach inevitably brings the issue of solving the coupled channel assignment and scheduling problem. This paper put forward a low-complexity distributed channel assignment and scheduling policy for multichannel wireless sensor networks with single-hop traffic flows, named LDCS, as well as its multihop multipath extension. Under the proposed algorithms, random access and backoff time techniques are introduced to keep the complexity low and independent of the number of links and channels. Through theoretical analysis and simulation experiments, it is proved that the proposed algorithms are throughput guaranteed, and in some network scenarios, the achieved capacity region can be larger than that of other comparable distributed algorithms.

Exploitation of the EDF Scheduling in the Wireless Sensors Networks

2011 ◽  
Vol 1 (2) ◽  
pp. 14-27 ◽  
Author(s):  
Rym Chéour ◽  
Sébastien Bilavarn ◽  
Mohamed Abid
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Management Policy ◽  
Wireless Sensor ◽  
Periodic Tasks ◽  
Real Time Scheduling ◽  
Scheduling Policy ◽  
Time Scheduling ◽  
Earliest Deadline

Today, due to recent advances in wireless technology, new products using wireless sensor networks are being employed. However, despite the excitement surrounding wireless sensor networks, it is not immune to the problem of energy consumption. To overcome this deficiency and enhance the real time aspect, a growing interest lies in the implementation of an “Earliest Deadline First” (EDF) scheduler. Thus, in this paper, the authors establish a management policy of periodic tasks that is preemptive, multiprocessor, and dynamic. The authors implement a real-time scheduling policy as a part of a user-level threads package under the Linux operating system as Linux does not support EDF. Furthermore, this paper describes the technique of the EDF scheduler and how it can yield to significant power savings.

scholarly journals Self-Learning-Based Data Aggregation Scheduling Policy in Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Yao Lu ◽  
Taihua Zhang ◽  
Erbao He ◽  
Ioan-Sorin Comşa
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
High Efficiency ◽  
Mac Protocol ◽  
Global Network ◽  
Wireless Sensor ◽  
Optimal Sequence ◽  
Scheduling Policy ◽  
Slot Scheduling ◽  
Self Learning

The problems of reducing the transmission delay and maximizing the sensor lifetime are always hot research topics in the domain of wireless sensor networks (WSNs). By excluding the influence of routing protocol on the transmission direction of data packets, the MAC protocol which controls the time point of transmission and reception is also an important factor on the communication performance. Many existing works attempt to address these problems by using time slot scheduling policy. However, most of them exploit the global network knowledge to construct a stationary scheduling, which violates the dynamic and scalable nature of WSNs. In order to realize the distributed computation and self-learning, we propose to integrate the Q-learning into the exploring process of an adaptive slot scheduling with high efficiency. Due to the convergence nature, the scheduling quickly approaches an approximate optimal sequence along with the execution of frames. By conducting the corresponding simulations, the feasibility and the high efficiency of the proposed method can be validated.

Sign in / Sign up

Export Citation Format

Share Document