Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Communication Software and Networks, 2010. ICCSN '10. Second International Conference on

Date 26-28 Feb. 2010

Filter Results

Displaying Results 1 - 25 of 126
  • [Front cover]

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (192 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (95 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (149 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (129 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (171 KB)  
    Freely Available from IEEE
  • Preface

    Page(s): xiv - xv
    Save to Project icon | Request Permissions | PDF file iconPDF (66 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Page(s): xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (105 KB)  
    Freely Available from IEEE
  • Technical Committee

    Page(s): xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (82 KB)  
    Freely Available from IEEE
  • Analytical Evaluation of Timing Offset Error in OFDM System

    Page(s): 3 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (304 KB) |  | HTML iconHTML  

    This paper proposes an idea of developing a model of estimating timing offset error of OFDM (Orthogonal Frequency Division Multiplexing) system without the use of additional pilots relying on inherent characteristics of the OFDM signal. An analytical expression has been derived and formulated to analyze the effect of bit error rate (BER) due to timing offset introduced by the transmission channel. This will help in determining the exact length of cyclic prefix to be added to each OFDM symbol to avoid misinterpretation by the receiver. The performances have also been evaluated under coded (convolution) and uncoded systems. The introduction of channel coding decreases this basic impairment of OFDM systems significantly. Simulated results show that the symbol error rate (SER) linearly depends on timing offset. It is expected that further works on the proposed estimated method will lead to a standard model so that at the receiving end the effect of timing offset can be eliminated totally. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrum Allocation in Cognitive Radio Networks Using Swarm Intelligence

    Page(s): 8 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (311 KB) |  | HTML iconHTML  

    ¿Cognitive radio¿ is an emerging technique to improve the utilization of radio frequency spectrum in wireless networks. This paper discusses the problem of spectrum sharing among primary users and secondary users, and carries out the centralized spectrum allocation with the following two goals: (1) maximize system's sum bandwidth reward, and (2) maximize second users' access fairness. The spectrum allocation problem is formulated into a multi-objective optimization problem aiming at optimizing the system's overall performance and reducing to a graph coloring problem. Graph coloring problem is a well known NP-hard problem. A swarm intelligence based algorithm, particle swarm optimization (PSO), is used to solve the problem. Simulations are conducted to compare the proposed methods with the CSGC algorithms under the Collaborative-Max-Sum-Reward (CSUM) and Collaborative-Max-Proportional-Fair (CMPF) rules. Our experiment results show that the proposed method provides a good tradeoff between the system's sum bandwidth reward and the secondary users' access fairness, and has a better system overall performance. The paper gives an effective method for the spectrum allocation of cognitive radio networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DCSE: A Dynamic Clustering for Saving Energy in Wireless Sensor Network

    Page(s): 13 - 17
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (363 KB) |  | HTML iconHTML  

    In this paper, a dynamic clustering for saving energy for wireless sensor network suggested. Our goal is to decrease the probability of missing the target and to increase the tracking exactness. First phase is consisting of selecting cluster head and creating clusters. In the next phase, new creating cluster based on moving targets. So that cluster head calculates the current location of target. In other phase, target tracking in environment be done by routing target among nodes. This cases cause saving energy in total network. We implemented our tracking algorithm in ns-2 simulator. Missing rate in our algorithm is 9%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Handover Scheme Based on User Profile: A Comparative Study

    Page(s): 18 - 21
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (239 KB) |  | HTML iconHTML  

    In this paper we have analyzed the number of handover required in different time stamp for a particular user on the quality of service parameters namely handover call blocking probability. This system model is based on the analysis of user mobility profile and assigns a weightage factor to each cell. The mathematical equation of the handover blocking probability derived from stochastic comparisons has-been used to compute upper bounds on dropping handover blocking probability by using Guard channel assignment scheme. A conceptual view is given to reduce the new call blocking probability. We use Dynamic Channel Reservation Scheme that can assign handover-reserved channels to new calls depending on the handover weightage factor to reduce new call blocking probability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of OFDM Baseband Trasmitter Compliant IEEE Std 802.16d on FPGA

    Page(s): 22 - 26
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (521 KB) |  | HTML iconHTML  

    Broadband Wireless Access (BWA) is a promising technology which can offer high speed voice, video and internet connection. The leading candidate for BWA is WiMAX, a technology that complies with the IEEE 802.16 family of standards. This paper is focused towards the hardware Implementation of WirelessMAN-OFDM Physical Layer of IEEE Std 802.16d Transmitter on FPGA. The RTL coding style of Verilog HDL was used which gave a high level design-flow for developing and validating communication system protocols and provides flexibility of modifications in future in order to meet real world performance evaluation. The proposed design is fully supportive to adaptive modulation schemes described in IEEE Std 802.16d and equipped with soft interfaces for MAC layer and RF-front end, so that in future more work could be done in order to deploy complete WiMAX CPE IP core. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Redundant Audio Watermarking Technique Using Discrete Wavelet Transformation

    Page(s): 27 - 31
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (402 KB) |  | HTML iconHTML  

    A frame based audio watermarking scheme using Discrete Wavelet Transformation (DWT) is presented in this paper. The algorithm embeds the copyright information into the consecutive levels of approximate coefficients of the DWT transformed audio signal. To increase the robustness of the proposed scheme, the information bits are embedded multiple times at the different levels. Embedding of redundant bits results in degradation of SNR and PSNR values; however, experimental results show that the degradation are within acceptable range. Extraction of the watermarked audio signal is carried out by considering the majority of the watermark bits extracted from different levels. The proposed scheme demonstrates results which tend to resist infiltration against many signal processing manipulations, like MP3 compression, re-sampling, quantization and noise addition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Strategy of Resource Searching in Unstructured P2P Network

    Page(s): 32 - 36
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (361 KB) |  | HTML iconHTML  

    In the unstructured P2P networks, the flooding resource search method may cause much communication overhead, and severely constrains the scalability of network. In order to overcome this disadvantage, a new search strategy named TTL-Search based on the local caching and the scope of searching requests is proposed in this paper. According to this strategy, the searching process is divided into two stages, and each stage adopts different forwarding strategies. Analysis and experimental results show that, TTL-Search can overcome blindness of flooding search, and also can reduce redundancy overhead caused by query to some extend. So it can improve query success rate, and can be efficiently applied in the unstructured P2P network searching. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Directed-Multicast Routing Approach with Path Replication in Content Addressable Network

    Page(s): 37 - 41
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (319 KB) |  | HTML iconHTML  

    In order to improve the efficiency of routing and resource location under large scale failure of Content Addressable Network, a directed-multicast routing approach is proposed to solve the backtrack problem of the traditional greedy approach. Possessing the advantages of directed routing approach and multicast, this new approach also has an extending coefficient to increase its feasibility. Meanwhile, we explore a new replication approach that we term Path Replication. Combining with Path Replication, the directed-multicast routing approach is more efficient in routing process. The efficiency of directed-multicast routing was proved in the simulations on PlanetSim. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Degree Control Resistance to Frangibility of Scale-Free Networks

    Page(s): 42 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (289 KB) |  | HTML iconHTML  

    Since the small-world effect and the scale-free characteristic discovery, the research of complex network obtained rapidly development in the past several years, the complex networks' anti-frangibility is one of research focal points. This article analysised the scale-free networks' frangibility, and obtained that the scale-free networks' frangibility is mainly caused by combining attack to the hubs. From the two aspects of minimum degree and hubs, through setting maximum degree and minimum degree to control the hubs and the stochastic production connections separately, established the scale-free networks' anti-frangibity model based on this. The simulation experiment indicated that through setting the minimum degree and controlling to hubs, can strengthen the scale-free networks' anti-rangibility ability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Failure Detection and Localization in OTN Based on Optical Power Analysis

    Page(s): 46 - 51
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (400 KB) |  | HTML iconHTML  

    In consideration of the new features of Optical Transport Networks (OTN), the failure detection and localization has become a new challenging issue in OTN management research area. This paper proposes a scheme to detect and locate the failures based on the optical power analysis. In failure detection section of the scheme, this paper propose a method to detect the performance degradation caused by possible failures based on real optical power analysis and build a status matrix which demonstrates the current optical power deviation of the fiber port of each node in OTN. In failure localization section of the scheme, this paper proposes the multiple failures location algorithm (MFLA), which deals with both single point failure and multi-point failures, to locate the multiple failures based on analyzing the status matrix and the switching relationship matrix. Then, an exemplary scenario is given to present the result of detecting and locating the fiber link failure and OXC device failure with the proposed scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of HVAC System Through Wireless Sensor Network

    Page(s): 52 - 56
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (300 KB) |  | HTML iconHTML  

    A wireless sensor network (WSN) in its simplest form can be defined as a network of sensors denoted as nodes that blankets a region and provides information about it. They can sense the environment and communicate the data gathered from the monitored field through wireless links. Processing is done at the sensor level. WSN have numerous applications ranging from indoor deployment scenarios in the home and office to outdoor deployment scenarios in natural and military settings. In some of these scenarios, lives may depend on the timelines and correctness of the sensor data obtained from dispersed sensor nodes. The analysis aims at employing WSN for one of its industrial application, i.e. ¿For Monitoring HVAC Systems¿. Significant advances in computer technology have made it possible to develop a wireless sensor network (WSN) capable of monitoring and operating a scheduling system for heating, ventilation, and air- conditioning (HVAC). The proposed system includes features such as monitoring, measurement, networking, and control. This system provides an energy efficient solution to the monitoring and controlling of a HVAC system. This design enables users to make cost-effective energy decisions with no interaction with the HVAC system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Winsock Based Wireless Routing Simulation

    Page(s): 57 - 60
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (241 KB) |  | HTML iconHTML  

    Routing protocol simulation is the basis for its practical application. Using multithread simulation technology can not only simulate the performance of routing protocols, but also lay good foundation for its hardware porting. By use of the technology and combing with Winsock, the paper researched on routing of wireless communication and brought out a kind of computer simulation method for distributed routing based on technologies of Winsock and multithread, and then constructed distributed routing protocol simulation system. With the communication system, different platform for distributed routing protocol simulation can be built to test the performance of routing protocols. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hermite Interpolation Based Motion Vector Recovery Algorithm for H.264/AVC

    Page(s): 63 - 67
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (366 KB) |  | HTML iconHTML  

    Error Concealment is a very useful method to improve the video quality. It aims at using the maximum received video data to recover the lost information of the picture at the decoder. Lagrange interpolation algorithm is the most effective interpolation for error concealment while it lost some detail information. Hermite interpolation algorithm considers the change rate of the motion vector as well as the motion vector itself, which is more accurate. In this paper, we propose a novel method which uses hermite interpolation to predict the lost motion vectors. We take the change rate (derivative) of motion vector into account, and synthesizing the horizontal and vertical recovered motion vectors adaptively by the minimum distance method. The experimental result shows that our method achieves higher PSNR values than Lagrange interpolation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Jobs in a Heterogeneous System with Unreliable Network Links by DLT

    Page(s): 68 - 72
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (252 KB) |  | HTML iconHTML  

    During the last decade, the use of parallel and distributed systems has become more common. In these systems, a huge chunk of data or computation is distributed among many systems in order to obtain better performance. Dividing data is one of the challenges in this type of systems. Divisible Load Theory (DLT) is proposed method for scheduling data distribution in parallel or distributed systems. In many researches carried out in this field, it was assumed that all processors are reliable for grid system but that is not always true in real systems. Although unreliable processors were investigated in some studies, unreliable or unreliable link connections have not been addressed before this research. Disconnection in network links is a common happening in all network topologies specially in wireless connections. In this investigation, we assume that we have two static parameters for processors in a unreliable system, probability of disconnection in network links and required time for repairing disconnection. Then, we present a closed-form formula for scheduling tasks in this type of systems. Experiments show this scheduling method has better performance than applying the proposed methods for reliable systems on an unreliable system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RCPC-Encoded V-BLAST MIMO with MMSE-Based Detection

    Page(s): 73 - 77
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (285 KB) |  | HTML iconHTML  

    A Rate-Compatible Punctured Convolutional (RCPC)-encoded Vertical Bell Laboratories Layered Space-Time (V-BLAST) MIMO system to provide a robust wireless communication link is proposed. The V-BLAST detection is based on Minimum Mean-Squared Error (MMSE) criterion, to alleviate the noise enhancement commonly found in the original V-BLAST scheme based on Zero Forcing criterion. Different code rates and transmit powers are allocated to data streams emitted from the multiple transmit antennas, according to the attenuation levels of the subchannels. This scheme is efficient in terms of transmit power and bandwidth usage, as the data stream entering a destructive subchannel is given low transmit power and high code rate. Simulations show that the proposed system can attain good performance at a reasonably low Eb/No. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A User-Centered Context-Sensitive Privacy Model in Pervasive Systems

    Page(s): 78 - 82
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (346 KB) |  | HTML iconHTML  

    With emerging of pervasive computing, computers have increasingly become a part of in our life routines. Ubiquitous computing (also known as pervasive computing) is known as the age of calm technology where technology becomes as necessity and tends to be virtually invisible in our daily life without realizing. Privacy is a major problem in an individual's daily routine and being a treat in a pervasive computing system. The proposed system to solve individual's privacy problems is called ¿User-Centered Context-Sensitive Privacy Model in Pervasive Systems¿. Implementation of this system wills emphasize on managing user's context privacy concern. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Evaluation of Handoff Queuing Schemes

    Page(s): 83 - 87
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (276 KB) |  | HTML iconHTML  

    One of the main advantages of new wireless systems is the freedom to make and receive calls anywhere and at any time; handovers are considered a key element for providing this mobility. This paper presents the handoff queuing problem in cellular networks. We propose a model to study three handoff queuing schemes, and provide a performance evaluation of these ones. The paper begin by a presentation of the different handoff queuing scheme to evaluate. Then, gives an evaluation model with the different assumption considered in the simulations. The evaluation concerns the blocking probability for handoff and original calls. These simulations are conducted for each scheme, according to different offered loads, size of call (original and handoff) queue, and number of voice channels. A model is proposed and introduced in this paper for the study of three channel assignment schemes; namely, they are the non prioritized schemes (NPS), the original call queuing schemes, and the handoff call queuing schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.