• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.227-230
• /
• 2011

In this paper, we are proposed ECOPS(Energy Conserving optimal Path Schedule) algorithm that according to ALPS(Ad hoc network Localized Positioning System) algorithm the location information is received and the new head node is selected considering the energy efficiency. The proposed algorithm follows RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure, that is the hierarchic cluster structure. And by using the location information of the node, it maintains the cluster which the energy is efficient with the production. It increases the life time of the total routing structure.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.395-402
• /
• 2007

Wireless sensor networks have many sensor nodes which response sudden events in a sensor fields. Some efficient routing protocol is required in a sensor networks with mobile sink node. A data-path template is offered for the data announcement and data request from source node and sink node respectively. Sensed data are transferred from source node to sink node using short-distance calculation. Typical protocols for the wireless networks with mobile sink are TTDD(Two-Tier Data Dissemination) and CBPER(Cluster-Based Power-Efficient Routing). The porposed SPDR(Short-Path Data Routing) protocol in this paper shows more improved energy efficiencies from the result of simulations than the typical protocols.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.180-190
• /
• 2011

Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.91-96
• /
• 2019

For a wireless sensor network in general, efficient routing decision is important because wireless connections are not stable, sensitive to external interference, and topology changes dynamically. RPL standard of IETF is not flexible to various environmental changes and causes packet loss and delay due to topological imbalance. Sending packets through multipath can partially remedy this problem. The multipath routing, however, can introduce significant delay overhead by allocating unnecessary timeslots. This paper proposes an RPL using multipath adaptively according to network conditions. We show by simulations that the proposed algorithm is more efficient than the basic RPL and the multipath RPL.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.3
• /
• pp.387-392
• /
• 2014

Now a days, there are various application functions to transmit from vehicles to the Internet and vice versa. And the communication can be operated through a roadside infrastructure including with possible use of routing protocols. Specifically, autonomous vehicles for remote driving and monitoring requires transmitting of high depth of multimedia such as video. Especially in a populated urban area, an efficient network is vital because of handling a great amount of the data. Therefore, in this paper, efficient network topology for a crossroad in urban area is suggested by performance evaluation of vehicular networks using a wireless LAN and a routing protocol. For the performance evaluation, various vehicular network topologies are designed and simulated in OPNet simulator.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.907-909
• /
• 2016

In this peper, we proposed efficient network structure using UAV squad in DTN. In Delay Tolerant Network(DTN), the routing protocols adopting store-carry-forward method are used for solving network problem occurred by the unstable network environments. This routing method is useful for work in disaster and battle field so many researches are in progress. This paper is part of that, we use UAV squad in DTN which is dynamic environments for efficient network structure. Propsed measure use environment information in disparate sensor node and organize UAV squad for stable network.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.11-18
• /
• 2014

Recently, ICT technology has been evolving towards an M2M (Machine to Machine) environment that allows communication between machine and machine from the communication between person and person, and now the IoT (Internet of Things) technology that connects all things without human intervention is receiving great attention. In such a network environment, the communication network between object and object as well as between person and person, and person and object is available which leads to the sharing of information between all objects, which is the essential technical element for us to move forward to the information service society of the era of future ubiquitous computing. On this paper, the protocol related to DTMNs in a Sparse M2M environment was applied and the improved routing protocol was applied by using the azimuth and density of the moving node in order to support a more efficient network environment to deliver the message between nodes in an M2M environment. This paper intends to verify the continuity of the study related to efficient routing protocols to provide an efficient network environment in the IoT and IoE (Internet of Everything) environment which is as of recently in the spotlight.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.212-218
• /
• 2021

Low-power and Lossy Networks (LLNs) have become the common network infrastructure for a wide scope of Internet of Things (IoT) applications. For efficient routing in LLNs, IETF provides a standard solution, namely the IPv6 Routing Protocol for LLNs (RPL). It enables effective interconnectivity with IP networks and flexibly can meet the different application requirements of IoT deployments. However, it still suffers from different open issues, particularly in large-scale setups. These include the node unreachability problem which leads to increasing routing losses at RPL sink nodes. It is a result of the event of memory overflow at LLNs devices due to their limited hardware capabilities. Although this can be alleviated by the establishment of multi-sink topologies, RPL still lacks the support for effective load balancing among multiple sinks. In this paper, we address the need for an efficient multi-sink load balancing solution to enhance the performance of PRL in large-scale scenarios and alleviate the node unreachability problem. We propose a new RPL objective function, Multi-Sink Load Balancing Objective Function (MSLBOF), and introduce the Memory Utilization metrics. MSLBOF enables each RPL node to perform optimal sink selection in a way that insure better memory utilization and effective load balancing. Evaluation results demonstrate the efficiency of MSLBOF in decreasing packet loss and enhancing network stability, compared to MRHOF in standard RPL.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.735-748
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.666-668
• /
• 1998

In this paper, we consider a bi-objective vehicle routing problem to minimize total distance traveled and maximize minimum integrated satisfaction level of selecting desirable routes in an fuzzy graph. The fuzzy graph reflects a real delivery situation in which there are a depot, some demand points, paths linking them, and distance and integrated satisfaction level are associated with each route. For solving the vi-objective problem we introduce a concept of routing vector and define non-dominated solution for comparing vectors. An efficient algorithm involving a selection method of non-dominated solutions based on DEA is proposed for the vehicle routing problem with rigid distance and integrated satisfaction level.