• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.75-83
• /
• 1999

recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

• Journal of Internet Technology
• /
• v.21 no.4
• /
• pp.977-988
• /
• 2020

A guard-band is used to prevent collision between paths in multipath routing protocols. However, problems such as traffic congestion, reduced lifetime, and void occurrence arise because existing protocols do not exploit the guard-band during packet transmission, but only transfer packets on the same path. To solve these problems, we propose radio-disjoint multipath routing that consists of guard-band shifting and balanced node selection. The proposed scheme transfers a packet on the constructed path and alternatively, into the guard-band area. In addition, the intermediate node is selected according to link quality and remaining energy, so all of the nodes involving packet transmission can be exploited equally. Through a performance evaluation, we demonstrate that the proposed scheme achieves a higher packet delivery ratio and prolongs the average network lifetime by at least 31% and up to approximately 99% compared with existing routing protocols, under the condition of a 90% link success ratio.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.86-102
• /
• 1991

The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.11
• /
• pp.911-923
• /
• 2013

Multipath routing is one of challenging issues for improving the reliability of end-to-end data delivery in wireless sensor networks. Recently, a disjointedness and management of path have been studying to enhance the robustness and efficiency of the multipath routing. However, previous multipath routing protocols exploit the disjointed multipath construction method that is not to consider the wireless communication environment. In addition, if a path failures is occurred due to the node or link failures in the irregular network environment, they maintain the multipath through the simple method that to construct a new extra path. Even some of them have no a method. In order to cope with the insufficiency of path management, a hole detouring scheme, to bypass the failures area and construct the new paths, was proposed. However, it also has the problem that requires a heavy cost and a delivery suspension to the some or all paths in the hole detouring process due to the centralized and inflexible path management. Due to these limitations and problems, the previous protocols may lead to the degradation of data delivery reliability and the long delay of emergency data delivery. Thus, we propose a flexible disjoint multipath routing protocol which constructs the radio disjoint multipath by considering irregular and constrained wireless sensor networks. It also exploits a localized management based on the path priority in order to efficiently maintain the flexible disjoint multipath. We perform the simulation to evaluate the performance of the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.429-436
• /
• 2009

Odd network was introduced as one model of graph theory. In [1], it was introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties such as simple routing algorithms, maximal fault tolerance, node axsjoint path, etc. In this paper, we sauw a construction algorithm of edge-axsjoint spanning trees in Odd network $O_d$. Also, we prove that edge-disjoint spanning tree generated by our algorithm is optimal edge-disjoint spanning tree.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.475-491
• /
• 2009

This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.718-720
• /
• 2001

본 논문에서는 하이퍼큐브보다 망 비용이 개선된 상호연결망 HCN(n,n)의 임의의 두 노드간에 노드중복하지 않는 n+1개의 병렬경로를 구성하는 방법을 제시하고, 그 결과를 통하여 HCN(n,n)의 고장지름이 dia(HCN(n,n))+4 이하임을 보인다. 이러한 병렬경로는 노드간에 메시지를 전송하는 시간을 줄일 수 있으며, HCN(n,n)의 노드 몇 개가 고장이 발생해도 통신지연시간이 발생하지 않음을 의미한다.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.433-440
• /
• 2010

Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.85-93
• /
• 2001

In this paper, a path restoration method independent of failure location in all-optical networks is proposed and its wavelength requirements are calculated. In the proposed method, since a single backup wavelength is used for any link failure, a node can consist of only fixed wavelength transmitters, resulting in the levels node cost. Hence, restoration process can be triggered just after the failure detection, if combined with edge-disjoint path restoration method. This feature and the parallel cross-connection message transfer technique proposed in this paper make the restoration process faster. Also, it is shown the wavelength requirements in the proposed method are similar to the ones in the method using tunable backup wavelength, resulting in little increment for transmission cost.

• KIISE Transactions on Computing Practices
• /
• v.23 no.2
• /
• pp.116-121
• /
• 2017

In wireless sensor networks, the multipath prefers energy efficient routing method due to the characteristic of low-power sensor which uses geographic method to transmit data packet through information of the neighbor nodes. However, when multipath meets the routing fail area called hole area, path overlap problem can occur, resulting in failed maintenance of disjoint multipath. To solve this problem, multipath research studies have been performed to exploit the modeling and detouring method in routing fail area by keeping the disjoint multipath. However, in an energy point of view, additional method like modeling can lead to a lot of energy consumption of sensor node. Moreover, lots of energy consumption of sensor node can shorten the life span of sensor network. In this study, we proposed an energy efficient geographic routing by keeping the disjoint multipath in routing fail area. The proposed scheme exploited the face routing using the geographic recovery method without additional method like modeling.