• 디지털산업정보학회논문지
• /
• 제8권1호
• /
• pp.47-53
• /
• 2012

Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.189-190
• /
• 2009

For applications involving the monitoring of large areas, dense sensor networks are not practical. For such applications, delay tolerant networks which consist of disconnected clusters of sensors that are visited periodically by a mobile robot are implemented. Because clock synchronization is critical to any data collection endeavor, and because the structure of DTNs is unique, this paper examines various clock synchronization algorithms as they apply to DTNs. A simulation tool was developed to examine and evaluate the RBS clock synchronization algorithm for DTNs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2202-2217
• /
• 2012

The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.618-629
• /
• 2017

Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.

• 디지털산업정보학회논문지
• /
• 제6권1호
• /
• pp.83-90
• /
• 2010

DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.234-252
• /
• 2013

Due to the uncertain of connections in Delay Tolerant Networks (DTNs), most routing algorithms in DTNs need nodes to forward the message to others based on the opportunistic contact. The contact is related with the beaconing rate. In particular, nodes have more chances to encounter with each other with bigger beaconing rate, but more energy will be used. On the other hand, if the nodes forward the message to every node all the time, the efficiency of the routing algorithm is better, but it needs more energy, too. This paper tries to exploit the optimal beaconing rate and forwarding rate when the total energy is constraint. First, a theoretical framework is proposed, which can be used to evaluate the performance with different forwarding rate and beaconing rate. Then, this paper formulates a joint optimization problem based on the framework. Through Pontryagin's Maximal Principle, this paper obtains the optimal policy and proves that both the optimal forwarding and beaconing rates conform to threshold form. Simulation results show the accuracy of the theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is the best.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2180-2200
• /
• 2015

This paper considers mobility control to improve packet delivery in delay-tolerant networks (DTNs) under group mobility. Based on the group structure in group mobility, we propose two mobility control techniques; group formation enforcement and group purposeful movement. Both techniques can be used to increase the contact opportunities between groups by extending the group's reachability. In addition, they can be easily integrated into some existing DTN routing schemes under group mobility to effectively expedite the packet delivery. This paper is divided into 2 parts. First, we study how our proposed mobility control schemes reduce the packet delivery delay in DTNs by integrating them into one simple routing scheme called group-epidemic routing (G-ER). For each scheme, we analytically derive the cumulative density function of the packet delivery delay to show how it can effectively reduce the packet delivery delay. Then, based on our second proposed technique, the group purposeful movement, we design a new DTN routing scheme, called purposeful movement assisted routing (PMAR), to further reduce the packet delay. Extensive simulations in NS2 have been conducted to show the significant improvement of PMAR over G-ER under different practical network conditions.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.656-666
• /
• 2014

In delay tolerant networks (DTNs), delay is inevitable; thus, making better use of buffer space to maximize the packet delivery rate is more important than delay reduction. In DTNs, epidemic routing is a well-known routing protocol. However, epidemic routing is very sensitive to buffer size. Once the buffer size in nodes is insufficient, the performance of epidemic routing will be drastically reduced. In this paper, we propose a buffer scheme to optimize the performance of epidemic routing on the basis of the Lagrangian and dual problem models. By using the proposed optimal buffer scheme, the packet delivery rate in epidemic routing is considerably improved. Our simulation results show that epidemic routing with the proposed optimal buffer scheme outperforms the original epidemic routing in terms of packet delivery rate and average end-to-end delay. It is worth noting that the improved epidemic routing needs much less buffer size compared to that of the original epidemic routing for ensuring the same packet delivery rate. In particular, even though the buffer size is very small (e.g., 50), the packet delivery rate in epidemic routing with the proposed optimal buffer scheme is still 95.8%, which can satisfy general communication demand.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.973-988
• /
• 2012

Delay tolerant networks (DTNs) characterized by the lack of guaranteed end-to-end paths exploit opportunistic data forwarding mechanism, which depends on the hypothesis that nodes are willing to store, carry, and forward the in-transit messages in an opportunistic way. However, this hypothesis might easily be violated by the presence of selfish nodes constrained with energy, bandwidth, and processing power. To address this problem, we propose a practical reputation-based incentive scheme, named PRI, to stimulate honest forwarding and discipline selfish behavior. A novel concept of successful forwarding credential and an observation protocol are presented to cope with the detection of nodes' behavior, and a reputation model is proposed to determine egoistic individuals. The simulation results demonstrate the effectiveness and practicality of our proposal.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 추계학술대회
• /
• pp.117-118
• /
• 2015

본 논문은 Delay Tolerant Networks(DTNs)에서 이동노드의 이동 속성 정보를 효율적으로 관리하여 목적노드를 지향하여 이동하는 중계노드를 선정하는 기법을 제안한다. 목적노드와 상이한 이동성을 가진 중계노드를 통해 전송 지연시간 및 패킷 손실이 발생할 가능성이 높아지게 된다. 따라서 본 논문에서는 부정확한 이동 속성 정보로 인하여 발생할 수 있는 전송 지연시간 및 패킷 손실이 증가하는 문제를 해소하기 위해, 이동노드 간 이동 속성 정보를 관리하고 연결성을 분석함으로써 중계노드를 선정하는 기법을 제안한다. 제안하는 알고리즘에서 이동노드는 주기적으로 자신의 속도와 방향을 상황인식 매트릭스에 저장하며, 다른 이동노드와 통신이 확립되면 저장된 이동 속성 정보를 교환하게 된다. 또한 교환된 이동 속성 정보를 연결성으로 분석함으로써 목적노드를 지향하여 이동하는 중계노드를 선정한다. 주어진 모의실험 결과, 최신의 이동 속성 정보를 활용하여 중계노드를 선정함으로써 패킷전송률 측면에서 더 향상된 결과를 보여주었다.