ABSTRACT Network continues to be under various attacks every day. One common attack is to use password guessing to intrude a machine and then to inject malware or botnet for future control. To develop counter measures, honeypot technique, which simulates a real system, is often used for capturing attack patterns, malware or botnet, and malware download sites. However, neither low‐interaction nor medium‐interaction honeypot could simulate well the behaviors in a true system as a result of the inborn restrictions in the technology so that the honeypot might be discovered by an attacker or malware. This study proposes a new honeypot system, Jingu, which is constructed with a true environment plus protection mechanism from being circumvented. The proposed high‐interactive honeypot system, Jingu, can achieve the following goals: (1) not be perceived by attackers; (2) to protect against being attacked; (3) to record and learn attack behaviors; (4) to capture malware; and (5) to collect valuable information for detection purpose. Jingu has been deployed on a real network for 2 years. Comparing with the low‐interactive honeypot, honeyd, Jingu can successfully catch attack behaviors as well as can capture malware. The results show that the proposed system is able to block real attacks and to collect valuable information for future detection and malware analysis. Copyright © 2012 John Wiley & Sons, Ltd.

In recent years, the public has been paying ever greater attention to problems associated with energy production and consumption. Major news publications print headlines such as "Crude-oil Production Is Winding Down" and "Natural Gas Is in Scarce Supply." Nuclear crises seem more likely than ever, whether caused by human actions or natural disasters. Energy-supply issues rightly constitute one of the most important issues that we face. Before a viable alternative energy source of supply is discovered and implemented, energy saving is essential. This work proposes a method based on fuzzy logic for scheduling and controlling electrical operators in a cyber-physical system. Not only output of process but also environmental variations are considered. The electrical operators are assumed to be of a single type but with various capabilities. One set of sensors is placed dispersedly around the to-be-affected area for measuring the output of processes. Another set of sensors would collect the data on environmental-variations to predict purposes. The results of a simulation reveal that fuzzy control method for actuators in a cyber-physical system can be used to minimize the power consumption of the system while accomplishing the desired set point.

Tourism navigation systems have become an important research area because they help people strengthen their focus on the quality of the tourism. This paper proposes an adaptive recommendation mechanism that rests on a congestion-aware scheduling method for multigroup travelers on multidestination travels. This recommendation scheme uses the pheromone mechanism of an ant algorithm for group system distribution. In order to reduce congestion in the “visiting multiple destinations” problem that might beset the multiple groups, we present a tour group that could take adaptive recommendations from a system that would yield a high quality tour experience, wherein the group would visit a secondary destination first and then visit the primary destination. Simulation results reveal the strengths of the proposed “adaptive recommendation mechanism” model in terms of decreasing average waiting time, congestion, and the ratio of congestion avoiding to number of groups.

This Connection Manager Intelligence Agent (CMIA) is an attractive feature of use the network traffic and behavior with multi-attributes to find the best network devices and connection devices meet user habits that it possible to access various multimedia contents everywhere at any time. In this agent, information process is thoroughly integrated into embedded system for connection manager of Meego or Android. We have implemented an interactive interface through this function (User interactive interface are based on Qt Creator IDE and CMIA) acquisition user behavior and to scholars of the machine. We have a successful user interaction of the agent can be decision making the choice of match the user intent.

Connection Manager Intelligence Agent's (CMIA) an attractive feature is use the network traffic and behavior with multi-attributes to find the best network devices and connection devices meet user habits that it possible to access various network contents everywhere at any time. In this agent, information process is thoroughly integrated into embedded system for connection manager of MeeGo or Android. This paper proposes a new and generic algorithm for connection manager in the heterogeneous wired or wireless environments. The proposed algorithm uses a Fuzzy Analytic Hierarchy Process theory (FAHP) of Multi-Criteria Decision Making (MCDM) system to achieve scalable, adaptable, and flexible solution. This study implemented an interactive interface through of this function acquisition user behavior and to scholars of the machine used a boosting iterations for User-Case, the algorithm maintains a set of weights as a distribution classes table of case as in the parameter learning by user-case and its quite possible that the Expectation-Maximization (EM) of Maximum Probability Model (MPM) by classification from user behavior. User interaction showed that the agent satisfactorily matched user intent.

A cyber-physical system (CPS) is an integration process between the cyber-world and the physical world. Because the cyber-world affects the physical world with actuators, CPS security is crucial. Limited by characteristics of low computation power and small storage capacity of embedded devices, cloud computing is enabling technology to provide computation resources. As a result of complexity and diversity in real-world activity, fuzzy logic is required for risk assessment. Therefore, developing an integrated framework for seamless security is necessary. This paper implements and analyzes an integrated framework for cultural heritage called “Banyan Tree Guardian”. Banyan Tree Guardian detects intrusion and regulates growth. Physical parts consist of a sensor network involving temperature, light, humidity, and intrusion sensors. However, sensing data require computation for analyzing. This study devises a set of cloud services that collect data and control alarms, sprays, and other physical actuators. Both physical and network intrusions are crises in cultural heritage preservation. As a result, we implement fuzzy logic in physical intrusion detection, and design a cross-layer compromise detection mechanism. To verify our concept, we implement the actual CPS at the Taiwan Confucian Temple.

This paper proposes a novel approach to clustering the interests of car drivers, increasing the lifetime of interest groups, and increasing the throughput in vehicle-to-vehicle environments. It develops an interest ontology of cellular automata (CA) clustering using the zone of interest (ZOI) for mobicast communications in vehicular ad hoc network (VANET) environments. The key to the proposed method is to integrate CA clustering with the ontology of users' interests. This paper argues for the use of both an interest profile (ontology) of drivers and information about vehicles to form a group of VANET-related interests. The current study evaluates the performance of the approach by conducting computer simulations. Simulation results reveal the strengths of the proposed CA clustering algorithm in terms of increased group lifetime and increased ZOI throughput for VANETs.

In this paper, we propose a tree-based adaptive broadcasting (TAB) algorithm for data dissemination to improve data access efficiency in vehicle communications. The proposed TAB algorithm first constructs a broadcast tree to determine the broadcast frequency of each data, and splits the broadcast tree into some broadcast wood to generate the broadcast program. In addition, this paper develops an analytical model to derive the mean access latency of the generated broadcast program. In light of the derived result, the bandwidth for both index channel and data channel can be optimally allocated to maximize bandwidth utilization. Furthermore, to evaluate the effectiveness of the proposed strategy, experiments are demonstrated as well. This study argues for the use of an interest profile (ontology) of drivers and information about vehicles to form a group of interest for Vehicle ad hoc Networks (VANETs). The performance of the approach is evaluated by performing computer simulations. From the experimental results, it can be seen that the proposed mechanism is feasible in practice.

The Internet Protocol Television (IPTV) is becoming one of the most promising applications over next generation networks. With the recent released of IEEE802.16d/e, it is capable ensuring high bandwidths and low latency and suitable for delivering multimedia services. In addition, it also provides wide area coverage, mobility support and non-line-of-sight operation. In this paper, we deliver IPTV streaming over 802.16 wireless systems and propose a simple but effective IPTV channel switching algorithm to keep the channel zapping time in the tolerable range. Besides, we discuss how to allocate channels in the limited bandwidth over wireless network, such as 802.16. The proposed algorithm based on Hot-View channel and personal favorite channel preloading to reduce the network delay and achieve the goal of fast channel switching. Finally, the experimental results show the performance of the proposed algorithm.

IEEE 802.16 broadband wireless access standard specifies four types of services to satisfy the quality of service (QoS) requirements of multimedia applications. How to design a scheduling algorithm is an open issue. Manufacturers can implement their own efficient scheduling algorithm depending on their requirement. There are a lot of scheduling algorithms that have been proposed. No matter these scheduling algorithms propose a hierarchical structure with strict priority or one-level scheduling mechanism, which is based conceptually on the round-robin approach, they do not consider an important factor: fair. The authors introduce a fair strategy algorithm for IEEE 802.16 broadband wireless access standard. The proposed algorithm applies a fair strategy to utilise the system bandwidth, achieve the QoS requirements of high-priority service flows and reduce starvations of low-priority service flows. The simulation studies show that the proposed scheduling algorithm provides a flexible way to utilise the system bandwidth.

The centralized medium access control (centralized MAC) protocol, which utilizes an Access Point (AP) to coordinate stations in wireless networks, guarantees the quality of service (QoS) for transmission, and provides good throughput in the highly congested network. However, the centralized MAC protocol cannot be adopted in ad hoc networks, because it provides only single-hop transmission. This paper proposes a multihop mechanism for centralized MAC protocols to operate on various network topologies. The proposed mechanism provides excellent throughput for both inter-subnet and intra-subnet links, and alleviates the hidden terminal problem. Experimental results reveal that the optimal configuration on the proposed mechanism and the comparison between our mechanism and other multihop forwarding mechanisms. The results demonstrate that the proposed mechanism outperforms other multihop forwarding mechanisms in terms of throughput.

We focus on the development and integration of broadband networks, wireless networks, and wireless sensor networks technology to realize the intelligent digital life. The key technologies of our laboratory are: (1) OSGi-based platform for appliance control and service integration, (2) the integration of heterogeneous network technologies and the development of the application services, (3) the user-friendly control interface and novel gesture controller, and (4) development of the core technology of wireless sensor networks. Exploiting on these key technologies, we implement a set of scenarios about the intelligent digital life in the NCKU Touch Center and name the service platform system the digital life Master - Zeus.

The contention-based DCF suffers from collision seriously under heavy load conditions. In this paper, a novel medium access control protocol called Contention-Polling Duality Coordination Function (CPDCF) is proposed to enhance the DCF-based MAC protocol. A polling ACK mechanism is introduced to admit the designated station to transmit without performing any contention process. By eliminating collisions and preventing waste from idle backoff slots, the system capacity is increased effectively. A mathematical model is developed to analyze the saturation throughput of the CPDCF with various CP combinations. The performance in terms of fairness is studied as well. The model accuracy is verified via extensive simulations. Numerical results show that the well-managed CPDCF can achieve a significantly higher system capacity than the legacy DCF does. The CPDCF is also employed to enhance the performance of IEEE 802.11e EDCA. We conclude that the proposed CPDCF is quite feasible, effective, and can be easily integrated with the widespread DCF-based devices.

IEEE 802.16 standards specify four types of services, while how to design an efficient scheduling algorithm remains an open issue. Manufacturers can implement their own scheduling algorithms depending on their specific requirements. There are a lot of scheduling algorithms proposed in the literature. Several scheduling algorithms propose hierarchical structures with strict priority or one-level scheduling mechanism. They are based conceptually on the round-robin approaches. However, they donpsilat consider an important factor: fairness. In this paper we propose a fairness strategy algorithm for IEEE 802.16 broadband wireless access networks. The proposed algorithm applies a fairness strategy to utilize the system bandwidth, to achieve the QoS requirements of high priority service flows, and to reduce starvations of low priority service flows. The simulation studies show that the proposed scheduling algorithm provides a flexible way to utilize the system bandwidth.

In this paper, we propose a scheduling-based medium access control (MAC) protocol for supporting multi-class services in wireless networks. The proposed protocol is a centralized MAC protocol which applies a coordinator node (CN) to coordinate the network. Our protocol is composed of a slot-scheduling algorithm called weighted scheduling and a quality of service (QoS) enhanced admission control algorithm. The weighted scheduling algorithm is designed to efficiently utilize the network bandwidth and fairly schedule the transmission for various types of services, whereas the QoS-enhanced admission control algorithm is proposed to manage resources and guarantee the QoS requirements of services. We make mathematical analysis for the protocol parameters and compare our protocol with IEEE 802.11e EDCF and IEEE 802.11 PCF in terms of throughput and delay by conducting simulations. The experimental results show that our protocol has the best throughput and delay performance among the simulated protocols. Moreover, our protocol has much fewer collisions than IEEE 802.11e EDCF has and always keeps on excellent performance even in the high-loaded network.

This paper proposes a tree-based adaptive broadcasting (TAB) algorithm for data dissemination to improve data access efficiency. The proposed TAB algorithm first constructs a broadcast tree to determine the broadcast frequency of each data, and splits the broadcast tree into some broadcast wood to generate the broadcast program. We learn from the experimental results that the bandwidth for both index channel and data channel can be optimally allocated to maximize bandwidth utilization.

Multimedia streaming over wireless network faces the problem of low-bandwidth data transmission in an error prone environment. Furthermore, due to the frame dependency exploited by the video coding schemes, packet loss could degrade the perceptual quality of the media streams. In this paper, we design and implement a group-of-pictures (GOP) based video packet interleaving technique to reduce the impact of bursty packet losses. At the server side of our system, the packets of B or P frames are interleaved into the packets of a single I frame. At the client side, the de-interleaving method is developed based on the RTP timestamp of RTP header. We also apply the technique to the MPEG-4 video codec in the streaming system and integrate its error resilient tools - video packet, data partition, and RVLC, to increase the performance of GOP based video packet interleaving technique. From the experiment results, we show that our technique improves the perceptual quality better than the classic scheme does

We investigate the notion of per-user integrated location and service management in personal communication service (PCS) networks by which a per-user service proxy is created to serve as a gateway between the mobile user and all client-server applications engaged by the mobile user. The service proxy is always colocated with the mobile user's location database such that whenever the MU's location database moves during a location handoff, a service handoff also ensues to colocate the service proxy with the location database. This allows the proxy to know the location of the mobile user all the time to reduce the network communication cost for service delivery. We investigate four integrated location and service management schemes. Our results show that the centralized scheme performs the best when the mobile user's SMR (service to mobility ratio) is low and CMR (call to mobility ratio) is high, while the fully distributed scheme performs the best when both SMR and CMR are high. In all other conditions, the dynamic anchor scheme is the best except when the service context transfer cost is high, under which the static anchor scheme performs the best. Through analytical and simulation results, we demonstrate that different users with vastly different mobility and service patterns should adopt different integrated location and service management methods to optimize system performance. Further, the best integrated scheme always performs better than the best decoupled scheme that considers location and service managements separately and management schemes that do not use any service proxy.

The selection of a suitable transport format combination (TFC) according to the system load condition is one important issue of the radio resource management (RRM) in 3GPP W-CDMA systems. Different TFCs specify different ways of transmitting user data input from logical channels. It is observed that data transmission with a higher data rate will suffer a higher bit error rate (BER). This paper investigates the impact of BER on the selection of optimal TFC for transmitting the user data. Two filtering strategies are proposed to filter out infeasible TFCs so that the optimal TFC can be selected to achieve high performance. Moreover, an imbedded Markov chain is developed to evaluate the proposed strategies. From the simulation results, the feasibility and the effectiveness of the proposed strategies are demonstrated as well. We are suggesting that, for the design of an optimal TFC selection algorithm, the proposed TFC filtering strategy shall be taken into consideration.

Many wireless access systems have been developed recently to support users mobility and ubiquitous communication. Nevertheless, these systems always work independently and cannot simultaneously serve users properly. In this paper, we aim to integrate IPv6-based wireless access systems and propose a coordinated call admission control mechanism to utilize the total bandwidth of these systems to minimize the call blocking probabilities, especially the handoff call dropping probabilities. First, we propose an integrated hierarchical wireless architecture over IPv6-based networks to combine the wireless access systems including cellular systems (second-generation, General Packet Radio Service, or third-generation), IEEE 802.11 a/b/g WLAN, and Bluetooth. In the proposed architecture, mobile user can request a call with quality-of-service (QoS) requirements by any wireless network interfaces that can be accessed. When the proposed coordinated call admission control (CCAC) mechanism receives a request, it takes the QoS requirements of the incoming call and the available and reserved bandwidth of this wireless system into consideration to accept or reject this request. Besides, the mechanism can coordinate with other wireless systems dynamically to adjust the bandwidth reserved for handoff calls at each wireless system in this architecture so as to reduce the call blocking probabilities. Once the call is admitted, the mobile user is able to access heterogeneous wireless access networks via multiple interfaces simultaneously. Finally, we evaluate this system to show that the CCAC on the proposed architecture outperforms other mechanisms proposed before.

In this paper, a quantum routing mechanism is proposed to teleport a quantum state from one quantum device to another wirelessly even though these two devices do not share EPR pairs mutually. This results in the proposed quantum routing mechanism that can be used to construct the quantum wireless networks. In terms of time complexity, the proposed mechanism transports a quantum bit in time almost the same as the quantum teleportation does regardless of the number of hops between the source and destination. From this point of view, the quantum routing mechanism is close to optimal in data transmission time. In addition, in order to realize the wireless communication in the quantum domain, a hierarchical network architecture and its corresponding communication protocol are developed. Based on these network components, a scalable quantum wireless communication can be achieved.

Efficient resource allocation for requests is an important issue in the radio resource management. In the third generation mobile communication systems, Orthogonal Variable Spreading Factor (OVSF) codes are used for spreading codes. In this paper, we consider the OVSF code allocation problem for supporting real-time services in which the service time of a request can be obtained a priori. The impact of the remaining time factor on the OVSF code allocation in W-CDMA systems is investigated. Two time-based allocation schemes are proposed for code assignment and reassignment. This paper represents the first attempt on addressing the remaining time impact on the OVSF code allocation. Simulation results show that the time-based allocation schemes have better performance on reducing the blocking probability and the reassignment cost.

Analytical results for the Cdf of the failure recovery time for client-server applications in mobile wireless environments characterized by logging, and mobility handoff strategies for facilitating failure recovery are reported in the paper. The results can be applied to determine if a mobile application can satisfy its recoverability requirement upon a mobile host failure when operating under a set of parameter values characterizing the mobile application, the underlying client-server environment, and the logging & mobility handoff strategies adopted by the mobile application. Model parameters which affect the shape of the failure recovery time Cdf for two mobility handoff strategies, namely, Eager and Lazy, are identified, and their effects are analyzed, with numerical data and result interpretations given. A tradeoff analysis between the cost invested by these two mobility handoff strategies for maintaining the logging and checkpoint information before failure versus the return of investment in terms of improved failure recoverability is given, and the best checkpoint interval period that would yield the best return of investment for the eager mobility handoff strategy over the lazy strategy is identified.

Abstract The selection of transport format combination (TFC) is a fast part of the radio resource management because the bit rate can be changed very fast without any need for network layer signaling. However, the data transmitted by the TFC with higher data rate will suffer higher bit error rate (BER) because of the interference between the data that transmitted by the same TFC. This paper investigates this problem and proposes a BER filtering strategy to filter out some infeasible TFCs in a given transport format combination set (TFCS). Based on the BER filtering strategy, three kinds of the TFC selection methods are developed to dynamically assign transport blocks to logical channels on‐demand so as to utilize the finite bandwidth. According to a performance index that takes the priority into consideration, the feasibility and the effectiveness of the proposed TFC selection algorithms have also been demonstrated from the simulation results. Copyright © 2003 John Wiley & Sons, Ltd.

We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.

We consider the schedulability-oriented replication problem of a set of periodic real-time tasks where each task can be decomposed into several modules and intermodule communications. The objective is to find an allocation in which there exists a feasible schedule for the given task set. In this paper, we adopt a communication model where the replication of modules is not for the sake of fault tolerance but for increasing the degree of schedulability. To solve the problem, we develop a replication technique and embed the technique in a simulated annealing algorithm. Experimental results show that such replication may lead to a higher degree of schedulability and obtain a feasible solution.