{"id":"https://openalex.org/W2148320438","doi":"https://doi.org/10.1109/efta.2007.4416883","title":"Optimal flow routing in multi-hop sensor networks with real-time constraints through linear programming.","display_name":"Optimal flow routing in multi-hop sensor networks with real-time constraints through linear programming.","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W2148320438","doi":"https://doi.org/10.1109/efta.2007.4416883","mag":"2148320438"},"language":"en","primary_location":{"id":"doi:10.1109/efta.2007.4416883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/efta.2007.4416883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Conference on Emerging Technologies & Factory Automation (EFTA 2007)","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/A5001362742","display_name":"Ji\u0159\u00ed Trdli\u010dka","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jiri Trdlicka","raw_affiliation_strings":["Department of Control Engineering Faculty of Electrical Engineering, CTU, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Control Engineering Faculty of Electrical Engineering, CTU, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039174863","display_name":"Zden\u011bk Hanz\u00e1lek","orcid":"https://orcid.org/0000-0002-8135-1296"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Zdenek Hanzalek","raw_affiliation_strings":["Faculty of Electrical Engineering Department of Control Engineering, CTU, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering Department of Control Engineering, CTU, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024256519","display_name":"Mikael Johansson","orcid":"https://orcid.org/0000-0002-2237-2580"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Johansson","raw_affiliation_strings":["KTH School of Electrical Engineering, Automatic Control, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"KTH School of Electrical Engineering, Automatic Control, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001362742"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":2.2461,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89350145,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"924","last_page":"931"},"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.9958000183105469,"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.9902999997138977,"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.7059736847877502},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5869652032852173},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5844300985336304},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5820943713188171},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5392059683799744},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.46841755509376526},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4593323767185211},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4562566876411438},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.42805197834968567},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4238334000110626},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4236429035663605},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.42223918437957764},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4213927686214447},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.4164285659790039},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4125874936580658},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3661237359046936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34190112352371216},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.27012455463409424},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2697491943836212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1712481677532196},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08557954430580139}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7059736847877502},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5869652032852173},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5844300985336304},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5820943713188171},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5392059683799744},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.46841755509376526},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4593323767185211},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4562566876411438},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.42805197834968567},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4238334000110626},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4236429035663605},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.42223918437957764},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4213927686214447},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.4164285659790039},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4125874936580658},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3661237359046936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34190112352371216},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.27012455463409424},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2697491943836212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1712481677532196},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08557954430580139},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/efta.2007.4416883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/efta.2007.4416883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Conference on Emerging Technologies & Factory Automation (EFTA 2007)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.9100000262260437,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1559582792","https://openalex.org/W1682076822","https://openalex.org/W1864788684","https://openalex.org/W1991082938","https://openalex.org/W2011039300","https://openalex.org/W2108471589","https://openalex.org/W2124758756","https://openalex.org/W2140409200","https://openalex.org/W2141884921","https://openalex.org/W2154056071","https://openalex.org/W2160248765","https://openalex.org/W2165275149","https://openalex.org/W2166679968","https://openalex.org/W2168835173","https://openalex.org/W2296319761","https://openalex.org/W2544671722","https://openalex.org/W2611804663","https://openalex.org/W2613173048","https://openalex.org/W3151832023","https://openalex.org/W4250589301","https://openalex.org/W4253070303","https://openalex.org/W4285719527","https://openalex.org/W4300550233","https://openalex.org/W6633516804","https://openalex.org/W6682865904","https://openalex.org/W6737445176"],"related_works":["https://openalex.org/W2347665962","https://openalex.org/W2351097701","https://openalex.org/W2162880363","https://openalex.org/W2555559350","https://openalex.org/W1996079847","https://openalex.org/W2317653264","https://openalex.org/W2154440508","https://openalex.org/W1978148660","https://openalex.org/W2120750391","https://openalex.org/W2362764218"],"abstract_inverted_index":{"We":[0],"have":[1],"proposed":[2],"an":[3],"algorithm":[4,18,55],"for":[5,13,35],"optimal":[6,47],"real-time":[7,30,78,81],"routing":[8,48,82],"in":[9,24,49,101],"multi-hop":[10],"communication":[11,27],"networks":[12],"multi-":[14],"source/multi-sink":[15],"connection.":[16],"The":[17,41,54],"deals":[19],"with":[20],"various":[21],"capacity":[22],"constraints":[23,31],"terms":[25,50],"of":[26,39,51,87,106],"limits":[28],"and":[29,68,79,95],"expressed":[32],"as":[33],"deadline":[34],"each":[36],"particular":[37],"flow":[38,61],"data.":[40],"objective":[42],"is":[43,56,83,93],"to":[44,64],"find":[45],"the":[46,104],"energy":[52],"consumption.":[53],"based":[57],"on":[58,103],"a":[59],"data":[60,88],"model":[62],"leading":[63],"Linear":[65],"Programming":[66],"formulation":[67],"therefore":[69],"it":[70],"ensures":[71],"polynomial-time":[72],"complexity.":[73],"An":[74,85],"extension":[75],"handling":[76],"simultaneous":[77],"non":[80],"added.":[84],"example":[86],"collection":[89],"from":[90],"100":[91],"nodes":[92,107],"presented":[94],"performance":[96],"experiments":[97],"illustrating":[98],"time":[99],"complexity":[100],"dependence":[102],"number":[105],"are":[108],"given.":[109]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}