{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T06:21:33Z","timestamp":1769062893922,"version":"3.49.0"},"reference-count":28,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:00:00Z","timestamp":1562716800000},"content-version":"vor","delay-in-days":9,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"name":"the NRF funds for the SARChI Chair in Advanced Sensor Networks (South Africa) co-hosted by UP and CSIR"},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 71301111"],"award-info":[{"award-number":["No. 71301111"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2017,4,19]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>In this paper, we consider two types of power consumption control policies for the long lifetime of wireless sensor node based on the discrete-time Geo\/G\/1 queue. One is the max(<jats:italic>N,\u00a0D<\/jats:italic>)-policy, which triggers transmission mode of radio server when the <jats:italic>N<\/jats:italic> and <jats:italic>D<\/jats:italic> policies are met simultaneously, and another is the min (<jats:italic>N,\u00a0D<\/jats:italic>)-policy, which restarts transmission function of radio server when either of the <jats:italic>N<\/jats:italic> and <jats:italic>D<\/jats:italic> policies is first satisfied. Under two control policies, the steady-state queueing analysis of sensor node is mathematically carried out. The mean queueing measures of sensor node, such as the mean number of data packets, mean transmission time backlog, mean waiting time, mean busy period, mean busy cycle period, and so on, are derived. Two power consumption functions are constructed through the queueing measures obtained. Numerical experiments validate that two policies are feasible and efficient for power consumption control of sensor node. At a minimum power consumption, the superiority of the <jats:italic>N<\/jats:italic>-policy, <jats:italic>D<\/jats:italic>-policy, and two dyadic (<jats:italic>N,\u00a0D<\/jats:italic>) policies is numerically compared. Some practical insights on the operation of two (<jats:italic>N,\u00a0D<\/jats:italic>) polices in power consumption control of sensor node are obtained.<\/jats:p>","DOI":"10.1051\/ro\/2017048","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T06:37:10Z","timestamp":1497335830000},"page":"937-962","source":"Crossref","is-referenced-by-count":3,"title":["Optimal power consumption control of sensor node based on (<i>N,\u00a0D<\/i>)-policy discrete-time queues"],"prefix":"10.1051","volume":"53","author":[{"given":"Renbin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attahiru Sule","family":"Alfa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miaomiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"Akyilidiz","year":"2002","journal-title":"Comput. Netw."},{"key":"R2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1016627727877","volume":"7","author":"Jones","year":"2001","journal-title":"Wirel. Netw."},{"key":"R3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/990680.990703","volume":"47","author":"Culler","year":"2004","journal-title":"Commun. ACM"},{"key":"R4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s11227-007-0122-8","volume":"43","author":"Liu","year":"2008","journal-title":"J. Supercomputing"},{"key":"R5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/15501320500201276","volume":"2","author":"Lian","year":"2006","journal-title":"Int. J. Distrib. Sensor Netw."},{"key":"R6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/B:MONE.0000048552.15853.c2","volume":"10","author":"Wadaa","year":"2005","journal-title":"Mobile Netw. Appl."},{"key":"R7","doi-asserted-by":"crossref","first-page":"3047","DOI":"10.1016\/j.gaceta.2008.07.003","volume":"52","author":"Machado","year":"2008","journal-title":"Comput. Netw."},{"key":"R8","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/j.adhoc.2008.06.003","volume":"7","author":"Anastasi","year":"2009","journal-title":"Ad Hoc Netw."},{"key":"R9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1166\/sl.2005.017","volume":"3","author":"Sha","year":"2005","journal-title":"Sensor. Lett."},{"key":"R10","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/LCOMM.2005.11010","volume":"9","author":"Chen","year":"2005","journal-title":"IEEE Commun. Lett."},{"key":"R11","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MIM.2009.4811133","volume":"12","author":"Alippi","year":"2009","journal-title":"IEEE Instrum. Meas. Mag."},{"key":"R12","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/j.jpdc.2010.05.009","volume":"70","author":"Xu","year":"2010","journal-title":"J. Parallel Distrib. Comput."},{"key":"R13","doi-asserted-by":"crossref","first-page":"2087","DOI":"10.1007\/s11276-010-0245-3","volume":"16","author":"Sinha","year":"2010","journal-title":"Wirel. Netw."},{"key":"R14","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1016\/j.adhoc.2011.03.001","volume":"9","author":"Wang","year":"2011","journal-title":"Ad Hoc Netw."},{"key":"R15","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.apm.2010.05.020","volume":"35","author":"Guerriero","year":"2011","journal-title":"Appl. Math. Model."},{"key":"R16","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.cor.2011.06.013","volume":"39","author":"Behdani","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1016\/j.comcom.2011.11.006","volume":"35","author":"Huang","year":"2012","journal-title":"Comput. Commun."},{"key":"R18","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1007\/s11227-010-0537-5","volume":"59","author":"Jiang","year":"2012","journal-title":"J. Supercomputing"},{"key":"R19","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/TMC.2005.31","volume":"4","author":"Miller","year":"2005","journal-title":"IEEE Trans. Mobile Comput."},{"key":"R20","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1007\/s11227-012-0759-9","volume":"62","author":"Jiang","year":"2012","journal-title":"J. Supercomputing"},{"key":"R21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1155\/2013\/642692","volume":"9","author":"Jiang","year":"2013","journal-title":"Mobile Inform. Syst."},{"key":"R22","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1002\/dac.1288","volume":"25","author":"Jiang","year":"2012","journal-title":"Int. J. Commun. Syst."},{"key":"R23","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.peva.2008.04.006","volume":"65","author":"Lee","year":"2008","journal-title":"Perform. Eval."},{"key":"R24","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1007\/s11424-016-4180-y","volume":"29","author":"Gu","year":"2016","journal-title":"J. Syst. Sci. Complexity"},{"key":"R25","unstructured":"Hunter J., Mathematical techniques of applied probability, in Vol 2: Discrete time models: techniques and applications, New York: Academic Press (1983)."},{"key":"R26","unstructured":"Takagi H., Queueing Analysis: Vol III, Discrete-time Systems, North-Holland, (1993)."},{"key":"R27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s11424-012-9313-3","volume":"25","author":"Luo","year":"2012","journal-title":"J. Syst. Sci. Complexity"},{"key":"R28","unstructured":"Bellman R.E., Dyn. Program., Princeton University Press (1957)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017048\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:39:10Z","timestamp":1584689950000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":28,"journal-issue":{"issue":"3"},"alternative-id":["ro160267"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2017048","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}