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

• Convergence Security Journal
• /
• v.7 no.3
• /
• pp.71-78
• /
• 2007

We proposed a simple and efficient routing protocol designed specifically for multi-hop ad-hoc networks. The proposed protocol is composed of the two routing tables which work together to allow nodes to send and receive packets. All aspects of the protocol can be operated on networks entirely consisting bidirectional links and networks with unidirectional links. Finding unidirectional link is embedded in the routing protocol since we considered not only bidirectional links but also unidirectional links when we developed a routing method.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1209-1218
• /
• 2001

In this dissertation, we propose a dynamic source routing protocol supporting asymmetric path for mobile ad hoc networks. At present, the existing dynamic source routing protocol supports only symmetric path for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile termenals or current wireless environment. Thus, we implement a mobile ad hoc routing protocol supporting asymmetric routing path, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1354-1372
• /
• 2012

Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.1-11
• /
• 2009

In this paper, we propose a QoS routing protocol for WiMAX based wireless mesh networks. The proposed routing protocol is a proactive hop-by-hop QoS routing protocol. It can find an optimal route that satisfies QoS requirements using bandwidth and delay as QoS parameters. In this paper, we first present a network model for WIMAX based wireless mesh networks and explain why QoS routing protocol is the most appropriate for WiMAX based wireless mesh networks. Then, we propose a proactive hop-by-hop QoS routing protocol that meets QoS requirements of traffic flowing between mesh client and the gateway. The simulation results show that the proposed routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.91-105
• /
• 2010

A wireless sensor network communication technique has been broadly studied with continuous advances in ubiquitous computing environment. Especially, because the resource of the sensor node is limited, it is important to reduce the communication energy by using an energy-efficient routing protocol. The existing cluster-based routing protocols have a problem that they cannot select a cluster head efficiently by randomly choosing a head. In addition, because the existing cluster-based routing protocols do not support the large scale of network, they cannot be used for various applications. To solve the above problems, we, in this paper, propose a new cluster-based routing protocol using representative paths. The proposed protocol constructs an efficient cluster with distributed cluster heads by creating representative paths based on hop count. In addition, a new routing protocol supports multi-hop routing for data communication between a cluster member node and a cluster head as well as between cluster heads. Finally, we show that our protocol outperforms LEACH and Multihop-LEACH in terms of reliability and scalability.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3218-3226
• /
• 2009

A number of on-demand routing protocols for sensor networks have been proposed yet. However, the majority of proposed on-demand routing protocols for sensor networks are not suitable for a relatively poor wireless environment and sensor applications requiring reliable data transmission due to using a hop-count metric for their protocols. In this paper, we proposed a minimum LQI(Link Quality Indicator) based on-demand sensor network routing protocol that is suitable for a relatively poor wireless environment and implemented the proposed routing protocol on a TinyOS. We also compared the implemented protocol with typical hop count based routing protocol by carrying out performance experiments on a multi-hop testbed. The results from these experiments showed that the successful transmission rate of the proposed routing protocol is higher than that of typical hop count based routing protocol over a poor wireless link.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.815-818
• /
• 2015

AODV routing protocol, one of the most studied routing protocols for the Mobile Ad hoc Network (MANET), uses the number of hops as the metric to choose a path from a source node to a destination node. If the path is deteriorated, it will cause many problems to the communication. In order to improve the performance of the network, we propose AuM-AODV routing protocol that contains an auxiliary metric besides the number of hops. Nodes using AuM-AODV use control packets such as Route Request (RREQ), Route Reply (RREP), and HELLO to exchange information about network topology like AODV routing protocol. AuM-AODV routing protocol is implemented in NS-3 for performance evaluation. We use three performance metrics, that is to say, throughput, packet delivery ratio, and average end-to-end delay. According to numerical results, the new AuM-AODV routing protocol has better performance over three performance metrics than AODV routing protocol.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.3
• /
• pp.59-67
• /
• 2009

This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.

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