{"id":"https://openalex.org/W2003936810","doi":"https://doi.org/10.1109/icccn.2010.5560166","title":"ITGR: Intermediate Target Based Geographic Routing","display_name":"ITGR: Intermediate Target Based Geographic Routing","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2003936810","doi":"https://doi.org/10.1109/icccn.2010.5560166","mag":"2003936810"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2010.5560166","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2010.5560166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Proceedings of 19th International Conference on Computer Communications and Networks","raw_type":"proceedings-article"},"type":"conference-paper","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/A5075098592","display_name":"Jianjun Yang","orcid":"https://orcid.org/0000-0003-2484-6011"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jianjun Yang","raw_affiliation_strings":["Laboratory of Advanced Networking, Department of Computer Science, University of Kentucky, Lexington, KY, USA","Dept. of Comput. Sci., Univ. of Kentucky Lexington, Lexington, KY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Advanced Networking, Department of Computer Science, University of Kentucky, Lexington, KY, USA","institution_ids":["https://openalex.org/I143302722"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Kentucky Lexington, Lexington, KY, USA","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047860075","display_name":"Zongming Fei","orcid":"https://orcid.org/0000-0002-0694-5924"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zongming Fei","raw_affiliation_strings":["Laboratory of Advanced Networking, Department of Computer Science, University of Kentucky, Lexington, KY, USA","Dept. of Comput. Sci., Univ. of Kentucky Lexington, Lexington, KY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Advanced Networking, Department of Computer Science, University of Kentucky, Lexington, KY, USA","institution_ids":["https://openalex.org/I143302722"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Kentucky Lexington, Lexington, KY, USA","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I143302722"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"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":1.0,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9988999962806702,"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.9987000226974487,"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/geographic-routing","display_name":"Geographic routing","score":0.8374037742614746},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.804210901260376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7946678400039673},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7326409816741943},{"id":"https://openalex.org/keywords/source-routing","display_name":"Source routing","score":0.6216037273406982},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6171066164970398},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5941518545150757},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5741921663284302},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.522556722164154},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5125979781150818},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.46256741881370544},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4441644847393036},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.43582600355148315},{"id":"https://openalex.org/keywords/ip-forwarding","display_name":"IP forwarding","score":0.4354351758956909},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.41119584441185},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.34561413526535034}],"concepts":[{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.8374037742614746},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.804210901260376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7946678400039673},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7326409816741943},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.6216037273406982},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6171066164970398},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5941518545150757},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5741921663284302},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.522556722164154},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5125979781150818},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.46256741881370544},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4441644847393036},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.43582600355148315},{"id":"https://openalex.org/C174809319","wikidata":"https://www.wikidata.org/wiki/Q5973191","display_name":"IP forwarding","level":5,"score":0.4354351758956909},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.41119584441185},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.34561413526535034}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2010.5560166","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2010.5560166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Proceedings of 19th International Conference on Computer Communications and Networks","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":17,"referenced_works":["https://openalex.org/W1550444125","https://openalex.org/W1985866492","https://openalex.org/W2016082965","https://openalex.org/W2037156716","https://openalex.org/W2086824628","https://openalex.org/W2096812964","https://openalex.org/W2099574482","https://openalex.org/W2101963262","https://openalex.org/W2119710605","https://openalex.org/W2124651399","https://openalex.org/W2135572590","https://openalex.org/W2140667900","https://openalex.org/W2160189149","https://openalex.org/W3041700000","https://openalex.org/W6632945411","https://openalex.org/W6672579688","https://openalex.org/W6678046172"],"related_works":["https://openalex.org/W2003936810","https://openalex.org/W1655019438","https://openalex.org/W57030944","https://openalex.org/W4385819622","https://openalex.org/W2741533325","https://openalex.org/W2077927962","https://openalex.org/W2078987980","https://openalex.org/W2963821737","https://openalex.org/W1985364327","https://openalex.org/W2349715051"],"abstract_inverted_index":{"Geographic":[0,106],"routing":[1,65,77,81,230,237],"is":[2,32,43,136],"an":[3,158,180],"effective":[4],"approach":[5,101,135],"for":[6,161],"finding":[7],"a":[8,14,17,85,91,99,138,147,168,173,215],"path":[9,88,141,217,231],"to":[10,16,33,45,52,70,83,109,145,164,172,191,199,213],"forward":[11,53],"packets":[12,190],"from":[13],"source":[15,116,163,177],"destination":[18,47,118,154,169,202],"in":[19,194],"wireless":[20],"ad":[21],"hoc":[22],"networks":[23],"when":[24,58,89],"nodes":[25],"have":[26],"location":[27],"information.":[28],"The":[29,115,131,176],"basic":[30],"strategy":[31],"let":[34],"each":[35],"node":[36,170,182],"select":[37],"one":[38],"of":[39,133],"its":[40],"neighbors":[41],"that":[42,137,150,225],"closest":[44],"the":[46,49,54,71,124,134,162,184,197,200,229],"as":[48,183],"next":[50],"hop":[51],"packet":[55,198],"greedily.":[56],"However,":[57],"there":[59],"are":[60,121],"void":[61],"areas":[62,119],"(holes),":[63],"greedy":[64,204],"does":[66],"not":[67],"work":[68],"due":[69],"local":[72],"minimum":[73],"problem.":[74],"Existing":[75],"geographic":[76,236],"algorithms":[78],"use":[79],"perimeter":[80],"strategies":[82],"find":[84,165],"long":[86,112],"detour":[87,113],"such":[90,111],"situation":[92],"occurs.":[93],"In":[94],"this":[95],"paper,":[96],"we":[97],"propose":[98],"new":[100],"called":[102],"Intermediate":[103],"Target":[104],"Based":[105],"Routing":[107],"(ITGR)":[108],"avoid":[110],"paths.":[114],"determines":[117],"which":[120,193],"shaded":[122,148,174],"by":[123,203],"holes":[125],"based":[126],"on":[127],"previous":[128],"forwarding":[129,140],"experience.":[130],"novelty":[132],"single":[139],"can":[142,207],"be":[143,208],"used":[144],"determine":[146],"area":[149],"may":[151],"cover":[152],"many":[153],"nodes.":[155],"We":[156],"design":[157],"efficient":[159],"method":[160],"out":[166],"whether":[167],"belongs":[171],"area.":[175],"then":[178],"selects":[179],"intermediate":[181],"tentative":[185,220],"target":[186],"and":[187],"greedily":[188],"forwards":[189,196],"it,":[192],"turn":[195],"final":[201],"routing.":[205],"ITGR":[206,226],"recursively":[209],"called,":[210],"if":[211],"necessary,":[212],"generate":[214],"detour-free":[216],"with":[218,234],"multiple":[219],"targets.":[221],"Simulation":[222],"results":[223],"show":[224],"significantly":[227],"reduces":[228],"length,":[232],"compared":[233],"existing":[235],"protocols.":[238]},"counts_by_year":[{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
