• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.173-179
• /
• 2008

An ad hoc network is multi-hop wireledss formed by mobile node without infrastructure. Due to the mobility of nodes in mobile ad hoc networks, the topology of network changes frequently. In this environments, multicast protocols are faced with the challenge of producing multi-hop routes and limitation of bandwidth. We compare the performance of two multicast routing protocols for mobile ad hoc networks - Serial Multiple Disjoint Tree Multicast Routing Protocol (Serial MDTMR) and Adaptive Core Multicast Routing Protocol (ACMRP). The simulator is implemented with GloMoSim.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.06a
• /
• pp.53-53
• /
• 2002

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.3
• /
• pp.61-72
• /
• 2002

In this paper, we propose two timing-driven routing algorithms for single-source net and multi-source net as applications of 1-Steiner heuristic algorithm. Using the method of substituting the cost of 1-Steiner heuristic algorithms with interconnection delay, our routing algorithms can route both single-source net and multi-source net which have all critical source-terminal pairs or one critical pair efficiently Our single-source net routing algorithm reduced the average maximum interconnection delay by up to 2.1% as compared with previous single-source routing algorithm, SERT, and 10.6% as compared with SERT-C. and Our multi-source net routing algorithm increased the average maximum interconnection delay by up to 2.7% as compared with MCMD A-tree, but outperforms it by up to average 1.4% when the signal net has only subset of critical node pairs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.75-79
• /
• 2010

Wireless sensor networks (WSN) are widely used in many applications. WSN acquires the data of surrounding environments with sensors attached to each node. It is important to design sensor networks that can communicate energy-efficiently as well as to get sensor readings with high accuracy. In this paper, we propose a novel routing scheme that assures high accuracy and significantly reduces data transmission costs in WSN with faults. First, we organize a number of network topologies randomly for routing sensor readings to the base station. Because every sensor node is connected each other with a single path, redundant transmissions are not incurred. It can reduce unnecessary transmissions and guarantee final sensor readings with high accuracy. To show the superiority of our scheme, we compare it with an existing multi-path routing scheme. In the result, our scheme has similar accuracy as the existing scheme and reduces unnecessary data transmissions by about 70% over the existing technique.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.33-39
• /
• 2000

In this paper, we present an algorithm for the multicast routing problem when there exit the cell replication limits of ATM switching nodes. This problem can be formulated as a Degree Constrained Minimum Steiner Tree Problem(DCSP). The proposed algorithm is a modification of the shortest path heuristic originally devised for minimum Steiner tree problem. From the experimental results, it can be seen that our algorithm is efficient to obtain a near optimal solution with comparatively low computational time.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.360-369
• /
• 2007

Since wireless sensor networks consist of nodes with the constrained battery, it is important to construct the topology performing energy-efficient routing while maximizing the whole network lifetime. Previous works related to this do not take into consideration the specific communication pattern in wireless sensor networks. In this paper, we propose a novel routing algorithm, called Up-Down Tree(UDT), which first constructs the tree topology based on distance and then adjusts the transmission range determined by the two different phases, tree setup and data gathering, to adapt the specific communication pattern in wireless sensor networks. Therefore, the UDT can improve energy efficiency, maximize the network lifetime, and block network partition Simulation results show that the UDT has the improved energy efficiency by constructing the optimal topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2477-2487
• /
• 1997

In this paepr, we propose a dynamic multicast routin algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the effiiciency enen in the case wheree the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we frist generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection. We also demonstrate the more cost-saving can be expected in dense networks when applyingour proposed algorithm.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2007.05a
• /
• pp.183-186
• /
• 2007

Faster, safer and cheaper mailing of the postal matter is essential for surviving in the competitive market of home-delivery service. The Steiner tree connects points minimally in geometrical way and has been used in the distribution system optimization and optimal routing of the transmission lines of the electric power system. This paper proposes a method to select the optimal location of mail distribution center that minimally connect the local mail center of some major cities using the Steiner tree theorem.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.169-176
• /
• 2000

This paper is considered with the problem of embedding complete binary trees into 3-dimensional meshes using dimension-ordered routing with primary concern of minimizing link congestion. The authors showed that a complete binary tree with $2^P-1$ nodes can be embedded into a 3-dimensional mesh with optimum size, $2^P$ nodes, if the link congestion is two[14], (More precisely, the link congestion of each dimension is two, two, and one if the dimension-ordered routing is used, and two, one, and one if the dimension-ordered routing is not imposed.) In this paper, we present a scheme to find an embedding of a complete binary tree into a 3-dimensional mesh of size no larger than 1.27 times the optimum with link congestion one while using dimension-ordered routing.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1113-1128
• /
• 2020

Ad hoc networks play an important role in mobile communications, and the performance of nodes has a significant impact on the choice of communication links. To ensure efficient and secure data forwarding and delivery, an intelligent routing protocol (IAODV) based on learning method is constructed. Five attributes of node energy, rate, credit value, computing power and transmission distance are taken as the basis of segmentation. By learning the selected samples and calculating the information gain of each attribute, the decision tree of routing node is constructed, and the rules of routing node selection are determined. IAODV algorithm realizes the adaptive evaluation and classification of network nodes, so as to determine the optimal transmission path from the source node to the destination node. The simulation results verify the feasibility, effectiveness and security of IAODV.