• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.546-553
• /
• 2012

Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and $HDLR^+$. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better space-stretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권3호
• /
• pp.735-748
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1178-1191
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• 한국CDE학회논문집
• /
• 제1권1호
• /
• pp.33-44
• /
• 1996

This study deals with the development of wire path searching module as a part of automobile wire harness design system. Wire path searching module manages the free space, finds transition locations, and creates bundle paths to dramatically reduce a tedious iterative routing process which results in easy optimization of the bundle paths. A prime policy in the system configuration is to compromise between man's and computer's ability, and make it possible a designer's leading role in designing process. Human input is indispensable to cope with the special cases which were not considered in the initial design stage of the system. In this study, we improve the previous shortest-path-finding algorithm, (VGraph and RCA method) into a new method called Extended RCA. Bundles, connectors and transitions are handled as objects so one can manage and modify physical properties of the objects easily. Therefore a verification is allowed at any desired stage of design. The reuse of previous result is facilitated by using Dependency Structure, which represents the mutual relations among connectors, transitions, and bundles. Dependency Structure makes it possible the elimination of redundant calculating process, and consequently shorter routing time.

• 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.

• 대한전자공학회논문지SD
• /
• 제46권9호
• /
• pp.25-32
• /
• 2009

최근 네트워크-온-칩(Network-on-chip)에 대한 연구가 활발히 진행되고 있는 가운데 반도체 칩 복잡도 증가와 고성능에 대한 요구로 인해 기존 구리 기반의 상호연결(Copper-based interconnects)을 사용할 경우 성능, 전력, 대역폭 등에 대한 설계 한계에 곧 직면할 것으로 보인다. 이 문제에 대한 대안으로 전기적인 상호연결(Electrical Interconnects, EIs)과 광학적 상호연결(Optical Interconnects, OIs)을 상호 보완적으로 사용하는 방법이 제안되고 있다. 이러한 연구 방향의 일환으로, 본 논문에서 광학적 상호연결은 지연 시간을 감안하여 임계 경로에, 전기적인 상호연결은 비 임계 경로에 적용하며, 두 상호연결을 혼용하여 사용하기 위한 효율적인 하이브리드 스위치 구조와 라우팅 최적화 방법을 제안한다. 모의실험 결과 제안한 알고리즘과 구조를 적용할 경우 전기적인 상호연결만을 사용 할 경우보다 최대 25%의 속도 향상과 38%의 소비 전력 감소를 나타냈다.

• 한국정보과학회논문지:정보통신
• /
• 제29권4호
• /
• pp.386-396
• /
• 2002

본 논문은 신경망을 이용한 최단 경로 문제를 풀기 위해 흡필드 신경망(Hopfield Neural Network)을 변형한 준최적 라우팅 알고리즘(suboptimal routing algorithm)을 다룬다. 이 알고리즘은 기존의 흡필드 신경망 알고리즘과는 달리 뉴런(neuron)의 진화를 위해 모든 주변 뉴런 정보뿐만 아니라, 상관 관계성이 높은 자신의 뉴런 정보도 동시에 이용함으로써, 수렴 성능 및 경로의 최적성을 향상하고자 하였다. 이 알고리즘의 수렴 속도는 흡필드 신경망을 이용하는 기존의 알고리즘보다 더 우수하며, 탐색 경로의 최적성도 높다는 것을 컴퓨터 시뮬레이션을 통해 확인한다. 이 결과는 거의 모든 출발지와 도착지 쌍에 대해 기존의 흡필드 신경망 기반의 최단 경로 탐색 알고리즘에 비해 네트워크 토폴로지에 비교적 덜 민감한 것으로 나타난다. 따라서, mobile ad-hoc network과 같이 네트워크 토폴로지가 시변하는 다중-흡 무선 패킷망(Multi-hop Packet Radio Network)에서의 경로 설정 알고리즘을 구현하는데 유용할 것으로 보인다.

• 인터넷정보학회논문지
• /
• 제8권4호
• /
• pp.17-29
• /
• 2007

본 논문에서는 RNG 기반의 스캐터넷 토폴로지 구성, 자기 치유 및 라우팅 경로의 최적화를 위한 알고리즘(RNG-FHR)을 제시하고, ns-2와 블루투스 확장인 blueware 시뮬레이터를 이용하여 알고리즘의 성능을 분석하였다. 소규모 분산망 환경에서 스캐터넷 구성, 노드의 링크 설정 및 자기 치유 관점에서 분석한 결과, 초기에는 이웃노드 발견을 위한 메시지 교환량이 증가하여 지연이 점차 증가하지만 시간이 지남에 따라 이웃노드 발견과 충분한 로컬 정보 교환에 따라 지연이 다소 줄어듦을 알 수 있다. 결국 블루투스 망을 RNG 기반으로 확장하여 소규모의 분산망에 적용하는 경우 소량의 메시지 교환과로컬 정보 교환으로 인해망 구성, 자기 치유 및 라우팅 경로의 최적화가 가능하여 성능과 구현측면에서 충분히 실현 가능함을 알 수 있다.

• 한국통신학회논문지
• /
• 제23권8호
• /
• pp.1883-1892
• /
• 1998

본 논문은 단일흡 WDM 광전달망에서 경로설정 및 파장할당을 위한 효율적인 설계를 고려한다. 노드쌍간의 하나의 연결은 하나의 광경로로 이루어지고 노드쌍간 연결수요는 주어진 것으로 한다. 파장 변환을 허용하지 않고 물리망은 주어진 것으로 가정한다. 본 논문에서는 노드쌍의 모든 연결 수요를 만족하는 최소 파장수를 갖는 광경로 설정 및 파장할당 바업ㅂ을 제시한다. 이를 위해 먼저 최적화 모형을 제시하고 모형의 해를 제공하는 발견적 알고리즘을 제시한다. 발견적 알고리즘을 구현하고 실제 규모의 망에 적용하여 결과를 최적화 상용코드인 GAMS/OSL 의 결과와 비교하고, Wauters & Demeester [8] 연구 결과와도 비교한다.

• 한국국방경영분석학회지
• /
• 제22권2호
• /
• pp.73-89
• /
• 1996

This paper suggests the new IP, SIMIP(Simple Mobile IP), which supports a continuous mobility between a static host and a mobile host in the static TCP/IP LAN environment where mobile hosts are overlayed with cells. For designing a mobile protocol, routing optimization is very important, and it is directly related to the management mechanism of a mobile host's location information. When the mobile hosts' location information are centralized, the network has high risk when a centralized device fails. On the other hand, when they are distributed, the above problems are solved. But it requires complicated techniques in order to search the encapsulated addresses. SIMP centralizes mobile hosts' location information, minimizes the risk by automatically substituting the failed default mobile router with one of the multiple general mobile routers, and supports the optimal routing path through "default mobile router path alternation" Then since SIMIP isn't reasonable the operations informations to the chief in military operations room.ions room.