• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.35-43
• /
• 2011

Cognitive Radio (CR) ad hoc network is highly considered as one of promising future ad hoc networks, which enables opportunistic access to under-utilized licensed spectrum. Similarly to other CR networks, the spectrum sensing is a prerequisite in CR ad hoc network. Collaborative spectrum sensing can help increasing sensing performance. For such an infrastructureless network, however the coordination for the sensing collaboration is really complicated due to the lack of a central controller. In this paper, we propose a novel collaborative spectrum sensing scheme in which the final decision is made by the node with the highest data reliability based on a sequential Dempster Shafer theory. The collaboration of sensing data is also executed by the proposed contention-aware reporting mechanism which utilizes the sensing data reliability order for broadcasting spectrum sensing result. The proposed method reduces the collecting time and the overhead of the control channel due to the efficiency of the ordered sequential combination while keeping the same sensing performance in comparison with the conventional cooperative centralized spectrum sensing scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.11-22
• /
• 2004

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules： the interface manager provides the interface for PDA users； the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques； the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.724-739
• /
• 2009

This paper suggests the energy-efficient message delivery scheme and the software platform which exploits the multiple network interfaces of the mobile terminals and GPS in the current mobile devices. The mobile terminals determine the delivery method among 'direct', 'indirect', and 'WAN' based on the position information of itself and other terminals. 'Direct' method sends a message directly to the target terminal using local RAT. 'Indirect' method extends the service area by exploiting intermediate terminals as relay node. If the target terminal is too far to reach through 'direct' or 'indirect' method, the message is sent using wireless WAN technology. Our proposed scheme exploits the position information and, thus, power consumption is drastically reduced in determining handover time and direction. Network simulation results show that our proposed delivery scheme improves the message transfer efficiency and the handover detection latency. We implemented a message platform in a smart phone realizing the proposed delivery scheme. We compared our platform with other typical message platforms from energy efficiency aspect by observing the real power consumption and applying the mathematical modeling. The comparison results show that our platform requires significantly less power.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.532-543
• /
• 2004

Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.605-619
• /
• 2003

The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss the index manager of the Tachyon, a next-generation MMDBMS. Recently, the gap between the CPU processing and main memory access times is becoming much wider due to rapid advance of CPU technology. By devising data structures and algorithms that utilize the behavior of the cache in CPU, we are able to enhance the overall performance of MMDBMSs considerably. In this paper, we address the practical implementation issues and our solutions for them obtained in developing the cache-conscious index manager of the Tachyon. The main issues touched are (1) consideration of the cache behavior, (2) compact representation of the index entry and the index node, (3) support of variable-length keys, (4) support of multiple-attribute keys, (5) support of duplicated keys, (6) definition of the system catalog for indexes, (7) definition of external APIs, (8) concurrency control, and (9) backup and recovery. We also show the effectiveness of our approach through extensive experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1631-1636
• /
• 2015

With the advance of wireless communication technology in terrestrial area, underwater communication is also evolving very fast from a simple point-to-point transmission to an elaborate networked communications. Underwater acoustic channel has quite different features comparing with the terrestrial radio channel in terms of propagation delay, Doppler shift, multipath, and path loss. Thus, existing technologies developed for terrestrial communication might not work properly in underwater channel. Especially medium access control (MAC) protocols which highly depend on propagation phenomenon should be newly designed for underwater network. CSMA/CA has drawn lots of attention as a candidate of underwater MAC protocol, since it is able to resolve a packet collision and the hidden node problem. However, a received signal could be degraded by the interferences from the nodes locating outside the receiver's propagation radius. In this paper, we study the effects of interference on the CSMA/CA based underwater network. We derived the SNR with the interference using the sonar equation and analyzed the degradation of the RTS/CTS effects. These results are compared with the terrestrial results to understand the differences. Finally we summarized the design considerations in CSMA/CA based underwater network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6C
• /
• pp.495-505
• /
• 2010

In this paper, the effect of Near-Far Problem (NFP) among distributed nodes in OFDMA-based Wireless Mesh Networks (WMNs) is analyzed by investigating statistical characteristics of Time Difference of Arrival (TDoA) and Desired-to-Undesired power Ratio (DUR). In order to overcome the effects of Inter-Symbol Interference (ISI), Inter-Carrier Interference (ICI), and Inter Link Interference (ILI), caused by TDoA in WMNs, we derive effective SINR for each subcarrier, and then, propose the optimal starting point of FFT window which can minimize BER for each subcarrier. In addition, we propose a subcarrier-based Zero Forcing - 2 Dimensional Ordered Successive Interference Cancellation (ZF-2DOSIC) technique for signal detection in WMNs with TDoA. It is verified by simulation that the effective SINR and uncoded BER performances of the proposed signal detection technique for OFDMA-based WMNs are significantly improved, compared with those of conventional technique.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.396-408
• /
• 2006

Moving object databases manage a large amount of past location data which are accumulated as the time goes. To retrieve fast the past location of moving objects, we need index structures which consider features of moving objects. The KDB-tree has a good performance in processing range queries. Although we use the KDB-tree as an index structure for moving object databases, there has an over-split problem in the spatial domain since the feature of moving object databases is to increase the time domain. Because the over-split problem reduces spatial regions in the MBR of nodes inverse proportion to the number of splits, there has a problem that the cost for processing spatial-temporal range queries is increased. In this paper, we propose the dynamic split strategy of the KDB-tree to process efficiently the spatial-temporal range queries. The dynamic split strategy uses the space priority splitting method for choosing the split domain, the recent time splitting policy for splitting a point page to maximize the space utilization, and the last division policy for splitting a region page. We compare the performance of proposed dynamic split strategy with the 3DR-tree, the MV3R-tree, and the KDB-tree. In our performance study for range queries, the number of node access in the MKDB-tree is average 30% less than compared index structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5B
• /
• pp.385-394
• /
• 2012

The tactical mobile communication network, which comprises a part of the next-generation Tactical Information and Communication Network (TICN), provides means of communication and control for Tactical Multi-Functional Terminals (TMFT) belonging to a Mobile Subscriber Access Point (MSAP). The next-generation of MSAP is capable of constructing a backbone network via LCTR and HCTR directional antennas. At the same time, WMN modules are used to create and manage a wireless mesh backbone. When directional antennas are used in mobile environments, seamless services cannot be efficiently supported as the movement of the node prevents the angle of the antenna to constantly match. Therefore, data communication through the wireless mesh networks is required to provide direct communication between mobile MSAPs. Accordingly, mutual authentication and data encryption mechanisms are required to provide reliable data transmission in this environment. To provide efficient mutual authentication between MSAP devices, the process of verifying a certificate of the other MSAP device through its own authentication server is required. This paper proposes mutual authentication mechanisms where the MSAP requiring authentication and the MSAP that permits it initiates low-cost and efficient authentication in a distributed way. More specifically, we propose a method of applying EAP-ELS (Extensible Authentication Protocol-Transport Layer Security) in the next-generation TICN.