{"id":"https://openalex.org/W2804697895","doi":"https://doi.org/10.1145/3164541.3164567","title":"Efficient Approximations for Thinnest Path Problem in Grid Graph","display_name":"Efficient Approximations for Thinnest Path Problem in Grid Graph","publication_year":2018,"publication_date":"2018-01-05","ids":{"openalex":"https://openalex.org/W2804697895","doi":"https://doi.org/10.1145/3164541.3164567","mag":"2804697895"},"language":"en","primary_location":{"id":"doi:10.1145/3164541.3164567","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3164541.3164567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Ubiquitous Information Management and Communication","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/A5100778373","display_name":"Shuang Wu","orcid":"https://orcid.org/0000-0001-9512-2358"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuang Wu","raw_affiliation_strings":["Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058880682","display_name":"Zhiyin Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiyin Chen","raw_affiliation_strings":["Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100322879","display_name":"Yang Wang","orcid":"https://orcid.org/0000-0003-0842-2446"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yang Wang","raw_affiliation_strings":["Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019439900","display_name":"Xiaofeng Gao","orcid":"https://orcid.org/0000-0003-1776-8799"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaofeng Gao","raw_affiliation_strings":["Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059190563","display_name":"Fan Wu","orcid":"https://orcid.org/0000-0003-0965-9058"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fan Wu","raw_affiliation_strings":["Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100428808","display_name":"Guihai Chen","orcid":"https://orcid.org/0000-0002-6934-1685"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guihai Chen","raw_affiliation_strings":["Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Key Lab of Scalable Computing and Systems Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.06288027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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.9995999932289124,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.998199999332428,"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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9973999857902527,"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.83537757396698},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7266567349433899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7132313251495361},{"id":"https://openalex.org/keywords/lattice-graph","display_name":"Lattice graph","score":0.574233889579773},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5218731164932251},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5123234987258911},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4892856776714325},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.459789514541626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4514658451080322},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44874662160873413},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42643752694129944},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.4229584336280823},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4173976480960846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.228044331073761},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1520293951034546},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07664337754249573},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.05746734142303467}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.83537757396698},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7266567349433899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7132313251495361},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.574233889579773},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5218731164932251},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5123234987258911},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4892856776714325},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.459789514541626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4514658451080322},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44874662160873413},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42643752694129944},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.4229584336280823},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4173976480960846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.228044331073761},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1520293951034546},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07664337754249573},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.05746734142303467},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3164541.3164567","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3164541.3164567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Ubiquitous Information Management and Communication","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":23,"referenced_works":["https://openalex.org/W1532687347","https://openalex.org/W1975638108","https://openalex.org/W1977762076","https://openalex.org/W1982444805","https://openalex.org/W1996805805","https://openalex.org/W2007572995","https://openalex.org/W2030420292","https://openalex.org/W2044712659","https://openalex.org/W2078323467","https://openalex.org/W2090820749","https://openalex.org/W2121101422","https://openalex.org/W2127067317","https://openalex.org/W2130626677","https://openalex.org/W2136399700","https://openalex.org/W2144050074","https://openalex.org/W2166196498","https://openalex.org/W2503699976","https://openalex.org/W2773713359","https://openalex.org/W3015467371","https://openalex.org/W3015760390","https://openalex.org/W3124339913","https://openalex.org/W3163397523","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W1562631103","https://openalex.org/W2348177054","https://openalex.org/W2367161887","https://openalex.org/W2170980056","https://openalex.org/W4281943708","https://openalex.org/W2946414957","https://openalex.org/W2886722595"],"abstract_inverted_index":{"In":[0,16],"this":[1],"paper,":[2],"we":[3,111,146],"study":[4],"the":[5,25,29,34,60,67,75,153],"thinnest":[6,118],"path":[7,47,119],"problem":[8,73],"for":[9,105],"secure":[10],"communication":[11],"in":[12,24],"wireless":[13],"sensor":[14,26],"networks.":[15],"real":[17],"situations,":[18],"there":[19],"may":[20],"exist":[21],"potential":[22],"eavesdroppers":[23],"networks":[27],"and":[28,37,80,121,158],"sensors":[30],"usually":[31],"cannot":[32],"afford":[33],"expensive":[35],"encryption":[36],"decryption":[38],"algorithms.":[39],"An":[40],"intuitive":[41],"idea":[42],"is":[43],"to":[44,51,66,151],"find":[45],"a":[46,49,84,95,113,123],"from":[48],"source":[50],"its":[52],"destination":[53],"with":[54],"minimum":[55],"number":[56],"of":[57,103,116,155],"nodes":[58,63],"overhearing":[59],"message":[61],"(the":[62],"directly":[64],"connects":[65],"source-destination":[68,108],"path).":[69],"We":[70,91,132],"refer":[71],"such":[72],"as":[74],"Thinnest":[76],"Path":[77],"(TP)":[78],"problem,":[79],"discuss":[81],"it":[82],"under":[83],"graph":[85],"model":[86],"named":[87,126],"Grid":[88],"Graph":[89],"(GG).":[90],"first":[92],"prove":[93,134],"that":[94,135],"modified":[96],"Dijkstra":[97],"algorithm":[98,128,137],"has":[99],"an":[100,139],"approximation":[101],"ratio":[102],"7":[104],"any":[106],"given":[107],"pair.":[109],"Next,":[110],"define":[112],"new":[114],"concept":[115],"\"shortest":[117],"(STP)\",":[120],"propose":[122],"novel":[124],"design":[125],"Pseudo-Dijkstra":[127,136],"based":[129],"on":[130],"STP.":[131],"then":[133],"yields":[138],"optimal":[140],"solution":[141],"while":[142],"scarifies":[143],"time-complexity.":[144],"Finally,":[145],"provide":[147],"some":[148],"simulation":[149],"experiments":[150],"exhibit":[152],"performance":[154],"our":[156],"observations":[157],"designs.":[159]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}