• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.676-682
• /
• 2018

As the IoT world including WSNs develops, the number of sensor systems that sense information according to the environment based on the principle of IoT is increasing. In order to perform security for each sensor system in such a complicated environment, the security modules must be varied. These problems make hardware/software implementation difficult when considering the system efficiency and hacking/cracking. Therefore, to solve this problem, this paper proposes a pseudorandom number generator (FLT: Pseudo-random Number Generator with Fixed Length Tap unrelated to the variable sensing nodes) with a fixed-length tap that generates a pseudorandom number with a constant period, irrespective of the number of sensing nodes, and has the purpose of detecting anomalies. The proposed FLT-LFSR architecture allows the security level and overall data formatting to be kept constant for hardware/software implementations in an IoT environment. Therefore, the proposed FLT-LFSR architecture emphasizes the scalability of the network, regardless of the ease of implementation of the sensor system and the number of sensing nodes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.8
• /
• pp.1082-1087
• /
• 2021

In MANET(mobile ad hoc network), Mobility models vary according to the application-specific goals. The most widely used Random WayPoint Mobility Model(RWPMM) is advantageous because it is simple and easy to implement, but the random characteristic of nodes' movement is not enough to express the mobile characteristics of the entire sensor nodes' movements. The random mobility model is insufficient to express the inherent movement characteristics of the entire sensor nodes' movements. In the proposed Stochastic mobility model, To express the overall nodes movement characteristics of the network, the moving nodes are treated as random variables having a specific probability distribution characteristic. The proposed Stochastic mobility model is more stable and energy-efficient than the existing random mobility model applies to the routing protocol to ensure improved performances in terms of energy efficiency.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1941-1946
• /
• 2009

Wireless sensor networks do the monitoring and collecting information in the environment instead of human. Sensor networks are consisted of small sensor nodes with very limited hardware resource and very low network bandwidth. The wireless communication environment causes lots of communication errors so that the sensor network requires error correction technique to increase the reliability of network. The performance of error correction technique could be increased by the researches about the error pattern of CRC. In the paper, we did the performance evaluation - transmission interval, distance between sensor nodes, racket size, and RF power - that affects to the success ratio of data transmission in the indoor environment. we propose the performance metrics of system configuration based on the analysis of performance evaluation.

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

Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.665-683
• /
• 2011

Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.2
• /
• pp.159-169
• /
• 2009

In this paper, optimum design of distributed detection is considered for a parallel sensor network system consisting of a fusion center and two passive sonar nodes. AND rule and OR rule are employed as the fusion rules of the sensor network. For the fusion rules, it is shown that a threshold rule of each sensor node has uniformly most powerful properties. Optimum threshold for each sensor is investigated that maximizes the probability of detection under the constraint of a specified probability of false alarm. It is also investigated through numerical experiments how signal strength, false alarm probability, and the distance between two sensor nodes affect the system detection performances.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.5
• /
• pp.58-70
• /
• 2008

Earlier researches on Sensor Networks preferred symmetric key-based authentication schemes in consideration of limitations in network resources. However, recent advancements in cryptographic algorithms and sensor-node manufacturing techniques have opened suggestion to public key-based solutions such as Merkle tree-based schemes. These previous schemes, however, must perform the authentication process one-by-one in hierarchical manner and thus are not fit to be used as primary authentication methods in sensor networks which require mass of multiple authentications at any given time. This paper proposes a new concept of public key-based authentication that can be effectively applied to sensor networks. This scheme is based on exponential distributed data concept, a derivative from Shamir's (t, n) threshold scheme, in which the authentication of neighbouring nodes are done simultaneously while minimising resources of sensor nodes and providing network scalability. The performance advantages of this scheme on memory usage, communication overload and scalability compared to Merkle tree-based authentication are clearly demonstrated using performance analysis.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.25-30
• /
• 2010

Wireless sensor networks is composed of many similar sensor nodes with limited resources. They are randomly scattered over a specific area and self-organize the network. For guarantee of network life time, load balancing and scalability in sensor networks, sensor networks needs the clustering algorithm which distribute the networks to a local cluster. In existing clustering algorithms, the cluster head selection method has two problems. One is additional communication cost for finding location and energy of nodes. Another is unequal clustering. To solve them, this paper proposes a novel cluster head selection algorithm revised previous clustering algorithm, LEACH. The simulation results show that the energy compared with the previous clustering method is reduced.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.117-121
• /
• 2018

A Wireless Sensor Network is a network that is composed of wireless sensor nodes. There is no restriction on the place where it can be installed because it is composed wirelessly. Instead, sensor nodes have limited energy, such as batteries. Therefore, to use the network for a long time, energy consumption should be minimized. Several protocols have been proposed to minimize energy consumption, and the typical protocol is the LEACH protocol. The LEACH protocol is a cluster-based protocol that minimizes energy consumption by dividing the sensor field into clusters. Depending on how you organize the clusters of sensor field, network lifetimes may increase or decrease. In this paper, we will improve the network lifetime by improving the cluster head selection method in LEACH Protocol.