• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.627-634
• /
• 2006

Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.89-99
• /
• 2005

Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.2 s.8
• /
• pp.55-61
• /
• 1996

The objective of this paper is to show an optimal design model for branched water supply system which also can find the optimal location of pumping stations using linear programming. GIS is utilized in this model to better handle the data and the results front the optimization. The developed model considers hydraulic influences of some appurtenances such as supply tunnels and a filtration plant The model also considers tunnel construction cost which should be treated differently from pipe construction cost Different from other models presently available, the model guarantees a nonnegative pressure at every junction node in the system. The objective function includes annual operation cost (electricity rate) ill addition to initial construction cost, thus producing a more reasonable decision. The model selects the optimal diameter not in the form of continuous number but in the form of commercial discrete diameter (pipe size) using the pipe lengths as decision variables instead of pipe diameters. The model not only determines the optimal pumping head for each pumping station but also finds the optimal location and number of pumping stations. GIS is used to handle hydraulic and budgetary data automatically and to visualize the results for the of optimal design of the system. The model has been applied to an existing water supply system. 'The results show that the optimization model with the aid of GIS is helpful in the decision-nulling process for the design of more economical systems, and can be dot into practice successfully.

• Atmosphere
• /
• v.16 no.1
• /
• pp.19-31
• /
• 2006

The purpose of this study is to develop the statistical model to predict sea level pressure of typhoon period in south coast of the Korean Peninsula. Seven typhoons, which struck south coast of the Korean Peninsula, are selected for this study, and the data for analysis include the central pressure and location of typhoon, and sea level pressure and location of 19 observing site. Models employed in this study are the first order regression, the second order regression and the neural network. The dependent variable of each model is a 3-hr interval sea level pressure at each station. The cause variables are the central pressure of typhoon, distance between typhoon center and observing site, and sea level pressure of 3 hrs before, whereas the indicative variable reveals whether it is before or after typhoon passing. The data are classified into two groups - one is the full data obtained during typhoon period and the other is the data that sea level pressure is less than 1000 hPa. The stepwise selection method is used in the regression model while the node number is selected in the neural network by the Schwarz's Bayesian Criterion. The performance of each model is compared in terms of the root-mean square error. It turns out that the neural network shows better performance than other models, and the case using the full data produces similar or better results than the case using the other data.

• 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.5
• /
• pp.1128-1134
• /
• 2007

Recently, sensor network technology is a highly concerned area due to the expectation of many applications in various fields. The application of sensor network technology to the marine and ocean surveillance and investigation makes the marine environmental research easier since intelligent sensor nodes substitute the human labor work. In ocean sensor network, the localization scheme for the sensor nodes is most essential because all the information without from sensor nodes might be useless unless the positional information of each sensor nodes is provided. In this paper, the localization scheme with mobile beacons in ocean sensor networks is suggested and showed it could be effective for applying to marine circumstances. Even though the previous localization scheme(Ssu's) has advantages that additional hardware is not required for obtaining the information of distance and angle and shows the high accuracy of location and energy efficiency and easy expandability as well, it has also demerits the location error increases as the minimum distance between the absolute positional information become closer. In our works, the improved localization scheme with the presumed area of sensor node using geometric constraints is suggested.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.59-69
• /
• 2005

Ad hoc network is the network which can be considered without a pre-constructed infrastructure, and a mobile node can join the network freely. However, the participation of the mobile nodes to the ad hoc network brings up much burden of re-computation for new routes, because it leads to losing the connection frequently. And, also, it causes serious security problem to be broadcasted wrong information by the malicious user. Therefore, it needs authentication against the mobile nodes. To make that Possible, we have two methods: single CA and distributed CA. In the case of CA method, the wireless network can be collapsed owing to expose the CA, but still the distributed CA method is a little more safe than previous one because it needs attacks toward a lot of CAs to collapse the network We can consider Secret Share scheme as the method that constructs the distributed CA system, but it is weak when the network size is too large. In this paper, we suggest hierarchical structure for the authentication method to solve this problem, and we will show the results of simulation for this suggestion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.407-416
• /
• 2005

This paper suggests a new geocasting protocol which is used to transfer the geographic packets to the specific region in MANET. Geocasting protocol is basically different from the conventional multicasting protocol that needs group addition and maintenance. A geocasting protocol using the mobile node's position information is the new area of multicasting protocols. The existing geocasting protocols have the following problems; it may be impossible to transfer data to some mobile hosts even if there are alternate routes and they have low adaptability and efficiency when the number of mobile hosts increases. The proposed CBG (Cluster-Based Geocasting) uses the proactive routing strategy and clustering technique with mobile host's location information. The CBG achieves high successful data transmission ratio and low data delivery cost to mobile hosts at specific region.