{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:31:37Z","timestamp":1760243497079,"version":"build-2065373602"},"reference-count":14,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSAN"],"abstract":"<jats:p>Convergecast is the transmission paradigm used by data gathering applications in wireless sensor networks (WSNs). For efficiency reasons, a collision-free slotted medium access is typically used: time slots are assigned to non-conflicting transmitters. Furthermore, in any slot, only the transmitters and the corresponding receivers are awake, the other nodes sleeping in order to save energy. Since a multichannel network increases the throughput available to the application and reduces interference, multichannel slot assignment is an emerging research domain in WSNs. First, we focus on a multichannel time slot assignment that minimizes the data gathering delays. We compute the optimal time needed for a raw data convergecast in various multichannel topologies. Then, we focus on how to adapt such an assignment to dynamic demands of transmissions (e.g., alarms, temporary additional application needs and retransmissions). We formalize the problem using linear programming, and we propose an incremental technique that operates on an optimized primary schedule to provide bonus slots to meet new transmission needs. We propose AMSA, an Adaptive Multichannel Slot Assignment algorithm, which takes advantage of bandwidth spatial reuse, and we evaluate its performances in terms of the number of slots required, slot reuse, throughput and the number of radio state switches.<\/jats:p>","DOI":"10.3390\/jsan2030449","type":"journal-article","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T04:31:13Z","timestamp":1374035473000},"page":"449-485","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Adaptive Strategy for an Optimized Collision-Free Slot Assignment in Multichannel Wireless Sensor Networks"],"prefix":"10.3390","volume":"2","author":[{"given":"Ridha","family":"Soua","sequence":"first","affiliation":[{"name":"INRIA Rocquencourt, 78153 Le Chesnay cedex, France"}]},{"given":"Erwan","family":"Livolant","sequence":"additional","affiliation":[{"name":"INRIA Rocquencourt, 78153 Le Chesnay cedex, France"}]},{"given":"Pascale","family":"Minet","sequence":"additional","affiliation":[{"name":"INRIA Rocquencourt, 78153 Le Chesnay cedex, France"}]}],"member":"1968","published-online":{"date-parts":[[2013,7,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Incel, O.D., Kumar, A., and Krishnamachari, B. (2009, January 12\u201315). Multi-Channel Scheduling Algorithms for Fast Aggregated Convergecast in Sensor Networks. Proceedings of the 6th IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), Macau, China.","DOI":"10.1109\/MOBHOC.2009.5336979"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Soua, R., Minet, P., and Livolant, E. (2012, January 1\u20133). MODESA: An Optimized Multichannel Slot Assignment for Raw Data Convergecast in Wireless Sensor Networks. Proceedings of the 31 International Performance Computing and Communications Conference (IPCCC), Austin, TX, USA.","DOI":"10.1109\/PCCC.2012.6407742"},{"key":"ref_3","unstructured":"Zhang, H., Soldati, P., and Johansson, M. (2009, January 23\u201325). Optimal Link Scheduling and Channel Assignment for Convergecast in Linear WirelessHART Networks. Proceedings of the International Conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT\u201909), Seoul, Korea."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Wu, Y., Stankovic, J., He, T., and Lin, S. (2008, January 15\u201317). Realistic and Efficient Multi-channel Communications in Wireless Sensor Networks. Proceedings of the International Conference on Computer Communications, INFOCOM\u201908, Phoenix, AZ, USA.","DOI":"10.1109\/INFOCOM.2008.175"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TMC.2011.22","article-title":"Fast data collection in tree-based wireless sensor networks","volume":"1","author":"Incel","year":"2012","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_6","unstructured":"Cui, M., Yin, J., Nie, J., Zhang, J., and Cao, Y. (2008, January 19\u201321). An Evolutionary Dynamic Slot Assignment Based on P-TDMA for Mobile Adhoc Network. Proceedings of the 11th IEEE Singapore International Conference on Communication Systems (ICCS), Guangzhou, China."},{"key":"ref_7","first-page":"115","article-title":"A collision-avoid dynamic slots assignment algorithm based on fixed TDMA","volume":"11","author":"Gexin","year":"2005","journal-title":"China Inf. Secur."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Gobriel, S., Mosse, D., and Cleric, R. (2009, January 22\u201326). TDMA-ASAP: Sensor Network TDMA Scheduling with Adaptive Slot-Stealing and Parallelism. Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS), Montreal, QC, Canada.","DOI":"10.1109\/ICDCS.2009.80"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Yackovich, J., Mosse, D., Rowe, A., and Rajkumar, R. (2011, January 28\u201331). Making WSN TDMA Practical: Stealing Slots Up and Down the Tree. Proceedings of the 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications(RTCSA), Toyama, Japan.","DOI":"10.1109\/RTCSA.2011.84"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kanzaki, A., Hara, T., and Nishio, S. (2009, January 26\u201329). On a TDMA Slot Assignment Considering the Amount of Traffic in Wireless Sensor Networks. Proceedings of the International Conference on Advanced Information Networking and Applications Workshops (WAINA), Bradford, UK.","DOI":"10.1109\/WAINA.2009.115"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Tselishchev, Y., Libman, L., and Boulis, A. (2011, January 4\u20137). Energy-efficient Retransmission Strategies Under Variable TDMA Scheduling in Body Area Networks. Proceedings of the 36th IEEE Conference on Local Computer Networks (LCN), Bonn, Germany.","DOI":"10.1109\/LCN.2011.6115319"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","article-title":"The complexity of the capacitated tree problem","volume":"8","author":"Papadimitriou","year":"1978","journal-title":"Networks"},{"key":"ref_13","unstructured":"GLPK (GNU Linear Programming Kit). Available online: http:\/\/www.gnu.org\/software\/glpk\/."},{"key":"ref_14","unstructured":"GNU Octave. Available online: http:\/\/www.gnu.org\/software\/octave\/."}],"container-title":["Journal of Sensor and Actuator Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2224-2708\/2\/3\/449\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:47:59Z","timestamp":1760219279000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2224-2708\/2\/3\/449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,16]]},"references-count":14,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,9]]}},"alternative-id":["jsan2030449"],"URL":"https:\/\/doi.org\/10.3390\/jsan2030449","relation":{},"ISSN":["2224-2708"],"issn-type":[{"type":"electronic","value":"2224-2708"}],"subject":[],"published":{"date-parts":[[2013,7,16]]}}}