{"id":"https://openalex.org/W1989900945","doi":"https://doi.org/10.1109/sahcn.2013.6645028","title":"Opportunistic walks on Random Geometric Networks and their application in scalability analysis","display_name":"Opportunistic walks on Random Geometric Networks and their application in scalability analysis","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1989900945","doi":"https://doi.org/10.1109/sahcn.2013.6645028","mag":"1989900945"},"language":"en","primary_location":{"id":"doi:10.1109/sahcn.2013.6645028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2013.6645028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt1p94c2kk/qt1p94c2kk.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040345225","display_name":"Ali Dabirmoghaddam","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Dabirmoghaddam","raw_affiliation_strings":["Department of Computer Engineering, University of California, Santa Cruz, Santa Cruz, CA, USA","Department of Computer Engineering, University of California Santa Cruz, Santa Cruz, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Department of Computer Engineering, University of California Santa Cruz, Santa Cruz, CA, USA#TAB#","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065935907","display_name":"J.J. Garcia\u2010Luna\u2010Aceves","orcid":"https://orcid.org/0000-0001-9914-6031"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. J. Garcia-Luna-Aceves","raw_affiliation_strings":["Department of Computer Engineering, University of California, Santa Cruz, Santa Cruz, CA, USA","Department of Computer Engineering, University of California Santa Cruz, Santa Cruz, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Department of Computer Engineering, University of California Santa Cruz, Santa Cruz, CA, USA#TAB#","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2498,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55727785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"559","last_page":"567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9908000230789185,"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/scalability","display_name":"Scalability","score":0.7465031743049622},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6939855813980103},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6674572229385376},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6227568984031677},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.542227029800415},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5142671465873718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48243197798728943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44628283381462097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3471187949180603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28453272581100464},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15317308902740479},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09348884224891663},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08822309970855713}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7465031743049622},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6939855813980103},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6674572229385376},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6227568984031677},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.542227029800415},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5142671465873718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48243197798728943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44628283381462097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3471187949180603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28453272581100464},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15317308902740479},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09348884224891663},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08822309970855713},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sahcn.2013.6645028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sahcn.2013.6645028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","raw_type":"proceedings-article"},{"id":"pmh:qt1p94c2kk","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/1p94c2kk","pdf_url":"https://escholarship.org/content/qt1p94c2kk/qt1p94c2kk.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Luna-Aceves, J.J.(2013). Opportunistic Walks on Random Geometric Networks and Their Application in Scalability Analysis. Proceedings IEEE SECON 2013. UC Santa Cruz: Retrieved from: http://www.escholarship.org/uc/item/1p94c2kk","raw_type":"article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt1p94c2kk","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/1p94c2kk","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:qt1p94c2kk","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/1p94c2kk","pdf_url":"https://escholarship.org/content/qt1p94c2kk/qt1p94c2kk.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Luna-Aceves, J.J.(2013). Opportunistic Walks on Random Geometric Networks and Their Application in Scalability Analysis. Proceedings IEEE SECON 2013. UC Santa Cruz: Retrieved from: http://www.escholarship.org/uc/item/1p94c2kk","raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6399999856948853,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G5259331294","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338295","funder_display_name":"Army Research Laboratory"},{"id":"https://openalex.org/G948678646","display_name":null,"funder_award_id":"W911NF-09-2-0053","funder_id":"https://openalex.org/F4320338295","funder_display_name":"Army Research Laboratory"}],"funders":[{"id":"https://openalex.org/F4320338295","display_name":"Army Research Laboratory","ror":"https://ror.org/011hc8f90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1989900945.pdf","grobid_xml":"https://content.openalex.org/works/W1989900945.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W630423399","https://openalex.org/W2009614135","https://openalex.org/W2010016774","https://openalex.org/W2032870567","https://openalex.org/W2062788739","https://openalex.org/W2081963068","https://openalex.org/W2096615736","https://openalex.org/W2104911317","https://openalex.org/W2108190032","https://openalex.org/W2110360611","https://openalex.org/W2112090702","https://openalex.org/W2112525087","https://openalex.org/W2114517212","https://openalex.org/W2128678576","https://openalex.org/W2132174536","https://openalex.org/W2137775453","https://openalex.org/W2149959815","https://openalex.org/W2162450625","https://openalex.org/W2168346693"],"related_works":["https://openalex.org/W1597743604","https://openalex.org/W2038723108","https://openalex.org/W2389214306","https://openalex.org/W2033630974","https://openalex.org/W4235240664","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"Opportunistic":[0],"routing":[1,11,14],"is":[2,21,88,109],"studied":[3],"as":[4,23,41,43,73],"a":[5,24,54,80],"representative":[6],"example":[7],"of":[8,39,60,101,119,131],"location-aware":[9],"greedy":[10],"schemes.":[12],"The":[13,36,99],"process":[15],"between":[16,28,48],"an":[17,117],"arbitrary":[18,49],"source-destination":[19],"pair":[20],"modeled":[22],"directed":[25],"random":[26],"walk":[27,63],"the":[29,33,44,61,65,74,92,102,106,120],"two":[30],"ends":[31],"in":[32,64,79,123],"underlying":[34],"graph.":[35,68],"mean":[37,75],"number":[38],"transmissions":[40],"well":[42],"average":[45],"multi-hop":[46],"distance":[47],"nodes":[50],"are":[51,97,135],"unified":[52],"under":[53],"conceptual":[55],"measure":[56],"called":[57],"expected":[58],"length":[59],"opportunistic":[62],"induced":[66],"network":[67],"We":[69,114],"model":[70,108,122],"this":[71],"quantity":[72],"time":[76],"to":[77,90],"absorption":[78],"finite-state":[81],"Markov":[82],"chain.":[83],"An":[84],"explicit":[85],"closed-form":[86],"expression":[87],"presented":[89],"approximate":[91],"results":[93,103],"and":[94,128],"tight":[95],"bounds":[96],"given.":[98],"accuracy":[100],"predicted":[104],"by":[105],"analytical":[107],"verified":[110],"through":[111],"simulation":[112],"experiments.":[113],"also":[115],"demonstrate":[116],"application":[118],"foregoing":[121],"defining":[124],"proximity-based":[125],"social":[126,132],"models":[127],"identifying":[129],"classes":[130],"networks":[133],"that":[134],"scalable.":[136]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}