scholarly journals A dynamic priority assignment technique for streams with (m, k)-firm deadlines

1995 ◽  
Vol 44 (12) ◽  
pp. 1443-1451 ◽  
Author(s):  
M. Hamdaoui ◽  
P. Ramanathan
Keyword(s):  
Priority Assignment ◽  
Dynamic Priority ◽  
Firm Deadlines

scholarly journals Guaranteed Dynamic Priority Assignment Schemes for Real-Time Tasks with (m, k)-Firm Deadlines

ETRI Journal ◽  
2010 ◽  
Vol 32 (3) ◽  
pp. 422-429 ◽  
Author(s):  
Hyeonjoong Cho ◽  
Yongwha Chung ◽  
Daihee Park
Keyword(s):  
Real Time ◽  
Priority Assignment ◽  
Dynamic Priority ◽  
Firm Deadlines

Heterogeneous Dynamic Priority Scheduling in Time Critical Applications

2012 ◽  
Vol 2 (2) ◽  
pp. 47-54
Author(s):  
Arvind Viswanathan ◽  
Garimella Rama Murthy ◽  
Naveen Chilamkurti
Keyword(s):  
Cognitive Radio ◽  
Cluster Head ◽  
Primary User ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Priority Assignment ◽  
Dynamic Priority ◽  
Time Critical ◽  
Unlicensed Band

In the unlicensed band, the notion of primary user and secondary user (To implement cognitive radio) is not explicit. By dynamic priority assignment the authors propose to implement cognitive radio in the unlicensed band. In time critical events, the data which is most important, has to be given the time slots. Wireless Sensor nodes in the authors’ case are considered to be mobile, and hence make it difficult to prioritize one over another. A node may be out of the reach of the cluster head or base station by the time it is allotted a time slot and hence mobility is a constraint. With the data changing dynamically and factors such as energy and mobility, which are major constraints, assigning priority to the nodes becomes difficult. In this paper, the authors have discussed about how Wireless Sensor Networks are able to allocate priorities to nodes in the unlicensed band with multiple parameters being posed. They have done simulations on NS-2 and have shown the implementation results.

Sign in / Sign up

Export Citation Format

Share Document