• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• 한국정보통신학회논문지
• /
• 제18권7호
• /
• pp.1565-1570
• /
• 2014

네트워크 통신에서 베이스노드가 목적지 노드에 데이터를 전송하는데 데이터가 목적지 노드에 전송하는 경로방향을 설정하는 것은 효율적인 데이터 전송을 위해 매우 중요하다고 할 수 있다. 표준 프로토콜의 하나인 애드혹 프로토콜은 패킷 혹은 데이터가 어떻게 목적지에 도달하는지 경로를 결정한다. 그중 대표적인 것이 애드혹 주문형 거리프로토콜 (AODV)이나 동적 소스 라우팅 프로토콜 (DSR) 이다. 본 논문에서 제안하는 작은 종단연결 순차번호를 이용한 라우팅 프로토콜은 라우트 방향이 가이드 노드의 도움을 받아 적절히 업데이트 되어 효율적이고 프로토콜의 성능분석에 초점을 맞추어 다른 두 프로토콜과 비교한다. 실험은 네트워크 시뮬레이터 (NS-2)를 사용하고 시뮬레이션 시간, 노드개수, 패킷 크기 같은 파라미터에 근거하고 패킷전송비율, 라우팅 부하, 데이터 전송률 같은 본 논문에서 제시한 성능지표에 따라 비교 분석한다. 그 결과 작은 종단연결 순차번호를 이용한 라우팅 프로토콜이 애드혹 주문형 거리 프로토콜 (AODV) 이나 동적 소스 라우팅 프로토콜 (DSR) 에 비해 우수한 성능을 가진 것으로 나타난다.

• 한국콘텐츠학회논문지
• /
• 제3권1호
• /
• pp.64-70
• /
• 2003

본 논문에서는 유선 인프라스트럭처 없이 쉽게 이동 단말기들만으로 네트워크를 쉽게 구성하여 긴급구조나 군용 네트워크로 이용되는 Ad hoc 네트워크의 성능에 영향을 미치는 성능 지표와 적정 운용성 등에 대한 연구를 통해 향후 제안하고자하는 DQM(Distributed QoS Monitoring) 기반 라우팅 프로토콜의 선행 자료로 이용하고자 한다.

• 한국통신학회논문지
• /
• 제31권2B호
• /
• pp.80-90
• /
• 2006

USN(Ubiquitous Sensor Network)은 감지기능을 수행하기 위해서는 센서노드에서 싱크로의 라우팅 기법이 반드시 필요하다. 본 논문에서는 데이터의 전달을 위한 경로설정시 에너지의 효율성 및 균일성을 제공하는 제어메시지의 확률적 플러딩을 제안하며 에너지의 소모를 되도록이면 균일하도록 유도하는 에너지확률을 이용하고 경로를 은닉할 수 있는 분산 라우팅기법을 제안하였다. 에너지효율성을 측정하기 위하여 수학적 모델링과 NS-2 시뮬레이터를 이용하였다. 각 기법은 기존의 관련연구와 비교분석하여 본 논문에서 제안한 기법이 우수함을 증명하였다.

• 한국산업정보학회논문지
• /
• 제11권2호
• /
• pp.48-62
• /
• 2006

최근 분산 컴퓨팅과 임베디드 시스템을 위한 응용 영역이 급성장하고 무선 통신 기술과 컴퓨터 하드웨어의 발전으로 매우 작은 크기의 센서 노드로 이루어진 센서 네트워크를 구성하는 것이 가능해졌다. 하지만 센서 네트워크의 특징 때문에 기존 라우팅 프로토콜을 적용하기 어렵다. 본 논문에서는 센서 네트워크의 특징을 고려하여 에너지 효율적으로 동작할 수 있는 알고리즘을 제안한다. 먼저 센서 노드가 관찰한 데이터를 싱크로 전송할 때 센서 노드의 에너지의 상태를 고려한 라우팅 프로토콜을 제안한다. 둘째, 센서 노드의 상대 위치를 측정하여 인접 노드를 휴지 상태로 전환시켜 에너지 소모를 줄이는 기법을 제안한다. 센서 노드의 에너지 상태와 위치정보를 주기적으로 재설정하여 센서 네트워크의 서비스 시간을 향상시킨다. 제안하는 기법은 트리기반 라우팅 프로토콜에 비해 경로 유지 시간이 2배 이상 향상되고, 평균 에너지 소모율이 약 30% 줄어든다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권10호
• /
• pp.3834-3857
• /
• 2021

The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.39-42
• /
• 2003

Due to the highly dynamic topology and absence of any fixed infrastructure, stability of selected path in Ad Hoc Networks is of prime importance. The frequent route failure and high control overhead in routing protocol consumes system resources and lead to degraded system performance. In this paper we present route stability metrics reflectting relative position and velocity of nodes, which help determine a stable route.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권1호
• /
• pp.5-24
• /
• 2010

Data fusion is an attractive technology because it allows various trade-offs related to performance metrics, e.g., energy, latency, accuracy, fault-tolerance and security in wireless sensor networks (WSNs). Under a complicated environment, each sensor node must be equipped with more than one type of sensor module to monitor multi-targets, so that the complexity for the fusion process is increased due to the existence of various physical attributes. In this paper, we first investigate the process and performance of multi-attribute fusion in data gathering of WSNs, and then propose a self-adaptive threshold method to balance the different change rates of each attributive data. Furthermore, we present a method to measure the energy-conservation efficiency of multi-attribute fusion. Based on our proposed methods, we design a novel energy equilibrium routing method for WSNs, viz., multi-attribute fusion tree (MAFT). Simulation results demonstrate that MAFT achieves very good performance in terms of the network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2144-2165
• /
• 2016

In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.