anycast routing in mobile opportunistic networks

	anycast routing in mobile opportunistic networks
	Xiong Yongping; Sun Limin; He Wenbo; Ma Jian
	2010
会议名称	15th IEEE Symposium on Computers and Communications, ISCC 2010
会议录名称	Proceedings - IEEE Symposium on Computers and Communications
页码	599-604
会议日期	37429
会议地点	Riccione, Italy
出版地	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
摘要	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.
关键词	Internet Protocols Probability Routing Algorithms
主办者	IEEE; IEEE Computer Society; IEEE Communications Society
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8662
专题	基础软件国家工程研究中心
推荐引用方式 GB/T 7714	Xiong Yongping,Sun Limin,He Wenbo,et al. anycast routing in mobile opportunistic networks[C]. United States,2010:599-604.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
anycast routing in m（845KB）			开放获取	--	请求全文