An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System

IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.

Adaptive Binary Negative-Exponential Backoff Algorithm Based on Contention Window Optimization in IEEE 802.11 WLAN

Choi¹

2010

A Novel System for Detecting Adult Images on the Internet

Park¹

2010

As Internet usage has increased, the risk of adolescents being exposed to adult content and harmful information on the Internet has also risen. To help prevent adolescents accessing this content, a novel detection method for adult images is proposed. The proposed method involves three steps. First, the Image Of Interest (IOI) is extracted from the image background. Second, the IOI is distinguished from the segmented image using a novel weighting mask, and it is determined to be acceptable or unacceptable. Finally, the features (color and texture) of the IOI or original image are compared to a critical value; if they exceed that value then the image is deemed to be an adult image. A Receiver Operating Characteristic (ROC) curve analysis was performed to define this optimal critical value. And, the textural features are identified using a gray level co-occurrence matrix. The proposed method increased the precision level of detection by applying a novel weighting mask and a receiver operating characteristic curve. To demonstrate the effectiveness of the proposed method, 2850 adult and non-adult images were used for experimentation.

A Border Line-Based Pruning Scheme for Shortest Path Computations

Park¹

2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, A* algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.