• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.84-95
• /
• 2008

Wireless sensor networks have recently emerged as a platform for several applications. By deploying wireless sensor nodes and constructing a sensor network, we can remotely obtain information about the behavior, conditions, and positions of objects in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable to prolong the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering algorithm that distributes the energy consumption of a cluster head. First, we analyze the energy consumption if cluster heads and divide each cluster into a collection layer and a transmission layer according to their roles. Then, we elect a cluster head for each layer to distribute the energy consumption of single cluster head. In order to show the superiority of our clustering algorithm, we compare it with the existing clustering algorithm in terms of the lifetime of the sensor network. As a result, our experimental results show that the proposed clustering algorithm achieves about $10%{\sim}40%$ performance improvements over the existing clustering algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.247-249
• /
• 2014

Ubiquitous Sensor Network (USN) environments, sensors and sensor nodes, and coming from heterogeneous sensor networks consist of one another, the characteristics of each component are also very diverse. Thus the sensor and the sensor nodes to interoperability between metadata for a single definition, management is very important. For this, the standard language for modeling sensor SensorML (Sensor Model Language) has. In this paper, sensor devices, sensor nodes and sensor networks for information technology in the application stage XMDR-DAI -based metadata to define the USN. The proposed XMDR-DAI USN based store and retrieve metadata for a method for effectively agent technology. Metadata of the proposed sensor is based SensorML USN environment by maintaining interoperability 50-200 USN middleware or a metadata management system for managing metadata in applications can be utilized directly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.239-250
• /
• 2022

LoRa is a physical layer technology designed to secure highly reliable long-range communication with introducing loco parentis tree network and chirp spreading spectrum. Since since a leaf can send message to more than one parents simultaneously with a single transmission in a region, packet delivery ratio increases logarithmically as the number of gateways increases. The delivery ratio, however, dramatically collapses even under loco parentis tree topology due to the limitations of ALOHA-like primitive MAC, . The proposed method is intended to exploit SDMA approach to reuse frequency in an area. With the view, TxPower of each sender for each message in a concurrent transmission is elaborately controlled to survive the collision at different gateway. Thus, the gain from the capture effect improves the capacity of resource-hungry Low Power and Wide Area Networks.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.929-934
• /
• 2010

Improvements in characteristics of a single junction AlGaAs/GaAs solar cell are observed by capping a PMMA lens on it. In order to show the effect of the lens, characteristics of a single junction AlGaAs/GaAs solar cell before and after the lens formation are compared under the one-sun illumination condition ($100mW/cm^2$). Characteristics of the solar cell under very weak illumination condition (about 1200 lux) is also measured with the lighting of a fluorescent desk lamp. About 5% of cell efficiency is improved after the capping of PMMA lens on the single junction AlGaAs solar cell and $83\;{\mu}m/cm^2$ of electrical power was generated with the lighting of a desk lamp.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.941-949
• /
• 2011

In a cooperative communication system with a source node and multiple relays equipping single antenna and a destination node equipping multiple antennas, the selective cooperative spatial multiplexing scheme can obtain spatial multiplexing gain and additional selection diversity gain. But it can degrade a bit error rate performance because some received symbols forwarded from particular relays may be lost by attenuation due to path-loss. We propose a relay and transmission mode selection scheme which selects minimum number of multiple relays having the channel capacity larger than a given data rate and transmission mode which switches spatial multiplexing and spatial diversity mode in cooperation phase to enhance the bit error rate performance. The proposed scheme achieves 1.5~2dB gain at the low SNR range compared with the conventional scheme by obtaining additional spatial diversity gain.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.281-290
• /
• 2010

In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads.Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node's position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2131-2139
• /
• 2014

In this paper, a binary-coded physical-layer network coding (PNC) is considered when high-order modulation techniques are used at source nodes in wireless communication environments. In the conventional PNC schemes, tight power control and phase compensation are required at a relay node. However, they may not be feasible in practical wireless communication environments. Thus, we do not assume the pre-equalization in this paper, and we only utilize the channel state information at receiver (CSIR). We propose a signal detection method for the binary-coded PNC with high-order modulation, such as QPSK and 16QAM, at the source nodes, while the conventional scheme only consider the BPSK at source nodes. We also analyze the bit-error performance of the proposed technique in both uncoded and coded cases.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.142-145
• /
• 2017

Currently, a trend in image processing is high-quality and high-resolution. The size and amount of image data are increasing exponentially because of the development of information and communication technology. Thus, license plate recognition with a single processor cannot handle the increasing data. This paper proposes a number plate recognition system using a distributed processing framework, Hadoop. Using SequenceFile format in Hadoop, each mapper performs a license plate recognition with a number of image data in a data block Experimental results show that license plate recognition performance with 16 data nodes accomplishes speedup of maximum 14.7 times comparing with one data node. In large dataset, the recognition performance is robust even if the number of data nodes increases gradually.