Frontiers of High Performance Computing and Networking ISPA 2007 Workshops

In a near future, our use of computer technology will increasingly depend on Wireless Sensor Network (WSN) system consists of plethora of nodes. This WSN’s survivability will depend most critically on base station that attaches WSN to outside network including Internet. The need for survivability is most pressing for mission critical systems. To increase the survivability, we show up the detection model with proactive rejuvenation and reactive recovery through a Continuous Time Markov Chain (CTMC) process, where it is designed to provide continued useful service in face of attacks, failures, or accidents and to prevent the intruders’ attempts in their tracks. Afterwards, we focus on downtime analysis. This is a general model which can be applicable to any nodes in a WSN environment. But this model can be more critically used for base station since base station is almost a single point of failure in a WSN.

Sensor node repairing is important for providing continuous sensing services. However, sometimes sensor nodes fail due to environmental interference such as attacks. Automatically replacing faulty sensor nodes in a sensor network may not be the course of action if the sensor network is under attack, because the attack will most likely disable the new nodes as well. In the extent of our knowledge, existing approaches tried to replace failed nodes with functional ones without examining whether the nodes failed due to some attacks. In order to study the efficient strategies for monitoring and repairing network behavior, we propose a framework for sensor nodes replacement that uses the mining technique in monitoring and repairing sensor nodes in wireless sensor network.

Distributed wireless sensor network in various environment have characteristic that is surveillance of environment-element and offering usefully military information but there is shortcoming that have some secure risks. Therefore secure service must be required for this sensor network safety. More safe and effective techniques of node administration are required for safe communication between each node. This paper proposes effective cluster-header and clustering techniques in suitable administration techniques of group-key on sensor network.

In this paper, first each node transmit residual electric power and authentication message to BS(Base-Station). BS reflects “

Validity Authentication Rate

” and residual electric power. And it selects node that is more than these regularity values by cluster header. After BS broadcasts information about cluster header in safety and it transmits making a list of information about cluster member node to cluster header. Also, Every rounds it reflects and accumulates “

Validity Authentication Rate

” of former round. Finally, BS can select more secure cluster header.

The proliferation of sensor networks provides a promising solution for a variety of ubiquitous data services, but it challenges the data security and privacy because of its unfavorable deployment nature of being prone to physical attacks with circumscribed source available. Considering the data redundancy, energy constraint, and security requirement, this paper proposed a secure data aggregation scheme which supports end-to-end encryption using privacy homomorphism as well as hop-by-hop verification using ECC based MAC in cluster based sensor networks. The analytic comparing results show that our scheme has higher resistance against eavesdropping and fabricating attacks at a little additional computational cost with higher connectivity.

Mobile Sensor Network (MSN) imposes challenges to apply security schemes for mobility and free joining and leaving in the network. Key pre-distribution scheme used for Wireless Sensor Network (WSN) is a potential candidate applicable to MSN as it is a brach of WSN with some additional features. In this paper, we evaluate the feasibilty of a key predistribution scheme named Randomized Grid Based (RGB) scheme proposed for WSN in the context of MSN. We propose a key revocation scheme applying redundancy on RGB scheme to ensure best connectivity and resiliency. The analysis proves the effectiveness of the scheme in terms of connectivity and resiliency.

When a mobile network moves from one place to another, it changes the reachability of the mobile network in the Internet topology. Network Mobility (NEMO) is concerned with the management of this movement of the mobile network. It is necessary to exchange binding update messages frequently for seamless mobility. However, it incurs both the increase of network overhead and poor usage of mobile router energy efficiency. Our main concerns focus on binding update message management to support efficient network mobility. Thus, this paper proposes an adaptive binding lifetime according to the duration for which mobile router resides in each network under the condition that the mobility type of the mobile router is known in advance. By introducing this algorithm, the number of binding update messages for refreshing the binding could be reduced compared to the default behavior of NEMO, which is defined in RFC3963. Simulation results are shown to prove the effectiveness of the proposed schemes.

Mobile networking, mobile systems and applications and ubiquitous computing infrastructures are of strongly growing importance in the IT sector in general, and for the parallel and distributed computing community. Particularly, when an signed(authenticated) information of multi-node is aggregated in ubiquitous sensor networks, the number of the signing information is very small. Thus, signature scheme which signs information has strong unforgeability. In 2005 Yu and Chen proposed threshold signature scheme [12]. Their scheme has a high efficiency. But, their scheme is not suitable for ubiquitous sensor networks because their scheme has no strong unforgeability. In this paper, we modify their scheme so that modified scheme is suitable for ubiquitous sensor networks. Also, our scheme has a good efficiency, and a smaller secret key than other cryptosystems with a similar security level.

This paper proposes the QLP-LBS (Quantization and Location Prediction-based LBS). This QLP-LBS system is based on quantization theory and uses statistical location prediction mechanism. This LBS applies the quantum range of quantization theory to each mobile user and reduces location update costs by comparing results between moving distance of mobile user and quantum range. But, this LBS system generates location errors from the quantization. In order to solve this problem, we apply statistical location prediction mechanism to LBS system. This prediction mechanism predicts location of mobile user using its historical path and decrease location errors by quantization and makes more reliable LBS system. For performance evaluation, this paper measures location accuracy and reduction rate of location update costs with various quantum ranges. This experiments show that QLP-LBS effectively reduces location update costs of LBS system. Also, QLP-LBS solves problem of location errors using location prediction mechanism which is problem of general quantized system. Therefore, QLP-LBS is solution for reduction of location update costs and has reliable location accuracy.

This paper presents a 802.11-based positioning system developed and demonstrated in the Taipei Children’s Museum of Transportation and Communication. Our positioning system partitions the service area into several regions and signal strength information which contains a sequence of access point IDs with the average power strength measured in the region will be collect. Our positioning system locates mobile users via collecting power strengths of the mobile users and then applies our algorithm to determine the regions in which the mobile users stay. A location database is applied to maintain the signal strength information. The experimental results validate that the location information provided by our positioning system assures high correctness of region classification.

Nowadays, medical centers are working on setting a safe medicating environment by using information technology. This study tried to improve patients’ safety environment, communications among medical workers and patients, medicating quality, and medical process efficiency through a wireless handheld RFID patient safety enhancement system for medical personnel. The proposed portable patient information integration system combines Radio Frequency Identification (RFID) technology, Wireless Network, Personal Digital Assistant (PDA) and Front-Monitoring System. Through the help of the proposed system, the medical workers can identify patients by non contact identification and get medical record immediately. Meanwhile the proposed system can record the history of the interaction between medical personnel and patients. It can also send alarm to the corresponding medical workers when reporting a high risk testing result and give medicine safety suggestion. The proposed system can improve the correctness and instantaneousness of patients’ medical information and hence provide a safe environment for patients, and the Wan Fang Hospital is now verifying the performance of this system for improving the patients’safety.

VoIP (Voice-over-IP) technology has come of age and is quickly gaining momentum on Broadband networks. VoIP packetizes phone calls through the same routes used by network and Internet traffic and is consequently prone to the same cyber threats that plague data networks today. These include denial - of service attacks, worms, viruses, and hacker exploitation. In addition to these traditional network security and availability concerns, there are also a plethora of new VoIP protocols that have yet to undergo detailed security analysis and scrutiny. The new challenges of VoIP security are session hijacking, abnormal termination, call flooding and spam. History has shown that many other advances and trends in information technology typically outpace the corresponding realistic security requirements that are often tackled only after these technologies have been widely adopted and deployed. In this paper, we describe the technology protects networks against the known VoIP threats, and propose security mechanism for VoIP session management.

We propose an effective Local Repair scheme for AODV in mobile ad-hoc network environment. Even though the existing Local Repair scheme for AODV routing protocol can recover the disconnected path in some ways, however, they can not utilize the pre-connected routing nodes when we handle the nodes in Ad-hoc environment. In order to utilize the pre-connected routing nodes in recovering the path more effectively, we use a designated candidate nodes and changed Hello messages. The candidate nodes are used to recover the disconnected path using the pre-connected routing information. The Hello messages provides multipath for candidate nodes. This scheme produces better results with less control packets with faster path recovery time.

In the past, the main purpose of telephony network is to transfer the voice. But Since 1990, there have been many changes about it. First of all, wireless mobile communication network has enjoyed tremendous growth at the popularity. And the purpose of communication has been changed to data communication from voice one. Furthermore, people have started to require both data communication and voice communication. Because of these issues, VoIP (Voice over IP) is getting to be a matter of concern. And According to development of network and computer devices, people want to communicate by not only voice telecommunication but also video telecommunication. However because it uses public IP network, security issues are getting to be an important thing in VoIP. Actually, there are many solutions to protect data from attackers in VoIP System. But to serve video transmission needs more special care. To display real time video streaming on telephones need more bandwidth and computing power. This is a handicap for video streaming on the mobile device. Therefore we concentrate on the solution how to protect the video data from attackers with well quality of service. This is discussed in this paper.

Recently, wireless sensor networks have been proposed for assisted living and residential monitoring. In such networks, physiological sensors are used to monitor vital signs e.g. heartbeats, pulse rates, oxygen saturation of senior citizens. Sensor data is sent periodically via wireless links to a personal computer that analyzes the data. In this paper, we propose an anomaly detection scheme based on time series analysis that will allow the computer to determine whether a stream of real-time sensor data contains any abnormal heartbeats. If anomaly exists, that time series segment will be transmitted via the network to a physician so that he/she can further diagnose the problem and take appropriate actions. When tested against the heartbeat data readings stored at the MIT database, our ECG anomaly scheme is shown to have better performance than another scheme that has been recently proposed. Our scheme enjoys an accuracy rate that varies from 70-90% while the other scheme has an accuracy that varies from 40-70%.

Web news classification is an unsupervised learning task, which is often accomplished by clustering methods. In traditional works, documents are first represented using the vector space model. Each vector generally consists of the keywords or phrases important to the document. Then vectors are clustered together according to some (dis)similarity measure. Such methods often take no or little semantic information into account. In this paper, we present a semantics-based event-driven approach. Event is represented by 3-tuple and document is associated with set of candidate events. These event sets are classified according to semantic dissimilarity. The preliminary experiment on Chinese web news classification shows that the proposed approach is promising.

The study has proposed a method for implementing cyber shopping services within smart home environment to allow residents convenient shopping at home by using interoperable sensor technology. The proposed model uses RFID tag, USN sensor and TinyOS for transmitting information to mobile interfaces. Residents and products information get collected and categorized under proposed categorization module. Service providers supporting the cyber shopping are defined as brokers and more effective cyber shopping environment are serviced by sharing such information as well.

There are a variety of AV devices and multimedia content in the ubiquitous home and the sharing of content needs to have high quality of transfer by using optimized transport protocol for the each content. This paper presents the design and implementation of our proposed scheme that is based on UPnP AV framework which can support various transport protocol transparently. We validated and evaluated our proposed scheme and experimental results show that it can stream content effectively.

A concept hierarchy is a kind of general form of knowledge representations. Since concept description is generally vague for human knowledge, crisp description for a concept usually cannot represent human knowledge completely and practically. In this paper, we discuss fuzzy characteristics of concept description and relationship. An agglomerative clustering scheme is proposed to learn hierarchical fuzzy concepts from databases automatically. We also propose the architecture of concept measurement and develop two node-labeling methods for measuring the effectiveness of fuzzy concept. Experimental results show that the proposed clustering method demonstrates the capability of accurate conceptualization in comparison with previous researches.

This paper present the treatment of prepositions and conjunctions in natural language interfaces to databases (NLIDB) that allows better translation of queries expressed in natural language into formal languages. Prepositions and conjunctions weren’t sufficiently studied for their usage in NLIDBs, because most of the NLIDBs just look for keywords in the sentences and focus their analysis on nouns and verbs getting rid of auxiliary words in the query. This paper shows that prepositions and conjunctions can be represented as operations using formal set theory. Additionally, since prepositions and conjunctions keep their meaning in any context, their treatment is domain independent. In our experiments we used Spanish language. We validate our approach using two databases; Northwind and Pubs of SQL Server, with a corpus of 198 different queries for the first one and 70 queries for the second one. The 84% of queries were translated correctly for the database Northwind and 80% for Pubs.

This paper presents a smart home system prototype which employs an indoor positioning system called the Best Beacon Match (BBM) positioning method to intelligently trigger the appropriately services for the home members. To overcome the ninja problem in the BBM method, the signal filtering, adjustment and smooth procedures are proposed. We employ the Zigbee module to implement the prototypes of the components for the BBM positioning method, and the prototypes were pass the ZigBee Compliant Platform (ZCP) certification test. The proposed system prototype which intelligently controls the air condition and light system for smart home applications is also verifying in our demo room and in the smart house in National Taiwan University.

The Knapsack problem is an NP-Complete problem. Unbounded Knapsack problems are more complex and harder to solve than the general Knapsack problem. In this paper, we apply the genetic algorithm to solve the unbounded Knapsack problem. We use an elitism strategy to overcome the defect of the slow convergence rate of the general genetic algorithm. The elitism strategy retains good chromosomes and ensures that they are not eliminated through the mechanism of crossover and mutation, while ensuring that the features of the offspring chromosomes are at least as good as their parents. The system automatically adapts the number of the initial population of chromosomes and the number of runs of the genetic algorithm. In addition, we use the strategy of greedy method to auto adaptive the sequence of chromosomes to enhance the effect of executing. Experimental results showed that our method could fast find the best solution of the problem.

This article describes an unsupervised strategy to acquire lexico-semantic frames (LSFs) of verbs from sentential parsed corpora (in syntactic level). LSF is a crucial linguistic resource presents a set of semantic elements for exhibiting a meaning of lexeme. The problems of acquiring LSFs consist of verb senses ambiguity, diversity of linguistic usages, and lack of completed elements in a sentence. We propose an specific clustering and combining technique to acquire frame for each verb sense and specify constraints to each frame’s slots. Our proposed clustering technique is based on the Minimum Description Length (MDL) principle and using information encoded in features of element instead of its frequency from the corpora.

The intelligent home network environment is thing which invisible computer that is not shown linked mutually through network so that user may use computer always is been pervasive. As home network service is popularized, the interest in home network security is going up. Many people interested in home network security usually consider user authentication and authorization. But the consideration about home device authentication almost doesn’t exist. In this paper, we describes home device authentication which is the basic and essential element in the home network security. We proposed S/Key based authentication, scheme for secure remote access in smart home networks. And our device authentication concept can offer home network service users convenience and security.

The main steps for designing an automatic document classification system include feature extraction and classification. In this paper a method to improve feature extraction is proposed. In this method, genetic algorithm (GA) was applied to determine the threshold values of four criteria for extracting the representative keywords for each class. The purpose of these four threshold values is to extract as few representative keywords as possible. This keyword extraction method was combined with two classification algorithms, vector space model (VSM) and support vector machine (SVM), for examining the performance of the proposed classification system under various extracting conditions.

This paper discusses security considerations of a ubiquitous computing environment and presents the context-aware security management system. The system supports the management and enforcement of context-aware security policies, and manages the context of users and resources in the ubiquitous computing environment. The system provides partial credential based user authentication and context aware access control service. This paper presents a calculation algorithm of an authentication credential value using fuzzy if-then rule for partial credential based user authentication.

There are many researches related to privacy protection in RFID system. Among them, Ohkubo’s hash-based scheme is provably secure and it can protect user’s privacy, prevent location tracking, and guarantee forward security completely. Unfortunately, one-way hash functions, which play important roles in Ohkubo’s schem, can’t be implemented into the current RFID tag hardware. So we propose a new secure protocol for RFID privacy protection, and it is a modified version of Ohkubo’s scheme using Feldhofer’s AES module for RFID tag. Our new scheme has almost all of advantages of Ohkubo’s scheme and moreover it can be embedded into RFID tag hardware easily.

Due to an increased awareness of potential ontology applications in industry, public administration and academia, a growing number of ontologies are created by different organizations and individuals. Although these ontologies are developed for various application purposes and areas, they often contain overlapping information. In this context, it is necessary to find ways to integrate various ontologies and enable use of multiple ontologies. In this paper, we extend previous work on ontology matching using polygon-based similarity aggregation. The main ideas we contribute to the research field are (1) an improved approach to aggregate the results of distance calculations between concepts in different ontologies by creating polygons for each ontology and (2) to compare the area of these polygons for deciding on similarity.

VoiceXML is new markup language which is designed for web resource navigation via voice based on XML. An application using VoiceXML is classified into computer-directed and mixed-initiative form dialog structure. Such dialog structures can’t construct services which provide free navigation of web resource by user because a scenario is decided by application developer. In this paper, we propose VoiceXML application structure using user-controlled form dialog system which decides a service scenario according to user’s intention. The proposed application automatically detects recognition candidates from requested information by user, and then system uses recognition candidate as voice-anchor. Also, system connects each voice-anchor with new voice-node. An example of proposed system, we implement news service with IT term dictionary, and we confirm detection and registration of voice-anchor and make an estimate of hit rate about measurement of a successive offer from information according to user’s intention and response speed. As the experiment result, we confirmed possibility which is more freely navigation of web resource than existing VoiceXML form dialog systems.

We have designed and deployed the New York State Grid (NYS Grid), which consists of an integrated computational and data grid. NYS Grid is used in a ubiquitous fashion, where the users have virtual access to their data sets and applications, allowing the user to perform tasks without knowledge of the physical hosts for data storage or compute systems. A wide variety of applications have been ported to NYS Grid, including critical programs in a variety of fields that are ideally suited to a multiprocessor computing environment with distributed datasets. Two applications from structural biology are presented as exemplars, including our Grid portal version of the

SnB

program, which has been run simultaneously on all computational resources on NYS Grid, as well as on the majority of the tens of thousands of processors available through the Open Science Grid. This paper also discusses previous grids that we developed, including the Buffalo-based (ACDC) experimental grid and the Western New York Grid, as well as a wide variety of advances that we have made in terms of grid monitoring, predictive scheduling, grid portal design, and grid-enabling application templates, to name a few.

Scaling up to large multimedia databases with high dimensional metadata descriptions while providing fast content-based retrieval (CBR) is getting increasingly important for many applications. To address this objective, we strive to exploit the popular parallel shared-nothing architecture. In this context, a major problem is data allocation on the different nodes in order to yield efficient parallel content-based retrieval. In this paper, assuming a clustering process and based on a complexity analysis of CBR, we propose a data allocation method with an optimal number of clusters and nodes. We validated our method through experiments with different high dimensional synthetic databases and implemented a query processing algorithm for full k nearest neighbors.

It is important to develop the multicasting technology for video on demand (VoD) services in Internet Protocol Television (IPTV) system with multiple channels. In this paper, we proposed an architecture combining multicast and unicast batching channels without scheduled multicasting streams. To provide an acceptable service rate and waiting latency, the 80% multicast channel rate under the experimental scenario is believed to be the optimized allocation between unicast and multicast VoD channels. Depending on the time zone of the arrival and the popularity of the requested videos, the batching scheme with five different time zones was designed to increase the efficient usage of the transmission bandwidth, especially for the request on popular videos, and to reduce the unnecessary waiting latency, especially at cold time zone.

Stream data are often transmitted over a distributed network, but in many cases, are too voluminous to be collected in a central location. Instead, we must perform distributed computations, guaranteeing high quality results in real-time even as new data arrive. In this paper, firstly, we formalize the problem of continuous outlier detection over distributed evolving data streams. Then, two novel outlier measures and algorithms are proposed which can identify outliers in a single pass. Furthermore, our experiments with synthetic and real data show that the proposed methods are both efficient and effective compared with existing outlier detection algorithms.

There has been significant effort to build high throughput computing systems out of many distributed multimedia servers. These systems should accommodate a larger number of servers and should handle the ever-growing user demands. Recently, Grid computing has become one of the promising technologies that can deliver such a system. Among the many problems encountered in building Grid computing systems, resource discovery, overhead reduction, workload balancing and fault tolerance are the most challenging. In this paper, we present a resource discovery and allocation mechanism (RDAM) in a computational Grid system.

A great amount of natural and artificial systems can be represented as a complex network, where the entities of the system are related of non-trivial form. Thus, the network topology is the pattern of the interactions between entities. The characterization of complex networks allows analyzing, classifying and modeling the topology of complex networks. The degree distribution is a characterization function used in the analysis of complex networks. In this work a comparative study of the degree distribution for three different instances of the Internet was carried out, with information about the interconnection of domains. The Internet has a degree distribution power-law, that is, it has a great amount of weakly connected domains while a few domains have a great number of connections. Our results show that Internet has a dynamic growing maintaining the degree distribution power-law through the time, independently of the growth in the number of domains and its connections.

In recent years, grid and mesh structures have received increasing attention. The mesh based multicomputers are the future of processing. As we slowly reach natural limits of semi-conductor spatial density supercomputer design depends more heavily on parallel and distributed processing. This paper concerns mesh allocation algorithms effectiveness assessment and the experimentation system that was developed to provide testing environment. Most focus was put on creation of such a system that would represent the highest scope of real supercomputers inner working routines and at the same time supply a way to input measured processing data as a base of allocation algorithm load computation. In investigations reported different allocation algorithms, including own WSBA, and various task parameters are considered.

In this paper, we present a method for describing the syntax and semantics of Viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components. We define the syntax of Viewcharts as attributed graphs and, based on this graph, describe dynamic semantics of Viewcharts by Object Mapping Automata. This approach covers many important constructs of Viewcharts, including hierarchy of views, ownership of elements, scope, and composition of Views in

separate

,

or

and

and

ways. It also covers completion and interlevel transitions without violating the independence of views. Viewcharts was originally based on Statecharts; in this paper we also change the basis of Viewcharts to an extended version of Finite State Machine(EFSM).

In this paper we will present a formal technique for describing complex systems consisting a number of interacting components. To meet this, we will consider a mathematical model for a single component and specify abstract communication protocols of components by using a lightweight formal language

Interface Automata

. To model hierarchal design for hierarchal systems, beside the basic component’s model, we will present other components, called

Nodes

. A

Node

consists of a set of components interacting under the supervision of a

Controller

. A

Controller

is a set of interface automata that specify interaction protocol of components inside a

Node

. In addition, we will prove that each

Node

is equal to a component. Therefore, a

Node

can be composed of components which are in turn

Nods

. To address state space explosion problem in system verification, a

Node

will not be directly analyzed, Instead, we will analyze the

Controller

and prove its conformance.

Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path queries. In this paper we present a message-efficient and truly distributed algorithm for computing the answer to regular path queries in a multi-source semistructured database setting. Our algorithm is general as it works for the larger class of weighted regular path queries on weighted (as well) semistructured databases.

The paper concerns a special architecture of dynamic shared memory processor (SMP) clusters organized at program run-time. In this architecture, designed for implementation in System on Chip technology, a new mechanism of the communication on the fly is provided. It is a combination of dynamic processor switching between SMP clusters and parallel data reads on the fly. This mechanism enables direct communication between processor data caches and eliminates many data transactions on memory busses. The paper presents the principles of the new architecture and evaluates its efficiency for execution of matrix multiplication with recursive matrix decomposition into quarters. The evaluation is done by simulation experiments with symbolic execution of parallel program graphs with different parallelization grain.

In order to solve the key technologies of urban traffic in China, the intelligent means and approach, combined artificial intelligent with tradition control ones, are adopted in the paper. Some hypotheses are elicited on the basis of the characteristics of Chinese urban traffic control system structure and function requirement, a kind of frame structure of urban traffic intelligent control system is stated based on multi-agents cooperation. A kind of better design ways and means for urban traffic real-time, rational and reasonable control system is established according to the frame structure, the system design of urban cross control and area control based on multi-agents is implemented. In this way, successful realization of goal for urban traffic intelligent control is insured so as to increase the capacity of urban road network and to improve our urban traffic control and management modes. Therefore urban surroundings quality will be enhanced. And the comfortable and delightful traffic surroundings will be built.

Register file design is very important in high performance processor design. Register Stack and Register Rotation are effective ways to improve performance. Compiler optimizations are often driven by specific assumptions about the underlying architecture and implementation of the target machine. SMT(simultaneous multithreading) processors execute instructions from different threads in the same cycle, which has the unique ability to exploit ILP(instruction-level parallelism) and TLP(thread-level parallelism) simultaneously. EPIC(explicitly parallel instruction computing) emphasizes importance of the synergy between compiler and hardware. In this paper, we present our efforts to design and implement register file management mechanism on a parallel environment, which includes an optimizing, portable parallel compiler OpenUH and SMT architecture EDSMT based on IA-64. Meanwhile, its compile optimization is also considered to improve the performance.

Proteomics is about the study of the proteins expressed in an organism or a cell. Computational Proteomics regards the computational methods, algorithms, databases, and methodologies used to manage, analyze and interpret the data produced in proteomics experiments. The broad application of proteomics and the increasing resolution offered by technological platforms, especially in Mass Spectrometry-based high-throughput proteomics, make the analysis of proteomics experiments difficult and error prone without efficient algorithms and easy-to-use tools. The paper discusses the requirements of Mass Spectrometry-based Computational Proteomics applications and surveys important services, standards, and technologies useful to build modular, scalable and reusable applications in this field.

Bioinformatics applications are naturally distributed, due to distribution of involved data sets, experimental data and biological databases. They require high computing power, owing to the large size of data sets and the complexity of basic computations, may access heterogeneous data, where heterogeneity is in data format, access policy, distribution, etc., and require a secure infrastructure, because they could access private data owned by different organizations. The Problem Solving Environment (PSE) is an approach and a technology that can fulfil such bioinformatics requirements. The PSE can be used for the definition and composition of complex applications, hiding programming and configuration details to the user that can concentrate only on the specific problem. Moreover, Grids can be used for building geographically distributed collaborative problem solving environments and Grid aware PSEs can search and use dispersed high performance computing, networking, and data resources. In this work, the PSE solution has been chosen as the integration platform of bioinformatics tools and data sources. In particular an experiment of multiple sequence alignment on large scale, supported by the LIBI PSE, is presented.

Grid and distributed public computing schemes has become an essential tool for many scientific fields including bioinformatics, computational biology and systems biology. The adoption of these technologies has given rise to a wide range of projects and contributions that provide various ways of setting up these environments and exploiting their potential resources and services for different domains of applications. This paper aims to provide a distilled overview of some of the major projects, technologies and resources employed in the area of structural proteomics. The major emphasis would be to briefly comment on various approaches related to the gridification and parallelization of some flagship legacy applications, tools and data resources related to key structural proteomics problems such as protein structure prediction, folding and comparison. The comments are based on theoretical analysis of some interesting parameters such as performance gain after gridification, user level interaction environments, workload distribution and the choice of deployment infrastructure and technologies. The study of these parameters would provide a basis for some motivating justification needed for further research and development in this domain.

The paper describes XML-based information structures (meta-models) and software services both developed to search, collect and aggregate data of drug clinical usage and represent the information to users in a comprehensible way. These tools provide biomedical professionals with more complete, detailed and actual information on possible adverse events related to drug administration and thus support the evidence-based pharmacology and more personalized healthcare. Grid provides implementation of these tools on base of multi-agent system technology enabling information processing in loosely coupled data space.

In this paper, we investigate the fault tolerance of connectivity probability for CDMA-based wireless sensor networks with variations of nodes deployment. The variations of deployment are modeled by 2D Gaussian distribution with zero-mean for the triangle, grid and hexagon topologies. Thus, the

k

-connectivity performance is studied through the outage probability of CDMA signal links. We evaluate the connectivity performance with

SIR

0,3 − 

con

, the minimum requirement of SIR,

SIR

0

for the 3-connectivity, when the nodes suffer a failure rate

P

f

. Simulation results show that the hexagonal and grid topologies suffer a degradation of -2.4 and -0.5 dB, respectively, when the failure rate

P

f

equals 0.1. However, the triangular topology shows robust fault tolerance with the failure rate

P

f

below 0.5 and moderate variations of deployment.

This paper proposes a fixed clustering algorithm (FCA) to improve energy efficiency for wireless sensor networks (WSNs). In order to reduce the consuming energy of sending data at each sensor, the proposed algorithm uniformly divides the sensing area into clusters where the cluster head is deployed in the center of the cluster area. Simulation results show that the proposed algorithm definitely reduces the energy consumption of the sensors and extends the lifetime of the networks nearly more 80% compared to the random clustering (RC).

In wireless sensor networks, unbalanced energy dissipation is one of the major causes for hot spots. The many-to-one communication pattern used by sensor nodes in most of the data gathering applications leads to such unbalanced energy consumption. Cluster-based protocols attempt to solve this problem by load balancing within the cluster and rotating the job of cluster head every few rounds. However, the energy consumption still remains unbalanced because the cluster formation process does not include all the parameters required for balanced energy consumption in the network. Therefore, an optimized cluster formation process which considers the overall network metrics for energy consumption is highly desirable in solving such problems. We introduce an approach to determine the energy dissipation behavior in the sensor deployment area and present results and analysis from our novel multi-criterion cluster formation technique. Simulation results and statistical analysis verify that our technique achieves balanced energy dissipation in the network.

In Mobile ad hoc networks (MANETs), most of current research works in key management can efficiently handle only limited number of nodes. When the number of nodes is gradually increasing, they will become either more inefficient or more insecure. Therefore, how to develop key management schemes for efficiently and securely satisfying the dynamic property of MANETs is a crucial issue. In this paper, by combining the efficient elliptic curve cryptosystem, secure self-certified public key cryptosystem and secure filter technique, we construct dynamic group key management schemes based on hierarchical clustering in MANETs. Specifically, the proposed schemes will effectively renew the group key of intra-cluster or inter-cluster to achieve the forward secrecy and backward secrecy when a node/cluster-head joins or leaves a cluster/cross-cluster. In such a new way, we affirm that the proposed group key management schemes can be very useful for securing practical applications in MANETs.

In this paper we consider a problem of privacy preserving surveillance and monitoring in sensor networks. We propose a framework and a solution of the problem based on multi-party computations. Our approach use pattern matching on data streams from sensors in order to monitor and detect events of interest.

We study a privacy preserving pattern matching problem where patterns are defined as sequences of constraints on input data items. We describe a new privacy preserving pattern matching algorithm over an infinite alphabet

A

where a pattern

P

is given as a sequence

$\{p_{i_1},p_{i_2},...,p_{i_n}\}$

of predicates

$p_{i_j}$

defined on

A

. The algorithm addresses the following problem: given a pattern

P

and an input sequence

t

, find privately all positions in

t

where

P

matches

t

. The privacy preserving in the context of this paper means that sensor measurements will be evaluated as predicates

p

i

(

e

j

) privately, that is, sensors will not need to disclose the measurement values to the monitor.

Wireless sensor networks which are envisioned to consist of many simple processing, storage, sensing, and communication capabilities are believed to open the doors to a plethora of new applications. Efficient robust data aggregation is a key feature in information processing in wireless sensor environments, especially in the presence of faulty sensor nodes which arise due to harsh environments or manufacturing reasons. These conditions highly affect the quality of gathering data in different locations and times. In this paper we propose a distributed localized method for detecting regions that are susceptible to message loss above a given threshold, and then based on this method we suggest an algorithm for clustering nodes in that region which proportionally adapts based on message loss. Simulation experiments confirm the validity of the proposed algorithm with a high degree of accuracy.

This paper presents a new method for

optimal routing and transmitting data

in networks with multicast services environment. End to end delay is minimized by the new approach across channels. We entitle this method as

Optimal Multicasting Multichannel Routing Algorithm (OMMRA)

. The new method transfers data from a sender node to the group of receivers using multichannel paths in minimal time. The new method is extention of an available unicast method. Computer examples will show that the new method is more efficient than unicast method.

In mobile ad hoc networks (MANETs), since all of the nodes communicate each other based on the routing protocol, and an attacker could manipulate a lower-level protocol to interrupt a security mechanism in a higher-level one, securing routing protocol is an important issue in MANETs. Recently, there exist several proposals that attempt to develop a secure routing protocol for MANETs. However, those methods are not actually secure against a variety of attacks, including the Sybil, wormhole, black hole, replay, blackmail, denial of service, and routing table poisoning attacks. Therefore, in this paper we design a secure hierarchical-clustering-based routing scheme using the self-certified public key cryptosystem, elliptic curve cryptosystem, pre-hashing, and nonce techniques against such attacks. Finally, we also analyze the advantages of our proposed scheme in terms of security and superiority.

Routing in Ad-hoc Wireless Sensor Network (AWSN) has been addressed by several research works which can basically be divided into flat-based, hierarchical-based, and location-based routing depending on the network structure. Despite advances in these interesting works, straightforward messages routing is still extremely difficult. We still seek a flexible approach that provides sensors with enough autonomy and processing capabilities to determine secure, lower-cost, and reliable routes while preventing the routing of unused data that burdens sensors. To meet this goal, we propose a requirement-driven approach that uses geographic-based routing to focus sensing efforts in areas of interest, plus semantic-based routing to determine and use relevant sensors semantically connected with respect to current monitoring requirements. By moving most intensive processing into a virtual network running in parallel to the physical AWSN, our approach uses software agents to reduce network resource consumption and find enhanced routing pathways.