Routing Mechanism Based on the Cooperation of the Ferry Nodes and Cluster Nodes in Opportunistic Networks
LIU Chun-rui1, ZHANG Shu-kui1,2, JIA Jun-cheng1, LIN Cheng-kuan1
1. School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu 215006, China;
2. Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, China
Opportunistic Networks are delay tolerant self-organized networks with sparse nodes,where the message propagation depends on the cooperation of nodes to fulfill a "store-carry-process-and-forward" fashion by leveraging the mobility of nodes,because there does not exist a complete path from the source to the destination in the most time.To achieve the communication of nodes in mutually disjoint clusters,we propose a Cluster Movement Model with Threshold (CMMT) and routing algorithm (CBSW),which is Cooperative Binary Spray and Wait routing algorithm based on the Ferry nodes and cluster nodes cooperation.This routing algorithm reduces of the redundancy of communication and store the cost,as well as if the destination or Ferry nodes are not found in the spraying phase,nodes carrying a message copy will forward the message only to its destination in the Waiting phase nodes etc.Simulation results demonstrate the effectiveness of the proposed CBSW protocol in terms of high delivery ratio,low overhead and small average delay.
刘春蕊, 张书奎, 贾俊铖, 林政宽. 机会网络中基于摆渡节点与簇节点相互协作的路由机制[J]. 电子学报, 2016, 44(11): 2607-2617.
LIU Chun-rui, ZHANG Shu-kui, JIA Jun-cheng, LIN Cheng-kuan. Routing Mechanism Based on the Cooperation of the Ferry Nodes and Cluster Nodes in Opportunistic Networks. Acta Electronica Sinica, 2016, 44(11): 2607-2617.
[1] CHAINTREAU A,HUI P,CROWCROFT J,et al.Pocket switched networks:real-world mobility and its consequences for opportunistic forwarding[R].University of Cambridge,Computer Lab,Tech Rep UCAM-CL-TR-617,2005.
[2] PELUSI L,PASSARELLA A,CONTIM.Opportunistic networking:data forwarding in disconnected mobile ad hoc networks[J].Communications Magazine,IEEE,2006,44(11):134-141.
[3] JUANG P,OKI H,WANG Y,et al.Energy-efficient computing for wildlife tracking:design tradeoffs and early experiences with ZebraNet[A].Proceeding of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems[C].New York:ACM,2002.96-107.
[4] SMALL T,HAAS Z J.The shared wireless infestation model:a new ad hoc networking paradigm[A].Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing[C].New York:ACM,2003.233-244.
[5] HULL B,BYCHKOVSKY V,ZHANG Y,et al.CarTel:a distributed mobile sensor computing system[A].The 4th ACM Conference on Embedded Networked Sensor System[C].Colorado:ACM,2006.125-138.
[6] PENTLAND A,FLETCHER R,HASSON A.DakNet:rethinking connectivity in developing nations[J].Computer,2004,37(1):78-83.
[7] MOREIRA W,FERREIRA R,CIRQUEIRA D,et al.SocialDTN:a DTN implementation for digital and social inclusion[A].ACM MobiCom Workshop on Lowest Cost Denominator Networking for Universal Access[C].Miami:ACM,2013.25-28.
[8] MOREIRA W,MENDES P,FERREIRA R,et al.Opportunistic routing based on users daily life routine[A].World of Wireless,Mobile and Multimedia Networks (WoWMoM),2012 IEEE International Symposium[C].Baltimore:IEEE,2012.1-6.
[9] NAUMOV V,GROSS T R.Connectivity-aware routing (CAR) in vehicular ad-hoc networks[A].INFOCOM 2007.26th IEEE International Conference on Computer Communications[C].Anchorage:IEEE,2007.1919-1927.
[10] VAHDAT A,BECKER D.Epidemic routing for partially connected ad hoc networks,CS2200006[R].Durham,NC:Duke University,2000.
[11] SPYROPOULOS T,PSOUNIS K,PAGHAVENDRA C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks[A].Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking[C].New York:ACM,2005.252-259.
[12] LINDGREN A,DORIA A,SCHENLEN O.Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):19-20.
[13] SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S.Efficient routing in intermittently connected mobile networks:the multiple-copy case[J].Networking,IEEE/ACM Transactions on,2008,16(1):77-90.
[14] 熊永平等,孙利民,年建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. XIONG Yong-Ping,SUN Li-Min,NIU Jian-Wei,LIU Yan.Opportunistic Networks[J].Journal of Software,2009,20(1):124-137.(in Chinese)
[15] BETTSTETTER C,RESTA G,SANETI P.The node distribution of the random waypoint mobility model for wireless ad hoc networks[J].Mobile Computing,IEEE transactions on,2003,2(3):257-269
[16] HONG X,GERLA M,PEI G,et al.A group mobility model for ad hoc wireless networks[A].Proceedings of the 2nd ACM International Workshop on Modeling,Analysis and Simulation of Wireless and Mobile Systems[C].New York:ACM,1999.53-60
[17] ROYER E M,MELLIAR-SMITH P M,MOSER L E.An analysis of the optimum node density for ad hoc mobile networks[A].Proceedings of the IEEE International Conference on Communications[C].USA:IEEE,2001.857-861.
[18] EAGLE N,PENTLAND A.Reality mining:sensing complex social systems[J].Personal and Ubiquitous Computing,2006,10(4):255-268.
[19] The University California S D.Wireless Topology Discovery Project[Z].UCSD,2004.
[20] DIO I.An Innovative Paradigm for Autonomic Opportunistic Communication[Z].2010.
[21] ZHANG X,KUROSE J,LEVINE B N,et al.Study of a bus-based disruption-tolerant network:mobility modeling and impact on routing[A].The 3th Annual International Conference on Mobile Computing and Networking[C].Montreal:MobiCom,2007.195-206.
[22] ZHAO W,AMMAR M,and ZEGURA E.Message ferrying proactive routing in highly-partitioned wireless and ad hoc networks[A].The 9th IEEE International Workshop on Future Trends in Distributed Computing Systems (FTDCS)[C].Puerto:IEEE,2003.308-314.
[23] ZHAO W,et al.A message ferrying approach for data delivery in sparse mobile Ad Hoc networks[A].Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHo?04)[C].New York:ACM,2004.187-98.
[24] Zhao W,AMMAR M,ZEGURA E.Controlling the mobility of multiple data transport ferries in a delay-tolerant network[A].Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05)[C].Miami:IEEE,2005.1407-1418.
[25] BETTSTETTER C,WAGNER C.The spatial node distribution of the random waypoint mobility model[A].Proceedings of German Workshop on Mobile Ad Hoc networks(WMAN)[C].Germany:IEEE,2002.41-58
[26] KERANEN A.Opportunistic network environment simulator[R].Special Assignment report,Helsinki University of Technology,Department of Communications and Networking,2008.
[27] JONES E,WARD P.Routing strategies for delay-tolerant networks[A].Proceedings of the ACM SIGCOMM workshop on Delay-tolerant networking[C].New York:ACM,2006.1577-1580.
2016, Vol. 44 
