• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.741-762
• /
• 2011

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.22-28
• /
• 1997

In this paper, we propose an efficient multicast addressing scheme for he self-routing multistage networks. Using only N-bit routing header an the simple hardware logic, the new scheme can efficiently provides all point-to-multipoint connections in single pass through the multistage copy networks. We also designed a hardware logic of switching element to implementation of multicasting in ATM switches are performed.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.140-144
• /
• 2003

A sensor network consists of many low-cost, low-power, and multi-functional sensor nodes. One of most important issues in of sensor networks is to increase network lifetime, and there have been researches on the problem. In this paper, we propose a routing mechanism to prolong network lifetime, in which each node adjusts its transmission power to send data to its neighbors. We model the energy efficient routing with power control and present an algorithm to obtain the optimal flow solution for maximum network lifetime. Then, we derive an upper bound on the network lifetime for specific network topologies.

• Smart Media Journal
• /
• v.11 no.9
• /
• pp.39-46
• /
• 2022

The WK-recursive network proposed by Vecchia and Sanges[1] is widely used in the design and implementation of local area networks and parallel processing architectures. It provides a high degree of regularity and scalability, which conform well to a design and realization of distributed systems involving a large number of computing elements. In this paper, the routing of a message is investigated on the WK-recursive network, which is key to the performance of this network. We present an efficient shortest path algorithm on the WK-recursive network, which is simpler than Chen and Duh[2] in terms of design complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.195-201
• /
• 2006

This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.

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

A routing scheme for a group of mobile users for wireless ad-hoc networks is presented. The proposed scheme mines social activity patterns from wireless traces, and exploits social user group for efficient data routing among users based on a data publish approach. Simulation results based on real-world wireless traces show that our routing scheme reduces routing cost for a large mobile user group with a factor of 1.8 compared to a baseline counterpart.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.466-469
• /
• 2008

The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.295-306
• /
• 2010

Network lifetime is a critical issue in Wireless Sensor Networks (WSNs). In which, a large number of sensor nodes communicate together to perform a predetermined sensing task. In such networks, the network life time depends mainly on the lifetime of the sensor nodes constituting the network. Therefore, it is essential to balance the energy consumption among all sensor nodes to ensure the network connectivity. In this paper, we propose an energy-efficient data routing protocol for wireless sensor networks. Contrary to the protocol proposed in [6], that always selects the path with minimum hop count to the base station, our proposed routing protocol may choose a longer path that will provide better distribution of the energy consumption among the sensor nodes. Simulation results indicate clearly that compared to the routing protocol proposed in [6], our proposed protocol evenly distributes the energy consumption among the network nodes thus maximizing the network life time.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.4
• /
• pp.209-213
• /
• 2007

In this paper, we propose more efficient implementation architecture for realizing combination of heterogeneous routing protocols in wireless mesh routes. For realizing heterogeneous routing protocol in wireless mesh router, the following should be considered; which position in OS platform protocols should be implemented, how to define the common API for multiple routing protocols, how to provide architecture for providing high data transfer throughput and for supporting multi platform, and finally how to verify the throughput of protocol by using simulator. For solving those consideration, we propose HRPC(Heterogeneous Routing Protocol Coordinator) and describe the method for testing the protocols.

• Journal of Korea Multimedia Society
• /
• v.25 no.11
• /
• pp.1564-1571
• /
• 2022

Wireless sensor network(WSN) is being used in various fields such as reconnaissance, echelon scale identification, weather observation, etc. using small sensors in an environment without a network infrastructure environment. In addition, WSN uses limited battery power, so study on routing protocols to extend the lifetime of the network is important. PEGASIS, a hierarchical routing protocol, accounts for the majority of energy-efficient routing protocol studies and is well known as a representative protocol. In this study, based on PEGASIS, we propose a protocol that constructs multiple chains rather than one chain using the AoA of nodes. The proposed protocol has the advantage of reducing the transmission distance of nodes and eliminating unnecessary transmissions, thereby increasing energy efficiency compared to the existing protocols.