• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.554-561
• /
• 2017

IoT (Internet of Things) devices are often located in environments where indoor or underground, signals are difficult to reach. In addition, the transmission power is low, the base station should be designed to be able to receive signals even at low reception sensitivity. For this reason, a device having a poor channel condition can be transmitted at a low data rate using a low coding rate or repetition. When the coverage class is divided according to the channel condition and the data rate, the packet length may vary from one coverage class to another, and the performance of the slotted aloha random access may be degraded. We will focus on two methods of using shared-resource and seperate resources among multiple slotted aloha methods. In particular, when devices with different coverage classes use shared resources, performance of a device with a bad channel condition may deteriorate. Conversely, when using separate resources for each coverage class, there is a problem that congestion may occur which increases the number of devices that perform random access to one resource area. In this paper, we propose some methods to overcome this problem. This study is mainly focused on MTC devices, and is considered to be a high possibility of future development.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.285-298
• /
• 2009

According to the development of ubiquitous technologies, sensor networks is used in various area. In particular, medical field is one of the significant application areas using sensor networks, and recently it has come to be more important according to standardization of the body sensor networks technology. There are special characteristics of their own for medical sensor networks, which are different from the one of sensor networks for general application or environment. In this paper, we propose a hierarchical medical sensor networks structure considering own properties of medical applications, and also introduce transmission mechanism based on hierarchical structure. Our mechanism uses the priority and threshold value for medical sensor nodes considering patient's needs and health condition. Through this way Cluster head can transmit emergency data to the Base station rapidly. We also present the new key establishment mechanism based on key management mechanism which is proposed by L. Eschenauer and V. Gligor for our proposed structure and transmission mechanism. We use key provisioning for emergency nodes that have high priority based on patients' health condition. This mechanism guarantees the emergency nodes to establish the key and transmit the urgent message to the new cluster head more rapidly through preparing key establishment with key provisioning. We analyze the efficiency of our mechanism through comparing the amount of traffic and energy consumption with analysis and simulation with QualNet simulator. We also implemented our key management mechanism on TmoteSKY sensor board using TinyOS 2.0 and through this experiments we proved that the new mechanism could be actually utilized in network design.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.73-78
• /
• 2002

In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2507-2517
• /
• 2015

In this research, we aim to analyze the trend of Huawei's PCT patent applications. As a result of analyzing Huawei's PCT patents by dividing temporal spans into three periods - the early 2000s, the late 2000s, and the early 2010s -, the following characteristics have been observed. First, the number of PCT patent applications has conspicuously increased from the early 2000s to the late 2000s and this trend has continued during the early 2010s. Second, in terms of a core technological field, whereas Huawei focused on the development of technologies in the 'H04L: transmission of digital information' sector during the early/late 2000s, it changed this field to the 'H04W: wireless communication networks' sector during the early 2010s. Lastly, in the case of the patent maps, it was found that while general communications technologies, as expressed with such keywords as 'user' and 'network,' were actively developed during the early/late 2000s, mobile phone-related technologies grasped this leading position, as shown with the keywords including 'user equipment,' 'base station,' and 'MME,' during the early 2010s. It was also noticeable that Huawei filed LTE-related patent applications more actively than Apple and Samsung Electronics, which implies that it will presumably pioneer the global market more aggressively than its competitors in the future.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1480-1485
• /
• 2017

A conventional max SNR scheme, which allocates uplink resources to the user with the highest gain of desired signal channel with a serving base station (BS), exhibits excellent performance in low interference environments. On the other hand, max SGIR scheme, which allocates resources by considering both the desired signal chanel gain and users' interference generating to neighboring BSs, outperforms the max SNR in high interference environments. The conventional two scheduling schemes exhibit optimal performance in different interference environments. Thus, we propose an adaptive scheduling scheme in order to overcome disadvantages of the conventional schemes. In the proposed scheme, a user is selected by max SNR and then the user's generating interference is compared with a pre-determined threshold value. If the generating interference is larger than a pre-determined threshold, then a user is re-selected by max SGIR policy. Monte-Carlo simulation results reveals that the proposed scheme outperforms the conventional schemes in various interference environments.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.620-630
• /
• 2006

Event-detection is an important application of sensor networks. Join operations can facilitate event-detection with a condition table predefined by a user. When join operations are used for event-detection, it is desirable, if possible, to do in-network join processing to reduce communication costs. In this paper, we propose an energy-efficient in-network join algorithm, called PBA. In PBA, each partition of a condition table is stored along the path from each node to the base station, and then in-network joins are performed on the path. Since each node can identify the parts to store in its storage by its level, PBA reduces the cost of disseminating a condition table considerably Moreover, while the existing method does not work well when the ratio of the size of the condition table to the density of the network is a little bit large, our proposed method PBA does not have such a restriction and works efficiently in most cases. The results of experiments show that PBA is efficient usually and especially provides significant cost reduction over existing one when a condition table is relatively large in comparison with the density of the network, or the routing tree of the network is high.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.8-21
• /
• 2009

A wireless sensor network is a computer network which consists of spatially distributed devices, called sensor nodes. In wireless sensor networks, energy efficiency is a key issue since sensor nodes must resides upon limited energy. To retrieve sensor information without dealing with the network issues, a sensor network is treated as conceptual database on which query can be requested. When multiple queries are requested for processing in a wireless sensor network, energy consumption can be significantly reduced if common partial results among similar queries can be effectively shared. In this paper, we propose an energy efficient multi-query processing technique based on the coverage relationship between multiple queries. When a new query is requested, our proposed technique derives an equivalent query from queries running at the moment, if it is derivable. Our technique first computes the set of running queries that may derive a partial result of the new query and then test if this set covers all the result of the new query attribute-wise and tuple-wise. If the result of the new query can be derived from the results of executing queries, the new query derives its result at the base station instead of being executed in the sensor network.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.273-280
• /
• 2008

In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

• Research in Plant Disease
• /
• v.21 no.2
• /
• pp.82-88
• /
• 2015

Acidovorax citrulli, the causal agent of bacterial fruit blotch, has caused an economically destructive damage in cucurbits cultivation fields worldwide. To consider more effective disease management, 33 A. citrulli isolates collected from various cucurbits in Korea were analysed by multi-locus phylogeny using five conserved loci(16S rRNA, adk, gltA, glyA, pilT). Two distinct groups (KCC1 and KCC2) in the population were identified on the base of group-specific genetic variation. Out of them, the predominant group was KCC2 and both groups included isolates from melon, cucumber and watermelon. Sixty-four percent of KCC1 isolates were recovered from non-watermelon hosts and seventy-two percent of KCC2 isolates from watermelon. This study presented that there was genetic differentiation among A. citrulli population in Korea. Also, these results will be applied as a very useful data in effective disease management.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.476-485
• /
• 2009

In sensor networks, many methods have been proposed to process in-network aggregation effectively. Unlike general aggregation queries, skyline query processing compares multi-dimensional data for the result. Therefore, it is very difficult to process the skyline queries in sensor networks. It is important to filter unnecessary data for energy-efficient skyline query processing. Existing approach like MFTAC restricts unnecessary data transitions by deploying filters to whole sensors. However, network lifetime is reduced by energy consumption for many false positive data and filters transmission. In this paper, we propose a bottom up filtering-based skyline query processing algorithm of in-network for reducing energy consumption by filters transmission and a PBFiltering technique for improving performance of filtering. The proposed algorithm creates the skyline filter table (SFT) in the data gathering process which sends from sensor nodes to the base station and filters out unnecessary transmissions using it. The experimental results show that our algorithm reduces false positives and improves the network lifetime over the existing method.