By Topic

Networks Security Wireless Communications and Trusted Computing (NSWCTC), 2010 Second International Conference on

Date 24-25 April 2010

Go

Filter Results

Displaying Results 1 - 25 of 146
  • [Front cover - Vol 2]

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

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

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

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

    Page(s): v - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (170 KB)  
    Freely Available from IEEE
  • Message from General Chairs - Volume 2

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

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (84 KB)  
    Freely Available from IEEE
  • Program Committee - Volume 2

    Page(s): xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (79 KB)  
    Freely Available from IEEE
  • list-reviewer

    Page(s): xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (78 KB)  
    Freely Available from IEEE
  • Geometrically Invariant Color Image Watermarking Using Mean-Based 2D Color Histogram

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

    Watermark resistance to geometric attacks is a crucial issue in watermark system design. Challenging cropping and recently reported random bending attacks (RBAs) are still the Achilles heel for most of the existing watermarking schemes. This paper presents a geometric attacks resistant zero-watermarking scheme for color images, which is based on one of the image geometric invariant representations-the mean-based 2D color histogram extracted from two different color components by reference to the mean value of the effective pixels of each component. Experimental results demonstrate that the proposed method provides a satisfactory performance for various geometric attacks and common image processing operations, including affine transformations, cropping, RBAs, additive noise, filtering, JPEG compression, etc. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direction Finding via Beam Scanning and Sparse Reconstruction

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

    An improved direction finding method is proposed based on unimodal characteristic of antenna pattern and sparse property of received data. Unlike the conventional methods based peak-searching and symmetric constraint, the sparse reconstruction algorithm requires less pulse and takes advantage of compressive sampling. Simulation results validate performance of the proposed method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication Scheme in Trusted Sensor Network

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

    Trust is an important issue when a wireless sensor network is used in the fields such as military surveillance and reconnaissance, emergency rescue, and intelligent residential district. Due to the restrictions of energy, resource, and computing power in the sensor nodes, the traditional secure solutions cannot be applied to the wireless sensor networks directly. In this paper, applying the concept of trusted computing, a trust-based dynamic key-distribution scheme is suggested. In this scheme, when a cluster head distributes the key for the communication among nodes in its cluster, based on the trust relations between the base station and cluster head and between the cluster head and sensor nodes, a trust chain is formed, which provides a secured path for the transmission of data. It can be shown that this solution ensures the security of communications between nodes, and reduces the energy consumption of the security scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust and Reputation Based Model Selection Mechanism for Decision-Making

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

    In open and distributed environment, model selection of decision-making is difficult due to the lack of model's knowledge. In order to find an effective mechanism for decision parties, semantics based trust and reputation computations are introduced into decision-making. Trust between decision parties and models are divided into trust dependence and trust relationship which demonstrate the matching degree between the semantics from sponsor model requirements and the semantics of candidate model's capacities, and the subjective reliability between sponsor party and provider party respectively. Then, a reputation ranking method is proposed to build up a neutral and whole belief about a decision party. Reputation ranking is composed by three facets: time limitation, source identity and ranking delay. According to the trust and reputation computation, we present a trust and reputation based model selection mechanism for decision party. Finally, the experiment shows that our approach is feasible and effective. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Energy Efficient Clustering Algorithm in Large-Scale Mobile Sensor Networks

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

    Clustering offers a kind of hierarchical organization to provide scalability and basic performance guarantee by partitioning the network into disjoint groups of nodes. In this paper an energy efficient clustering algorithm is proposed under large-scale mobile sensor networks scenario. In the initial cluster formation phase, our proposed scheme features a simple execution process, which has a time and message complexity of O(n), and eliminates the “frozen time” requirement by introducing some GPS-capable mobile nodes. In the following cluster maintenance stage, the maintenance of clusters is asynchronously and event driven so as to thoroughly avoid the “ripple effect”, thus being well suitable for the high mobility environment. Extensive simulations have been conducted and the simulation results reveal that our proposed algorithm successfully achieves its target at incurring much less clustering overheads as well as maintaining much more stable cluster structure, as compared to HCC(High Connectivity Clustering) algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined Fountain Code with Network Coding in Cooperative Communication

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

    In this paper, we will investigate the block error rate (BLER) performance in cooperative communication, through combining fountain code with network coding. Contrast to the fixed-rate code, the rate of fountain code is not determined in advance, since that varies according to the instant channel state information. Under the error-free channel condition, network coding can get the maximum possible rate through coding at the correlative nodes not just store-and-forward. Based on this, the error-tolerant coding scheme is proposed by means of integrating fountain code with network coding in cooperative communication. Simulation results show that the proposed scheme can obtain the lower block error rate (BLER), compared with detect and forward scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hierarchical Semi-centralized Architecture for Load Balancing of Heterogeneous Wireless Networks

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

    Drawing on the idea of grid in computer networks, this paper maps heterogeneous wireless networks to distributed grids by introducing Resource Management Unit, and then presents a hierarchical semi-centralized architecture for load balancing of heterogeneous wireless networks. The analytical models for the signaling overhead of the architecture are established. Theoretical analysis and simulation results indicate that the architecture we proposed can reduce the signaling overhead and improve the system reliability effectively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Malware variants identification based on byte frequency

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

    Malware variants refer to all the new malwares manually or automatically produced from any existing malware. However, such simple approach to produce malwares can change signatures of the original malware to confuse and bypass most of popular signature-based anti-malware tools. In this paper we propose a novel byte frequency based detecting model (BFBDM) to deal with the malware variants identification issue. The primary experimental results show that our model is efficient and effective for the identification of malware variants, especially for the manual variant. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research of Initiative Monitoring Model Based on Hybrid P2P Network for Special Information

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

    Based on the currently P2P(Peer to Peer) traffic identification, this paper established a initiative monitoring model to monitor specific information based on hybrid P2P network, which detects the existed specific information on hybrid P2P network by positive monitoring method, to get the audience information related to specific information. By mathematic analysis to the audience information to monitor the development trend of the specific information, it provides the data support to the follow-up specific information's pre-warning or forecasting. Finally, this method's feasibility and effectiveness has been proved by the achieved system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Power Control Game Algorithm Based on Interference Temperature in Cognitive Radio

    Page(s): 40 - 44
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (349 KB) |  | HTML iconHTML  

    Aiming at the power control in cognitive radio, a power control game algorithm based on interference temperature is discussed, and non-cooperative power control game which is created by David Goodman is used. The efficiency function was mended, and we also designed a new pricing function with interference temperature. Compared with other power control game models, the simulation shows that the NPG-ITLP algorithm can improve the parteo efficiency, and guarantee the QoS of the secondary users as well as primary users. It also realizes resource allocation equality in cognitive radio network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlation-Based Traffic Analysis on Encrypted VoIP Traffic

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

    In this paper, we focus on traffic analysis on encrypted Voice over IP (VoIP) calls at the network level and the application level. The network-level traffic analysis aims to correlate VoIP traffic flows with features in time domain and frequency domain. The application-level traffic analysis at identify speeches in encrypt VoIP calls. We verified our analysis approaches with experiments over existing anonymity networks and experiments results show that the successful rate for flow correlation and speech identification can approach 0.9 and 0.98 respectively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on imperceptibility index of image Information Hiding

    Page(s): 49 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (560 KB) |  | HTML iconHTML  

    The deficiency of imperceptibility indexes of information hiding algorithm has been analyzed. According to human vision characteristics, a new imperceptibility evaluation index with the original carrier image for comparing. This index comprehensively considers the background illumination of carrier image, the complexity of background texture, the spatial position and the directivity influence on vision masking effect. Experiments prove that this index is better than Power Signal-to-Noise Ratio (PSNR) in measuring the imperceptibility of hidden information. It can evaluate gray image and binary image, this solves the problem that gray image and binary image can not use the same index. Besides, a special situation of this index is just PSNR. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum Design of Digital Filters for EBPSK Demodulation

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

    Extended Binary Phase Shift Keying (EBPSK) modulation with very high spectra efficiency is a hot research problem in the field of communication. This paper proposes an optimum design method of digital filters in EBPSK demodulation aiming at very tiny waveform difference, which is based on the minimum bit error rate (BER) criteria. Simultaneously, the inter symbol interference is considered as a constraint condition. Also the impulse filter proposed by Wu is used as comparison by computer simulation, the results illustrate that our proposed optimum method has better performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometry Influence on GDOP in TOA and AOA Positioning Systems

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

    Geometric dilution of precision (GDOP) is defined as the ratio of the root-mean-square position determination error to the root-mean-square measurement error. Based on the Cramer-Rao lower bound (CRLB), new mathematical expressions of GDOP are presented in Time-of-Arrival (TOA) and Angle-of-Arrival (AOA) positioning systems in this paper. The expressions obviously reveal that the geometrical shape of the anchor nodes make a significant influence on GDOP. Then the influence of adding a new anchor node at different locations is analyzed. Simulations show that in both positioning systems, two optimal placement angles exist to make the GDOP smallest, when the original anchor nodes are no uniformly scattered. However, when uniformly scattered, the GDOP keeps constant no matter what angle the new anchor node is placed at. In AOA positioning systems, the GDOP is also affected by the distance between the newly added anchor node and the target, and increases when the distance increases. Meanwhile, the GDOP is always reduced when more anchor nodes are used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Securing Cookies with a MAC Address Encrypted Key Ring

    Page(s): 62 - 65
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (442 KB) |  | HTML iconHTML  

    Most web services providers use cookies to personalize the customers' access to the website. A cookie contains a user's privacy and important identification which can be used to identify the user. However, cookies are not as safe as we take it for granted. There are still some potential safety hazards in cookies. For example, the contents in the cookies can be easily changed, thus it will result in some safety threats to the user or the website. This paper proposes a new cookie security policy based on a MAC address encrypted key ring. It can make the cookies have higher confidentiality and higher efficiency. It is also easy to deploy and meets the user's higher security requirements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Grid Switch in Multi-sink Mobile Sensor Networks

    Page(s): 66 - 70
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (270 KB) |  | HTML iconHTML  

    Due to the fact that TTDD (Two-Tier Data Dissemination) could not adjust the grid structure according to the real time flux, we propose DGS, a Dynamic Grid Switch multi-sink data gathering mechanism which constructs grid based on the TTDD. DGS adds even driven mechanism to dynamically adapt to the whole network energy status. The frequency of grid switch is based on the power level of even status the energy mode. DGS also supports mobile sink conditions in such environment. Our results demonstrate that DGS could efficiently enhance the network life and achieve load balance even when nodes are mobile. View full abstract»

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