• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.65-73
• /
• 2016

Peer-to-Peer (P2P) systems with super-peer overlay networks show combined advantages of both hybrid and pure P2P systems. Super-peer is a special peer acting as a server to a cluster of generic peers. Organizing a super-peer network is one of important issues for P2P systems with super-peer networks. Conventional P2P systems are based on two-level hierarchies of peers. One is a layer for generic peers and the other is for super-peers. And it is usual that super-peer networks have forms of random graphs. However, for accommodating a large-scale collection of generic peers, the super-peer network has also to be extended. In this paper, we propose a scheme of hierarchically constructing super-peer networks for large-scale P2P systems. At first, a two-level tree, called a simple super-peer network, is proposed, and then a scheme of generalizing and then extending the simple super-peer network to multi-level super-peer network is presented to construct a large-scale super-peer network. We call it an extended super-peer network. The simple super-peer network has several good features, but due to the fixed number of levels, it may have a scalability problem. Thus, it is extended to k-level tree of a super-peer network, called extended super-peer network. It shows good scalability and easy management of generic peers for large scale P2P system.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.43 no.3
• /
• pp.101-113
• /
• 2015

The purpose of this study is increasing ventilation network usability for urban green space planning by enhancing its practicality and detail. A ventilation network feature extraction technique using roughness length($z_0$) was proposed. Continuously surfaced DZoMs generated from $z_0$(cadastral unit) using three interpolations(IDW, Spline, and Kriging) were compared to choose the most suitable interpolation method. Ventilation network features were extracted using the most suitable interpolation technique and studied with land cover and land surface temperature by spatial overlay comparison. Results show Kriging is most suitable for DZoM and feature extraction in comparison with IDW and Spline. Kriging based features are well fit to the land surface temperature(Landsat-7 ETM+) on summer and winter nights. Noteworthy is that the produced ventilation network appears to mitigate urban heat loads at night. The practical use of proposed ventilation network features are highly expected for urban green space planning, though strict validation and enhancement should follow. (1) $z_0$ enhancement, (2) additional ventilation network interpretation and editing, (3) linking disconnected ventilation network features, and (4) associated dataset enhancement with data integrity should technically preceded to enhance the applicability of a ventilation network for green space planning. The study domain will be expanded to the Seoul metropolitan area to apply the proposed ventilation network to green space planning practice.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1947-1954
• /
• 2009

Service discovery mechanism is a core technique for getting a desired service in MANET(Mobile Ad-Hoc NETwork) environment. However, As feature of MANET, existing mechanisms have some problem that service requester search for trustable service. also it can not support scalability. in this paper, how to reliably support applications such as service discovery on top of MANET. we are firstly finding a trustable service provider and configure DHT(Distributed Hash Table). P2P's DHT can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. Especially, Proposed DHT systems used for P2P overlay network can be effective in reducing the communication overhead in service discovery. So proposed mechanism can support for reliably searching required service and scalability. Simulation results show that our mechanism is scalable and outperforms existing service discovery mechanism.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.216-225
• /
• 2004

In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.4
• /
• pp.1-9
• /
• 2015

This paper proposes CAC method that is more efficient for RRM using game theory combined with Multiple Attribute Decision Making(MADM). Because users request services with different Quality of Service(QoS), the network preference values to alternative networks for each service are calculated by MADM methods such as Grey Relational Analysis(GRA), Simple Additive Weighting(SAW) and Technique for Order Preference by Similarity to Ideal Solution(TOPSIS). According to a utility function representing preference value, non-cooperative game is played, and then network provider select the requested service that provide maximum payoff. The appropriate service is selected through Nash Equilibrium that is the solution of game and the game is played repeated. We analyze two overlaid networks among four Wireless LAN(WLAN) systems with different properties. Simulation results show that proposed MADM techniques have same outcomes for every game round.

• Smart Media Journal
• /
• v.5 no.2
• /
• pp.42-50
• /
• 2016

In case of a emergency situation or a natural disaster, a warning notification system is an essential tool to notify at-risk people in advance and provide them useful information to survive the event. Although some systems have been proposed such as emergency alert system using android, SMS, or P2P overlay network, these works mainly focus on a reliable message distribution methods. In this paper, we proposed a novel design and implementation of a personalized warning notification system to help inform not only the at-risk people but also their family and friends about the coming disaster as well as escape plan and survival information. The system consists of three main modules: the user selection module, the knowledge based message generator, and message distribution modules. The user selection module collects the list of people involved in the event and sorts them based on their level of involvement (their location, working position and social relationships). The knowledge based message generator provides each person with a personalized message that is concise and contains only the necessary information for the particular person based on their working position and their involvement in the event. The message distribution module will then find a best path for sending the personalized messages based on trustiness of locations since network failures may exist in a disaster event. Additionally, the system also have a comprehensive database and an interactive web interface for both user and system administrator. For evaluation, the system was implemented and demonstrated successfully with a building on fire scenario.

• International Journal of Highway Engineering
• /
• v.12 no.4
• /
• pp.39-46
• /
• 2010

In 2007, Iowa department of transportation (DOT) initiated to run the falling weight deflectometer (FWD) network-level testing along Iowa highway and road systems and to build a comprehensive database of deflection data and subsequent structural analysis, which are used for detecting pavement structure failure, estimating expected life, and calculating overlay requirements over a desired design life. Iowa's current FWD networklevel testing protocol requires that pavements are tested at three-drop level with 8-deflection basin collected at each drop level. The test point is determined by the length of the tested pavement section. However, the current FWD network-level program could cover about 20% of Iowa's highway and road systems annually. Therefore, the current FWD network-level test protocol should be simplified to test more than 20% of Iowa's highway and road systems for the network-level test annually. The main objective of this research is to investigate if the minimum number of drop levels and test points could be reduced to increase the testing production rate and reduce the cost of testing and traffic control without sacrificing the quality of the FWD data. Based upon the limited FWD network-level test data of eighty-three composite pavement sections, there was no significant difference between the mean values of three different response parameters when the number of drop levels and test points were reduced from the current FWD network-level testing protocol. As a result, the production rate of FWD tests would increase and the cost of testing and traffic control would be decreased without sacrificing the quality of the FWD data.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.139-145
• /
• 2009

Recently P2P (Peer-to-Peer) networks and applications have been expanded to various field. However, because the construction of P2P network did not influence a underlying network topology or property, it may be inefficient. Especially, this inefficiency is more serious in MANET because MANET has narrow bandwidth and energy constraint. When we use a proactive routing protocol in MANET, we can know hop counts between two nodes. And, we can construct a P2P overlay network using this hop count information. However, In case of using hop count only, we can avoid a interference path selection problem and a zig-zag problem. We propose a method of improving P2P contents distribution using virtual positions. We calculate virtual positions from hop counts using the trigonometry. This method solves a interference path selection problem and a zig-zag problem. This method also allows a P2P network to influence underlying network topology. We adopt this method to a network which uses a virtual geographic routing, a proactive routing protocol, or a reactive routing protocol. We show that our proposed methods improve P2P contents distribution performance over MANET through a simulation.

• Journal of Environmental Science International
• /
• v.17 no.6
• /
• pp.679-687
• /
• 2008

In this study, we implemented landslide distribution of Jeju Island using ANN and GIS, respectively. To do this, we first get the counter line from 1:2,5000 digital map and use this counter line to make the DEM. for the evaluate the land slide susceptibility. Next, we abstracted slop map and aspect map from the DEM and get the land use map using ISODATA classification method from Landsat 7 images. In the computation processes of landslide analysis, we make the class to the soil map, tree diameter map, Isohyet map, geological map and so on. Finally, we applied the ANN method to the landslide one and calculated its weighted values. GIS results can be calculated by using Acrview program and produced Jeju landslide susceptibility map by usign Weighted Overlay method. Based on our results, we found the relatively weak points of landslide ware concentrated to the top of Halla mountains.