• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.394-397
• /
• 2012

Wireless sensor network is configured to be able to collect information collected from the various sensors, real-world environment wireless network. In this paper, the information collected from the wireless sensor networks in the real world using AR (Augmented Reality) data by projecting, in a variety of ways, the information collected from the wireless sensor network is utilized, which more intuitive is intended to provide to users. In this paper, stored in the DB table and the information collected from the wireless sensor network, wireless LAN (Access Point) that are placed in the sensor field and the terminal attached to the geomagnetic sensor, terminal position, after correction using acceleration sensors and augmented reality the aim is to visualize the data stored in the DB table using.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.755-761
• /
• 2013

Medium access control (MAC) protocols for wireless sensor networks make sensor nodes on state for energy-efficiency only when necessary. In this paper we present an energy efficient priority-based MAC protocol for energy-harvesting Wireless Sensor Networks (WSNs). For support priority-based packet transmission the proposed EEPB-MAC protocol uses the modified IEEE 802.15.4 beacon frames including priority bit, sender node address, and NAV value fields. A receiver node periodically wakes up, receives sender beacon frames, selects data sending sender, and broadcasts a beacon frame containing the selected sender's address. A receiver node selects sender node according to sender's data priority. A receiver nodes also adjust wake up period based on their energy states. Hence, the energy consumption of receiver node can be minimized. Through simulations and analytical analysis, we evaluate the performance of our proposed the EEPB-MAC protocol and compare it against the previous MACs. Results have shown that our protocol outperforms other MAC in terms of energy consumption, higher priority packet delivery delay.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.131-138
• /
• 2006

To achieve security in wireless sensor networks(WSN), it is important to be able to encrypt and authenticate messages sent among sensor nodes. Due to resource constraints, many key agreement schemes used in general networks such as Diffie-Hellman and public-key based schemes are not suitable for wireless sensor networks. The current pre-distribution of secret keys uses q-composite random key and it randomly allocates keys. But there exists high probability not to be public-key among sensor nodes and it is not efficient to find public-key because of the problem for time and energy consumption. To remove problems in pre-distribution of secret keys, we propose a new cryptographic key management protocol, which is based on the clustering scheme but does not depend on probabilistic key. The protocol can increase efficiency to manage keys because, before distributing keys in bootstrap, using public-key shared among nodes can remove processes to send or to receive key among sensors. Also, to find outcompromised nodes safely on network, it selves safety problem by applying a function of lightweight attack-detection mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.573-580
• /
• 2011

WSNs (Wireless Sensor Networks) are becoming more widely used in various fields, and improving localization performance is a crucial and essential issue for sensor network applications. In this paper, we propose a low-complexity localization mechanism for WSNs that operates in 3D (Three-Dimensional) space. The basic idea is to use aerial vehicles or flying objects that are deliberately equipped with the anchor nodes. These anchor nodes periodically broadcast beacon signals containing their current locations, and the unknown nodes receive these signals as soon as they enter the communication range of the anchors. We estimate the locations of the unknown nodes based on the proposed scheme that transforms the 3D problem into 2D computations to reduce the complexity of 3D localization. Simulated results show that our approach is an effective scheme for 3D self-positioning in WSNs.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.40-49
• /
• 2006

As a promising integrated circuit, wireless communication and micro-computing technology, the technology of sensor network that will lead the information technology industries of the next generation and realize the ubiquitous computing is one of the most active research topics and its research activities are also making today. From now on, each node, the network formation, and even the sensor network itself will interact with the generic network and evolve dynamically according to environmental changes in a process of continual creation and extinction. Therefore, address-internetworking between sensor network and generic network which are used different address mechanism is required. In this paper, we propose a static address-internetworking scheme for interactive networking between a sensor network and the Internet. The proposed scheme that possess a gateway approach to perform the protocol translation from one protocol to another, an overlay approach to constructs an overlay network on the WSNs and enables static internetworking between a sensor network address scheme based on Zigbee and the Internet address scheme based on the Internet Protocol. In addition, we verify the proposed scheme by an interconnection experiment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2800-2807
• /
• 2012

An ad-hoc wireless network provides self-organizing data networking while they are routing of packets among themselves. Typically multi-hop and control packets overhead affects the change of route of transmission. There are numerous routing protocols have been developed for ad hoc wireless networks as the size of the network scale. Hence the scalable routing protocol would be needed for energy efficient various network routing environment conditions. The number of depth or layer of hierarchical clustering nodes are analyzed the different clustering structure with topology in this paper. To estimate the energy efficient number of cluster layer and energy dissipation are studied based on distributed homogeneous spatial Poisson process with context-awareness nodes condition. The simulation results show that CACHE-R could be conserved the energy of node under the setting the optimal layer given parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5785-5804
• /
• 2019

The information of localization is a fundamental requirement in wireless sensor network (WSN). The method of distance vector-hop (DV-Hop), a range-free localization algorithm, can locate the ordinary nodes by utilizing the connectivity and multi-hop transmission. However, the error of the estimated distance between the beacon nodes and ordinary nodes is too large. In order to enhance the positioning precision of DV-Hop, fast triangle flip bat algorithm, which is based on curve strategy and rank transformation (FTBA-TCR) is proposed. The rank is introduced to directly select individuals in the population of each generation, which arranges all individuals according to their merits and a threshold is set to get the better solution. To test the algorithm performance, the CEC2013 test suite is used to check out the algorithm's performance. Meanwhile, there are four other algorithms are compared with the proposed algorithm. The results show that our algorithm is greater than other algorithms. And this algorithm is used to enhance the performance of DV-Hop algorithm. The results show that the proposed algorithm receives the lower average localization error and the best performance by comparing with the other algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.388-398
• /
• 2011

In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.845-854
• /
• 2008

In this paper, we propose a clustering algorithm for efficient energy management of sensor network consisted of sensor nodes that have restricted energy to solve these problem. Proposed algorithm improves energy efficiency by controlling sensing power. And it has distinctive feature that is applied in various network environment. The performance evaluation result shows that the energy efficiency is improved by 5% in the case of all sensor node fixed and by $10{\sim}15%$ in the case of all sensor node moving. It is confirmed through experiment process that the proposed algorithm brings energy efficiency ratio improvement of $5{\sim}15%$ more than the existing algorithm. Proposed algorithm derived an upper bound on the energy efficiency for Ubiquitous Computing environment that have various network environment that is with ZigBee technology of IEEE 802.15.4 bases. Also, we can blow bring elevation for lifetime of sensor network greatly for lifetime of sensor node as is small. And we think that may expand practical use extent of a sensor network technology more in fast changed network environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.50-63
• /
• 2017

In the wireless sensor networks, a sensor node has limited resources such as battery or memory. Hence, the routing protocol used in the wireless sensor networks is required efficient use of resources. In this paper, the VAP(Virtual Address Protocol), ensures the shortest transmission path for data transmission between the sink node and sensor node, is proposed. The VAP is assigned each node virtual address and sub address related with its neighboring nodes. The shortest transmission path to the destination node will be choose by comparing to each other address of its neighboring node. The comparison with other existing routing protocol shows that transmission path and usage of memory resource are minimized. Also transmission delay time of data was reduced.