中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 基础软件国家工程研究中心  > 会议论文
题名:
anycast routing in mobile opportunistic networks
作者: Xiong Yongping ; Sun Limin ; He Wenbo ; Ma Jian
会议文集: Proceedings - IEEE Symposium on Computers and Communications
会议名称: 15th IEEE Symposium on Computers and Communications, ISCC 2010
会议日期: 37429
出版日期: 2010
会议地点: Riccione, Italy
关键词: Internet protocols ; Probability ; Routing algorithms
出版地: United States
ISSN: 15301346
ISBN: 9781420000000
部门归属: (1) Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China; (2) Graduate University of the Chinese, Academy of Sciences, Beijing, China; (3) Institute of Software, Chinese Academy of Sciences, Beijing, China; (4) Department of Computer Science, University of New Mexico, Albuquerque, NM, United States; (5) Nokia Research Center, Beijing, China
主办者: IEEE; IEEE Computer Society; IEEE Communications Society
英文摘要: A mobile opportunistic network consists of sparsely scattered mobile nodes communicating via short range radios. It is characterized by frequent and unpredictable network partitions and intermittent connectivity. Anycast in opportunistic networks is anticipated in many application scenarios , and deserves great attention. In this paper, we propose an anycast routing algorithm in which each node is associated with a forwarding metric indicating its delivery probability to the destination anycast group and the node with lower value hands over the message to the encountered node with higher metric. The forwarding metric is determined according to historical node encounter information. We use three different forwarding metrics (variables) to guide the transmission of messages. The Group Forwarding Metric (GFM) treats the entire group as a whole, and it is defined as the probability of meeting any member in the anycast group to deliver a message. Similar to GFM , Probability Forwarding Metric (PFM) is defined as the probability of encountering at least one anycast group member, but it relies on the probability of meeting individual group members. The Distance Forwarding Metric (DFM) takes a function of the delivery probability to an anycast group member as the distance to the member. The DFM is the combination of these distances to forward messages towards the higher member density. Different metrics can be adopted for different mobile opportunistic networks based on the connectivity characteristics of the networks. We analyze the control overhead of the any cast algorithm and the message delivery delay of the routing protocol. Extensive simulations are carried out to evaluate the performance of the proposed solution under synthetic and realistic traces. The results show that our algorithm will significantly improve the anycast delivery performance when compared with simple routing algorithms in term of average message delivery delay and transmission overhead. © 2010 IEEE.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8662
Appears in Collections:基础软件国家工程研究中心_会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
anycast routing in mobile opportunistic networks.pdf(845KB)----限制开放-- 联系获取全文

Recommended Citation:
Xiong Yongping,Sun Limin,He Wenbo,et al. anycast routing in mobile opportunistic networks[C]. 见:15th IEEE Symposium on Computers and Communications, ISCC 2010. Riccione, Italy. 37429.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xiong Yongping]'s Articles
[Sun Limin]'s Articles
[He Wenbo]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xiong Yongping]‘s Articles
[Sun Limin]‘s Articles
[He Wenbo]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace