By Topic

Communications and Networks, Journal of

Issue 6 • Date Dec. 2009

Filter Results

Displaying Results 1 - 22 of 22
  • [Front cover]

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (306 KB)  
    Freely Available from IEEE
  • [Front inside cover]

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (297 KB)  
    Freely Available from IEEE
  • Secure wireless networking

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

    Wireless technologies have had a significant impact on computing and communication technologies in the past decade, and we are thus now progressing to the new "anytime-anywhere" service model of the mobile Internet. Unfortunately, the affordability and availability of wireless technologies that makes them so attractive, also makes them an enticing target for security threats. As new wireless technologies continue to emerge, many of which will be highly flexible and programmable (such as the next generation of software radios), it will be easier than ever before for adversaries to acquire the equipment and the means to launch new security or privacy attacks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Build-in wiretap channel I with feedback and LDPC codes

    Page(s): 538 - 543
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1283 KB) |  | HTML iconHTML  

    A wiretap channel I is one of the channel models that was proved to achieve unconditional security. However, it has been an open problem in realizing such a channel model in a practical network environment. The paper is committed to solve the open problem by introducing a novel approach for building wiretap channel I in which the eavesdropper sees a binary symmetric channel (BSC) with error probability p while the main channel is error free. By taking advantage of the feedback and low density parity check (LDPC) codes, our scheme adds randomness to the feedback signals from the destination for keeping an eavesdropper ignorant; on the other hand, redundancy is added and encoded by the LDPC codes such that a legitimate receiver can correctly receive and decode the signals. With the proposed approach, unconditionally-secure communication can be achieved through interactive communications, in which the legitimate partner can realize the secret information transmission without a pre-shared secret key even if the eavesdropper has better channel from the beginning. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of wavelet-based RF fingerprinting to enhance wireless network security

    Page(s): 544 - 555
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2016 KB) |  | HTML iconHTML  

    This work continues a trend of developments aimed at exploiting the physical layer of the open systems interconnection (OSI) model to enhance wireless network security. The goal is to augment activity occurring across other OSI layers and provide improved safeguards against unauthorized access. Relative to intrusion detection and anti-spoofing, this paper provides details for a proof-of-concept investigation involving “air monitor” applications where physical equipment constraints are not overly restrictive. In this case, RF fingerprinting is emerging as a viable security measure for providing device-specific identification (manufacturer, model, and/or serial number). RF fingerprint features can be extracted from various regions of collected bursts, the detection of which has been extensively researched. Given reliable burst detection, the near-term challenge is to find robust fingerprint features to improve device distinguishability. This is addressed here using wavelet domain (WD) RF fingerprinting based on dual-tree complex wavelet transform (DT-CWT) features extracted from the non-transient preamble response of OFDM-based 802.11a signals. Intra-manufacturer classification performance is evaluated using four like-model Cisco devices with dissimilar serial numbers. WD fingerprinting effectiveness is demonstrated using Fisher-based multiple discriminant analysis (MDA) with maximum likelihood (ML) classification. The effects of varying channel SNR, burst detection error and dissimilar SNRs for MDA/ML training and classification are considered. Relative to time domain (TD) RF fingerprinting, WD fingerprinting with DT-CWT features emerged as the superior alternative for all scenarios at SNRs below 20 dB while achieving performance gains of up to 8 dB at 80% classification accuracy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient key detection method in the correlation electromagnetic analysis using peak selection algorithm

    Page(s): 556 - 563
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1918 KB) |  | HTML iconHTML  

    A side channel analysis is a very efficient attack against small devices such as smart cards and wireless sensor nodes. In this paper, we propose an efficient key detection method using a peak selection algorithm in order to find the advanced encryption standard secret key from electromagnetic signals. The proposed method is applied to a correlation electromagnetic analysis (CEMA) attack against a wireless sensor node. Our approach results in increase in the correlation coefficient in comparison with the general CEMA. The experimental results show that the proposed method can efficiently and reliably uncover the entire 128-bit key with a small number of traces, whereas some extant methods can reveal only partial subkeys by using a large number of traces in the same conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundancy minimizing techniques for robust transmission in wireless networks

    Page(s): 564 - 573
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (938 KB) |  | HTML iconHTML  

    In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N =3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worst-case running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible, extensible, and efficient VANET authentication

    Page(s): 574 - 588
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1083 KB) |  | HTML iconHTML  

    Although much research has been conducted in the area of authentication in wireless networks, vehicular ad-hoc networks (VANETs) pose unique challenges, such as real-time constraints, processing limitations, memory constraints, frequently changing senders, requirements for interoperability with existing standards, extensibility and flexibility for future requirements, etc. No currently proposed technique addresses all of the requirements for message and entity authentication in VANETs. After analyzing the requirements for viable VANET message authentication, we propose a modified version of TESLA, TESLA++, which provides the same computationally efficient broadcast authentication as TESLA with reduced memory requirements. To address the range of needs within VANETs we propose a new hybrid authentication mechanism, VANET authentication using signatures and TESLA++ (VAST), that combines the advantages of ECDSA signatures and TESLA++. Elliptic curve digital signature algorithm (ECDSA) signatures provide fast authentication and non-repudiation, but are computationally expensive. TESLA++ prevents memory and computation-based denial of service attacks. We analyze the security of our mechanism and simulate VAST in realistic highway conditions under varying network and vehicular traffic scenarios. Simulation results show that VAST outperforms either signatures or TESLA on its own. Even under heavy loads VAST is able to authenticate 100% of the received messages within 107ms. VANETs use certificates to achieve entity authentication (i.e., validate senders). To reduce certificate bandwidth usage, we use Hu et al.'s strategy of broadcasting certificates at fixed intervals, independent of the arrival of new entities. We propose a new certificate verification strategy that prevents denial of service attacks while requiring zero additional sender overhead. Our analysis shows that these solutions introduce a small d- lay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing for enhancing source-location privacy in wireless sensor networks of multiple assets

    Page(s): 589 - 598
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1148 KB) |  | HTML iconHTML  

    In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An energy-efficient access control scheme for wireless sensor networks based on elliptic curve cryptography

    Page(s): 599 - 606
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (966 KB) |  | HTML iconHTML  

    For many mission-critical related wireless sensor network applications such as military and homeland security, user's access restriction is necessary to be enforced by access control mechanisms for different access rights. Public key-based access control schemes are more attractive than symmetric-key based approaches due to high scalability, low memory requirement, easy key-addition/revocation for a new node, and no key pre-distribution requirement. Although Wang et al. recently introduced a promising access control scheme based on elliptic curve cryptography (ECC), it is still burdensome for sensors and has several security limitations (it does not provide mutual authentication and is strictly vulnerable to denial-of-service (DoS) attacks). This paper presents an energy-efficient access control scheme based on ECC to overcome these problems and more importantly to provide dominant energy-efficiency. Through analysis and simulation based evaluations, we show that the proposed scheme overcomes the security problems and has far better energy-efficiency compared to current scheme proposed by Wang et al. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust and efficient anonymous authentication protocol in VANETs

    Page(s): 607 - 614
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1059 KB) |  | HTML iconHTML  

    Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme for generating anonymous certificates from roadside units (RSUs). However, ECPP does not provide unlinkability and traceability when multiple RSUs are compromised. In this paper, we make up for the limitations and propose a robust and efficient anonymous authentication protocol without loss of efficiency as compared with ECPP. Furthermore, in the proposed protocol, RSUs can issue multiple anonymous certificates to an OBU to alleviate system overheads for mutual authentication between OBUs and RSUs. In order to achieve these goals, we consider a universal re-encryption scheme and identity-based key establishment scheme as our building blocks. Several simulations are conducted to verify the efficiency and effectiveness of the proposed protocol by comparing with those of the existing ECPP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An IBC and certificate based hybrid approach to WiMAX security

    Page(s): 615 - 625
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (591 KB) |  | HTML iconHTML  

    Worldwide inter-operability for microwave access (WiMAX) is a promising technology that provides high data throughput with low delays for various user types and modes of operation. While much research had been conducted on physical and MAC layers, little attention has been paid to a comprehensive and efficient security solution for WiMAX. We propose a hybrid security solution combining identity-based cryptography (IBC) and certificate based approaches. We provide detailed message exchange steps in order to achieve a complete security that addresses the various kind of threats identified in previous research. While attaining this goal, efficient fusion of both techniques resulted in a 53% bandwidth improvement compared to the standard's approach, PKMv2. Also, in this hybrid approach, we have clarified the key revocation procedures and key lifetimes. Consequently, to the best of knowledge our approach is the first work that unites the advantages of both techniques for improved security while maintaining the low overhead for WiMAX. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A seamless lawful interception architecture for mobile users in IEEE 802.16e networks

    Page(s): 626 - 633
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2138 KB) |  | HTML iconHTML  

    Lawful interception (LI) involves legally accessing private communication such as telephone calls or email messages. Numerous countries have been drafting and enacting laws concerning the LI procedures. With the proliferation of portable Internet services such as the IEEE 802.16e wireless mobile networks, surveillance over illegal users is an emerging technical issue in LI. The ever-migrating users and their changing IP's make it harder to provide support for seamless LI procedures on 802.16e networks. Few studies, however, on seamless LI support have been conducted on the 802.16e mobile networks environments. Proposed in this paper are a seamless LI architecture and algorithms for the 802.16e networks. The simulation results demonstrate that the proposed architecture improves recall rates in intercepting mobile user, when compared to the existing LI architectures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formalizing the design, evaluation, and analysis of quality of protection in wireless networks

    Page(s): 634 - 644
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (762 KB) |  | HTML iconHTML  

    A diversity of wireless networks, with rapidly evolving wireless technology, are currently in service. Due to their innate physical layer vulnerability, wireless networks require enhanced security components. WLAN, WiBro, and UMTS have defined proper security components that meet standard security requirements. Extensive research has been conducted to enhance the security of individual wireless platforms, and we now have meaningful results at hand. However, with the advent of ubiquitous service, new horizontal platform service models with vertical cross-layer security are expected to be proposed. Research on synchronized security service and interoperability in a heterogeneous environment must be conducted. In heterogeneous environments, to design the balanced security components, quantitative evaluation model of security policy in wireless networks is required. To design appropriate evaluation method of security policies in heterogeneous wireless networks, we formalize the security properties in wireless networks. As the benefit of security protocols is indicated by the quality of protection (QoP), we improve the QoP model and evaluate hybrid security policy in heterogeneous wireless networks by applying to the QoP model. Deriving relative indicators from the positive impact of security points, and using these indicators to quantify a total reward function, this paper will help to assure the appropriate benchmark for combined security components in wireless networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reviewer list for 2009

    Page(s): 645 - 647
    Save to Project icon | Request Permissions | PDF file iconPDF (222 KB)  
    Freely Available from IEEE
  • Author index

    Page(s): 1 - 5
    Save to Project icon | Request Permissions | PDF file iconPDF (277 KB)  
    Freely Available from IEEE
  • Call for papers

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (453 KB)  
    Freely Available from IEEE
  • Call for papers

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (323 KB)  
    Freely Available from IEEE
  • Call for papers

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (336 KB)  
    Freely Available from IEEE
  • [Advertisement]

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (286 KB)  
    Freely Available from IEEE
  • Journal of Communications and Networks (JCN)

    Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (280 KB)  
    Freely Available from IEEE
  • [Back cover]

    Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (306 KB)  
    Freely Available from IEEE

Aims & Scope

The Journal of Communications and Networks is published six times per year, and is committed to publishing high-quality papers that advance the state-of-the-art and practical applications of communications and information networks.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
H. Vincent Poor
Princeton University