Optimal power consumption control of sensor node based on (N, D)-policy discrete-time queues

DOI10.1051/ro/2017048zbMath1423.60142OpenAlexW2625464829MaRDI QIDQ5242275

Attahiru Sule Alfa, Renbin Liu, Miao-Miao Yu

Publication date: 6 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017048

zbMATH Keywords

discrete-time queuedyadic \((N, D)\)-policyminimum power consumptionpower-saving schemewireless sensor node

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (1)

Queue size distribution on a new ND policy \(Geo/G/1\) queue and its computation designs

Cites Work

• Queue size distribution of Geo/G/\(1\) queue under the \(\operatorname{Min}(N,D)\)-policy
• The recursive solution of queue length for \(\mathrm{Geo}/G/1\) queue with \(N\)-policy
• Modelling and solving optimal placement problems in wireless sensor networks
• Energy-efficient cooperative data aggregation for wireless sensor networks
• Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
• A survey of game-theoretic approaches in wireless sensor networks
• A survey of energy efficient network protocols for wireless networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal power consumption control of sensor node based on (N, D)-policy discrete-time queues