Showing papers in "Int'l J. of Communications, Network and System Sciences in 2010"

Time Domain Signal Analysis Using Wavelet Packet Decomposition Approach

Abstract: This paper explains a study conducted based on wavelet packet transform techniques. In this paper the key idea underlying the construction of wavelet packet analysis (WPA) with various wavelet basis sets is elaborated. Since wavelet packet decomposition can provide more precise frequency resolution than wavelet decomposition the implementation of one dimensional wavelet packet transform and their usefulness in time signal analysis and synthesis is illustrated. A mother or basis wavelet is first chosen for five wavelet filter families such as Haar, Daubechies (Db4), Coiflet, Symlet and dmey. The signal is then decomposed to a set of scaled and translated versions of the mother wavelet also known as time and frequency parameters. Analysis and synthesis of the time signal is performed around 8 seconds to 25 seconds. This was conducted to determine the effect of the choice of mother wavelet on the time signals. Results are also prepared for the comparison of the signal at each decomposition level. The physical changes that are occurred during each decomposition level can be observed from the results. The results show that wavelet filter with WPA are useful for analysis and synthesis purpose. In terms of signal quality and the time required for the analysis and synthesis, the Haar wavelet has been seen to be the best mother wavelet. This is taken from the analysis of the signal to noise ratio (SNR) value which is around 300 dB to 315 dB for the four decomposition levels.

Envelope Correlation Parameter Measurements in a MIMO Antenna Array Configuration

Abstract: In a 2 × 2 MIMO antenna array system envelope correlation coefficient “ρ” shows the influence of different propagation paths of the RF signals that reach the antenna elements. The approximated value of this coefficient is based on a simple closed-form equation and also varies from 0 to 1. Quite perfect performance for MIMO applications is achieved when this parameter approximates to zero. In this paper, we evaluate an antenna diversity MIMO system by measuring the envelope correlation coefficient. The corresponding results in our antenna array configurations show that the measured “ρ” has very small values and approximates to zero. This observation indicates quite perfect behavior and performance of our MIMO antenna array system.

A Comparative Analysis of Tools for Verification of Security Protocols

Abstract: The area of formal verification of protocols has gained substantial importance in the recent years The research results and subsequent applications have amply demonstrated that the formal verification tools have indeed helped correct the protocols even after being standardized However, the standard protocol verification tools and techniques do not verify the security properties of a cryptographic protocol This has resulted in the emergence of the security protocol verifiers to fill the need In this paper, taking the two popular security verification tools namely Scyther and ProVerif as the basis, we identify a few security protocols and implement them in both Scyther and ProVerif, to aptly evaluate the tools, in terms of the security properties of the selected protocols In the process, we not only characteristically present a comparative evaluation of the two tools, but also reveal interesting security properties of the protocols selected, showing their strengths and weaknesses To the best of our knowledge, this is a unique attempt to juxtapose and evaluate the two verification tools using the selected security protocols

Short-Term Load Forecasting Using Soft Computing Techniques

Abstract: Electric load forecasting is essential for developing a power supply strategy to improve the reliability of the ac power line data network and provide optimal load scheduling for developing countries where the demand is increased with high growth rate. In this paper, a short-term load forecasting realized by a generalized neuron–wavelet method is proposed. The proposed method consists of wavelet transform and soft computing technique. The wavelet transform splits up load time series into coarse and detail components to be the features for soft computing techniques using Generalized Neurons Network (GNN). The soft computing techniques forecast each component separately. The modified GNN performs better than the traditional GNN. At the end all forecasted components is summed up to produce final forecasting load.

Advances in MIMO Techniques for Mobile Communications—A Survey

Abstract: This paper provides a comprehensive overview of critical developments in the field of multiple-input multiple-output (MIMO) wireless communication systems. The state of the art in single-user MIMO (SU-MIMO) and multiuser MIMO (MU-MIMO) communications is presented, highlighting the key aspects of these technologies. Both open-loop and closed-loop SU-MIMO systems are discussed in this paper with particular emphasis on the data rate maximization aspect of MIMO. A detailed review of various MU-MIMO uplink and downlink techniques then follows, clarifying the underlying concepts and emphasizing the importance of MU-MIMO in cellular communication systems. This paper also touches upon the topic of MU-MIMO capacity as well as the promising convex optimization approaches to MIMO system design.

A New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks

Abstract: Existing works on data aggregation in wireless sensor networks (WSNs) usually use a single channel which results in a long latency due to high interference, especially in high-density networks. Therefore, data aggre- gation is a fundamental yet time-consuming task in WSNs. We present an improved algorithm to reduce data aggregation latency. Our algorithm has a latency bound of 16R + Δ – 11, where Δ is the maximum degree and R is the network radius. We prove that our algorithm has smaller latency than the algorithm in [1]. The simulation results show that our algorithm has much better performance in practice than previous works.

Geometry Aspects and Experimental Results of a Printed Dipole Antenna

Abstract: Detail experimental measurements of a 2.4 GHz printed dipole antenna for wireless communication systems is presented and discussed. A group of printed dipoles with integrated balun have been designed and constructed on a dielectric substrate. This paper is based on modifications of the known printed dipole architecture. The corresponding printed dipole antennas have differences on their forms that are provided by two essential geometry parameters. The first parameter l is related to the bend on microstrip line that feeds the dipole and the second w corresponds to the form of the dipole’s gap. The impact of these parameters on reflection coefficient and radiation pattern of antenna has been investigated. The corresponding measured results indicate that the return loss and radiation pattern of a printed dipole antenna are independent of the w parameter. Instead, variations in the value of the l parameter in the dipole’s structure affect the form of the corresponding return loss. These observations are very important and provide interesting considerations on affecting design and construction of antenna elements at frequency range of 2.4 GHz.

Reduction PAPR of OFDM Signals by Combining SLM with DCT Transform

Abstract: One of main disadvantage of OFDM is high peak-to-average power ratio (PAPR). In this paper, two effective PAPR reduction schemes are proposed. These techniques combine DCT and SLM techniques. The scheme 1 is composed of the DCT followed by SLM technique, and the DCT is used followed by conventional SLM in proposed scheme 2. Simulation results show that the proposed schemes can obtain significant PAPR reduction performance with that of ordinary SLM techniques.

A Measurement Study on BitTorrent System

Abstract: Measuring and characterizing peer-to-peer (P2P) file-sharing systems will benefit the optimization and management of P2P systems. Though there are a lot of measurement studies on BitTorrent almost in every important aspect, few of them focus on the measurement issues and the corresponding solutions, which can strongly influence the accuracy of measurement results. This paper analyzes the key difficulties of measuring BitTorrent and presents a measurement system with combination of active and passive ways, which can han-dle with the problems well and balance the efficiency and integrity. Then compared to other work, a more complete and representative measurement was performed for nearly two months and several characteristics are concerned: 1) there are diverse content sharing in BitTorrent system, but multimedia files that are larger than 100 MB are the most. 2) Distributed Hash Tables has indeed enhanced the ability of peer discovery though there are some pitfalls to be addressed. 3) Pieces are distributed uniformly after the early stage and there are few rare pieces. Furthermore, peer arrival rate shows a periodical pattern, which was not well mod-eled before. Then an improved model is proposed and the experiment results indicate that new model is fitted in with actual measurement results with high accuracy.

An Empirical Examination of Routing Protocols in Mobile Ad Hoc Networks

Abstract: A Mobile Ad hoc NETwork (MANET) is a self-organizing, temporary, infrastructure-free, multi-hop, dynamic topology wireless network that contains collection of cooperative autonomous freely roaming mobile nodes. The nodes communicate with each other by wireless radio links with no human intervention. Each mobile node functions as a specialized router to forward information to other mobile nodes. In order to provide efficient end-to-end communication with the network of nodes, a routing protocol is used to discover the optimal routes between the nodes. The routing protocols meant for wired networks can not be used for mobile ad hoc networks because of the mobility of nodes. Routing in ad hoc networks is nontrivial due to highly dynamic nature of the nodes. Various routing protocols have been proposed and widely evaluated for efficient routing of packets. This research paper presents an overview on classification of wide range of routing protocols for mobile ad hoc wireless networks proposed in the literature and shows the performance evaluation of the routing protocols: DSDV, AODV, FSR, LAR, OLSR, STAR and ZRP using the network simulator QualNet 4.0 to determine which protocols may perform best in large networks. To judge the merit of a routing protocol, one needs performance metrics (throughput, end-to-end delay, jitter, packet delivery ratio, routing overhead) with which to measure its suitability and performance. Our simulation experiments show that the LAR protocol achieve relatively good performance compared to other routing protocols.

Performance of Multirate Multicast in Distributed Network

Abstract: The number of Internet users has increased very rapidly due to the scalability of the network. The users demand for higher bandwidth and better throughput in the case of on demand video, or video conference or any real time distributed network system. Performance is a great issue in any distributed networks. In this paper we have shown the performance of the multicast groups or clusters in the distributed network system. In this paper we have shown the performance of different users or receivers belongs to the multicast group or cluster in the distributed network, transfer data from the source node with multirate multicast or unirate multicast by considering packet level forwarding procedure in different sessions. In this work we have shown that how the throughput was effected when the number of receiver increase. In this work we have considered the different types of queue such as RED, Fair queue at the junction node for maintaining the end to end packet transmission. In this work we have used various congestion control protocol at the sender nodes. This paper we have shown the performance of the distributed cluster network by multirate multicast.

Indoor Radio Propagation Model Based on Dominant Path

Abstract: When there are bigger obstacles in the indoor environment such as elevator, the radio waves basically can not penetrate it. The contribution of received signal strength by transmission and reflection will be greatly reduced, and most of the time, the radio waves will reach the user by bypass diffraction. Therefore, the traditional path loss model is no longer applicable, and the improved model should be proposed. In this paper, we firstly proposed an indoor radio propagation model based on dominant path in which the received signal strength has nothing to do with the direct distance between user and access point, but is related to the length of dominant path. Then on the basis of dominant path model, the NLOS influence is considered in order to further improve the accuracy of dominant path model. Experimental results demonstrated that the proposed dominant path model can improve the accuracy of traditional path loss model remarkably.

A Synchronous and Deterministic MAC Protocol for Wireless Communications on Linear Topologies

Abstract: Linear topology is useful in several pervasive application scenarios. Even though a linear topology can be handled by unspecific routing algorithms over general purpose MAC protocols, better performance can be obtained by specialized techniques. This paper describes a new communication scheme called Wireless Wire (WiWi), which builds up a bidirectional wireless communication channel with deterministic properties in terms of throughput and latency over a strip of pervasive devices with short-range transmission capabilities. The system is synchronous and fault tolerant. With low cost and extremely simple devices, WiWi builds up a “wire-like” dielectric link, but its applications are not limited to end-to-end communications. For example, WiWi can be used to collect data from sensors along the path, thus acting as a virtual conveyor belt.

Online Detection of Network Traffic Anomalies Using Degree Distributions

Abstract: Diagnosing traffic anomalies rapidly and accurately is critical to the efficient operation of large computer networks. However, it is still a challenge for network administrators. One problem is that the amount of traffic data does not allow real-time analysis of details. Another problem is that some generic detection metrics possess lower capabilities on diagnosing anomalies. To overcome these problems, we propose a system model with an explicit algorithm to perform on-line traffic analysis. In this scheme, we first make use of degree distributions to effectively profile traffic features, and then use the entropy to determine and report changes of degree distributions, which changes of entropy values can accurately differentiate a massive network event, normal or anomalous by adaptive threshold. Evaluations of this scheme demonstrate that it is feasible and efficient for on-line anomaly detection in practice via simulations, using traffic trace collected at high-speed link.

Particle Swarm Optimization Based Approach for Resource Allocation and Scheduling in OFDMA Systems

Abstract: Orthogonal Frequency-Division Multiple Access (OFDMA) systems have attracted considerable attention through technologies such as 3GPP Long Term Evolution (LTE) and Worldwide Interoperability for Microwave Access (WiMAX). OFDMA is a flexible multiple-access technique that can accommodate many users with widely varying applications, data rates, and Quality of Service (QoS) requirements. OFDMA has the advantages of handling lower data rates and bursty traffic at a reduced power compared to single-user OFDM or its Time Division Multiple Access (TDMA) or Carrier Sense Multiple Access (CSMA) counterparts. In our work, we propose a Particle Swarm Optimization based resource allocation and scheduling scheme (PSORAS) with improved quality of service for OFDMA Systems. Simulation results indicate a clear reduction in delay compared to the Frequency Division Multiple Access (FDMA) scheme for resource allocation, at almost the same throughput and fairness. This makes our scheme absolutely suitable for handling real time traffic such real time video-on demand.

IDMA Based on Deterministic Interleavers

Abstract: Previously, the interleavers is generated randomly for users of Interleave Division Multiple Access (IDMA) systems. Therefore, transmitting the entire chip-level interleaver matrix or power interleaver generation is required, which either adds redundancy or increases delay. In this paper, we propose to use deterministic chip-level interleavers for multiple users of IDMA systems. These chip-level interleavers are modified from single-user symbol-level interleavers for turbo codes. The receiver can generate the chip-level interleavers for user k automatically without the redundancy of transmitting the entire interleaver matrix or the delay of generating power interleavers. Simulation results show that the proposed deterministic–interleaver-based IDMA performance is better than Gold-code-based CDMA in the multipath environment.

Using Bayesian Game Model for Intrusion Detection in Wireless Ad Hoc Networks

Abstract: Wireless ad ho network is becoming a new research fronter, in which security is an important issue. Usually some nodes act maliciously and they are able to do different kinds of Denial of Service (Dos). Because of the limited resource, intrusion detection system (IDS) runs all the time to detect intrusion of the attacker which is a costly overhead. In our model, we use game theory to model the interactions between the intrusion detection system and the attacker, and a realistic model is given by using Bayesian game. We solve the game by finding the Bayesian Nash equilibrium. The results of our analysis show that the IDS could work intermittently without compromising on its effectiveness. At the end of this paper, we provide an experiment to verify the rationality and effectiveness of the proposed model.

Extending the Network Lifetime of Wireless Sensor Networks Using Residual Energy Extraction—Hybrid Scheduling Algorithm

Abstract: Wireless sensor networks (WSNs) are mostly deployed in a remote working environment, since sensor nodes are small in size, cost-efficient, low-power devices, and have limited battery power supply. Because of limited power source, energy consumption has been considered as the most critical factor when designing sensor network protocols. The network lifetime mainly depends on the battery lifetime of the node. The main concern is to increase the lifetime with respect to energy constraints. One way of doing this is by turning off redun-dant nodes to sleep mode to conserve energy while active nodes can provide essential k-coverage, which improves fault-tolerance. Hence, we use scheduling algorithms that turn off redundant nodes after providing the required coverage level k. The scheduling algorithms can be implemented in centralized or localized schemes, which have their own advantages and disadvantages. To exploit the advantages of both schemes, we employ both schemes on the network according to a threshold value. This threshold value is estimated on the performance of WSN based on network lifetime comparison using centralized and localized algorithms. To extend the network lifetime and to extract the useful energy from the network further, we go for compromise in the area covered by nodes.

Radio Frequency Modelling for Future Wireless Sensor Network on Surface of the Moon

Abstract: In order to study lunar regolith properties, wireless sensor network is planned to be deployed on surface of the Moon. This network can be deployed having few wireless sensor nodes capable of measuring soil properties and communicating results, as and when ready. Communication scenario on lunar surface is quite different as compared to that on the Earth, as there is no atmosphere and also there are lots of craters as well as various terrain topologies. Since the deployment of sensors on the Moon is a challenging and difficult task, it is advisable to predict the behaviour of communication channel on lunar surface. However, communication models like Irregular Terrain Model used for terrestrial communication networks are not directly applicable for Unattended Ground Sensor type sensor networks and need modifications according to lunar surface conditions and lunar environment. Efforts have been put to devise a model of radio frequency environment on the Moon using basic equations governing various physical phenomena occurring during radio propagation. The model uses Digital Elevation Model of four sites of the Moon, measured by Terrain Mapping Camera on board Chandrayan-1, a recent Indian mission to the Moon. Results presented in this paper can provide understanding of percentage area coverage for given minimum received signal strength, potential sites for sensor deployment assuring wireless communication, decision whether a given sensor node can work and can provide suggestion for possible path of rover with cluster head to remain in contact with the nodes. Digital Elevation Model based results presented here can provide more insight in to the communication scenario on the Moon and can be very useful to mission planners.

Flocking Control of a Group of Agents Using a Fuzzy-Logic-Based Attractive/Repulsive Function

Abstract: In this study, a novel procedure is presented for control and analysis of a group of autonomous agents with point mass dynamics achieving flocking motion by using a fuzzy-logic-based attractive/repulsive function. Two cooperative control laws are proposed for a group of autonomous agents to achieve flocking formations related to two different centers (mass center and geometric center) of the flock. The first one is designed for flocking motion guided at mass center and the other for geometric center. A virtual agent is introduced to represent a group objective for tracking purposes. Smooth graph Laplacian is introduced to overcome the difficulties in theoretical analysis. A new fuzzy-logic-based attractive/repulsive function is proposed for separation and cohesion control among agents. The theoretical results are presented to indicate the stability (separation, collision avoidance and velocity matching) of the control systems. Finally, simulation example is demonstrated to validate the theoretical results.

MRBCH: A Multi-Path Routing Protocol Based on Credible Cluster Heads for Wireless Sensor Networks

Abstract: Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.

A Load Balancing Policy for Distributed Web Service

Abstract: The proliferation of web services; and users appeal for high scalability, availability and reliability of web servers to provide rapid response and high throughput for the Clients’ requests occurring at anytime. Distributed Web Servers (DWSs) provide an effective solution for improving the quality of web services. This paper addresses un-regulated jobs/tasks migration among the servers. Considering distributed web services with several servers running, a lot of bandwidth is wasted due to unnecessary job migration. Having considered bandwidth optimization, it is important to develop a policy that will address the bandwidth consumption while loads/tasks are being transferred among the servers. The goal of this work is to regulate this movement to minimize bandwidth consumption. From literatures, little or no attention was given to this problem, making it difficult to implement some of these policies/schemes in bandwidth scarce environment. Our policy “Cooperative Adaptive Symmetrical Initiated Dynamic/Diffusion (CASID)” was developed using Java Development Environment (JADE) a middle ware service oriented environment which is agent-based. The software was used to simulate events (jobs distribution) on the servers. With no job transfer allowed when all servers are busy, any over loaded server process jobs internally to completion. We achieved this by having two different agents; static cognitive agents and dynamic cognitive agents. The results were compared with the existing schemes. CASID policy outperforms PLB scheme in terms of response time and system throughput.

Modeling and Analysis of Bandwidth Allocation in IEEE 802.16 MAC: A Stochastic Reward Net Approach

Abstract: In this paper, we present a stochastic reward net (SRN) approach to analyse the performance of IEEE 802.16 MAC with multiple traffic classes. The SRN model captures the quality of service requirements of the traffic classes. The model also takes into account pre-emption, priority and timeout characteristics associated with the traffic classes under consideration. The performance of the system is evaluated in terms of mean delay and normalized throughput considering the on-off traffic model. Our analytical model is validated by simulations.

Design and Measurements of Ultra-Wideband Antenna

Abstract: This paper describes the design, realization and experimental measurements of an antenna element to operate at ultra-wideband (UWB) spectrum. The type of this antenna is a circular disk monopole (CDM), with two notches opposite to each other at two sides of the disk. The feed of the antenna is a coplanar waveguide (CPW). The effect of the presence of the notches is studied through simulations and tested experimentally.

A Maximum Likelihood TOA Based Estimator For Localization in Heterogeneous Networks

Abstract: In this paper, we exploit the concept of data fusion in hybrid localization systems by combining different TOA (Time of Arrival) observables coming from different RATs (Radio Access Technology) and characterized by different precisions in order to enhance the positioning accuracy. A new Maximum Likelihood estimator is developed to fuse different measured ranges with different variances. In order to evaluate this estimator, Monte Carlo simulations are carried out in a generic environment and Cramer Rao Lower Bounds (CRLB) are investigated. This algorithm shows enhanced positioning accuracy at reasonable noise levels comparing to the typical Weighted Least Square estimator. The CRLB reveals that the choice of the number, and the configuration of Anchor nodes, and the type of RAT may enhance positioning accuracy.

Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols

Abstract: Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and validates a new algorithm, called the Enhanced Euclid Algorithm, for modular multiplicative inverse (MMI). Analysis of the proposed algorithm shows that it is more efficient than the Extended Euclid algorithm (XEA). In addition, if a MMI does not exist, then it is not necessary to use the Backtracking procedure in the proposed algorithm; this case requires fewer operations on every step (divisions, multiplications, additions, assignments and push operations on stack), than the XEA. Overall, XEA uses more multiplications, additions, assignments and twice as many variables than the proposed algorithm.

A Multi-objective QoS Optimization with Fuzzy Based Parameter Setting for Real-Time Multicasting

Abstract: We propose a multi-objective Pareto-optimal technique using Genetic Algorithm (GA) for group communication, which determines a min-cost multicast tree satisfying end-to-end delay, jitter, packet loss rate and blocking probability constraints. The model incorporates a fuzzy-based selection technique for initialization of QoS parameter values at each instance of multicasting. The simulation results show that the proposed algorithm satisfies on-demand QoS requirements (like high availability, good load balancing and fault-tolerance) made by the hosts in varying topology and bursty data traffic in multimedia communication networks.

An Evolutionary Algorithm Based on a New Decomposition Scheme for Nonlinear Bilevel Programming Problems

Abstract: In this paper, we focus on a class of nonlinear bilevel programming problems where the follower’s objective is a function of the linear expression of all variables, and the follower’s constraint functions are convex with respect to the follower’s variables. First, based on the features of the follower’s problem, we give a new decomposition scheme by which the follower’s optimal solution can be obtained easily. Then, to solve efficiently this class of problems by using evolutionary algorithm, novel evolutionary operators are designed by considering the best individuals and the diversity of individuals in the populations. Finally, based on these techniques, a new evolutionary algorithm is proposed. The numerical results on 20 test problems illustrate that the proposed algorithm is efficient and stable.

Performance of Block Diagonalization Broadcasting Scheme for Multiuser MIMO System Operating in Presence of Spatial Correlation and Mutual Coupling

Abstract: In this paper, the capacity of a multiuser Multiple Input Multiple Output (MIMO) system employing the block diagonalization broadcasting scheme in presence of spatial correlation and mutual coupling is investigated. It is shown by computer simulations that, in general, the presence of spatial correlation decreases the capacity of a multiuser MIMO system. However, for some particular antenna element spacing mutual coupling decreases the spatial correlation rendering an increased capacity. The optimized diagonalization broadcasting technique with a two-stage power allocation scheme is proposed and verified. The presented simulations results confirm the advantage of the proposed broadcasting scheme.

Routing Strategy Selection for Zigbee Mesh Networks

Abstract: Based on IEEE 802.15.4 Low Rate-Wireless Personal Area Network (LR-WPAN) standard, the Zigbee standard has been proposed to interconnect simple, low rate and battery powered wireless devices. The deployment of Zigbee network is expected to facilitate numerous applications such as Home-appliance networks, home healthcare, medical monitoring and environmental sensors. An effective routing scheme is more important for Zigbee mesh networks. In order to achieve effective routing in Zigbee Mesh networks, a Zigbee protocol module is realized using NS-2. The suitable routing for different data services in the Zigbee application layer and a best routing strategy for Zigbee mesh network are proposed. The simulation shows the selection of suitable routing for continuous data services and for bursting data services in the Zigbee application layer and the comparison of three routing strategies namely ERD (All packets Enable Route Discovery), SRD (All packets Suppress Route Discovery) and BOS (routing Based on Data Services) in the aspects of Efficiency and Overhead.