• 한국통신학회논문지
• /
• 제37B권9호
• /
• pp.760-766
• /
• 2012

본 논문에서 효율적인 플러딩(flooding)을 위한 알고리즘을 제시하였다. 대표적인 link-state 라우팅 프로토콜인 OSPF(Open Short Path First)와 IS-IS(Intermediate System Routing Protocol)는 네트워크의 환경이 변할 때 노드 간에 LSA를 플러딩하여, 정보를 교환할 수 있다. 하지만 네트워크의 규모가 커지면 불필요한 LSA가 증가하여 CPU, 메모리, 대역폭 사용을 증가시켜 네트워크의 확장성에 영향을 준다. MST(Minimum spanning tree)를 기반으로 하는 기존 알고리즘은 네트워크의 불안정성과 효율적이지 못한 플러딩 문제를 가지고 있다. 그래서 네트워크의 안정성을 유지하면서 효율적인 플러딩을 위한 알고리즘을 제안하였다. 시뮬레이션을 통해 제안한 알고리즘이 기존 알고리즘보다 플러딩 효율이 향상된 것을 확인하였다.

• 한국지능시스템학회논문지
• /
• 제15권6호
• /
• pp.736-741
• /
• 2005

다단계 호핑(multi-hop) 무선 센서네트워크의 라우팅 경로를 설정하는데 있어서 데이터 전송의 요구가 있는 경우에만 경로를 만드는 Demand-Driven 방식의 대표적인 방법이 DSR(Dynamic Source Routing)인데 라우트 레코드를 패킷에 실어 보내기 때문에 이 또한 센서노드들의 수가 많아질수록 패킷이 무거워질 수밖에 없다. 본 논문에서는 DSR 프로토콜을 기반하면서도 라우팅 테이블을 적절히 이용하여 노드 수 증가에 대해 고정된 패킷크기를 가지도록 하였으며 라우팅 비용함수를 적용하여 각 센서노드들의 전원 소모량, 이동성(Mobility), 네트워크 내에서의 Traffic, 거리(Hop) 등을 복합적으로 고려한 안정적이고 신뢰성 있는 최적의 라우팅 설정알고리즘을 제안한다.

• International Journal of Computer Science & Network Security
• /
• 제23권8호
• /
• pp.121-136
• /
• 2023

Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

• 한국산학기술학회논문지
• /
• 제3권4호
• /
• pp.274-279
• /
• 2002

광대역 ISDN 서비스를 위한 ATM 패킷 스위칭 구조 설계 기술을 위한 접근은 주로 비교적 하드웨어의 복잡성이 낮은 병렬 네트워크의 Self-Routing 함수를 주로 이용하므로 피할 수 없는 패킷의 충돌로 인한 패킷의 손실을 줄이기 위하여 여러 가지 형태로 연구가 진행되어 왔다. 따라서, 본 연구과제에서는 비교적 하드웨어의 복잡성보다는 효율적인 Routing 알고리즘을 통하여 스위칭 네트워크의 성능을 향상시킬 수 있는 Sort-Banyan을 기본으로 한 스위칭 구조를 근간으로 하여 하드웨어 구조의 개선과 그에 맞는 최적의 Routing 알고리즘을 개발한다. 이러한 스위치 네트워크를 구현하기 위해 두 단계의 패킷 분배 결정 알고리즘 따라 분배를 결정하여 패킷이 전송될 때 출력 단에서 충돌이 발생하지 않도록 미리 선택적으로 전송함으로서 패킷의 손실을 방지하는 패킷 Distributor 및 Multiplane의 구성을 제안한다. 이는 Self-Routing 함수로 인하여 발생되는 내부 Blocking을 해결하기 위한 방법으로, 패킷의 손실을 최소로 하여, 전송에 있어서 지연을 줄이는 효과가 있는 중요한 스위치 네트워크로 구성될 것이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1317-1341
• /
• 2021

Nowadays, the Internet of Things (IoT) is adopted to enable effective and smooth communication among different networks. In some specific application, the Wireless Sensor Networks (WSN) are used in IoT to gather peculiar data without the interaction of human. The WSNs are self-organizing in nature, so it mostly prefer multi-hop data forwarding. Thus to achieve better communication, a cross-layer routing strategy is preferred. In the cross-layer routing strategy, the routing processed through three layers such as transport, data link, and physical layer. Even though effective communication achieved via a cross-layer routing strategy, energy is another constraint in WSN assisted IoT. Cluster-based communication is one of the most used strategies for effectively preserving energy in WSN routing. This paper proposes a Bio-inspired cross-layer routing (BiHCLR) protocol to achieve effective and energy preserving routing in WSN assisted IoT. Initially, the deployed sensor nodes are arranged in the form of a grid as per the grid-based routing strategy. Then to enable energy preservation in BiHCLR, the fuzzy logic approach is executed to select the Cluster Head (CH) for every cell of the grid. Then a hybrid bio-inspired algorithm is used to select the routing path. The hybrid algorithm combines moth search and Salp Swarm optimization techniques. The performance of the proposed BiHCLR is evaluated based on the Quality of Service (QoS) analysis in terms of Packet loss, error bit rate, transmission delay, lifetime of network, buffer occupancy and throughput. Then these performances are validated based on comparison with conventional routing strategies like Fuzzy-rule-based Energy Efficient Clustering and Immune-Inspired Routing (FEEC-IIR), Neuro-Fuzzy- Emperor Penguin Optimization (NF-EPO), Fuzzy Reinforcement Learning-based Data Gathering (FRLDG) and Hierarchical Energy Efficient Data gathering (HEED). Ultimately the performance of the proposed BiHCLR outperforms all other conventional techniques.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.238-242
• /
• 2005

This paper considers a routing problem on a RPR(Resilient Packet Ring). The RPR is one of the ring-type data telecommunication network. Our major problem is to find an optimal routing algorithm for a given data traffic on the network under no splitting the traffic service, where the maximum load of a link is minimized. This paper characterizes the Minmax problem and develops two heuristic algorithms. By using the numerical comparison, we show that our heuristic algorithm is valuable for efficient routing the data traffic on a RPR.

• 전자공학회논문지A
• /
• 제29A권10호
• /
• pp.49-56
• /
• 1992

A new global routing algorithm which dynamically adjusts its cost parameters depending on the given routing poroblem to find a near optimum solution has been developed. The proposed algorithm efficiently performs global routing on general area in which all the pin positions are given. This algorithm is composed of two phases`In the first phase, it routes each net by searching a minimum cost path while ignoring the channel capacity. In the second iterative phase, it rips up nets which pass the channel at which the horizontal or vertical routing density exceeds the capacity and then it reroutes them using a modified set of cost parameters. Applying the above phases, paths for nets are found such that routing density doesn't exceed the capacity in each channel and that nets are routed with minimum cost. Experimental results for several benchmark examples including difficult-4, difficult-8, difficult-16, Primary1 and Primary2 show that our method generates better results than other published ones.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.25-32
• /
• 2006

Given a schedule of train to be routed by a Railway Stock, Railway Stock Routing Problem determine a sequence of train while satisfying turnaround time and maintenance restrictions. The objective is to minimize the Railway Stock during a week and each day simultaneously. And we prove that Railway Stock Routing Problem with maintenance restrictions is NP-hard. In this paper, we present two stage approaches that solve the Railway Stock Routing Problem in a reasonable time. In first stage we relax maintenance restrictions and formulate as a Min-cost-flow problem. Then, in the second stage, we attempt to satisfy maintenance restrictions using ours heuristic algorithm. We show the computational result of applying to an actual train schedule data.

• 대한전자공학회논문지
• /
• 제25권2호
• /
• pp.102-108
• /
• 1988

In this paper, a channel routing algorithm which considers cycle problem is proposed. The requirements of routing is given by pin numbers which imply interconnections between a upper block and lower block of the channel. Output is represented by interconnections among equipotential pins. When input is given, the algorithm constructs a channel representation graph and makes weight of each net. And then it checks cycle and finidhes the routing. If the cycle is detected, it finds path with maze routing. This algorithm have coded in C language on IBM-PC /AT. If cycle is not detected, the results are near optimal values. If it is detected, routing is possible as well.

• 산업공학
• /
• 제16권spc호
• /
• pp.14-20
• /
• 2003

This paper presents a multi-criteria decision model and Multi-Criteria Generic Algorithm(MCGA) approach to improve backbone topology by leveraging the Virtual Link(VL) system in an hierarchical Link-State(LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in an hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MCGA.