{"id":"https://openalex.org/W2129768292","doi":"https://doi.org/10.1109/wcnc.2006.1683479","title":"Minimum energy path planning for ad hoc networks","display_name":"Minimum energy path planning for ad hoc networks","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2129768292","doi":"https://doi.org/10.1109/wcnc.2006.1683479","mag":"2129768292"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2006.1683479","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2006.1683479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/33706","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022154857","display_name":"Danjie Chen","orcid":"https://orcid.org/0000-0001-9398-1669"},"institutions":[{"id":"https://openalex.org/I1343143571","display_name":"Draper Laboratory","ror":"https://ror.org/04378d909","country_code":"US","type":"funder","lineage":["https://openalex.org/I1343143571"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Danjie Chen","raw_affiliation_strings":["Draper Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Draper Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1343143571","https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111113524","display_name":"Ping-Ying Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I1343143571","display_name":"Draper Laboratory","ror":"https://ror.org/04378d909","country_code":"US","type":"funder","lineage":["https://openalex.org/I1343143571"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P.J. Lin","raw_affiliation_strings":["Draper Laboratory, 555 Technology Square, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Draper Laboratory, 555 Technology Square, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1343143571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"288","last_page":"293"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9997000098228455,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9997000098228455,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9966999888420105,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.683639407157898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6674764752388},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5910899639129639},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5702915787696838},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5647146701812744},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5633559226989746},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5572343468666077},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5121669769287109},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49848389625549316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49328988790512085},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4692428410053253},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4206709563732147},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.4172835350036621},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41308796405792236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40106889605522156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24323564767837524},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23391324281692505},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1572851836681366},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07649755477905273},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07065823674201965}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.683639407157898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6674764752388},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5910899639129639},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5702915787696838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5647146701812744},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5633559226989746},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5572343468666077},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5121669769287109},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49848389625549316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49328988790512085},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4692428410053253},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4206709563732147},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.4172835350036621},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41308796405792236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40106889605522156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24323564767837524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23391324281692505},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1572851836681366},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07649755477905273},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07065823674201965},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","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":3,"locations":[{"id":"doi:10.1109/wcnc.2006.1683479","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2006.1683479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.905.4941","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.905.4941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/handle/1721.1/33706/64696352-MIT.pdf%3Bjsessionid%3D030186E10FD9397A70D244CB4D074097?sequence%3D2","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/33706","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/33706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/33706","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/33706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.9100000262260437,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1980566883","https://openalex.org/W2038958985","https://openalex.org/W2039414274","https://openalex.org/W2083689139","https://openalex.org/W2149906774","https://openalex.org/W2169528473","https://openalex.org/W3137299218","https://openalex.org/W4242246215","https://openalex.org/W6660158680","https://openalex.org/W6671510484"],"related_works":["https://openalex.org/W2183747532","https://openalex.org/W2002764510","https://openalex.org/W2237480599","https://openalex.org/W2776102956","https://openalex.org/W2129550502","https://openalex.org/W3184816460","https://openalex.org/W2277626332","https://openalex.org/W4304192587","https://openalex.org/W2365960806","https://openalex.org/W2894757447"],"abstract_inverted_index":{"We":[0,49,83],"introduce":[1,54],"the":[2,43,55,66,112],"minimum":[3],"energy":[4,45,89],"path":[5,12,63,77],"planning":[6],"(MEPP)":[7],"problem":[8,52,67,113],"of":[9,34],"finding":[10],"a":[11,14,19,22,32,39,71,75],"for":[13],"mobile":[15],"node":[16,30],"traveling":[17],"from":[18,31,79],"source":[20,80],"to":[21,69,81,92,107],"destination":[23],"while":[24],"communicating":[25],"with":[26],"at":[27],"least":[28],"one":[29],"set":[33],"stationary":[35],"nodes":[36],"in":[37,47,95,111],"such":[38],"way":[40],"that":[41,59,87],"minimizes":[42],"transmission":[44],"used":[46],"communication.":[48],"characterize":[50],"this":[51,102],"and":[53,73],"discretized":[56],"graph":[57,72],"algorithm":[58,85,103],"finds":[60],"an":[61],"approximate":[62],"by":[64],"discretizing":[65],"space":[68],"form":[70],"performing":[74],"shortest":[76],"search":[78],"destination.":[82],"find":[84],"parameters":[86],"allow":[88],"efficient":[90],"paths":[91],"be":[93,105],"found":[94],"suitable":[96],"time.":[97],"Finally,":[98],"we":[99],"discuss":[100],"how":[101],"can":[104],"extended":[106],"facilitate":[108],"other":[109],"considerations":[110]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}