{"id":"https://openalex.org/W3196488507","doi":"https://doi.org/10.1109/lcn52139.2021.9524986","title":"To Forward or Not to Forward: Optimal Message Scheduling in Mobile Opportunistic Networks","display_name":"To Forward or Not to Forward: Optimal Message Scheduling in Mobile Opportunistic Networks","publication_year":2021,"publication_date":"2021-09-07","ids":{"openalex":"https://openalex.org/W3196488507","doi":"https://doi.org/10.1109/lcn52139.2021.9524986","mag":"3196488507"},"language":"en","primary_location":{"id":"doi:10.1109/lcn52139.2021.9524986","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn52139.2021.9524986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","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/A5049022781","display_name":"Gourish Goudar","orcid":"https://orcid.org/0000-0002-8737-8588"},"institutions":[{"id":"https://openalex.org/I74796645","display_name":"Birla Institute of Technology and Science, Pilani","ror":"https://ror.org/001p3jz28","country_code":"IN","type":"education","lineage":["https://openalex.org/I74796645"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Gourish Goudar","raw_affiliation_strings":["BITS Pilani, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BITS Pilani, India","institution_ids":["https://openalex.org/I74796645"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070569222","display_name":"Suvadip Batabyal","orcid":"https://orcid.org/0000-0001-8344-5897"},"institutions":[{"id":"https://openalex.org/I74796645","display_name":"Birla Institute of Technology and Science, Pilani","ror":"https://ror.org/001p3jz28","country_code":"IN","type":"education","lineage":["https://openalex.org/I74796645"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Suvadip Batabyal","raw_affiliation_strings":["BITS Pilani, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BITS Pilani, India","institution_ids":["https://openalex.org/I74796645"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034697367","display_name":"\u00d6zg\u00fcr Er\u00e7etin","orcid":"https://orcid.org/0000-0002-3454-5610"},"institutions":[{"id":"https://openalex.org/I134235054","display_name":"Sabanc\u0131 \u00dcniversitesi","ror":"https://ror.org/049asqa32","country_code":"TR","type":"education","lineage":["https://openalex.org/I134235054"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ozgur Ercetin","raw_affiliation_strings":["Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey","institution_ids":["https://openalex.org/I134235054"]}]}],"institutions":[],"countries_distinct_count":2,"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":"201","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9842000007629395,"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/T11478","display_name":"Caching and Content Delivery","score":0.9799000024795532,"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/computer-science","display_name":"Computer science","score":0.8234655857086182},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7691608667373657},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6231935024261475},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4902854263782501},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.48269057273864746},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.47621187567710876},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.4397750794887543},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41932445764541626},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09702533483505249},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09559917449951172},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08064022660255432}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8234655857086182},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7691608667373657},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6231935024261475},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4902854263782501},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.48269057273864746},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.47621187567710876},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.4397750794887543},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41932445764541626},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09702533483505249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09559917449951172},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08064022660255432},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lcn52139.2021.9524986","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn52139.2021.9524986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","raw_type":"proceedings-article"},{"id":"pmh:oai:research.sabanciuniv.edu:43846","is_oa":false,"landing_page_url":"https://research.sabanciuniv.edu/id/eprint/43846/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402254","display_name":"Sabanci University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I134235054","host_organization_name":"Sabanc\u0131 \u00dcniversitesi","host_organization_lineage":["https://openalex.org/I134235054"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1989015090","https://openalex.org/W2021497904","https://openalex.org/W2023290717","https://openalex.org/W2096509679","https://openalex.org/W2109528718","https://openalex.org/W2129849999","https://openalex.org/W2133255965","https://openalex.org/W2136102209","https://openalex.org/W2155059902","https://openalex.org/W2163783967","https://openalex.org/W2521980040","https://openalex.org/W2557416775","https://openalex.org/W2753853327","https://openalex.org/W2793242007","https://openalex.org/W2943996453","https://openalex.org/W2944474639","https://openalex.org/W2962867292","https://openalex.org/W3009186011","https://openalex.org/W3016045526","https://openalex.org/W4242656826","https://openalex.org/W6679985502"],"related_works":["https://openalex.org/W2392835431","https://openalex.org/W1965371215","https://openalex.org/W2126932387","https://openalex.org/W2353762239","https://openalex.org/W2484966135","https://openalex.org/W2015050211","https://openalex.org/W2108990487","https://openalex.org/W2126435977","https://openalex.org/W2017131087","https://openalex.org/W1978276953"],"abstract_inverted_index":{"Mobile":[0],"opportunistic":[1],"networks":[2],"(MONs)":[3],"are":[4],"characterized":[5],"by":[6],"frequently":[7],"changing":[8],"network":[9,113],"topology":[10],"that":[11,129],"rely":[12],"on":[13],"multi-copy":[14],"transmission":[15],"schemes":[16],"to":[17,32,42,51,98,102,138],"ensure":[18],"the":[19,24,48,59,69,75,91,103,106,112],"delivery":[20,71,77,135],"of":[21,28,95,109],"messages.":[22],"However,":[23],"limited":[25],"buffer":[26,33],"capacity":[27],"mobile":[29],"nodes":[30],"leads":[31],"overflow":[34],"and":[35,73,89,125],"head-of-line":[36],"blocking.":[37],"Head-of-line-blocking":[38],"is":[39,114],"caused":[40],"due":[41],"short":[43],"contact":[44],"duration,":[45],"which":[46],"causes":[47],"older":[49],"messages":[50,61],"be":[52],"replicated":[53],"at":[54],"a":[55,83,100,121,134,139],"faster":[56],"rate":[57],"than":[58,116],"newer":[60],"waiting":[62],"behind":[63],"them.":[64],"This":[65],"unfair":[66],"replication":[67,124],"decreases":[68],"message":[70,84,101,122,142],"ratio":[72,136],"increases":[74],"average":[76],"delay.":[78],"For":[79],"implementation,":[80],"we":[81,119],"categorize":[82],"as":[85],"new":[86],"or":[87],"old":[88],"calculate":[90],"necessary":[92],"maximum":[93],"number":[94,108],"replicas":[96,110],"required":[97],"deliver":[99],"destination.":[104],"If":[105],"instantaneous":[107],"in":[111],"less":[115],"this":[117],"number,":[118],"schedule":[120],"for":[123],"vice-versa.":[126],"We":[127],"demonstrate":[128],"our":[130],"proposed":[131],"scheme":[132],"achieves":[133],"comparable":[137],"utility-based":[140],"optimal":[141],"drop":[143],"algorithm":[144],"with":[145],"significantly":[146],"lower":[147],"overhead.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}