• Journal of the Korean Institute of Rural Architecture
• /
• v.6 no.1
• /
• pp.32-41
• /
• 2004

Many administrative policies for regional activation have progressed the expansion and improvement of convenience institutions. Most appraisals about rural community influenced by urban life convenience are affirmative, but chasing urban life convenience is a cause of breaking out regional identity. Recently, new rising methods of theme and characteristic to imply regional identity, are ways of regional activation through neighboring network around satellite of rural community. In this study, I research and suggest applicable possible proposal of rural communities in Korea. by survey of neighboring network methods of Asan Live Museum in Japan applied ecomuseum concept for regional activation.

• Journal of Fisheries and Marine Sciences Education
• /
• v.23 no.3
• /
• pp.477-485
• /
• 2011

For the identifying of spatial distribution pattern, Moran's Index(I) which has the range of values from -1 to +1 is common method for the spatial autocorrelation measurement. When I is close to 1, all neighboring features have close to the same value, indicating clustered pattern. Conversely, if the spatial pattern is dispersed, I is close to -1. And I closing to 0 means spatially random pattern. However, this index equation is influenced by how defining the neighboring features for target feature. To compare and understand the difference of neighborhood definition methods, fixed distance neighboring method and Gabriel Network method were used for I. In this study, these two methods were applied to two marine environments with water quality data. One is Gwangyang Bay which has complex geometric coastal structure located in South Sea of Korea. Another is Uljin area adjacent to open sea located in east coast of Korea. The distances between water quality observed locations were relatively regular in Gwangyang Bay, however, irregular in Uljin area. And for the fixed distance method popular Arc GIS tool was used, but, for the Gabriel Network, Visual Basic program was developed to produce Gabriel Network and calculate Moran's I and its Z-score automatically. According to this experimental results, different spatial pattern was showed differently for some data with using of neighboring definition methods. Therefore there is need to choose neighboring definition method carefully for spatial pattern analysis.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.33-39
• /
• 2008

Mobile Ad Hoc Network is easy to be attacked because nodes are distributed not network based infrastructure. Intrusion detection system perceives the trust values of neighboring nodes and receives inspection on local security of nodes and observation ability. This study applied clustering mechanism to reduce overhead in intrusion detection. And, in order to measure the trust values, it associates the trust information cluster head received from member nodes with its own value and evaluates the trust of neighboring nodes. Secure data transmission is received by proposed concept because the trust of nodes on network is achieved accurately.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.227-230
• /
• 2009

In this paper, the results of field testing of high-speed power line in-home networking in Korea are reported. When multiple networks share a common channel, they can interfere destructively and reduce system capacity. This is major problem in-home power line communications, especially in MDU deployments. The effects of neighboring network interference in power line communications are reported.

• International Journal of Contents
• /
• v.2 no.2
• /
• pp.29-31
• /
• 2006

Mobile Ad hoc network is a self configuring network of mobile nodes. It allows mobile nodes to configure network spontaneously and share their services. In these networks, service discovery is very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Some service discovery protocols have been proposed in last couple of years but they include significant traffic overhead and for small scale MANETS. In this paper, we present extensible lookup service scheme based on distributed mechanism. In our scheme neighboring nodes of service provider monitor service provider and send notification to lookup server when the service provider terminates its services unexpectedly. Lookup server can find other service provider or other alternative services in advance because of advance notification method and can provide consistent lookup services. In our scheme neighboring nodes also monitor lookup server and send notification to network when lookup server terminates unexpectedly. Simulation results show that our scheme can reduce up to 70% and 30% lookup failure as compare to centralize and simple distributed mechanism respectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.465-468
• /
• 2008

Clustering techniques in wireless sensor networks is developed to minimize the energy consumption of node, show the effect that increases the network lifetime. Existing clustering techniques proposed the method that increases the network lifetime equalizing each node's the energy consumption by rotating the role of CH(Cluster Head), but these algorithm did not present the resolution that minimizes the energy consumption of neighboring nodes with sink. In this paper, we propose the clustering algorithm that prolongs the network lifetime by not including a part of nodes in POS(Personal Operating Space) of the sink in a cluster and communicating with sink directly to reduce the energy consumption of CH closed to sink.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1107-1112
• /
• 2008

Clustering techniques, which are algorithm to increase the network lifetime in wireless sensor networks, is developed to minimize the energy consumption of nodes. Existing clustering techniques by to increase the network lifetime with equalizing each node's the energy consumption by rotating the role of CH(Cluster Head), but these algorithms did not present the solution that minimizes the energy consumption of neighboring nodes with sink. In this paper, we propose the clustering algorithm that prolongs the network lifetime by not including a part of nodes in POS(Personal Operating Space) of the sink in a cluster and communicating with sink directly to reduce the energy consumption of CH closed to sink.

• International Journal of Contents
• /
• v.1 no.2
• /
• pp.31-34
• /
• 2005

The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

• Journal of Intelligence and Information Systems
• /
• v.4 no.2
• /
• pp.23-34
• /
• 1998

Travel time forecasting, especially public bus travel time forecasting in urban areas, is a difficult and complex problem which requires a prohibitively large computation time and years of experience. As the network of target area grows with addition of streets and lanes, computational burden of the forecasting systems exponentially increases. Even though the travel time between two neighboring intersections is known a priori, it is still difficult, if not impossible, to compute the travel time between every two intersections. For the reason, previous approaches frequently have oversimplified the transportation network to show feasibilities of the problem solving algorithms. In this paper, forecasting of the travel time between every two intersections is attempted based on travel time data between two neighboring intersections. The time stamps data of public buses which recorded arrival time at predetermined bus stops was extensively collected and forecast. At first, the time stamp data was categorized to eliminate white noise, uncontrollable in forecasting, based on wavelet conversion. Then, the radial basis neural networks was applied to remaining data, which showed relatively accurate results. The success of the attempt was confirmed by the drastically reduced relative error when the nodes between the target intersections increases. In general, as the number of the nodes between target intersections increases, the relative error shows the tendency of sharp increase. The experimental results of the novel approaches, based on wavelet conversion and neural network teaming mechanism, showed the forecasting methodology is very promising.