• Journal of Advanced Navigation Technology
• /
• v.21 no.3
• /
• pp.306-311
• /
• 2017

In the future ubiquitous network, information will collect data from various sensors in the field. Since the sensor nodes are equipped with small, often irreplaceable, batteries with limited power capacity, it is essential that the network be energy-efficient in order to maximize its lifetime. In this paper, we propose an effective network routing method that can operate with low power as well as the transmission of data and information obtained from sensor networks, and identified the number of sensors with the best connectivity to help with the proper placement of the sensor. These purposes of this research are the development of the sensor middle-ware to integrate the maritime information and the proposal of the routing algorithm for gathering the maritime information of various sensors. In addition, for more secure ship navigation, we proposed a method to construct a sensor network using various electronic equipments that are difficult to access in a ship, and then construct a communication system using NMEA(the national marine electronics association), a ship communication standard, in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.728-733
• /
• 2009

An ubiquitous environment has features like peer-to-peer and nomadic environments. Such features can be represented by peer-to-peer systems and mobile ad-hoc networks. P2P systems and MANETs share similar features, appealing for implementing P2P systems in MANET environment. However, if a P2P system designed for wired networks was applied to mobile ad-hoc environment, its performance was not good enough. Subsequently, this paper proposes a P2P system to improve performance using cross-layer design and the goodness of a node as a peer by using routing metric and P2P metric to choose favorable peers to connect. It also utilizes proactive approach for distributing peer information. The simulation results showed that the proposed system produced better performance in query success rate, query response time and energy consumption by reducing the routing path length.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1082-1092
• /
• 2008

In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1431-1439
• /
• 2016

In this paper, we propose a new location service and location-based routing for data dissemination from a source to a mobile group sink in less energy consumption of the sensor node. Unlike the existing protocols, the proposed protocol uses a leader sink instead of a group area as the location information to represent a mobile sink group. The proposed protocol also uses grid leaders on virtual grid structure to support sink mobility in location service. By using a leader sink as a representative and grid leaders for mobility supporting, the proposed protocol can exploit an efficient hierarchical location service and data dissemination method without using flooding. Accordingly, the proposed protocol carries out upper layer location services and data dissemination between a leader sink and a source and lower layer location services and data dissemination between the leader sink and member sinks. Simulation results demonstrate that the proposed protocol achieves energy-efficiency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.3
• /
• pp.29-38
• /
• 2006

Recent advances in wireless communication technology promotes many researches related to sensor network and brings several proposals to fit into various types of sensor network communication. The research direction for sensor network is divided into the method to maximize an energy efficiency and security researches that has not been remarkable so far. To maximize an energy efficiency, the methods to support data aggregation and cluster-head selection algorithm are proposed. To strengthen the security, the methods to support encryption techniques and manage a secret key that is applicable to sensor network are proposed, In. However, the combined method to satisfy both energy efficiency and security is in the shell. This paper is devoted to design the protocol that combines an efficient clustering protocol with key management algorithm that is fit into various types of sensor network communication. This protocol may be applied to sensor network systems that deal with sensitive data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1224-1248
• /
• 2022

In various sensor network applications, such as climate observation organizations, sensor nodes need to collect information from time to time and pass it on to the recipient of information through multiple bounces. According to field tests, this information corresponds to most of the energy use of the sensor hub. Decreasing the measurement of information transmission in sensor networks becomes an important issue.Compression sensing (CS) can reduce the amount of information delivered to the network and reduce traffic load. However, the total number of classification of information delivered using pure CS is still enormous. The hybrid technique for utilizing CS was proposed to diminish the quantity of transmissions in sensor networks.Further the energy productivity is a test task for the sensor nodes. However, in previous studies, a clustering approach using hybrid CS for a sensor network and an explanatory model was used to investigate the relationship between beam size and number of transmissions of hybrid CS technology. It uses efficient data integration techniques for large networks, but leads to clone attacks or attacks. Here, a new algorithm called SBEA (Snowball Endurance Algorithm) was proposed and tested with a bow. Thus, you can extend the battery life of your WSN by running effective copy detection. Often, multiple nodes, called observers, are selected to verify the reliability of the nodes within the network. Personal data from the source centre (e.g. personality and geographical data) is provided to the observer at the optional witness stage. The trust and reputation system is used to find the reliability of data aggregation across the cluster head and cluster nodes. It is also possible to obtain a mechanism to perform sleep and standby procedures to improve the life of the sensor node. The sniffers have been implemented to monitor the energy of the sensor nodes periodically in the sink. The proposed algorithm SBEA (Snowball Endurance Algorithm) is a combination of ERCD protocol and a combined mobility and routing algorithm that can identify the cluster head and adjacent cluster head nodes.This algorithm is used to yield the network life time and the performance of the sensor nodes can be increased.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1873-1893
• /
• 2023

The development of lightweight, low energy and small-sized sensors incorporated with the wireless networks has brought about a phenomenal growth of Wireless Sensor Networks (WSNs) in its different fields of applications. Moreover, the routing of data is crucial in a wide number of critical applications that includes ecosystem monitoring, military and disaster management. However, the time-delay, energy imbalance and minimized network lifetime are considered as the key problems faced during the process of data transmission. Furthermore, only when the functionality of cluster head selection is available in WSNs, it is possible to improve energy and network lifetime. Besides that, the task of cluster head selection is regarded as an NP-hard optimization problem that can be effectively modelled using hybrid metaheuristic approaches. Due to this reason, an Improved Coyote Optimization Algorithm-based Clustering Technique (ICOACT) is proposed for extending the lifetime for making efficient choices for cluster heads while maintaining a consistent balance between exploitation and exploration. The issue of premature convergence and its tendency of being trapped into the local optima in the Improved Coyote Optimization Algorithm (ICOA) through the selection of center solution is used for replacing the best solution in the search space during the clustering functionality. The simulation results of the proposed ICOACT confirmed its efficiency by increasing the number of alive nodes, the total number of clusters formed with the least amount of end-to-end delay and mean packet loss rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.499-502
• /
• 2008

한정된 용량의 배터리에 의존하는 무선 Ad-hoc 네트워크(MANET)에서는 에너지 효율을 높이기 위한 다양한 클러스터링 기법과 라우팅 알고리즘이 연구되고 있다. 이러한 무선 Ad-hoc 네트워크에서는 에너지 효율이 높은 클러스터 기반의 라우팅 알고리즘이 많이 사용된다. 그러나 일반적인 클러스터 방식에 따른 라우팅 알고리즘에서는 클러스터 헤드 노드에 부하가 집중되어 에너지 소모가 많은 문제점을 가진다. 이 문제를 보완하기 위해서 클러스터 헤드 노드의 재 선출을 통해 에너지 소모를 분산하는 동적 클러스터링 방식이 사용되고 있다. 그러나 동적 클러스터링 방식 또한 높은 빈도의 클러스터 재형성 과정에서 많은 에너지를 소모하는 문제점이 있다. 즉, 지금까지 연구되어온 알고리즘은 클러스터 구성에 대한 효율적인 알고리즘을 제시하고 있지만 불필요한 에너지 소모를 최소화하는 최적의 헤드 노드 선정 방법과 클러스터 관리를 통하여 에너지 효율을 높일 수 있는 해결책을 제시하지 않았다. 따라서 본 논문에서는 위의 클러스터 문제를 해결하기 위해 TICC(Time Interval Clustering Control) 알고리즘 기법을 제안한다. 제안된 TICC은 각 노드의 에너지 속성 값에 따라 에너지 Level을 분류하고 분류된 에너지 Level에 따라 타이밍을 고려한 클러스터링 및 노드 관리방법이다. 이러한 TICC기법을 적용하여 실험을 하였고 결과적으로 클러스터 전체의 에너지 효율을 향상되고 Lifetime이 증가함을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.520-524
• /
• 2007

제한된 전지를 사용하는 노드들로 이루어진 이동 애드혹 네트워크 환경에서 멀티 홉 간의 에너지 효율적인 경로 설정은 매우 중요한 이슈이다. 이러한 문제를 해결하기 위해서 본 논문에서는 이동 애드혹 네트워크 환경에서 자주 사용되는 라우팅 프로토콜 중 하나인 AODV(Ad-hoc On-demand Distance Vector) 라우팅 프로토콜을 기반으로, 네트워크 계층과 MAC계층의 자원을 크로스 레이어 기법을 활용하여 에너지 효율적인 크로스 레이어 라우팅 프로토콜을 제안한다. 네트워크 계층에서의 이웃노드에 관한 상태 정보를 크로스 레이어 기법을 활용하여 MAC 계층의 back-off time을 적절히 조절함으로써 프레임의 충돌을 줄이고, 패킷의 경로를 설정하는데 있어서 신뢰성과 효율성을 부여하기 위한 방법으로 MAC계층의 자원을 활용하여 얻은 Collision-Level을 사용한다. 또한 Collision Level은 패킷 경로 선택에 사용되는 지연시간을 적응성 있게 줄이는 자원으로 사용된다.