{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:55:03Z","timestamp":1770836103330,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T00:00:00Z","timestamp":1434931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Southern Illinois University, Edwardsville"},{"name":"Universit\u00e9 de Lorraine"},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["n\u00b0ANR 2010 INTB 0206 01"],"award-info":[{"award-number":["n\u00b0ANR 2010 INTB 0206 01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,22]]},"DOI":"10.1145\/2746285.2746301","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"367-376","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["An Operator Calculus Approach for Multi-constrained Routing in Wireless Sensor Networks"],"prefix":"10.1145","author":[{"given":"Bilel","family":"Nefzi","sequence":"first","affiliation":[{"name":"Loria-University of Lorraine, Nancy, France"}]},{"given":"Ren\u00e9","family":"Schott","sequence":"additional","affiliation":[{"name":"Loria-University of Lorraine, Nancy, France"}]},{"given":"Ye Qiong","family":"Song","sequence":"additional","affiliation":[{"name":"Loria-University of Lorraine, Nancy, France"}]},{"given":"George Stacey","family":"Staples","sequence":"additional","affiliation":[{"name":"Southern Illinois University, Edwardsville, USA"}]},{"given":"Evangelia","family":"Tsiontsiou","sequence":"additional","affiliation":[{"name":"Loria-University of Lorraine, Nancy, France"}]}],"member":"320","published-online":{"date-parts":[[2015,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"46","volume-title":"Proceedings of IEEE International Conference on Distributed Computing Systems","author":"He T.","year":"2005","unstructured":"T. He , J. Stankovic , C. Lu , and T. Abdelzaher , \" SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks \", Proceedings of IEEE International Conference on Distributed Computing Systems , pp. 46 -- 55 , 2005 . T. He, J. Stankovic, C. Lu, and T. Abdelzaher, \"SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks\", Proceedings of IEEE International Conference on Distributed Computing Systems, pp. 46--55, 2005."},{"key":"e_1_3_2_1_2_1","first-page":"83","volume-title":"14th IEEE International Workshop on Quality of Service (IWQoS 2006","author":"Qin Guoling","year":"2006","unstructured":"Chipara, O.; He, Z.; Guoling Xing; Qin Chen; Xiaorui Wang; Chenyang Lu; Stankovic , J.; Abdelzaher, T., \"Real-time Power-Aware Routing in Sensor Networks\" , 14th IEEE International Workshop on Quality of Service (IWQoS 2006 ), pp. 83 -- 92 , June 2006 . Chipara, O.; He, Z.; Guoling Xing; Qin Chen; Xiaorui Wang; Chenyang Lu; Stankovic, J.; Abdelzaher, T., \"Real-time Power-Aware Routing in Sensor Networks\", 14th IEEE International Workshop on Quality of Service (IWQoS 2006), pp.83--92, June 2006."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00938761"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2012.6503645"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/p843"},{"key":"e_1_3_2_1_9_1","volume-title":"Pr\u00e9publications de l'Institut Elie Cartan","author":"Schott R.","year":"2011","unstructured":"R. Schott , G.S. Staples , \" Operator calculus on generalized zeon algebras : theory and application to multi-constrained path problems \", Pr\u00e9publications de l'Institut Elie Cartan , 2011 \/18, (2011). Online at http:\/\/hal.archives-ouvertes.fr\/hal-00603748\/ PDF\/ staceyQoSjune11.pdf. R. Schott, G.S. Staples, \"Operator calculus on generalized zeon algebras: theory and application to multi-constrained path problems\", Pr\u00e9publications de l'Institut Elie Cartan, 2011\/18, (2011). Online at http:\/\/hal.archives-ouvertes.fr\/hal-00603748\/ PDF\/staceyQoSjune11.pdf."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00156-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900712"},{"key":"e_1_3_2_1_13_1","first-page":"743","article-title":"A* Prune: an algorithm for finding K shortest paths subject to multiple constraints","volume":"2001","author":"Liu G.","unstructured":"G. Liu and K. G. Ramakrushnam , \" A* Prune: an algorithm for finding K shortest paths subject to multiple constraints \" IEEE INFOCOM 2001 2(April 2001) 743 -- 749 . G.Liu and K. G. Ramakrushnam, \"A* Prune: an algorithm for finding K shortest paths subject to multiple constraints\" IEEE INFOCOM 2001 2(April 2001) 743--749.","journal-title":"IEEE INFOCOM"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/495803"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-006-0731-9"},{"key":"e_1_3_2_1_16_1","unstructured":"RPL\n  : IPv6 Routing Protocol for Low power and Lossy Networks - http:\/\/tools.ietf.org\/html\/draft-ietf-roll-rpl-19  RPL: IPv6 Routing Protocol for Low power and Lossy Networks - http:\/\/tools.ietf.org\/html\/draft-ietf-roll-rpl-19"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031508"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1182807.1182838"},{"key":"e_1_3_2_1_20_1","unstructured":"Contiki OS. http:\/\/www.contiki-os.org\/  Contiki OS. http:\/\/www.contiki-os.org\/"},{"key":"e_1_3_2_1_21_1","unstructured":"Timesynch module. http: \/\/contiki.sourceforge.net\/docs\/2.6\/a01741.html  Timesynch module. http: \/\/contiki.sourceforge.net\/docs\/2.6\/a01741.html"},{"key":"e_1_3_2_1_22_1","unstructured":"TelosB data sheet. http:\/\/www.willow.co.uk\/TelosB_Datasheet.pdf.  TelosB data sheet. http:\/\/www.willow.co.uk\/TelosB_Datasheet.pdf."}],"event":{"name":"MobiHoc'15: The Sixteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","location":"Hangzhou China","acronym":"MobiHoc'15","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746285.2746301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746285.2746301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:57Z","timestamp":1750227417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746285.2746301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,22]]},"references-count":21,"alternative-id":["10.1145\/2746285.2746301","10.1145\/2746285"],"URL":"https:\/\/doi.org\/10.1145\/2746285.2746301","relation":{},"subject":[],"published":{"date-parts":[[2015,6,22]]},"assertion":[{"value":"2015-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}