• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.152-158
• /
• 2015

We consider the problem of designing independently operating local quantizers at nodes in distributed estimation systems, where many spatially distributed sensor nodes measure a parameter of interest, quantize these measurements, and send the quantized data to a fusion node, which conducts the parameter estimation. Motivated by the discussion that the estimation accuracy can be improved by using the quantized data with a high probability of occurrence, we propose an iterative algorithm with a simple design rule that produces quantizers by searching boundary values with an increased likelihood. We prove that this design rule generates a considerably reduced interval for finding the next boundary values, yielding a low design complexity. We demonstrate through extensive simulations that the proposed algorithm achieves a significant performance gain with respect to traditional quantizer designs. A comparison with the recently published novel algorithms further illustrates the benefit of the proposed technique in terms of performance and design complexity.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.51-58
• /
• 2017

This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.197-201
• /
• 2006

In the implementation of a smart home, activity recognition technology using simple sensors is very important. In this paper, we propose a new activity recognition method based on Bayesian network (BN). The structure of the BN is learned by K2 algorithm and is composed of sensor nodes, activity nodes and time node whose state is quantized with reasonable interval. In the proposed method, the BN has less complexity and provides better activity recognition rate than the previous method.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.989-993
• /
• 2007

It was intended in this study to seek for the measures to utilize the USN technique, which has high usability due to low price and low power consumption, in air quality monitoring. As a method, the sensors of temperature, humidity, particulate matters (PM10), and carbon dioxide ($CO_2$) were installed in the self-manufactured sensor nodes; the nodes were installed in the waiting rooms and platforms of a subway station and the measurements were collected at real time with use of a computer which micro gateway was built in. Collected data was to be processed by the statistics program installed in the computer; the collected data is to be used in managing the air quality of stations after transmission to the ventilation system of ventilation chambers.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.71-79
• /
• 2007

The communicative behaviors in Wireless Sensor Networks(WSNs) can be characterized by two different types: routing and broadcasting. The broadcasting is used for effective route discoveries and packet delivery. However, broadcasting shorten the network lifetime due to the energy overconsumption by redundant transmissions. In this paper, we proposed a algorithm that remove redundant forward nodes based on Dominant Pruning method using 2-hop neighbors knowledge. Simulation results show that the proposed algorithm appears superior performance in respect of the number of forward nodes and the network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2203-2217
• /
• 2016

To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.254-258
• /
• 2007

Recently, ubiquitous computing in being actively researched and one of the main technology in ubiquitous computing environments is recognized as RFID system. The RFID system has much benefits but simultaneously has some problems such as user's privacy violation. In this paper, in order to improve the survivability of its nodes, it should build available simulation surrounding sensor nodes. Also, In the proposed cryptosystems we use a new hash function for user authentication and a stream cipher based on LFSR(Linear Feedback Shift Register) for message encryption and decryption. Moreover, each algorithm is programmed with C language and simulated on IBM-PC system and we analyze the randomness properties of the proposed algorithms by using statistical tests.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.264-268
• /
• 2012

Tree-based structures offer assured optimal paths from the data source to the sink. Shortest routes are disregarded since these do not consider the remaining energy level of the nodes. This shortens the lifetime of the whole network. Most tree-based routing protocols, although aware of the nodes' energy, do not consider an energy aware sleep scheduling scheme. We propose an energy-aware sleep scheduling (EASS) scheme that will improve the sleep scheduling scheme of an existing tree-based routing protocol. An energy harvesting structure will be implemented on the wireless sensor network. The depth of sleep of every node will be based on the harvested energy.

• Journal of Power Electronics
• /
• v.12 no.6
• /
• pp.954-959
• /
• 2012

A hybrid switch that uses a microelectromechanical system (MEMS) switch as a gate driver of a MOSFET is applied to an energy harvesting system. The power management circuit adopting the hybrid switch provides ultralow leakage, self-referencing, and high current handling capability. Measurements show that solar energy harvester circuit utilizing the MEMS-MOSFET hybrid switch accumulates energy and charges a battery or drive a resistive load without any constant power supply and reference voltage. The leakage current during energy accumulation is less than 10 pA. The power management circuit adopting the proposed hybrid switch is believed to be an ideal solution to self-powered wireless sensor nodes in smart grid systems.

• Journal of information and communication convergence engineering
• /
• v.22 no.3
• /
• pp.207-214
• /
• 2024

In wireless sensor networks, the implementation of routing protocols is crucial owing to their limited computational capacities. Tree routing is a suitable method in wireless sensors owing to its minimal routing overhead. However, single-hop metric schemes, such as hop count, cause congestion at specific nodes, whereas multiple metric schemes cannot control dynamically changing network environments. To address these issues, we propose a scheme to implement enhanced tree routing with adaptive metrics based on hop count. This approach assigns different weights to metrics to select suitable parent nodes based on hop count. The parent-selection algorithm utilizes hop count, buffer occupancy, and received signal strength indicator (RSSI) as metrics. This study evaluates the performance through simulation scenarios to analyze whether improvements can be made to address problems encountered in traditional tree routing. The performance metrics include packet delivery speed, throughput, and end-to-end delay, which vary depending on the volume of network traffic.