buffer management and hybrid probability choice routing for packet delivery in opportunistic networks缓冲区管理和混合概率选择在机会网络路由数据包交付.pdfVIP

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2012, Article ID 817528, 14 pages doi:10.1155/2012/817528 Research Article Buffer Management and Hybrid Probability Choice Routing for Packet Delivery in Opportunistic Networks Daru Pan, Wei Cao, Han Zhang, and Mu Lin School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou 510006, China Correspondence should be addressed to Daru Pan, pandaru@126.com Received 8 April 2012; Accepted 20 May 2012 Academic Editor: Carlo Cattani Copyright q 2012 Daru Pan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Due to the features of long connection delays, frequent network partitions, and topology unsteadiness, the design of opportunistic networks faces the challenge of how to effectively deliver data based only on occasional encountering of nodes, where the conventional routing schemes do not work properly. This paper proposes a hybrid probability choice routing protocol with buffer management for opportunistic networks. A delivery probability function is set up based on continuous encounter duration time, which is used for selecting a better node to relay packets. By combining the buffer management utility and the delivery probability, a total utility is used to decide whether the packet should be kept in the buffer or be directly transmitted to the encountering node. Simulation results show that the proposed routing outperforms the existing one in terms of the delivery rate and the average delay. 1. Introduction Opportunistic networks 1–4 are one of the most