In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general i...In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.展开更多
Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobi...Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobility of the vessels/ships and the large inter.ship distances, nodes in the maritime network are frequently disconnected, forcing data communication in the maritime mesh networks to be opportunistic and delay.tolerant. In this paper, we present Lane Post, an optimization approach for maritime delay.tolerant routing protocol. We exploit the shipping lane information to predict the rendezvous opportunities of the ships to optimize the route selection in delay.tolerant routing. In particular, we show that when the shipping lane information is available, an opportunistic routing graph(ORG) for each ship can be constructed to predict its multi.hop data routing opportunities to the other ships or to the shore. Based on the ORG, we develop an optimal route protocol(i.e., Lane Post) for each ship to minimize its delay of multi.hop packet delivery via dynamic programming. We discussed the ways of collecting shipping lane information by centralized method or distributed method.The proposed Lane Post protocol was evaluated by ONE, an open.source delay.tolerant network simulator, which shows its dramatic performance improvement in terms of delay reduction compared to the state.of.the.art opportunistic routing protocols.展开更多
Delay tolerant networks （DTNs） experience frequent and long lasting network disconnection due to various reasons such as mobility, power management, and scheduling. One primary concern in DTNs is to route messages t...Delay tolerant networks （DTNs） experience frequent and long lasting network disconnection due to various reasons such as mobility, power management, and scheduling. One primary concern in DTNs is to route messages to keep the end-to-end delivery delay as low as possible. In this paper, we study the single-copy message routing problem and propose an optimal opportunistic routing strategy -Leapfrog Routing - for probabilistically contacted DTNs where nodes encounter or contact in some fixed probabilities. We deduce the iterative computation formulate of minimum expected opportunistic delivery delay from each node to the destination, and discover that under the optimal opportunistic routing strategy, messages would be delivered from high-delay node to low-delay node in the leapfrog manner. Rigorous theoretical analysis shows that such a routing strategy is exactly the optimal among all possible ones. Moreover, we apply the idea of Reverse Dijkstra algorithm to design an algorithm. When a destination is given, this algorithm can determine for each node the routing selection function under the Leapfrog Routing strategy. The computation overhead of this algorithm is only O（n^2） where n is the number of nodes in the network. In addition, through extensive simulations based on real DTN traces, we demonstrate that our algorithm can significantly outperform the previous ones.展开更多
The lack of continuous connectivity and a complete path from source to destination makes node communication quite difficult in Delay-Tolerant Networks(DTNs). Most studies focus on routing problems in idealized network...The lack of continuous connectivity and a complete path from source to destination makes node communication quite difficult in Delay-Tolerant Networks(DTNs). Most studies focus on routing problems in idealized network environments without considering social properties. Communication devices are carried by individuals in many DTNs; therefore, DTNs are unique social networks to some extent. To design efficient routing protocols for DTNs, it is important to analyze their social properties. In this paper, a more accurate and comprehensive metric for detecting the quality of the relationships between nodes is proposed, by considering the contact time, contact frequency, and contact regularity. An overlapping hierarchical community detection method is designed based on this new metric, and a tree structure is built. Furthermore, we exploit the overlapping community structure and the tree structure to provide message-forwarding paths from the source node to the destination node.The simulation results show that our Routing method based on Overlapping hierarchical Community Detection(ROCD) achieves better delivery rate than SimBet and Bubble Rap, the classic routing protocols, without affecting the average delay.展开更多
在分析现有机会网络转发策略及机会网络中节点的运动特性的基础上,通过改进节点的转发策略提出一种新的机会网络路由算法(Delayed Spray and Wait,DSW).算法假设的应用场景为节点均沿着预先存在的路径移动,通过延迟发送转发数据包,可以...在分析现有机会网络转发策略及机会网络中节点的运动特性的基础上,通过改进节点的转发策略提出一种新的机会网络路由算法(Delayed Spray and Wait,DSW).算法假设的应用场景为节点均沿着预先存在的路径移动,通过延迟发送转发数据包,可以显著减少网络中的低效数据包转发的数量.仿真结果表明,在合适的应用场景下该算法可以显著的降低网络中数据包的转发数量并略微提高传输成功率,这对于减少节点能耗和改善网络拥塞状况都具有实际意义.展开更多
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61100208, No. 61100205 the Natural Science Foundation of Jiangsu under Grant No. BK2011169. Pietro lio was supported by the EU FP7 project RECOGNITION： Relevance and Cognition for Self-Awareness in a Content-Centric Intemet.
文摘In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.
基金supported in part by National Natural Science Foundation of China Grant 61672524the Fundamental Research Funds for the Central University+1 种基金the Research Funds of Renmin University of China, 2015030273National Key Technology Support Program 2014BAK12B06
文摘Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobility of the vessels/ships and the large inter.ship distances, nodes in the maritime network are frequently disconnected, forcing data communication in the maritime mesh networks to be opportunistic and delay.tolerant. In this paper, we present Lane Post, an optimization approach for maritime delay.tolerant routing protocol. We exploit the shipping lane information to predict the rendezvous opportunities of the ships to optimize the route selection in delay.tolerant routing. In particular, we show that when the shipping lane information is available, an opportunistic routing graph(ORG) for each ship can be constructed to predict its multi.hop data routing opportunities to the other ships or to the shore. Based on the ORG, we develop an optimal route protocol(i.e., Lane Post) for each ship to minimize its delay of multi.hop packet delivery via dynamic programming. We discussed the ways of collecting shipping lane information by centralized method or distributed method.The proposed Lane Post protocol was evaluated by ONE, an open.source delay.tolerant network simulator, which shows its dramatic performance improvement in terms of delay reduction compared to the state.of.the.art opportunistic routing protocols.
基金supported by the National Basic Research 973 Program of China under Grant No.2006CB303006the National Natural Science Foundation of China under Grant No.60803009,the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No.20070358075
文摘Delay tolerant networks （DTNs） experience frequent and long lasting network disconnection due to various reasons such as mobility, power management, and scheduling. One primary concern in DTNs is to route messages to keep the end-to-end delivery delay as low as possible. In this paper, we study the single-copy message routing problem and propose an optimal opportunistic routing strategy -Leapfrog Routing - for probabilistically contacted DTNs where nodes encounter or contact in some fixed probabilities. We deduce the iterative computation formulate of minimum expected opportunistic delivery delay from each node to the destination, and discover that under the optimal opportunistic routing strategy, messages would be delivered from high-delay node to low-delay node in the leapfrog manner. Rigorous theoretical analysis shows that such a routing strategy is exactly the optimal among all possible ones. Moreover, we apply the idea of Reverse Dijkstra algorithm to design an algorithm. When a destination is given, this algorithm can determine for each node the routing selection function under the Leapfrog Routing strategy. The computation overhead of this algorithm is only O（n^2） where n is the number of nodes in the network. In addition, through extensive simulations based on real DTN traces, we demonstrate that our algorithm can significantly outperform the previous ones.
基金supported by the Youth Sci-Tech innovation leader and team project of Jilin Province of China (No. 20170519017JH)the National Science-Technology Support Project (No. 2014BAH02F02)the Graduate Innovation Fund of Jilin University (No. 2016031)
文摘The lack of continuous connectivity and a complete path from source to destination makes node communication quite difficult in Delay-Tolerant Networks(DTNs). Most studies focus on routing problems in idealized network environments without considering social properties. Communication devices are carried by individuals in many DTNs; therefore, DTNs are unique social networks to some extent. To design efficient routing protocols for DTNs, it is important to analyze their social properties. In this paper, a more accurate and comprehensive metric for detecting the quality of the relationships between nodes is proposed, by considering the contact time, contact frequency, and contact regularity. An overlapping hierarchical community detection method is designed based on this new metric, and a tree structure is built. Furthermore, we exploit the overlapping community structure and the tree structure to provide message-forwarding paths from the source node to the destination node.The simulation results show that our Routing method based on Overlapping hierarchical Community Detection(ROCD) achieves better delivery rate than SimBet and Bubble Rap, the classic routing protocols, without affecting the average delay.
文摘在分析现有机会网络转发策略及机会网络中节点的运动特性的基础上,通过改进节点的转发策略提出一种新的机会网络路由算法(Delayed Spray and Wait,DSW).算法假设的应用场景为节点均沿着预先存在的路径移动,通过延迟发送转发数据包,可以显著减少网络中的低效数据包转发的数量.仿真结果表明,在合适的应用场景下该算法可以显著的降低网络中数据包的转发数量并略微提高传输成功率,这对于减少节点能耗和改善网络拥塞状况都具有实际意义.
