• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.167-175
• /
• 2008

The current pre-distribution of secret keys uses a-composite random key and it randomly allocates keys. But there exists high probability not to be public-key among nodes and it is not efficient to find public-key because of the problem for time and energy consumption. We presents key establishment scheme designed to satisfy authentication and confidentiality, without the need of a key distribution center. Proposed scheme is scalable since every node only needs to hold a small number of keys independent of the network size, and it is resilient against node capture and replication due to the fact that keys are localized. In simulation result, we estimate process time of parameter used in proposed scheme and efficiency of Proposed scheme even if increase ECC key length.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.4227-4240
• /
• 2019

In this paper, we present our proposed magnetic induction based wireless communication system. The proposed system is designed to perform communication as well as distance measurement in underground environments. In order to improve the communication quality, we propose and implement the adaptive channel compensation technique. Based on the fact that the channel may be fast time-varying, we keep track of the channel status each time the data is received and accordingly compensate the channel coefficient for any change in the channel status. By using the proposed compensation technique, the developed platform can reliably communicate over distances of 10m while the packet error rate is being maintained under 5%. We also implement the distance measurement block that is useful for various applications that should promptly estimate the location of nearby nodes in communication. The distance between two nodes in communication is estimated by generating a table describing pairs of the magnetic signal strength and the corresponding distance. The experiment result shows that the platform can estimate the distance of a node located within 10m range with the measurement error less than 50cm.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.389-399
• /
• 2021

In this paper, we propose one-bit feedback-based distributed beamforming (DBF) techniques for simultaneous wireless information and power transfer in interference channels where the information transfer and power transfer networks coexist in the same frequency spectrum band. In a power transfer network, multiple distributed energy transmission nodes transmit their energy signals to a single energy receiving node capable of harvesting wireless radio frequency energy. Here, by considering the Internet-of-Things sensor network, the energy harvesting/information decoding receivers (ERx/IRx) can report their status (which may include the received signal strength, interference, and channel state information) through one-bit feedback channels. To maximize the amount of energy transferred to the ERx and simultaneously minimize the interference to the IRx, we developed a DBF technique based on one-bit feedback from the ERx/IRx without sharing the information among distributed transmit nodes. Finally, the proposed DBF algorithm in the interference channel is verified through the simulations and also implemented in real time by using GNU radio and universal software radio peripheral.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1049-1052
• /
• 2009

This paper develop a intelligent personal emergency call system using the wireless sensor network to resolve that a portable problem of established emergency call system. The proposed system is composed of a transmitter nodes for individuals, routing nodes for multihop communications, and a server part. The transmitters for patients are monitored for both low battery and operational status. The transmitters provide location of the person activating an emergency call using RSSI. The efficacy of the proposed system is verified by means of experiments. Experimental results are presented that show the effectiveness.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.17-26
• /
• 2022

Sensor Nodes play a major role to monitor and sense the variations in physical space in various real-time application scenarios. These nodes are powered by limited battery resources and replacing those resource is highly tedious task along with this it increases implementation cost. Thus, maintaining a good network lifespan is amongst the utmost important challenge in this field of WSN. Currently, energy efficient routing techniques are considered as promising solution to prolong the network lifespan where multi-hop communications are performed by identifying the most energy efficient path. However, the existing scheme suffer from performance related issues. To solve the issues of existing techniques, a novel hybrid technique by merging particle swarm optimization and game theory model is presented. The PSO helps to obtain the efficient number of cluster and Cluster Head selection whereas game theory aids in finding the best optimized path from source to destination by utilizing a path selection probability approach. This probability is obtained by using conditional probability to compute payoff for agents. When compared to current strategies, the experimental study demonstrates that the proposed GTPSO strategy outperforms them.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.17-32
• /
• 2023

Centralized hierarchical routing protocols are often used to solve the problems of uneven energy consumption and short network life in wireless sensor networks (WSNs). Clustering and cluster head election have become the focuses of WSNs. In this paper, an energy balanced clustering routing algorithm optimized by sine cosine algorithm (SCA) is proposed. Firstly, optimal cluster head number per round is determined according to surviving node, and the candidate cluster head set is formed by selecting high-energy node. Secondly, a random population with a certain scale is constructed to represent a group of cluster head selection scheme, and fitness function is designed according to inter-cluster distance. Thirdly, the SCA algorithm is improved by using monotone decreasing convex function, and then a certain number of iterations are carried out to select a group of individuals with the minimum fitness function value. From simulation experiments, the process from the first death node to 80% only needs about 30 rounds. This improved algorithm balances the energy consumption among nodes and avoids premature death of some nodes. And it greatly improves the energy utilization and extends the effective life of the whole network.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.22-30
• /
• 2005

We implement an interactive 3D audio broadcasting terminal which synthesizes an audio scene according to the request of a user. Audio scene structure is described by the MPEG-4 AudioBIFS specifications. The user updates scene attributes and the terminal synthesizes the corresponding sound images in the 3D space. The terminal supports the MPEG-4 Audio top nodes and some visual nodes. Instead of using sensor nodes and route elements, we predefine node type-specific user interfaces to support BIFS commands for field replacement. We employ sound spatialization, directivity/shape modeling, and reverberation effects for 3D audio rendering and realistic feedback to user inputs. We also introduce a virtual concert program as an application scenario of the interactive broadcasting terminal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1547-1568
• /
• 2013

Wireless body area network (WBAN) is an emerging short-range wireless communication network with sensor nodes located on, in or around the human body for healthcare, entertainment and ubiquitous computing. In WBANs, energy is severely constrained which is the prime consideration in the medium access control (MAC) protocol design. In this paper, we propose a novel MAC protocol named Energy-efficient Relay MAC with dynamic Power Control (ERPC-MAC) to save energy consumption. Without relying on the additional devices, ERPC-MAC employs relaying nodes to provide relay service for nodes which consume energy fast. Accordingly the superframe adjustment is performed and then the network topology can be smoothly switched from single-hop to multi-hop. Moreover, for further energy saving and reliability improvement, the dynamic power control is introduced to adjust the power level whenever a node transmits its packets to the coordinator or the relaying node. To the best of the authors' knowledge, this is the first effort to integrate relay, topology adjustment and power control to improve the network performance in a WBAN. Comprehensive simulations are conducted to evaluate the performance. The results show that the ERPC-MAC is more superior to the existing standard and significantly prolongs the network lifetime.

• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.677-683
• /
• 2009

In this study, we designed and implemented testbed for localization algorithm by using a area reduction method in outdoor environment. The proposed algorithm used 3 steps of area reduction method, which estimated blind nodes position. Also, we have experimented with using a Zigbee module for 5 fixed reference nodes and 4 blind nodes in sensor field of $60m{\times}23m$. The results show that our algorithm is improved the localization accuracy even at the number of ref. node is fixed and the number of blind node is increased. In future research, we will be adding the function of seamless localization in indoor and NLOS(non-line of sight) environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1363-1372
• /
• 2011

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.