Multichannel direct sequence spectrum signaling using code phase shift keying

In this paper, we have designed and realized multichannel direct sequence spread spectrum (DSSS) system using code phase shift keying (CPSK). In the transmitter, taking each bit from each channel, data word is made as a symbol for selecting PN sequence, which is modulated with frequency of 100 MHz as DSSS signals. At the receiver, the correlator, integrator and decoder are used for separation of the signal of respective channel after demodulation. Oscilloscope traces show that the transmitted signals are matched with the simulated signals at the receiver. The bit error rate (BER) variation with jamming signal is estimated by our proposed simulation model, matching well with experimental values of BER measured by BER meter.     

Potential of near-field microwave imaging in breast cancer detection utilizing tapered rectangular waveguide probes

Microwave imaging for medical applications has been of interest for many years. A novel near-field microwave non-invasive testing and evaluation (NIT&E) technique utilizing tapered rectangular waveguide probes is presented for breast cancer detection. Near-field microwave NIT&E techniques can be a successful candidate for the detection of breast cancer because of their potential in dealing with materials of low conductivity (i.e. lossy dielectrics like the breast tissue). The physical basis for breast tumor detection with microwave imaging is the contrast in dielectric properties of normal and malignant breast tissues. A method adopting Fourier transform matching (FTM) technique and utilizing the reflection coefficient at the aperture of a tapered rectangular waveguide sensor radiating into a breast is described resulting in microwave images that indicate the presence of a tumor. These images demonstrate the feasibility of detecting breast tumors using this approach.     

Dynamic SLAs management in service oriented environments

The increasing adoption of service oriented architectures across different administrative domains, forces service providers to use effective mechanisms and strategies of resource management in order for them to be able to guarantee the quality levels their customers demands during service provisioning. Service level agreements (SLA) are the most common mechanism used to establish agreements on the quality of a service (QoS) between a service provider and a service consumer. The WS-Agreement specification, developed by the Open Grid Forum, is a Web Service protocol to establish agreements on the QoS level to be guaranteed in the provision of a service. The committed agreement cannot be modified during service provision and is effective until all activities pertaining to it are finished or until one of the signing party decides to terminate it. In B2B scenarios where several service providers are involved in the composition of a service, and each of them plays both the parts of provider and customer, several one-to-one SLAs need to be signed. In such a rigid context the global QoS of the final service can be strongly affected by any violation on each single SLA. In order to prevent such violations, SLAs need to adapt to any possible needs that might come up during service provision. In this work we focus on the WS-Agreement specification and propose to enhance the flexibility of its approach. We integrate new functionality to the protocol that enable the parties of a WS-Agreement to re-negotiate and modify its terms during the service provision, and show how a typical scenario of service composition can benefit from our proposal.     

Design of DL-based certificateless digital signatures

Public-key cryptosystems without requiring digital certificates are very attractive in wireless communications due to limitations imposed by communication bandwidth and computational resource of the mobile wireless communication devices. To eliminate public-key digital certificate, Shamir introduced the concept of the identity-based (ID-based) cryptosystem. The main advantage of the ID-based cryptosystem is that instead of using a random integer as each user’s public key as in the traditional public-key systems, the user’s real identity, such as user’s name or email address, becomes the user’s public key. However, all identity-based signature (IBS) schemes have the inherent key escrow problem, that is private key generator (PKG) knows the private key of each user. As a result, the PKG is able to sign any message on the users’ behalf. This nature violates the “non-repudiation” requirement of digital signatures. To solve the key escrow problem of the IBS while still taking advantage of the benefits of the IBS, certificateless digital signature (CDS) was introduced. In this paper, we propose a generalized approach to construct CDS schemes. In our proposed CDS scheme, the user’s private key is known only to the user himself, therefore, it can eliminate the key escrow problem from the PKG. The proposed construction can be applied to all Discrete Logarithm (DL)-based signature schemes to convert a digital signature scheme into a CDS scheme. The proposed CDS scheme is secure against adaptive chosen-message attack in the random oracle model. In addition, it is also efficient in signature generation and verification.     

Dynamic Web Service discovery architecture based on a novel peer based overlay network

Service Oriented Computing and its most famous implementation technology Web Services (WS) are becoming an important enabler of networked business models. Discovery mechanisms are a critical factor to the overall utility of Web Services. So far, discovery mechanisms based on the UDDI standard rely on many centralized and area-specific directories, which poses information stress problems such as performance bottlenecks and fault tolerance. In this context, decentralized approaches based on Peer to Peer overlay networks have been proposed by many researchers as a solution. In this paper, we propose a new structured P2P overlay network infrastructure designed for Web Services Discovery. We present theoretical analysis backed up by experimental results, showing that the proposed solution outperforms popular decentralized infrastructures for web discovery, Chord (and some of its successors), BATON (and it’s successor) and Skip-Graphs.     

CoRAL: A transparent fault-tolerant web service

The Web is increasingly used for critical applications and services. We present a client-transparent mechanism, called CoRAL, that provides high reliability and availability for Web service. CoRAL provides fault tolerance even for requests being processed at the time of server failure. The scheme does not require deterministic servers and can thus handle dynamic content. CoRAL actively replicates the TCP connection state while maintaining logs of HTTP requests and replies. In the event of a primary server failure, active client connections fail over to a spare, where their processing continues seamlessly. We describe key aspects of the design and implementation as well as several performance optimizations. Measurements of system overhead, failover performance, and preliminary validation using fault injection are presented.     

Full mobile agent interoperability in an IEEE-FIPA context

The existence of heterogeneous mobile agent systems hinders the interoperability of mobile agents. Several solutions exist, but they are limited in some aspects. This article proposes a full interoperability solution, in the context of the IEEE-FIPA agent standards, composed of three parts. The first part is a simple language-independent agent interface that enables agents to visit locations with different types of middlewares. The second part is a set of design models for the middlewares to support agents developed for different programming languages and architectures. And the third part is a method based on agents with multiple codes and a common agent data encoding mechanism to enable interoperability between middlewares that do not support the same programming languages. Furthermore two agent interoperability implementations, and its corresponding performance comparison, carried out over the JADE and AgentScape agent middlewares are presented.     

MHS: A distributed metadata management strategy

This paper proposes a novel distributed metadata management strategy to efficiently handle different metadata workloads. It can deliver high performance and scalable metadata service through four techniques, including directory conversion metadata, mimic hierarchical directory structure, flexible partition methods targeted different kinds of metadata of diverse characteristics, and the application of database to metadata backend. Using micro-benchmarks and a prototype system, we firstly demonstrate the performance superiority of our strategy compared to Lazy Hybrid, and then present the detailed performance results and analysis of our strategy on different MDS scales.