• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2002-2019
• /
• 2017

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.1955-1960
• /
• 2014

Many routing protocols have been proposed for low-power and ad-hoc networks to deliver command or data among nodes and recently, various researches are carried out about networking scheme considering reliability and scalability. In low-power networking technology, the performance of network layer is closely connected with the operation of data link layer and mesh routing mechanisms based on TDMA MAC are considered for reliability and scalability. This paper proposes mesh routing algorithm utilizing the characteristics of TDMA MAC and topological addressing in TDMA based low-power and ad-hoc networks and implementation results are presented.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.135-139
• /
• 2003

Sensor networks consist of sensor nodes with small-size, low-cost, low-power, and multi-functions to sense, to process and to communicate. Minimizing power consumption of sensors is an important issue in sensor networks due to limited power in sensor networks. Clustering is an efficient way to reduce data flow in sensor networks and to maintain less routing information. In this paper, we propose a multi-hop clustering mechanism using global and local ID to reduce transmission power consumption and an efficient routing method for improved data fusion and transmission.

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

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.327-332
• /
• 2016

The routing protocol for low-power and lossy networks (RPL) is an internet protocol based routing protocol developed and standardized by IETF in 2012 to support a wide range of applications for low-power and lossy-networks (LLNs). In LLNs consisting of resource-constrained devices, the energy consumption of battery powered sensing devices during network operations can greatly impact network lifetime. In the case of inefficient route selection, the energy depletion from even a few nodes in the network can damage network integrity and reliability by creating holes in the network. In this paper, a composite energy-aware node metric ($RER_{BDI}$) is proposed for RPL; this metric uses both the residual energy ratio (RER) of the nodes and their battery discharge index. This composite metric helps avoid overburdening power depleted network nodes during packet routing from the source towards the destination oriented directed acyclic graph root node. Additionally, an objective function is defined for RPL, which combines the node metric $RER_{BDI}$ and the expected transmission count (ETX) link quality metric; this helps to improve the overall network packet delivery ratio. The COOJA simulator is used to evaluate the performance of the proposed scheme. The simulations show encouraging results for the proposed scheme in terms of network lifetime, packet delivery ratio and energy consumption, when compared to the most popular schemes for RPL like ETX, hop-count and RER.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.197-200
• /
• 2011

Many routing protocols have been proposed for low-power and ad-hoc networks where energy awareness and reliability are essential design issues. This paper proposes a dynamic routing protocol for low-power and ad-hoc networks. A dynamic path cost function is defined considering the constraints and characteristics of low-power and ad-hoc networks. The cost function can be applied flexibly depending on the characteristics of the networks. The performance of the proposed method is evaluated using a QualNet network simulator.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.179-188
• /
• 2003

Advances in wireless networking technology has engendered a new paradigm of computing, called mobile computing, in which users carrying portable devices have access to a shared infrastructure independent of their physical locations. Wireless communication has some restraints such as disconnection, low bandwidth, a variation of available bandwidth, network heterogeneity, security risk, small storage, and low power. Power adaptation routing scheme overcome the shortage of power by adjusting the output power, was proposed. Existing power saving routing algorithm has some minor effect such as seceding from shortest path to minimize the power consumption, and number of nodes that Participate in routing than optimal because it select a next node with considering only consuming power. This paper supplements the weak point in the existing power saving routing algorithm as considering the gradual approach to final destination and the number of optimal nodes that participate in routing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1113-1116
• /
• 2020

In the EH-WSN(Energy Harvesting Wireless Sensor Network), the routing protocol must consider the power condition of nodes such as residual power and energy harvesting rate. Many EH-WSN studies have emphasized the power aspect and make the urgency of sensed data less important. However, in applications such as environmental monitoring, stability and latency become more important issues than power efficiency for urgent data. In this paper, we designed a routing protocol that can set path according to data urgency. To this end, relay nodes are determined considering the urgency of date. Nodes with poor power do not participate in routing when normal data is generated, so that urgent data can be transmitted reliably with low latency. The performance of the proposed routing protocol is analyzed by computer simulation.

• Journal of Communications and Networks
• /
• v.14 no.5
• /
• pp.546-553
• /
• 2012

Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and $HDLR^+$. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better space-stretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.

• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.49-54
• /
• 2005

With the recent advances in Micro Electro Mechanical System (MEMS) technology, low cost and low power consumption wireless micro sensor nodes have become available. However, energy-efficient routing is one of the most important key technologies in wireless sensor networks as sensor nodes are highly energy-constrained. Therefore, many researchers have proposed routing protocols for sensor networks, especially cluster-based routing protocols, which have many advantages such as reduced control messages, bandwidth re-usability, and improved power control. Some protocols use information on the locations of sensor nodes to construct clusters efficiently. However, it is rare that all sensor nodes know their positions. In this article, we propose another cluster-based routing protocol for sensor networks. This protocol does not use information concerning the locations of sensor nodes, but uses the remaining energy of sensor networks and the desirable number of cluster heads according to the circumstances of the sensor networks. From performance simulation, we found that the proposed protocol shows better performance than the low-energy adaptive clustering hierarchy (LEACH).