• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.544-550
• /
• 2006

Next-generation wireless/mobile networks are envisioned to have an IP-based infrastructure. One of the research challenges for next-generation all IP-based networks is the design of intelligent mobility management technologies that have a seamless mobility and minimal signaling overhead. Recently, HMIPv6 was proposed by the IETF for efficient mobility management. HMIPv6 reduces the amount of signaling and improves the performance of MIPv6 in terms of handover latency. However the MAP can be a single point of performance bottleneck when there are a lot of local movements. HMIPv6 can cause signaling overhead due to the unnecessary location update of idle mobile nodes. Therefore, in this paper, we propose the dynamic paging Mobile IPv6 that reduces the signaling cost of the unnecessary location updates using IP paging and organizes dynamically optimal MAP area according to user's mobility and traffic. We show performance results that are obtained from the average total location update cost and packet delivery cost.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.487-497
• /
• 2005

A range mosaic query returns distribution of data within the query region as a pattern of mosaic, whereas a range aggregate query returns a single aggregate value of data within the query region. The range mosaic query divides a query region by a multi-dimensional grid, and calculates aggregate values of grid cells. In this paper, we propose a new type of query, range mosaic query and a new operator, mosaic-by, with which the range mosaic queries can be represented. In addition, we suggest efficient algorithms for processing range mosaic queries using an aggregate R-tree. The algorithm that we present computes aggregate results of every mosaic grid cell by one time traversal of the aggregate R-tree, and efficiently executes the queries with only a small number of node accesses by using the aggregate values of the aggregate R-tree. Our experimental study shows that the range mosaic query algorithm is reliable in terms of performance for several synthetic datasets and a real-world dataset.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.583-591
• /
• 2000

Caching mechanisms have been studied extensively to buffer the speed gap of hierarchical storages in the context of cache memory, paging system, and buffer management system. As the wide-area distributed environments such as the WWW extend broadly, caching of remote objects becomes more and more important. In the wide-area distributed environments, the cost and the benefit of caching an object is not uniform due to the location of the object; which should be considered in the cache replacement algorithms. For online operation, the time complexity of the replacement algorithm should not be excessive. To date, most replacement algorithms for the wide-area distributed environments do not meet both the non-uniformity of objects and the time complexity constraint. This paper proposes a replacement algorithm which considers the non-uniformity of objects properly; it also allows for an efficient implementation. Trace-driven simulations show that proposed algorithm outperforms existing replacement algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.688-696
• /
• 2013

In wireless sensor networks, real-time applications have to ensure the timely delivery of real-time data. Recently, OMLRP (On-demand Multi-hop Look-ahead Routing Protocol) has been proposed to improve the timeliness of wireless sensor networks. The protocol needs initialization time to establish multi-hop information based routing path because it performs incremental look-ahead of the information. Consequently, the protocol deteriorates DDSR (Deadline Delivery Success Ratio) as an event moves because it takes little consideration of event mobility. In this paper, we proposed a Real-time Routing for Events Mobility (RREM) which exploits a data redirection in order to improve the DDSR of moving events. Instead of recollecting muti-hop look-ahead information, the RREM redirects the data to a sensor node holding the information collected in a previous round. We verify the timeliness and energy efficiency of RREM using various MatLab simulations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.8
• /
• pp.5559-5564
• /
• 2015

A variety of routing protocols targeted specifically at mobile ad-hoc network environments have been developed. Mobile ad-hoc network is a self-organizing temporary network, operating without the aid of any established wired infrastructure. The proposed protocol supports seamless communication services between the mobile hosts within a mobile ad-hoc network environments. In particular, our protocol makes faster route re-establishment possible by maintaining multiple paths in each mobile host, and also, the protocol provides reliable communication environments. We compare the performance of RWP model with that of LW model. This paper shows delivery ratio with single path and non-disjoint multiple path according to mobility model and node numbers.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.1
• /
• pp.21-30
• /
• 2006

As the amount of information to be processed by computers has recently been increased, there has been cluster computing systems developed by connecting PCs and workstations using high-speed networks. hs a result, the studies on a cluster-based DBMS have been done with a wide range and it is necessary to develop a cluster manager for monitoring and managing cluster-based DBMSs. But, a cluster manager for efficiently managing cluster-based DBMSs has been studied in a first step. In this paper, we design and implement a high-availability cluster manager for a cluster-based DBMS. It monitors the status of nodes in cluster systems as well as the status of DBMS instances in a node, by using a graphic user interface (GUI). Our cluster manager supports the high-availability for a cluster-based DBMS by perceiving errors and recovering them, based on the monitored information on the status of a server.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.39-46
• /
• 2013

Cooperative spectrum sensing can improve sensing reliability, compared with single node spectrum sensing. In addition, Eigenvalue-based spectrum sensing has also drawn a great attention due to its performance improvement over the energy detection method in which the more smoothing factor, the better performance is achieved. However, the more smoothing factor in Eignevalue-based spectrum sensing requires the more sensing time. Furthermore, more reporting time in cooperative sensing will be required as the number of nodes increases. Subsequently, we in this paper propose an Eigenvalue and superposition-based spectrum sensing where the reporting time is utilized so as to increase the number of smoothing factors for autocorrelation calculation. Simulation result demonstrates that the proposed scheme has better detection probability in both local as well as global detection while requiring less sensing time as compared with conventional Eigenvalue-based detection scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.1-8
• /
• 2007

Although the Java bytecode has numerous advantages. there ate also shortcomings such as slow execution speed and difficulty in analysis. Therefore. in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implements CTOC. CTOC generated CFG using the existing bytecode then created the SSA Form for analysis and optimization. However. due to insertion or the ${\phi}$-function in the process of conversion into the SSA Form, the number of nodes increased. As a means of reducing the number of nodes, we performed copy propagation, which is an optimization method applicable to the SSA form. Copy propagation is the process of a value of a variable being topied to another variable. There are cases where conversion due to copy propagation alone does not yield significant effects. However, when variables are not used in the later optimization stages, copy propagation provides a means for eliminating the copy statement for the corresponding variable, making it an important step. This paper shows the copy propagation to obtain a more optimized code in SSA Form.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.422-428
• /
• 2011

In this paper, we introduce system and channel modeling for an underwater ad hoc acoustic network with n regularly located nodes， and then analyze capacity scaling laws based on the model. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize in attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks having unit node density. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a power-limited network. Furthermore, we describe an achievable scheme based on the simple nearest-neighbor multi-hop (MH) transmission. It is shown under extended networks that the MH scheme is order-optimal for all the operating regimes expressed as functions of the attenuation parameter.