{"id":"https://openalex.org/W2043374590","doi":"https://doi.org/10.1109/mobhoc.2009.5336979","title":"Multi-channel scheduling algorithms for fast aggregated convergecast in sensor networks","display_name":"Multi-channel scheduling algorithms for fast aggregated convergecast in sensor networks","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2043374590","doi":"https://doi.org/10.1109/mobhoc.2009.5336979","mag":"2043374590"},"language":"en","primary_location":{"id":"doi:10.1109/mobhoc.2009.5336979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mobhoc.2009.5336979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems","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/A5103068464","display_name":"Amitabha Ghosh","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amitabha Ghosh","raw_affiliation_strings":["Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, 90089, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, 90089, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059258053","display_name":"\u00d6zlem Durmaz \u0130ncel","orcid":"https://orcid.org/0000-0002-6229-7343"},"institutions":[{"id":"https://openalex.org/I4405392","display_name":"Bo\u011fazi\u00e7i University","ror":"https://ror.org/03z9tma90","country_code":"TR","type":"education","lineage":["https://openalex.org/I4405392"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ozlem Durmaz Incel","raw_affiliation_strings":["NETLAB, Department of Computer Engineering, Bogazici University, Istanbul, Turkey","NETLAB, Department of Computer Engineering, Bogazi\u00e7i University, 34342 Bebek, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NETLAB, Department of Computer Engineering, Bogazici University, Istanbul, Turkey","institution_ids":["https://openalex.org/I4405392"]},{"raw_affiliation_string":"NETLAB, Department of Computer Engineering, Bogazi\u00e7i University, 34342 Bebek, Istanbul, Turkey","institution_ids":["https://openalex.org/I4405392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107858741","display_name":"V. S. Anil Kumar","orcid":"https://orcid.org/0000-0002-4406-8483"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V.S. Anil Kumar","raw_affiliation_strings":["Department of Computer Science and Virginia Bio-Informatics Institute, Virginia Technology, Blacksburg, VA, USA","Department of Computer Science and Virginia Bio-Informatics Institute, Virginia Tech, Blacksburg, 24061, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Virginia Bio-Informatics Institute, Virginia Technology, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Department of Computer Science and Virginia Bio-Informatics Institute, Virginia Tech, Blacksburg, 24061, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063784062","display_name":"Bhaskar Krishnamachari","orcid":"https://orcid.org/0000-0002-9994-9931"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar Krishnamachari","raw_affiliation_strings":["Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, 90089, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, 90089, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"363","last_page":"372"},"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.9998999834060669,"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.9998999834060669,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6917845010757446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6645479202270508},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.6043295860290527},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5244840979576111},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.47761768102645874},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4747222661972046},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4710029661655426},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.4703384041786194},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.44660359621047974},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.44551730155944824},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4283027648925781},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.4105614721775055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37016624212265015},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3142858147621155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29241472482681274},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27692824602127075},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.2743367552757263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22635817527770996},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.17135539650917053},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1271105706691742}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6917845010757446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6645479202270508},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.6043295860290527},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5244840979576111},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.47761768102645874},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4747222661972046},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4710029661655426},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.4703384041786194},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44660359621047974},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.44551730155944824},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4283027648925781},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.4105614721775055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37016624212265015},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3142858147621155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29241472482681274},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27692824602127075},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.2743367552757263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22635817527770996},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.17135539650917053},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1271105706691742},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mobhoc.2009.5336979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mobhoc.2009.5336979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1518358948","https://openalex.org/W1595409123","https://openalex.org/W1964204642","https://openalex.org/W2000783799","https://openalex.org/W2011039300","https://openalex.org/W2040350502","https://openalex.org/W2061990624","https://openalex.org/W2072546650","https://openalex.org/W2083057776","https://openalex.org/W2093381928","https://openalex.org/W2100806474","https://openalex.org/W2100925062","https://openalex.org/W2104680817","https://openalex.org/W2106388288","https://openalex.org/W2114477045","https://openalex.org/W2115467602","https://openalex.org/W2115651379","https://openalex.org/W2118921653","https://openalex.org/W2125859743","https://openalex.org/W2142502714","https://openalex.org/W2150633912","https://openalex.org/W2161631339","https://openalex.org/W2167396179","https://openalex.org/W2386491531","https://openalex.org/W2476096155","https://openalex.org/W2899702797","https://openalex.org/W4248301666","https://openalex.org/W4285719527","https://openalex.org/W6600014790","https://openalex.org/W6683745066"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W318309967","https://openalex.org/W3022252369","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W2397211304","https://openalex.org/W1862126075","https://openalex.org/W1497398712","https://openalex.org/W96441109","https://openalex.org/W2113623403"],"abstract_inverted_index":{"Fast":[0],"and":[1,13,50,65,95,132,156,237,258],"periodic":[2],"collection":[3,56],"of":[4,8,90,151,209,233],"aggregated":[5,35],"data":[6,32,55],"is":[7,93,148,158,177,196],"considerable":[9],"interest":[10],"for":[11,83,105,116,137,182,264],"mission-critical":[12],"continuous":[14],"monitoring":[15],"applications":[16],"in":[17,72,76,87,96,153,193,218,222,262],"sensor":[18],"networks.":[19,107],"In":[20,108],"the":[21,54,59,73,80,88,149,154,159,189,194,206,215,230,245],"many-to-one":[22],"communication":[23],"paradigm":[24],"known":[25],"as":[26,119,188],"convergecast,":[27],"we":[28,110,252],"consider":[29],"scenarios":[30],"where":[31,124,141],"packets":[33],"are":[34],"at":[36,58],"each":[37],"hop":[38],"en":[39],"route":[40],"to":[41,212],"a":[42,46,112,128,133,164,173,199,239],"sink":[43,60],"node":[44,126,161,191],"along":[45],"tree-based":[47],"routing":[48,166,184],"topology":[49],"focus":[51],"on":[52,163,179,229],"maximizing":[53],"rate":[57],"by":[61,198],"employing":[62],"TDMA":[63],"scheduling":[64],"multiple":[66,91],"frequency":[67],"channels.":[68],"Our":[69],"key":[70],"result":[71],"paper":[74],"lies":[75],"proving":[77],"that":[78,172,204,243],"minimizing":[79],"schedule":[81,246],"length":[82,247],"an":[84,219,226],"arbitrary":[85,220],"network":[86,155,221,266],"presence":[89],"frequencies":[92,210,235],"NP-hard,":[94],"designing":[97],"approximation":[98,115,136,176],"algorithms":[99,255],"with":[100],"worst-case":[101],"provable":[102],"performance":[103,263],"guarantees":[104],"geometric":[106],"particular,":[109],"design":[111],"constant":[113,174],"factor":[114,175],"networks":[117],"modeled":[118],"unit":[120],"disk":[121,139],"graphs":[122,140],"(UDG)":[123],"every":[125],"has":[127],"uniform":[129],"transmission":[130,145],"range,":[131],"O(Delta(T)log":[134],"n)":[135],"general":[138],"nodes":[142,152],"have":[143],"different":[144,265],"ranges;":[146],"n":[147],"number":[150,208,232],"Delta(T)":[157],"maximum":[160,190,231],"degree":[162,192],"given":[165],"tree":[167,195],"T.":[168],"We":[169,201,224],"also":[170,202],"prove":[171],"achievable":[178],"UDG":[180],"even":[181],"unknown":[183],"topologies":[185],"so":[186],"long":[187],"bounded":[197],"constant.":[200],"show":[203,259],"finding":[205],"minimum":[207],"required":[211,236],"remove":[213],"all":[214],"interfering":[216],"links":[217],"NP-hard.":[223],"give":[225],"upper":[227],"bound":[228],"such":[234],"propose":[238],"polynomial":[240],"time":[241],"algorithm":[242],"minimizes":[244],"under":[248],"this":[249],"scenario.":[250],"Finally,":[251],"evaluate":[253],"our":[254],"through":[256],"simulations":[257],"various":[260],"trends":[261],"parameters.":[267]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}