{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:45:17Z","timestamp":1761896717357,"version":"3.41.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T00:00:00Z","timestamp":1519257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2018,4,30]]},"abstract":"<jats:p>Wireless Sensor Networks (WSNs) are important examples of Collective Adaptive System, which consist of a set of motes that are spatially distributed in an indoor or outdoor space. Each mote monitors its surrounding conditions, such as humidity, intensity of light, temperature, and vibrations, but also collects complex information, such as images or small videos, and cooperates with the whole set of motes forming the WSN to allow the routing process. The traffic in the WSN consists of packets that contain the data harvested by the motes and can be classified according to the type of information that they carry. One pivotal problem in WSNs is the bandwidth allocation among the motes. The problem is known to be challenging due to the reduced computational capacity of the motes, their energy consumption constraints, and the fully decentralised network architecture. In this article, we study a novel algorithm to allocate the WSN bandwidth among the motes by taking into account the type of traffic they aim to send. Under the assumption of a mesh network and Poisson distributed harvested packets, we propose an analytical model for its performance evaluation that allows a designer to study the optimal configuration parameters. Although the Markov chain underlying the model is not reversible, we show it to be \u03c1-reversible under a certain renaming of states. By an extensive set of simulations, we show that the analytical model accurately approximates the performance of networks that do not satisfy the assumptions. The algorithm is studied with respect to the achieved throughput and fairness. We show that it provides a good approximation of the max-min fairness requirements.<\/jats:p>","DOI":"10.1145\/3155335","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T16:40:01Z","timestamp":1519404001000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs"],"prefix":"10.1145","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2606-7241","authenticated-orcid":false,"given":"Andrea","family":"Marin","sequence":"first","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia Italia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia Italia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Burato","sequence":"additional","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia Italia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Sina","sequence":"additional","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia Italia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Sottana","sequence":"additional","affiliation":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia, Venezia Italia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2004.04.003"},{"key":"e_1_2_1_2_1","unstructured":"D. Bertsekas and R. Gallager. 1992. Data Networks. Prentice Hall.   D. Bertsekas and R. Gallager. 1992. Data Networks. Prentice Hall."},{"volume-title":"Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS\u201902)","author":"Caccamo M.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5121\/ijcnc.2014.6609"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/NBiS.2009.77"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2012.08.004"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031513"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207025"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2883608"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2800835.2809508"},{"volume-title":"Proceedings of the International Conference on Analytical Stochastic Modelling Techniques and Applications (ASMTA\u201915)","author":"Gelenbe E.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.103550"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2010.2050144"},{"volume-title":"Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems. 46--55","author":"He T.","key":"e_1_2_1_14_1"},{"volume-title":"Reversibility and Stochastic Networks","author":"Kelly F.","key":"e_1_2_1_15_1"},{"volume":"7405","volume-title":"Lecture Notes in Computer Science","author":"Khan D.","key":"e_1_2_1_16_1"},{"volume-title":"Proceedings of the International Federation for Information Processing Congress (IFIP\u201971)","year":"1971","author":"King W. F.","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5194\/nhess-14-3123-2014"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/570738.570751"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4108\/icst.valuetools.2014.258200"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2014.59"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0266-1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4108\/eai.14-12-2015.2262651"},{"volume-title":"Proceedings of the IEEE INFOCOM\u201900","author":"Pan R.","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/778415.778437"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2607229"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2015.2504106"},{"key":"e_1_2_1_28_1","first-page":"101","article-title":"Utility maximization resource allocation in wireless networks: Methods and algorithms","volume":"45","author":"Tan L.","year":"2015","journal-title":"IEEE Trans. Syst., Man Cybernet.: Syst."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2640285"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2016.12.005"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2017.03.004"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958523"},{"volume-title":"Systems in Stochastic Equilibrium","author":"Whittle P.","key":"e_1_2_1_34_1"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/381677.381699"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.3390\/s151229859"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3155335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3155335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:28Z","timestamp":1750213588000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3155335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4,30]]}},"alternative-id":["10.1145\/3155335"],"URL":"https:\/\/doi.org\/10.1145\/3155335","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2018,2,22]]},"assertion":[{"value":"2017-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}