Peiyan Yuan
Wei Wang
ABSTRACT
Mobile opportunistic network (MON) is a new paradigm which exploits node contacts to forward data, enabling numerous and impressive applications. The data copy spraying scheme is a challenging problem in MON, due to the mobility of nodes and lack of global knowledge, it hence captures great interests from research communities. Traditional algorithms allocate data copies with node's statistical information and neglect the temporal contact feature, resulting in a poor delivery performance. We propose AS, an adaptive data copy spraying scheme in MON. AS adjusts the number of copies dynamically based on the temporal contact feature among nodes. Theoretical analysis verifies that AS achieves a lower mean delivery delay than SprayWait, one of the state-of-the-art works. Simulation results show that AS improves the packet delivery ratio simultaneously.
- H. Ma, D. Zhao, and P. Yuan. Opportunities in mobile crowd sensing. Communications Magazine, IEEE, 52(8):29--35, August 2014.Google Scholar
Cross Ref
- T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Efficient routing in intermittently connected mobile networks: the multiple-copy case. Networking, IEEE/ACM Transactions on, 16(1):77--90, February 2008. Google ScholarDigital Library
- J. Wu, M. Xiao, and L. Huang. Homing spread: Community home-based multi-copy routing in mobile social networks. In INFOCOM, 2013 Proceedings IEEE, pages 2319--2327. IEEE, 2013.Google ScholarCross Ref
- P. Yuan and P. Liu. Data fusion prolongs the lifetime of mobile sensing networks. Journal of Network and Computer Applications, 49:51--59, March 2015. Google ScholarDigital Library
- P. Yuan and H. Ma. Hug: Human gathering point based routing for opportunistic networks. In Wireless Communications and Networking Conference (WCNC), 2012 IEEE, pages 3024--3029. IEEE, 2012.Google ScholarCross Ref
- P. Yuan, H. Ma, and H. Fu. Hotspot-entropy based data forwarding in opportunistic social networks. Pervasive and Mobile Computing, 16:136--154, January 2015. Google ScholarDigital Library
Index Terms
- Poster: An Adaptive Copy Spraying Scheme for Data Forwarding in Mobile Opportunistic Networks
Recommendations
Exploiting Partial Centrality of Nodes for Data Forwarding in Mobile Opportunistic Networks
CSE '14: Proceedings of the 2014 IEEE 17th International Conference on Computational Science and EngineeringThe social-based forwarding scheme has recently been shown to be an effective solution to improve the performance of opportunistic routing. Most of the current works focus on the globally defined node centrality, resulting in a bias towards the most ...
Effective and efficient collection of control messages for opportunistic routing algorithms
Opportunistic routing algorithms (ORAs) provide a feasible solution to transmit packets in intermittently connected scenarios, where links may be broken due to node mobility or power on/off. To make a smart forwarding decision, most of ORAs have to ...
RADON: reputation-assisted data forwarding in opportunistic networks
MobiOpp '10: Proceedings of the Second International Workshop on Mobile Opportunistic NetworkingIn opportunistic networks, the probability of encountering a destination node is popularly used to select a qualified forwarder; however, it can not represent the competency of delivering data in a hostile wireless environment, because a malicious node ...
Comments