{"id":"https://openalex.org/W4415180728","doi":"https://doi.org/10.23919/ecc65951.2025.11187067","title":"A Minimal Loss Multi-path Peer-to-Peer Power Routing and Scheduling Algorithm for Energy Internet","display_name":"A Minimal Loss Multi-path Peer-to-Peer Power Routing and Scheduling Algorithm for Energy Internet","publication_year":2025,"publication_date":"2025-06-24","ids":{"openalex":"https://openalex.org/W4415180728","doi":"https://doi.org/10.23919/ecc65951.2025.11187067"},"language":"en","primary_location":{"id":"doi:10.23919/ecc65951.2025.11187067","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","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/A5114413957","display_name":"Neethu Maya","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Neethu Maya","raw_affiliation_strings":["Indian Institute of Science,Department of Aerospace Engineering,Bangalore,Karnataka,India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science,Department of Aerospace Engineering,Bangalore,Karnataka,India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101042799","display_name":"Narasimman Sundararajan","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Narasimman Sundararajan","raw_affiliation_strings":["Nanyang Technological University,Faculty of the School of Electrical and Electronics Engineering,Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University,Faculty of the School of Electrical and Electronics Engineering,Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":null,"display_name":"Suresh Sundaram","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Suresh Sundaram","raw_affiliation_strings":["Indian Institute of Science,Department of Aerospace Engineering,Bangalore,Karnataka,India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science,Department of Aerospace Engineering,Bangalore,Karnataka,India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5114413957"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33259118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2458","last_page":"2463"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9912999868392944,"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/T11478","display_name":"Caching and Content Delivery","score":0.9912999868392944,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9495000243186951,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9194999933242798,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6861000061035156},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5008000135421753},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4189000129699707},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.38269999623298645},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.376800000667572},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3682999908924103},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.36320000886917114},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.3546999990940094},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.35269999504089355}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6861000061035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6021999716758728},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5680000185966492},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5008000135421753},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.396699994802475},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.38269999623298645},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.376800000667572},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3682999908924103},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3546999990940094},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.35269999504089355},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.3513000011444092},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.34529998898506165},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3379000127315521},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3287000060081482},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3257000148296356},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3172999918460846},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.31310001015663147},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.31139999628067017},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3061999976634979},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.26980000734329224},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.26600000262260437},{"id":"https://openalex.org/C2986056383","wikidata":"https://www.wikidata.org/wiki/Q556030","display_name":"Power flow","level":4,"score":0.2632000148296356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25690001249313354},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc65951.2025.11187067","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","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":18,"referenced_works":["https://openalex.org/W2100945405","https://openalex.org/W2120575449","https://openalex.org/W2622528438","https://openalex.org/W2819881978","https://openalex.org/W2906317992","https://openalex.org/W2911256795","https://openalex.org/W2921079368","https://openalex.org/W2944132049","https://openalex.org/W3028690796","https://openalex.org/W3089511252","https://openalex.org/W3159068316","https://openalex.org/W3174083144","https://openalex.org/W3200594522","https://openalex.org/W4214646136","https://openalex.org/W4281751812","https://openalex.org/W4385753491","https://openalex.org/W4394579751","https://openalex.org/W4406611686"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,29,101,108,120,152],"Hop":[4],"Optimized":[5],"Multi-Exchange":[6],"Routing":[7],"and":[8,36,39,86,170,178],"Scheduling":[9],"(HOMERS)":[10],"algorithm":[11,91,161],"designed":[12],"to":[13,52,83,93,119],"solve":[14],"concurrent":[15],"Peer-to-Peer":[16],"(P2P)":[17],"exchanges":[18,27],"in":[19,100,111,122,132,140,155],"the":[20,112,123,156,160],"Energy":[21],"Internet.":[22],"HOMERS":[23,45,106,137],"formulates":[24],"multiple":[25],"P2P":[26],"as":[28],"single-step":[30],"mixed-integer":[31],"nonlinear":[32],"programming":[33],"optimization":[34],"problem":[35],"effectively":[37,164],"routes":[38,172],"schedules":[40],"them.":[41],"Using":[42],"graph":[43],"theory,":[44],"ensures":[46],"power":[47,63,95],"distribution":[48,125,180],"from":[49,81],"each":[50],"source":[51],"its":[53],"corresponding":[54],"destination":[55],"with":[56,77,151,167],"required":[57],"equivalent":[58,142],"multi-path":[59,143,168],"solutions,":[60,136,169],"without":[61],"any":[62],"flow":[64,96],"conflicts.":[65],"Performance":[66],"evaluations":[67],"of":[68,115],"HOMER":[69],"were":[70,87],"conducted":[71],"on":[72],"randomly":[73],"generated":[74],"dense":[75],"topologies":[76],"community":[78],"sizes":[79],"ranging":[80],"10":[82],"400":[84,149],"nodes":[85,150],"compared":[88],"against":[89],"Dijkstra\u2019s":[90],"modified":[92],"prevent":[94],"violations.":[97],"The":[98],"results":[99],"400-node":[102],"network":[103],"show":[104],"that":[105],"achieved":[107],"68.29%":[109],"reduction":[110,147,154],"mean":[113,157],"number":[114],"hops,":[116],"which":[117],"translates":[118],"decrease":[121],"total":[124],"loss.":[126],"Though":[127],"Dijkstra":[128],"was":[129],"computationally":[130],"faster":[131],"routing":[133],"for":[134,145,173],"single-path":[135],"performed":[138],"better":[139],"providing":[141],"solutions":[144,175],"congestion":[146,166],"among":[148],"65.27%":[153],"runtime.":[158],"Thus,":[159],"is":[162],"scalable,":[163],"manages":[165],"also":[171],"feasible":[174],"under":[176],"heterogeneous":[177],"limited":[179],"capacity":[181],"constraints.":[182]},"counts_by_year":[],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-15T00:00:00"}