{"id":"https://openalex.org/W2020944405","doi":"https://doi.org/10.1109/tnet.2011.2146273","title":"Multichannel Scheduling and Spanning Trees: Throughput\u2013Delay Tradeoff for Fast Data Collection in Sensor Networks","display_name":"Multichannel Scheduling and Spanning Trees: Throughput\u2013Delay Tradeoff for Fast Data Collection in Sensor Networks","publication_year":2011,"publication_date":"2011-05-17","ids":{"openalex":"https://openalex.org/W2020944405","doi":"https://doi.org/10.1109/tnet.2011.2146273","mag":"2020944405"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2011.2146273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2011.2146273","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},"type":"article","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"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amitabha Ghosh","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, 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":"\u00d6zlem Durmaz Incel","raw_affiliation_strings":["NETLAB, Department of Computer Engineering, Bogazici University, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NETLAB, Department of Computer Engineering, Bogazici University, 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 Polytechnic Institute and State University, Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Virginia Bio-Informatics Institute, Virginia Polytechnic Institute and State University, Blacksburg, VA, 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":["Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.4397,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.96715447,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"6","first_page":"1731","last_page":"1744"},"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.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9948999881744385,"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/computer-science","display_name":"Computer science","score":0.7649933099746704},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6510821580886841},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6160566806793213},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5416101217269897},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5254891514778137},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5089352130889893},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.485330730676651},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47571808099746704},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47036075592041016},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.44347497820854187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42759907245635986},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.36190110445022583},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32519295811653137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22128629684448242},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1884302794933319},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.09515786170959473}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7649933099746704},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6510821580886841},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6160566806793213},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5416101217269897},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5254891514778137},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5089352130889893},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.485330730676651},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47571808099746704},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47036075592041016},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.44347497820854187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42759907245635986},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.36190110445022583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32519295811653137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22128629684448242},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1884302794933319},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.09515786170959473},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tnet.2011.2146273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2011.2146273","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.3132","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.3132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://anrg.usc.edu/www/publications/papers/TON-Dec2011.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.2287","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.2287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://anrg.usc.edu/www/publications/papers/TON-2011-accepted.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1482887149","https://openalex.org/W1518358948","https://openalex.org/W1530867537","https://openalex.org/W1662911496","https://openalex.org/W1918603512","https://openalex.org/W1964611452","https://openalex.org/W1976889764","https://openalex.org/W1999760725","https://openalex.org/W2002764437","https://openalex.org/W2004681879","https://openalex.org/W2011039300","https://openalex.org/W2040350502","https://openalex.org/W2043374590","https://openalex.org/W2066133642","https://openalex.org/W2074417667","https://openalex.org/W2077987111","https://openalex.org/W2093979815","https://openalex.org/W2100617218","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/W2118498353","https://openalex.org/W2118921653","https://openalex.org/W2123635701","https://openalex.org/W2132467327","https://openalex.org/W2142502714","https://openalex.org/W2146692740","https://openalex.org/W2157421865","https://openalex.org/W2161631339","https://openalex.org/W2167396179","https://openalex.org/W3147332716","https://openalex.org/W4248301666","https://openalex.org/W4252443832","https://openalex.org/W6668948603","https://openalex.org/W6677553180","https://openalex.org/W6678513053","https://openalex.org/W6683745066"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,29,41,49,82,91,94,98,123,126,132,147,171,194,203,210],"tradeoff":[3],"between":[4],"two":[5],"mutually":[6],"conflicting":[7],"performance":[8],"objectives-throughput":[9],"and":[10,34,45,58,68,146,163,182,208],"delay-for":[11],"fast,":[12],"periodic":[13],"data":[14,30,88,205],"collection":[15,31,206],"in":[16,22,52,85,199],"tree-based":[17],"sensor":[18],"networks":[19],"arbitrarily":[20],"deployed":[21],"2-D.":[23],"Two":[24],"primary":[25],"factors":[26],"that":[27,75,184],"affect":[28],"rate":[32,207],"(throughput)":[33],"timeliness":[35],"(delay)":[36],"are:":[37],"1)":[38],"efficiency":[39,172],"of":[40,48,54,125,149,173,179,196,201],"link":[42,72],"scheduling":[43,73],"protocol,":[44],"2)":[46],"structure":[47],"routing":[50,190],"tree":[51,127],"terms":[53,200],"its":[55],"node":[56,151],"degrees":[57],"radius.":[59],"In":[60],"this":[61],"paper,":[62],"we":[63,107,169],"utilize":[64],"multiple":[65],"frequency":[66],"channels":[67],"design":[69,109],"an":[70,110],"efficient":[71],"protocol":[74],"gives":[76],"a":[77,103,117,137],"constant":[78],"factor":[79],"approximation":[80,113],"on":[81,176],"optimal":[83,189],"throughput":[84,105],"delivering":[86],"aggregated":[87,204],"from":[89],"all":[90],"nodes":[92],"to":[93,102,115],"sink.":[95],"To":[96],"minimize":[97],"maximum":[99,211],"delay":[100],"subject":[101],"given":[104,138],"bound,":[106],"also":[108],"(\u03b1,":[111],"\u03b2)-bicriteria":[112],"algorithm":[114],"construct":[116],"Bounded-Degree":[118],"Minimum-Radius":[119],"Spanning":[120],"Tree,":[121],"with":[122,188],"radius":[124,135],"at":[128,152],"most":[129,153],"\u03b2":[130,164],"times":[131],"minimum":[133],"possible":[134],"for":[136],"degree":[139,148],"bound":[140],"\u0394":[141,154],"<sup":[142,155],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[143,156],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">*</sup>":[144,157],",":[145,160],"any":[150],"+":[158],"\u03b1":[159,162],"where":[161],"are":[165],"positive":[166],"constants.":[167],"Lastly,":[168],"evaluate":[170],"our":[174],"algorithms":[175],"different":[177],"types":[178],"spanning":[180],"trees":[181],"show":[183],"multichannel":[185],"scheduling,":[186],"combined":[187],"topologies,":[191],"can":[192],"achieve":[193],"best":[195],"both":[197],"worlds":[198],"maximizing":[202],"minimizing":[209],"packet":[212],"delay.":[213]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}