Numerical transient analysis of Markov models
Computers and Operations Research
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks
Wireless Networks
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
MAMSolver: A Matrix Analytic Methods Tool
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Z-MAC: a hybrid MAC for wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
PEDAMACS: Power Efficient and Delay Aware Medium Access Protocol for Sensor Networks
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
This paper presents an analytical framework for evaluating a tradeoff between the schedule information freshness and the energy consumption in a TDMA environment. In practice, we investigate the importance of the speed of schedules updating in a totally distributed TDMA MAC protocol. In order to do that, we developed an analytical framework based on Markov chain that permits to measure a tradeoff between the cost associated with the update process and the freshness of information. The power consumption associated with the schedule updating process and the speed of the schedule updating process are considered as two antagonis QoS parameters. The main objective of this paper is to maximize the probability that the Schedule Update Process is realized in an interval time [0, t], given a constraint in terms of power consumption 0 ≤ cost ≤ c. We will show an application of this analytical framework to a totally distributed TDMA protocol, the E-TDMA.