{"id":"https://openalex.org/W2787215260","doi":"https://doi.org/10.1109/glocomw.2017.8269114","title":"Throughput Maximization Scheduling Algorithm in TSCH Networks with Deadline Constraints","display_name":"Throughput Maximization Scheduling Algorithm in TSCH Networks with Deadline Constraints","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2787215260","doi":"https://doi.org/10.1109/glocomw.2017.8269114","mag":"2787215260"},"language":"en","primary_location":{"id":"doi:10.1109/glocomw.2017.8269114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2017.8269114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Globecom Workshops (GC Wkshps)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069281382","display_name":"Mike O. Ojo","orcid":"https://orcid.org/0000-0002-4127-1902"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mike Ojo","raw_affiliation_strings":["Department of Information Engineering, University of Pisa, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021026284","display_name":"Stefano Giordano","orcid":"https://orcid.org/0000-0002-1408-7528"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Giordano","raw_affiliation_strings":["Department of Information Engineering, University of Pisa, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000904980","display_name":"Giuseppe Portaluri","orcid":"https://orcid.org/0000-0003-3646-4774"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe Portaluri","raw_affiliation_strings":["Department of Information Engineering, University of Pisa, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007526433","display_name":"Davide Adami","orcid":"https://orcid.org/0000-0003-3007-1400"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Davide Adami","raw_affiliation_strings":["Department of Information Engineering, University of Pisa, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11932","display_name":"Wireless Body Area Networks","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8104926347732544},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6196016669273376},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.45610716938972473},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.45457950234413147},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4518612325191498},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.43216589093208313},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4135914146900177},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4111769199371338},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37831956148147583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37786412239074707},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.32738199830055237},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.2865259051322937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09257984161376953},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07311949133872986}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8104926347732544},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6196016669273376},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.45610716938972473},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.45457950234413147},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4518612325191498},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.43216589093208313},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4135914146900177},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4111769199371338},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37831956148147583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37786412239074707},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32738199830055237},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.2865259051322937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09257984161376953},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07311949133872986}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocomw.2017.8269114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2017.8269114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Globecom Workshops (GC Wkshps)","raw_type":"proceedings-article"},{"id":"pmh:oai:arpi.unipi.it:11568/904415","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/904415","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1964581121","https://openalex.org/W1972012147","https://openalex.org/W1985567175","https://openalex.org/W1995872509","https://openalex.org/W2000825106","https://openalex.org/W2048225273","https://openalex.org/W2067243022","https://openalex.org/W2107472419","https://openalex.org/W2119638979","https://openalex.org/W2120462722","https://openalex.org/W2413566101","https://openalex.org/W2418973386","https://openalex.org/W2567031948","https://openalex.org/W3103693542","https://openalex.org/W4232569293"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W2071937864"],"abstract_inverted_index":{"Time":[0],"Slotted":[1],"Channel":[2],"Hopping":[3],"(TSCH),":[4],"defined":[5],"among":[6],"the":[7,29,49,57,64,74,85,92,120,131,143],"operating":[8],"modes":[9],"in":[10,53,70,142,145],"IEEE":[11],"802.15.4-2015":[12],"standard,":[13],"was":[14,106],"established":[15],"to":[16,91,119],"offer":[17],"a":[18,33,40,78,101],"guaranteed":[19],"quality":[20],"of":[21,55,87,147],"service":[22],"for":[23],"deterministic":[24],"industrial":[25],"type":[26],"applications.":[27],"However,":[28],"standard":[30],"only":[31],"provides":[32],"framework":[34,105],"but":[35],"it":[36],"does":[37],"not":[38],"mandate":[39],"specific":[41],"scheduling":[42,51,99,140],"mechanism.":[43],"In":[44,73,129],"this":[45,96],"paper,":[46],"we":[47],"formulate":[48],"NP-hard":[50,97],"problem":[52],"terms":[54,146],"maximizing":[56],"throughput":[58,98,148],"with":[59,125],"deadline":[60],"constraints":[61,69],"and":[62,89,123],"at":[63],"same":[65],"time":[66],"satisfying":[67],"interference":[68],"TSCH":[71,76],"Networks.":[72],"considered":[75],"network,":[77],"centralized":[79],"entity":[80],"typically":[81],"called":[82],"gateway,":[83],"coordinates":[84],"assignment":[86],"frequencies":[88],"timeslots":[90],"nodes.":[93],"To":[94],"solve":[95],"problem,":[100],"Genetic":[102],"Algorithm":[103],"(GA)":[104],"adopted.":[107],"Simulation":[108],"results":[109,132],"corroborate":[110],"that":[111,135],"our":[112],"GA-based":[113],"approach":[114],"yields":[115],"very":[116],"close":[117],"performance":[118],"optimal":[121],"solutions":[122],"operates":[124],"much":[126],"lower":[127],"complexity.":[128],"addition,":[130],"also":[133],"confirmed":[134],"GA":[136],"outperforms":[137],"other":[138],"popular":[139],"algorithms":[141],"literature":[144],"maximization":[149],"as":[150],"well":[151],"minimizing":[152],"violated":[153],"deadlines.":[154]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
