I-Hsien Liu

Novel intrusion prediction mechanism based on honeypot log similarity

Summary The current network-based intrusion detection systems have a very high rate of false alarms, and this phenomena results in significant efforts to gauge the threat level of the anomalous traffic. In this paper, we propose an intrusion detection mechanism based on honeypot log similarity analysis and data mining techniques to predict and block suspicious flows before attacks occur. With honeypot logs and association rule mining, our approach can reduce the false alarm problem of intrusion detection because only suspicious traffic would be present in the honeypots. The proposed mechanism can reduce human effort, and the entire system can operate automatically. The results of our experiments indicate that the honeypot prediction system is practical for protecting assets from attacks or misuse.

Novel Advanced Broadcast Scheme for Efficient Safety Message Collision Alleviation in Vehicular Networks

Safety message broadcasting may cause a broadcast storm in vehicular ad-hoc network without an effective feedback mechanism. In particular, with increasing number of vehicles, serious collisions and incurred long delays are not acceptable for emergency safety messages. In this paper, we proposed an advanced broadcast scheme by the functionality of distributed coordination function and multi-channel operation in dedicated short range communication to decrease collision probability and increase received ratio of safety messages. The proposed scheme can increases safety message transmission efficiency and reduce the latency by delicately designing a rebroadcast probability, choosing the channel and selecting the backoff timer. After broadcasting in the control channel, transmitters return to their original service channel. Then, the vehicles receiving the safety message should inform the others in the same service channel to switch to the control channel for the safety message. Afterwards, the vehicles broadcast the safety message once and go back to the original service channel. This method can inform the other vehicles in different channels to increase the broadcast penetration. The proposed scheme can work without global positioning system (GPS). However, GPS can adapt the rebroadcast probability on hot spots to enhance the efficiency of the proposed scheme. Through detailed simulations, the proposed scheme is shown to be more efficient compared to the existing ones.

Intelligent Adjustment Forwarding: A compromise between end-to-end and hop-by-hop transmissions in VANET environments

Most of the nodes in a vehicular ad hoc network (VANET) move continuously, and thus the link quality changes constantly. As a result, the connections are intermittent and many network services (e.g., video conferencing) fail to function properly. Although many routing algorithms for discovering available transmission paths have been proposed, it is almost impossible to find a reliable end-to-end path in VANET environments since transmission failures occur so frequently. As a result, developing efficient retransmission schemes is of great practical importance. Accordingly, the present study proposes an application layer forwarding protocol designated as Intelligent Adjustment Forwarding (IAF), in which a segment-to-segment transmission paradigm is used to enhance the data delivery performance. The simulation results show that IAF not only improves the reliability of the data transmissions, but also enables a more efficient recovery in the event of transmission failures. Significantly, the improved transmission performance of IAF is accomplished with no more than a slight increase in the transmission time relative to that of existing VANET approaches.

A multi-hop resource scheduling algorithm for IEEE 802.16j relay networks

Abstract The IEEE 802.16j standard defines both transparent and non-transparent relay transmission mode. The present study formulates and optimizes the relay resource scheduling problem for the case of a non-transparent relay network. It is shown that the resource scheduling problem is NP-Complete. A method is proposed for optimizing the position of the zone boundary adaptively during the resource scheduling process in order to maximize the system throughput. In addition, a low time complexity algorithm designated as MRRS (multi-hop relay resource scheduling) is proposed to obtain an approximate solution for the NP-Complete scheduling problem. In the proposed algorithm, the zone boundary is adjusted adaptively in accordance with the user distribution and the channel state information in such a way as to improve the utilization of the available slots. The simulation results show that MRRS achieves a higher throughput than existing relay resource scheduling algorithms (GenArgMax and Eliminate-Repeat) with no significant loss in fairness. In addition, it is shown that the performance improvement provided by MRRS increases as the hop-count is increased.

Defending cloud computing environment against the challenge of DDoS attacks based on software defined network

With the explosive growth of cloud computing, virtualization technology has become more and more mature. However, it also increases the complexity of the network topology and causes many new important issues. One of the important issues is the security problem. It is hard to directly monitor the network traffic between Virtual Machines (VMs) through the external network devices, which make VMs more vulnerable in virtual environments. This research focuses on how to efficiently and rapidly protect VMs from malicious attacks without consuming its resources. We combine virtualization platform with the concept of Defense in Depth based on Software Defined Network (SDN), and implement a real-time detection and defense system for DDoS attacks. Moreover, we propose an enhanced entropy-based DDoS detection method to improve its detection accuracy, and we deploy it in SDN architecture.

K-anonymity against neighborhood attacks in weighted social networks

Nowadays, with the advance of Internet technology, social network is getting popular, which combines the virtual network and the real world. People employ this network to communicate with all social things of their interest, including shopping, making friends, sharing experiences of life, and so on. In social networks, the social data expands rapidly and the malicious users can easily get the social data. With the social information, they could conjecture the relationship among social network data via the systematical analysis tool. Hence, the personal privacy data in social network may be exposed to some unknown risks, and recently, these issues arising in such a network catch much attention. The protection of personal privacy social data becomes an important and urgent research in social networks. One of personal privacy social information is the relations between the individuals and their social groups, namely human relationships.

Navigation-aware association control in vehicular wireless networks

Currently, internetworking over Wireless Vehicular Ad Hoc Networks VANET is getting more attention and discussion. Mobile devices, including smartphones, laptops and PDAs, associate with nearby access points that are located on the roadside to access Internet in VANETs. Hence, people can use these devices to communicate in VANETs. However, the unbalanced traffic distribution often occurs among the APs in the networks, which leads to unfair bandwidth share for each user. This situation may get worse in VANETs composed of thousands of high mobility vehicles. Hence, this study focuses on association control to achieve load balancing among APs RSUs, and we propose a novel association control algorithm with an aid of the navigation system. Based on the use of fully-fledged navigation system, our proposed algorithm plans a RSU-association-schedule, which selects a series of appropriate RSUs roadside units in advance to reach destination and meanwhile achieves load balancing among RSUs. The simulation results show that our scheme does improve the fairness and overall performance in VANETs.

A Survey on SCADA Security and Honeypot in Industrial Control System

Nowadays, the infrastructure employs SCADA (supervisory control and data acquisition) system for monitoring, such as power plants, reservoir, manufacturing, and logistics industry. With the rapid development of the internet, IOT (internet of things) makes every massive infrastructure more convenient to be control and monitoring. However, the convenience of remote controlling to the infrastructure may cause serious damage which could affect people’s livelihood. Consequently, an effective and protective mechanism to protect the SCADA system is necessary. We have investigated the related attacks and defensive methods. This paper surveys varying SCADA system and the honeypot system of SCADA. Then we proposed a defensive architecture with honeypot system to protect the SCADA system.

Distributed Node Scheduling Algorithms for Multiple Group Communications in Wireless Multi-hop Networks

We study the scheduling problem in performing multiple multicast communications in wireless multi-hop networks, it is necessary to ensure that each multicast group can complete one transmission from the source to all the destination nodes without conflict in every frame. The present study proposes two distributed token-based STDMA node scheduling algorithms which not only satisfy this requirement, but also minimize the frame length. In the first algorithm, the multicast groups are scheduled on a group-by-group basis, whereas in the second algorithm, multiple groups are scheduled in each scheduling operation. The first algorithm has the advantages of computational simplicity and a straightforward implementation, while the second algorithm increases the percentage of reused time slots and reduces the number of token forwarding events. The simulation results show that both algorithms achieve a shorter frame length than existing methods.

Factor Impact of Virtual Switch Performance by Factorial Design in Cloud Computing

One of the main technologies of cloud computing is virtualization. Virtualization allows Virtual Machines (VMs) to share physical resources simultaneously resulting in higher utilization of hardware resources and lower infrastructure costs. With the proliferation of VMs, the importance of virtual switches (vSwitches) comes to the forefront. The concept of network virtualization is connecting VMs using virtual switches. The virtual switches are responsible for the packet switching between VMs. A virtual switch can be designed and implemented by software or hardware. In this paper, the virtual environment we implement is a Kernel-based Virtual Machine (KVM) and we connect the VMs with Open vSwitch. The purpose with factorial design is effective to discern the impact and the extent of system workload on the performance of applications running on the VMs. We also measure and analyze the performance and overhead of different virtual switch deployment topologies.