Estimators for global information in mobile opportunistic network

Suvadip Batabyal, Parama Bhaumik
{"title":"Estimators for global information in mobile opportunistic network","authors":"Suvadip Batabyal, Parama Bhaumik","doi":"10.1109/ANTS.2013.6802843","DOIUrl":null,"url":null,"abstract":"Lack of global knowledge in a delay tolerant network proves detrimental, for a replication based routing strategy, in terms of resource utilization. It has often been noticed that nodes keep on replicating a message although it has already been delivered to the destination since such information remains unknown to most of the nodes in the network. Moreover recovery mechanisms (like VACCINE for epidemic routing) take time to propagate and incur additional transmission overhead. Global information such as number of nodes in the network, node meeting schedule, and whether a message has already been delivered to the destination is vital for optimal network performance. In this paper we propose model for estimating some of these vital information and show that replication based routing algorithm like epidemic routing, can perform better with minimum resource utilization. First, we use a uniformly minimum variance unbiased estimator (UMVUE) to estimate the number of nodes in the network. Second, we estimate the number of replicas of any given message in the network, at any given instant (t). Third, we show that epidemic routing with a node population of N can perform best with only N/2 message replicas for any given message and that further replication only leads additional overhead without any performance improvement. We show the simulated results using random waypoint mobility model and Shanghai taxi trace.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2013.6802843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Lack of global knowledge in a delay tolerant network proves detrimental, for a replication based routing strategy, in terms of resource utilization. It has often been noticed that nodes keep on replicating a message although it has already been delivered to the destination since such information remains unknown to most of the nodes in the network. Moreover recovery mechanisms (like VACCINE for epidemic routing) take time to propagate and incur additional transmission overhead. Global information such as number of nodes in the network, node meeting schedule, and whether a message has already been delivered to the destination is vital for optimal network performance. In this paper we propose model for estimating some of these vital information and show that replication based routing algorithm like epidemic routing, can perform better with minimum resource utilization. First, we use a uniformly minimum variance unbiased estimator (UMVUE) to estimate the number of nodes in the network. Second, we estimate the number of replicas of any given message in the network, at any given instant (t). Third, we show that epidemic routing with a node population of N can perform best with only N/2 message replicas for any given message and that further replication only leads additional overhead without any performance improvement. We show the simulated results using random waypoint mobility model and Shanghai taxi trace.
移动机会网络中全局信息估计方法
对于基于复制的路由策略来说,就资源利用率而言,延迟容忍网络中缺乏全局知识是有害的。人们经常注意到,尽管消息已经传递到目的地,但节点仍在继续复制消息,因为网络中的大多数节点仍然不知道这些信息。此外,恢复机制(如用于流行病路由的疫苗)需要时间来传播并产生额外的传播开销。全局信息,如网络中的节点数量、节点会议安排以及消息是否已经传递到目的地,对于优化网络性能至关重要。在本文中,我们提出了一个估计这些重要信息的模型,并证明了基于复制的路由算法,如流行病路由,可以在最小的资源利用率下实现更好的性能。首先,我们使用一致最小方差无偏估计器(UMVUE)来估计网络中的节点数量。其次,我们估计了网络中任何给定消息在任何给定时刻(t)的副本数量。第三,我们表明,对于任何给定消息,节点群为N的流行路由在只有N/2个消息副本的情况下表现最佳,并且进一步的复制只会导致额外的开销,而不会带来任何性能改进。利用随机航路点移动模型和上海出租车轨迹给出了仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信