12573730
A secure proxy signature protocol for agent-based M-commerce applications
We present a novel agent-based threshold proxy signcryption (ATPS) protocol, which enables an agent owner to securely delegate his signing capabilities to a mobile agent so that the mobile agent can sign documents on behalf of its owner. The protocol incorporates three novel contributions: a proxy key generation method, a threshold proxy signcryption scheme and a proxy signature verification method. The most notable feature of the protocol is that it enables a mobile agent to securely, efficiently and autonomously sign documents on the owner's behalf in a remote host with nonrepudiation and fairness assurance for both the owner and the remote host. The security of the proposed protocol is analyzed and its performance against other related work is evaluated.
13044783
A New Time-domain Detection Approach with Blind Separation Based on Neural Network
In this paper a new technique is proposed for time-domain detection in energy detection. The proposed scheme is based on a independent-component analysis (ICA): blind separation of unknown source signals. This method not only improves the nicety of time-domain detection for narrow band signal and the sinusoidal signal but also reduces the power of the whole detection system.
1660866
A General Fuzzified CMAC Controller with Eligibility
This paper presents an online neural network controller. Cerebellar Model Articulation Controller (CMAC) is suitable to online control due to its fast learning speed. By integrating the CMAC address scheme with fuzzy logic concept, a general fuzzified CMAC (GFAC) is proposed. Then by incorporating the concept of eligibility into the GFAC, a GFAC controller with eligibility is presented, named FACE. A learning algorithm for the FACE is derived to tune the model parameters. To achieve online control, an efficient implementation of the proposed FACE method is presented. As an example, the proposed FACE is applied to a ship steering control system. The simulation results show that the ship course can be properly controlled under the disturbances of wave, wind and current.
1884872
A mobility monitoring based advance reservation protocol
Future wireless cellular networks will be Internet Protocol (IP) based. Users of wireless devices in these networks will expect to run real-time applications that require guarantees of Quality of Service (QoS). Such a user will expect the same seamless QoS that he would receive if he were running real-time applications on a wired network. Achieving seamless QoS in a mobile environment implies that a reservation should be re-established at the new Base Station (BS) before hand-over occurs. However, making these advance reservations is wasteful of valuable bandwidth in the wireless network. This paper proposes a protocol, called the Mobility Monitoring Based Advance Reservation Protocol (M²BARP), which aims to reduce the bandwidth overhead of making advance reservations. The protocol makes use of information about a Mobile Node's (MN) mobility to make a single advance reservation when the MN is about to hand-over. Unlike previous work, M²BARP takes advantage of overlapping cells to help to provide a more seamless QoS by reducing the number of calls dropped at hand-over
42027884
New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network
Our problem formulation is as follows. Given a weighted disk graph Gwhere the weight of edge represents the transmission energy consumption, we wish to determine a dominating tree Tof Gsuch that the total weight of edges in Tis minimized. To the best of our knowledge, this problem have not been addressed in the literature. Solving the dominating tree problem can yield a routing backbone for broadcast protocols since: (1) each node does not have to construct their own broadcast tree, (2) utilize the virtual backbone to reduce the message overhead, and (3) the weight of backbone is minimized. 
 
Our contributions to this problem is multi-fold: First, the paper is the first to study this problem, prove the hardness of this problem and propose an approximation framework. Second, we present a heuristic to approximate the solution with low time complexity. Third, a distributed algorithm is provided for practical implementation. Finally, we verify the effectiveness of our proposal through simulation.
14935404
Levels of Authentication Assurance: an Investigation
The ES-LoA project, funded by the UK Joint Information Systems Committee (JISC) under its e- Infrastructure Security Programme, investigates current and future needs among UK research and education community for a more fine-grained authorisation scheme that would allow service providers to take into account of the levels of confidence in identifying a remote entity requesting for service access. Such a fine-grained authorisation scheme is attractive to service providers offering resources with varying levels of sensitivity and/or wishing to tailor their security protections based upon risk levels. Service providers may wish to restrict access to more sensitive resources only to those who have gone through a more stringent authentication process, or given the same remote entity, require the use of a stronger authentication token should the access request come from a more risky environment. In this way, the quality of an authentication instance, expressed as an authentication Level of Assurance (LoA), becomes one of the parameters used in access control decision making. This paper investigates the current worldwide efforts in defining LoA and identifies gaps in existing definitions when they are applied to a federated environment.
8279850
Analysis and Simulation Protocols Based on Slotted ALOHA for Plastic Optical Fiber Network
In this paper a novel multipriority reservation protocols for plastic optical fiber network is proposed. In conventional OCDMA system only allows finite units to transmit and access simultaneously according to the number of channels which be restricted by BER. To resolve this problem, a novel protocol based on slotted ALOHA is proposed in this paper. By using the reservation scheme and a distributed arbitration algorithm, channel collision and destination conflict can be avoided. The protocol can efficiently support the transmission of multimedia messages that require the different time-delay. The network throughput and average delay has been investigated by numerical analysis and simulation experiments. It is showed that the multipriority reservation protocol in this POF network is valid and efficient.
17853419
A succinct physical storage scheme for efficient evaluation of path queries in XML
Path expressions are ubiquitous in XML processing languages. Existing approaches evaluate a path expression by selecting nodes that satisfies the tag-name and value constraints and then joining them according to the structural constraints. We propose a novel approach, next-of-kin (NoK) pattern matching, to speed up the node-selection step, and to reduce the join size significantly in the second step. To efficiently perform NoK pattern matching, we also propose a succinct XML physical storage scheme that is adaptive to updates and streaming XML as well. Our performance results demonstrate that the proposed storage scheme and path evaluation algorithm is highly efficient and outperforms the other tested systems in most cases.
3386880
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much more complex than relational operators such as table scans and joins. In this paper, we propose a new approach, called COMET, to modeling the cost of XML operators; to our knowledge, COMET is the first method ever proposed for addressing the XML query costing problem. As in relational cost estimation, COMET exploits a set of system catalog statistics that summarizes the XML data; the set of "simple path" statistics that we propose is new, and is well suited to the XML setting. Unlike the traditional approach, COMET uses a new statistical learning technique called "transform regression" instead of detailed analytical models to predict the overall cost. Besides rendering the cost estimation problem tractable for XML queries, COMET has the further advantage of enabling the query optimizer to be self-tuning, automatically adapting to changes over time in the query workload and in the system environment. We demonstrate COMET's feasibility by developing a cost model for the recently proposed XNAV navigational operator. Empirical studies with synthetic, benchmark, and real-world data sets show that COMET can quickly obtain accurate cost estimates for a variety of XML queries and data sets.
13356041
Research on Distributed Data Mining Technology Based on Grid
Distributed data mining (DDM) techniques have become necessary for large and multi-scenario datasets requiring resources, which are heterogeneous and distributed. In this paper, we focused on distributed data mining based in grid. We have discussed and analyzed a new framework based on grid environments to execute new distributed data mining techniques on very large and distributed heterogeneous datasets. The architecture and motivation for the design have been presented. We pointed out that distributed data mining technology can offer a better solution since they are designed to work in a distributed environment by paying careful attention to the computing and communication resources.
16464983
Self-Protection Model Based on Intelligent Agent
In this paper, we propose a self-protection model based on distributed intelligent agents. The major feather of this model is that autonomic agents can manage themselves given high-level objectives from administers. System can detect attacks and compromise, and recovering from security incidents without human intervention. We describe the model and the existing prototype, as well as some design and implementation experiences. Meanwhile several topics including structure of agent, relationship among agents and the establishment of a trustworthy system are discussed. We are implementing this model on the Eclipse Platform using Java. According to the experiments, this model provides significant advantages in scalability, flexibility, fault tolerance, and resistance to compromise.