{"id":"https://openalex.org/W2120417266","doi":"https://doi.org/10.1109/isit.2004.1365156","title":"Coding and routing complexity in sensor networks","display_name":"Coding and routing complexity in sensor networks","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2120417266","doi":"https://doi.org/10.1109/isit.2004.1365156","mag":"2120417266"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-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/A5072765803","display_name":"Sekhar Tatikonda","orcid":"https://orcid.org/0000-0002-8956-6208"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Tatikonda","raw_affiliation_strings":["Department of Electrical Engineering, Yale University, USA","[Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Yale University, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA]","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030620564","display_name":"Kannan Ramchandran","orcid":"https://orcid.org/0000-0002-4567-328X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Ramchandran","raw_affiliation_strings":["University of California, Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2495,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66866916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9842000007629395,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9842000007629395,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9459999799728394,"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/T12029","display_name":"DNA and Biological Computing","score":0.9160000085830688,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7470636367797852},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5195408463478088},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5042246580123901},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.4856632947921753},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.46536946296691895},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44926875829696655},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.43515923619270325},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4307730197906494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42699068784713745},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4010081887245178},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4007921814918518},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.30634403228759766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15112844109535217},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08784845471382141}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7470636367797852},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5195408463478088},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5042246580123901},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.4856632947921753},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.46536946296691895},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44926875829696655},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.43515923619270325},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4307730197906494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42699068784713745},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4010081887245178},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4007921814918518},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.30634403228759766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15112844109535217},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08784845471382141},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2120137201","https://openalex.org/W1655019438","https://openalex.org/W2123812631","https://openalex.org/W2950120971","https://openalex.org/W2543752581","https://openalex.org/W1975971517","https://openalex.org/W2149136852","https://openalex.org/W2904118576","https://openalex.org/W2163375631","https://openalex.org/W2395854216"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,19,25,38,42,96],"particular":[4,59],"network":[5,26],"source":[6,85],"coding":[7],"problem":[8,13],"for":[9,67],"sensor":[10],"networks.":[11],"The":[12,76],"consists":[14],"of":[15,21,45,54,79,83],"transmitting":[16],"information":[17],"between":[18],"set":[20],"source-destination":[22],"pairs":[23],"over":[24],"where":[27,69],"the":[28,33,46,52,60,70,81,84,91],"nodes":[29],"are":[30],"correlated.":[31],"When":[32],"underlying":[34,71],"graph":[35,72],"structure":[36,73],"is":[37,99],"tree":[39,62,94],"we":[40],"give":[41],"complete":[43],"characterization":[44],"achievable":[47],"rate":[48],"region":[49],"and":[50,57,89],"discusses":[51],"role":[53],"graphical":[55],"models":[56],"in":[58,63,95],"junction":[61],"determining":[64],"routing":[65,92],"paths":[66],"cases":[68],"has":[74],"cycles.":[75],"communication":[77],"complexity":[78],"learning":[80],"statistics":[82],"from":[86],"observation":[87],"data":[88],"computing":[90],"spanning":[93],"distributed":[97],"manner":[98],"determined.":[100]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}