• Journal of Information Processing Systems
• /
• 제20권1호
• /
• pp.131-147
• /
• 2024

A routing strategy based on traffic prediction and dynamic cache allocation for satellite nodes is proposed to address the issues of high propagation delay and overall delay of inter-satellite and satellite-to-ground links in low Earth orbit (LEO) satellite systems. The spatial and temporal correlations of satellite network traffic were analyzed, and the relevant traffic through the target satellite was extracted as raw input for traffic prediction. An improved gradient boosting regression tree algorithm was used for traffic prediction. Based on the traffic prediction results, a dynamic cache allocation routing strategy is proposed. The satellite nodes periodically monitor the traffic load on inter-satellite links (ISLs) and dynamically allocate cache resources for each ISL with neighboring nodes. Simulation results demonstrate that the proposed routing strategy effectively reduces packet loss rate and average end-to-end delay and improves the distribution of services across the entire network.

• 한국통신학회논문지
• /
• 제30권11B호
• /
• pp.744-749
• /
• 2005

본 논문에서는 기존의 QoS 라우팅 알고리즘이 가지고 있는 문제점인 네트워크 상태 정보 오버헤드를 최소화하면서 네트워크 상태의 정확성을 유지하기 위한 예측 기반 QoS 라우팅 기법인 PSS (Prediction Safety-Shortest) 라우팅 알고리즘 모델을 제안하였다. QoS 라우팅의 상태 정보 갱신 주기에 따른 가용 대역폭의 부정확한 정보를 극복하기 위하여 네트워크 상태를 적용할 수 있는 시계열 예측 알고리즘을 적용하였고, 알고리즘의 성능 평가를 위하여 실제 네트워크와 유사한 MCI 네트워크상에서 시뮬레이션 수행하였으며 라우팅 실패율, 라우팅 대역폭 실패율, 그리고 라우팅 부정확율의 비교를 통하여 본 알고리즘의 우수성을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4644-4661
• /
• 2015

Wireless sensor networks are often organized in the form of clusters leading to the new framework of WSN called cluster or hierarchical WSN where each cluster head is responsible for its own cluster and its members. These hierarchical WSN are prone to various routing layer attacks such as Black hole, Gray hole, Sybil, Wormhole, Flooding etc. These routing layer attacks try to spoof, falsify or drop the packets during the packet routing process. They may even flood the network with unwanted data packets. If one cluster head is captured and made malicious, the entire cluster member nodes beneath the cluster get affected. On the other hand if the cluster member nodes are malicious, due to the broadcast wireless communication between all the source nodes it can disrupt the entire cluster functions. Thereby a scheme which can detect both the malicious cluster member and cluster head is the current need. Abnormal energy consumption of nodes is used to identify the malicious activity. To serve this purpose a learning based energy prediction algorithm is proposed. Thus a two level energy prediction based intrusion detection scheme to detect the malicious cluster head and cluster member is proposed and simulations were carried out using NS2-Mannasim framework. Simulation results achieved good detection ratio and less false positive.

• 한국멀티미디어학회논문지
• /
• 제19권11호
• /
• pp.1829-1836
• /
• 2016

Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.397-399
• /
• 2014

DTN(Delay/Disruption Tolerant Networks)은 노드의 불규칙적인 움직임으로 인한 연결단절과 불안정한 연결 상태를 극복하기 위해 효율적인 포워딩 전략이 필요하다. 제시하는 알고리즘은 노드의 속도, 방향 등의 상황정보를 활용하며 이를 통해 이후의 이동성을 예측하여 포워딩할 중계노드를 선택하기 위한 방법을 고려한다. 본 논문에서는 중계노드들의 상관관계를 분석하여 안정된 경로를 제공하기 위해 노드의 상황정보를 예측하는 EPCM(Efficient Prediction-based Context-awareness Matrix) 알고리즘을 제안한다. 이를 위해 상황 매트릭스라는 상황 분석 도구를 사용하여 시간에 따라 상황정보를 저장하고, 변화의 추이를 분석하여 노드의 속도, 방향 등의 정보를 예측하는데 활용된다. EPCM 알고리즘은 예측된 상황정보를 활용하여 노드 간 미래의 연결성을 분석하고 중계노드를 선택함으로써 안정된 포워딩 경로를 제공할 수 있고, 불필요한 포워딩으로 인한 자원 낭비를 방지할 수 있다. 제안하는 알고리즘을 시뮬레이션 해본 결과 예측된 상황정보의 값이 실제의 값에 대하여 약 2%내의 오차율을 나타내어 예측의 정확도를 확인하였다.

• 대한임베디드공학회논문지
• /
• 제5권4호
• /
• pp.243-253
• /
• 2010

Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

• 한국군사과학기술학회지
• /
• 제14권3호
• /
• pp.492-500
• /
• 2011

The airborne backbone network(ABN) provides communication transport services between airborne nodes, surface nodes and satellite nodes. Such ABN is generally constructed with wide-body and high-capacity planes such as AWACS, which can fly long-term along pre-defined flight paths. In this paper, we propose an efficient method to improve routing performances by reconfiguring routing path before link failure based on the prediction of link state with the information of pre-defined backbone nodes' trajectories. Since the proposed method does not need additional information exchange between airborne nodes in order to acknowledge the link failure, it can be effectively used for airborne backbone network with limited bandwidths.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3851-3866
• /
• 2015

The dynamic nature of opportunistic networks results in long delays, low rates of success for deliveries, etc. As such user experience is limited, and the further development of opportunistic networks is constrained. This paper proposes a prediction-based routing method for opportunistic networks (PB-OppNet). Firstly, using an ARIMA model, PB-OppNet describes the historical contact information between a node pair as a time series to predict the average encounter time interval of the node pair. Secondly, using an optimal stopping rule, PB-OppNet obtains a threshold for encounter time intervals as forwarding utility. Based on this threshold, a node can easily make decisions of stopping observing, or delivering messages when potential forwarding nodes enter its communication range. It can also report different encounter time intervals to the destination node. With the threshold, PB-OppNet can achieve a better compromise of forwarding utility and waiting delay, so that delivery delay is minimized. The simulation experiment result presented here shows that PB-OppNet is better than existing methods in prediction accuracy for links, delivery delays, delivery success rates, etc.

• 대한조선학회논문집
• /
• 제42권1호
• /
• pp.57-63
• /
• 2005

This paper introduces basic research of optimum routing assessment system as voyage support purpose which can obtain safe and efficient route. In view point of safety, the prediction of ship motion should be evaluated in the condition of rough weather This part includes general seakeeping estimation based on 3 dimensional panel method and parametric roil prediction. For increasing voyage efficiency, ETA(Estimated Time of Arrival) and fuel consumption should be calculated considering speed reduction and power increase due to wave effects based on added resistance calculation and ship performance characteristics. Basically, the weather forecast is assumed to be prepared previously to operate this system. The idea of these factors in this system will be helpful to escape from dangerous voyage situation by wave conditions and to make optimum route planning based on ETA and fuel consumption.

• 한국통신학회논문지
• /
• 제37권1B호
• /
• pp.39-49
• /
• 2012

다수의 노드들이 유사한 이동 특성을 보이는 그룹 이동성을 고려하였을 때, 동일 그룹에 속한 노드간의 상대 속도는 작기 때문에 그룹 내 라우팅 업데이트 주기를 길게 설정하여 라우팅 오버헤드를 최소화하는 것이 가능하지만, 수집된 정보의 정확성이 저하되기 때문에 상대 속도가 큰 그룹 간의 패킷 전송 성공률이 감소된다. 그룹 간의 라우팅 오버헤드를 패킷 전송 성공률의 저하 없이 감소시키기 위해 이동 적응적인 라우팅 업데이트 구조가 본 논문에서 제안된다. 제안하는 알고리즘은 각 그룹 단위로 이동성을 예측을 하고 이를 통해 라우팅 업데이트 주기를 유동적으로 조절하여 라우팅 오버헤드를 감소시킨다. 또한 적절한 인접 그룹을 중계(relay) 그룹으로 설정하여, 추후 이동성에 의해 두 그룹간의 직접적인 연결이 단절되더라도 중계 그룹을 통해 통신이 원활이 유지될 수 있도록 지원함으로써 오버헤드가 감소하고 패킷 전송 성공률이 높아지게 된다.