MILCOM 2007 - IEEE Military Communications Conference 2007
DOI: 10.1109/milcom.2007.4455149
|View full text |Cite
|
Sign up to set email alerts
|

On Scheduling Guaranteed Time Slots for Time Sensitive Transactions in IEEE 802.15.4 Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 3 publications
0
11
0
Order By: Relevance
“…Research by Mishra et al [8] provides a scheduling model that attempts to meet the delay constraints of timesensitive transactions. Time constraints meet ratio (TMR) was introduced and the on-line scheduling algorithm using a mathematical model proves to work with aperiodic and periodic messages even in overload conditions.…”
Section: Related Workmentioning
confidence: 99%
“…Research by Mishra et al [8] provides a scheduling model that attempts to meet the delay constraints of timesensitive transactions. Time constraints meet ratio (TMR) was introduced and the on-line scheduling algorithm using a mathematical model proves to work with aperiodic and periodic messages even in overload conditions.…”
Section: Related Workmentioning
confidence: 99%
“…The network is exemplified by a full-duplex communication channel where each communication direction works at an individual bit rate due to the asymmetric properties characterizing wireless communication networks. The general concept, however, constitutes a generic framework that can be adapted to wireless networks with a deterministic MAC protocol (such as a time-division multiple access (TDMA)-based protocols [23]- [25]). Such adaptations are out of the scope of this paper and are planned future work.…”
Section: Framework Overviewmentioning
confidence: 99%
“…The second constraint, introduced by [28], [29], and generalized by [30], was added in order to be able to insure the continued feasibility of the traffic allocation even in case a new traffic flow is added. The constraint demands that (25) Unfortunately, this constraint introduces a high amount of computational complexity into the feasibility analysis and therefore does not lend itself to calculation particularly well. However, in [31] a way of reducing the time and memory complexity is presented.…”
Section: Real-time Scheduling Analysismentioning
confidence: 99%
“…Unlike non beacon-enabled mode, the beacon-enabled mode in a 802.15.4 network employs a few end device nodes and a centralized node (i.e., personal area network (PAN) coordinator) which broadcasts beacons to synchronize the nodes in the network, manages guaranteed timeslots (GTS) (de)allocation requests from the nodes, and assigns dedicated slots for transmissions of the nodes through beacons. The beacon broadcast and GTS management scheme are the most critical parts of real-time delivery of time-sensitive data during the contention free period (CFP) [2][3][4][5][6][7]. Many researchers have focused on improving the performance or energy efficiency of beacon-enabled 802.…”
Section: Introductionmentioning
confidence: 99%