• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.763-770
• /
• 2014

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.2
• /
• pp.86-91
• /
• 2011

In the underwater communications, the acoustic channel is in poor communication conditions, such as long propagation delay, narrow bandwidth, and high bit-error rate. For these bad acoustic channels, we propose an efficient automatic repeat request (ARQ) for multi-hop underwater network by using the concepts of concurrent bi-directional transmission, multiple sub-packets, and overhearing data packet instead of the acknowledgement signal. Our results show that the proposed ARQ significantly reduces the transmission latency especially in high BER compared with the existing Stop and Wait ARQ.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.64-69
• /
• 2017

The abstract should summarize the contents of the paper and written below the author information. Use th In Wide-area Wireless Sensor Networks, network lifetime is short due to energy consumption due to transmission distance. To improve this, we divide the sensor field into layers and reduce transmission distance through multi-hop transmission. However, there is a problem in that the transmission rate drops because there is no Cluster Head in the layer, or the transmission distance increases due to the layer, and energy is wasted. There are DL-LEACH and EDL-LEACH as Protocols to improve this. DL-LEACH uses either single-hop transmission or multi-hop transmission depending on the situation. As a result, the transmission distance is optimized, thereby reducing energy consumption. In case of EDL-LEACH, it is proposed to improve the data rate in DL-LEACH. It is the same as DL-LEACH, but the Cluster Head is mandatory for all layers to improve the transmission rate. Although there is no Cluster Head for each layer, the transmission rate is improved, but the network life is shortened. In this paper, we try to improve the network lifetime while maintaining the EDL-LEACH transmission rate. The shortened network lifetime is due to Cluster Head overload near the base station. To improve this, the Cluster Head distribution method is improved and the network lifetime is improved.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.580-581
• /
• 2018

In order to reduce end-to-end delay in EH-WSN (energy harvestin wireless sensor netowk), medium access control protocols using multi-hop routing technique have been studied. In a real environment, there are many situations where it is difficult to harvest enough energy than the energy consumed. Therefore, it is required to design a MAC protocol that allows nodes to reliably relay data without exhausting power in multi-hop transmission. In this paper, we propose a power-efficient MAC protocol that can select the relay node according to the residual power and the energy collection rate to increase network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.279-282
• /
• 2007

Typically a wireless sensor network consists of a number of nodes that sense surrounding environment and collaboratively work to process and route the sensing data to a sink or gateway node. We propose an architecture with support of multiple routers in IPv6-based Low-power Wireless Personal Area Network (6LoWPAN). Our architecture provides traffic load balancing and increases network lifetime as well as self-healing mechanism so that in case of a router failure the network still can remain operational. Each router sends its own Router Advertisement message to nodes and all the nodes receiving the messages can select which router is the best router with the minimum hop-count and link information. We have implemented the architecture and assert our architecture helps in traffic load balancing and reducing data transmission delay for 6LoWPAN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4738-4753
• /
• 2018

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.3
• /
• pp.166-171
• /
• 2023

Efficient energy management is a very important factor in sensor networks with limited resources, and cluster techniques have been studied a lot in this respect. However, a problem may occur in which energy use of the cluster header is concentrated, and when the cluster header is not evenly distributed over the entire area but concentrated in a specific area, the transmission distance of the cluster members may be large or very uneven. The transmission distance can be directly related to the problem of energy consumption. Since the energy of a specific node is quickly exhausted, the lifetime of the sensor network is shortened, and the efficiency of the entire sensor network is reduced. Thus, balanced energy consumption of sensor nodes is a very important research task. In this study, factors for balanced energy consumption by cluster headers and sensor nodes are analyzed, and a balancing distribution clustering method in which cluster headers are balanced distributed throughout the sensor network is proposed. The proposed cluster method uses multi-hop routing to reduce energy consumption of sensor nodes due to long-distance transmission. Existing multi-hop cluster studies sets up a multi-hop cluster path through a two-step process of cluster setup and routing path setup, whereas the proposed method establishes a hierarchical cluster routing path in the process of selecting cluster headers to minimize the overhead of control messages.

• International journal of advanced smart convergence
• /
• v.5 no.1
• /
• pp.59-65
• /
• 2016

In this paper, we're compared network protocol which is network lifetime longer when using LEACH Protocol, SEP, and TEEN in a heterogeneous Wireless Sensor Network with a Large Sensor Area. Also, we propose a method of divided layer the wide-area sensor filed and transmitting a multi-hop to improve the network lifetime. And we're compared network protocol which is network lifetime more improved apply the proposed method to LEACH Protocol, SEP, and TEEN. We tried to compare results, TEEN showed the best network lifetime. Apply the proposed method to divided the sensor field, L-TEEN (Layered TEEN)'s network lifetime rates of improvement is highest.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.11
• /
• pp.984-990
• /
• 2016

In wireless mesh sensor networks (WMSNs), sensor nodes are connected in the form of a mesh topology and transfer sensor data by multi-hop routing. A data aggregation method for WMSNs is required to minimize the number of routing hops and the energy consumption of each node with limited battery power. This paper presents a shortest path data aggregation method for WMSNs. The proposed method utilizes a simple hash function based on shuffled row major indexing for addressing sensor nodes. This allows sensor data to be aggregated without complex routing tables and calculation for deciding the next hop. The proposed data aggregation algorithms work in a fractal fashion with different mesh sizes. The method repeatedly performs gathering and moves sensor data to sink nodes in higher-level clusters. The proposed method was implemented and simulations were performed to confirm the accuracy of the proposed algorithms.