• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.49-58
• /
• 2004

The existing route re-establishment methods which intend to extend the lifetime of the network attempt to find a new route in order not to overly consume energy of certain nodes. These methods outperforms other routing algorithms in the network lifetime aspect because that they try to consume energy evenly for the entire network. However, these algorithms involve heavy signaling overheads because they find new routes based on flooding method and route re-establishment occurs often. Because of the overhead they often can not achieve the level of performance they intend to. In this paper, we propose a new route selection algorithm which takes into account costs for the packet transmission and the route re-establishment. Since the proposed algerian considers future route re-establishment costs when it first find the route, it spends less energy to transmit given amount of data while evenly consuming energy as much as possible. Simulation results show that the proposed algorithm outperforms the existing route re-establishment methods in that after simulation it has the largest network energy which is the total summation of remaining energy of each node, the smallest energy consumed for route re-establishment, and the smallest energy needed for maintaining a session.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2473-2492
• /
• 2012

Energy conservation is a vital issue in wireless sensor networks. Recently, employing mobile sinks for data gathering become a pervasive trend to deal with this problem. The sink can follow stochastic or pre-defined paths; however the controlled mobility pattern nowadays is taken more into consideration. In this method, the sink moves across the network autonomously and changes its position based on the energy factors. Although the sink mobility would reduce nodes' energy consumption and enhance the network lifetime, the overhead caused by topological changes could waste unnecessary power through the sensor field. In this paper, we proposed EEDARS, an energy-efficient dual-sink algorithm with role switching mechanism which utilizes both static and mobile sinks. The static sink is engaged to avoid any periodic flooding for sink localization, while the mobile sink adaptively moves towards the event region for data collection. Furthermore, a role switching mechanism is applied to the protocol in order to send the nearest sink to the recent event area, hence shorten the path. This algorithm could be employed in event-driven and multi-hop scenarios. Analytical model and extensive simulation results for EEDARS demonstrate a significant improvement on the network metrics especially the lifetime, the load and the end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5023-5038
• /
• 2017

Big data is an emerging technology which deals with wide range of data sets with sizes beyond the ability to work with software tools which is commonly used for processing of data. When we consider a huge network, we have to process a large amount of network information generated, which consists of both normal and abnormal activity logs in large volume of multi-dimensional data. Intrusion Detection System (IDS) is required to monitor the network and to detect the malicious nodes and activities in the network. Massive amount of data makes it difficult to detect threats and attacks. Sequential Pattern mining may be used to identify the patterns of malicious activities which have been an emerging popular trend due to the consideration of quantities, profits and time orders of item. Here we propose a sequential pattern mining algorithm with fuzzy logic feature selection and fuzzy weighted support for huge volumes of network logs to be implemented in Apache Hadoop YARN, which solves the problem of speed and time constraints. Fuzzy logic feature selection selects important features from the feature set. Fuzzy weighted supports provide weights to the inputs and avoid multiple scans. In our simulation we use the attack log from NS-2 MANET environment and compare the proposed algorithm with the state-of-the-art sequential Pattern Mining algorithm, SPADE and Support Vector Machine with Hadoop environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.37-45
• /
• 2004

In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.486-490
• /
• 2007

Recently, there have been active research efforts on devising efficient routing algorithms utilizing location information in ad-hoc mobile networks. In this paper, we propose a new method to improve the performance of the widely recognized Location Aided Routing (LAR) algorithm. To this end, we suggest the concept of accessible zone combined with the basic two schemes associated with LAR algorithm. Through the proposed algorithm, we can confine the flooding area within accessible zone, thereby reducing the routing delay.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.525-534
• /
• 2005

This paper is concerned with the query slipping and its prevention for trajectory-based matchmaking service in wireless sensor networks. The problem happens when a query propagating along a subscribe trajectory moves through a publish trajectory without obtaining desired information, even though two trajectories intersect geometrically. There follows resubmission of the query or initiation of another subscribe trajectory Thus, query slipping results in considerable time delay and in the worst, looping in the trajectory or query flooding the network. We address the problem formally and suggest a solution. First, the area where nodes are distributed is logically partitioned into smaller grids, and a grid-based multicast next-hop selection algorithm is proposed. Our algorithm not only attempts to make the trajectory straight but also considers the nodal density of recipient nodes and the seamless grid-by-grid multicast. We prove that the publishing and subscribing using the algorithm eventually eliminate the possibility of the slipping. It toms out that our algorithm dissipates significantly less power of neighbor nodes, compared to the non grid-based method, as greedy forwarding, and the fixed- sized grid approach, as GAF (Geographical Adaptive Fidelity)

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.189-198
• /
• 2009

Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.187-196
• /
• 2000

Failures in ATM networks can occur at virtual path (VP) links, virtual path switches, and virtual channel (VC) switches. Restoration schemes have been proposed for VP link and VP switch failures, however, none for VC switch failures. In general, VC switches are used for edge nodes in protection domains. Since even only one VC switch failure can cause a critical problem, new restoration schemes for VC switch failures are highly required. Restoration schemes at the VP level proposed so far can be categorized into those using the flooding algorithm and those using the backup virtual path (BVP) concept. Even though the latter cannot handle unpredictable failures, it has some advantages such as fast restoration and low spare capacity requirement. In this paper, we propose new restoration schemes using a new type of BVPs to handle VC switch failures. The simulation results show that the proposed schemes can restore virtual connection failures due to VC switch failures without degrading restorability for VP failures.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1303-1310
• /
• 2011

This paper proposes the design of 3-party negotiation protocol for the security of self_organized storage which consists of the owner node possessing data, the holder node holding the owner's data and the verification node verifying the data of the holder node on infra-cloud environment. The proposed security technique delegating the data verification of the holder node to the verification node increases the efficiency of the self-organized storage. In addition, the encrypt key and certification of the storage created by EC-DH algorithm enhances the security much more. Also, when the self-organized storage is composed, the security technique not only prevents external flooding attack by setting a certification key among three parties, but also prevents internal flooding attack by restricting the number of verification nodes. And The replay attack which can occur in the step of verification is automatically detected by using the created seed value whenever the verification is requested.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.4
• /
• pp.71-80
• /
• 2011

A simple and an improved methods for the assessment of flood damage were used in previous studies, and the Multi-Dimensional Flood Damage Assessment (MD-FDA) has been applied since 2004 in Korea. This study evaluated flood damage of dam downstream using considering MD-FDA method based on GIS data. Firstly, flood water level with FLDWAV (Flood Wave routing) model was input into cross section layer based on enforcement drainage algorithm, water depth grid data were created through spatial calculation with DEM data. The value of asset of building and agricultural land according to local government was evaluated using building layer from digital map and agricultural land map from landcover map. Also, itemized flood damage was calculated by unit price to building shape, evaluated value of housewares to urban type, unit cost to crop, tangible and inventory asset of company connected with building, agricultural land, flooding depth layer. Flood damage in rainfall frequency of 200 year showed 1.19, 1.30 and 1.96 times to flood damage in rainfall frequency of 100 year, 50 year and 10 year respectively by flood damage analysis.