• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.4
• /
• pp.151-157
• /
• 2023

RPL (IPv6 Routing Protocol for Low-power Lossy Network) is a standardized routing protocol for LLNs (Low power and Lossy Networks) by the IETF (Internet Engineering Task Force). RPL creates routes and builds a DODAG (Destination Oriented Directed Acyclic Graph) through OF (Objective Function) defining routing metrics and optimization objectives. RPL supports a leaf mode which does not allow any child nodes. In this paper, we propose INFRA-RPL which provides a dynamic leaf mode functionality to a leaf node with the mobility. The proposed protocol is implemented in the open-source IoT operating system, Contiki-NG and Cooja simulator, and its performance is evaluated. The evaluation results show that INFRA-RPL outperforms the existing protocols in the terms of PDR, latency, and control message overhead.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.601-602
• /
• 2011

In wireless sensor networks, coverage problem is a fundamental issue that has attracted considerable attention in recent years. Most node scheduling patterns utilize the adjustable range of sensor to minimize the sensing energy consumption. However, a large source of consumption of communication energy of sensor is not strictly taken into account. In this paper, we introduce an energy-efficient pattern that is used to minimize the communication energy consumption of a sensor network. Calculations and extensive simulation are conducted to evaluate the efficiency of the new pattern comparing to existing ones.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.29-34
• /
• 2008

In this paper, we propose an entropy-based dynamic routing protocol for supporting effective route stability in mobile ad-hoc wireless sensor networks(MAWSN). The basic ideas and features are as follows. First, construction of entropy-based stable routing route using mobility of nodes between a source node and a destination node. Second, usage of location and direction information for route construction to support resource saving. Third, We consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET. The simulation results show the proposed routing protocol can effectively support route stability and packet delivery ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.10 no.4
• /
• pp.265-275
• /
• 2010

In this work, reliable methodology for device design is presented. Based on this method, the underlap length has been optimized for minimizing the gateinduced drain leakage (GIDL) in a 22-nm node 4-terminal (4-T) silicon-on-insulator (SOI) fin-shaped field effect transistor (FinFET) by TCAD simulation. In order to examine the effects of underlap length on GIDL more realistically, doping profile of the source and drain (S/D) junctions, carrier lifetimes, and the parameters for a band-to-band tunneling (BTBT) model have been experimentally extracted from the devices of 90-nm channel length as well as pnjunction test element groups (TEGs). It was confirmed that the underlap length should be near 15 nm to suppress GIDL effectively for reliable low standby power (LSTP) operation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.213-220
• /
• 2008

A MANET is an autonomous, infrastructureless system that consists of mobile nodes. In MANET, on-demand routing protocols are usually used because network topology changes frequently. The current approach in case of broken routes is to flag an error and re-initiate route discovery either at the source or at the intermediate node. Repairing these broken links is a costly affair in terms of routing overhead and delay involved. Therefore, this paper propose a NAODV(Neighbor-aware AODV) protocol that stands on the basis of an AODV. It sets up the route rapidly if it operates for setting the route directly by using sequence number of neighbor nodes without re-search the route when the route to destination node is broken. Also, it reduces loss of packets. We use NS-2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio and average end-to-end delay. Also, when the proposed protocol is applied to the large ad-hoc network with multiple nodes, the performance is more efficient.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.135-142
• /
• 2010

Wireless mesh network, which is an access network technology, adopts ubiquitous features of ad-hoc network that includes capabilities of self-configuration and self-management. This paper proposes a scheme which enables nodes along route in wireless mesh network to authenticate data and verify data integrity. The scheme distinguishes infra-node, which is a network device used to form mesh network, and user node in ad-hoc network, which operates functions as a sender, receiver or relayer, to deploy different authentication scheme. That is, hop-based authentication scheme along route forming wireless backbone differs from authentication scheme for user nodes in route over MANET. The proposed scheme is less complex than previously proposed schemes from the repects of security setup procedures and managements. In addition, the scheme is able to reduce transmission delay from a source to a destination owing to fast authentication over wireless backbone.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.17-24
• /
• 2011

In this paper, we propose an Entropy-based Routing Protocol using Mobility (ERPM) for supporting ubiquitous convergence services efficiently in mobile ad-hoc wireless networks. The main features that the ERPM introduces to obtain the goals can be summarized as follows. First, ERPM can construct stable routing routes based on the entropy concepts using mobility of nodes. Second, ERPM can quantitatively evaluate the stability of route by entropy concepts using mobility of nodes. Third, ERPM can select the most stable route in the view points of mobility of routes between a source node and a destination node, where multiple paths are available. The performance evaluation of the proposed ERPM performed via simulation using OPNET and analysis shows that the ERPM can support the construction of stable routing routes and increase the transmission ratio of data efficiently.

• Journal of IKEEE
• /
• v.12 no.1
• /
• pp.8-17
• /
• 2008

Recently, GMAHN that provides interface between MANET and Wired Network has been focused in mobile communication. It is necessary that the technology provide reliable data transmission technology between mobile node and wired network in MANET environment that is varied by the node movement. In this paper, using the TCP protocol(Tahoe, Reno, Vegas, SACK)that increases reliability between source and destination, we applied the TCP protocol mechanism to various environment, and proposed the most efficient TCP mechanism by comparing each mechanism.