Security and Communication Networks

Cover image for Vol. 4 Issue 9

Special Issue: Special Issue on Security challenges in emerging and next-generation wireless communication networks

September 2011

Volume 4, Issue 9

Pages 979–1087, e1–e1

Issue edited by: Sudip Misra, Mieso Denko, Hussein Mouftah

  1. Guest Editorial

    1. Top of page
    2. Guest Editorial
    3. Special Issue Papers
    4. Special Issue Articles
    5. Special Issue Papers
    6. Call for Papers
    1. You have free access to this content
  2. Special Issue Papers

    1. Top of page
    2. Guest Editorial
    3. Special Issue Papers
    4. Special Issue Articles
    5. Special Issue Papers
    6. Call for Papers
    1. A WLAN security management framework based on formal spatio-temporal RBAC model (pages 981–993)

      P. Bera, S. K. Ghosh and Pallab Dasgupta

      Article first published online: 28 AUG 2010 | DOI: 10.1002/sec.232

      Thumbnail image of graphical abstract

      The proposed WLAN security management framework is based on a formal spatio-temporal RBAC model, which dynamically computes the security policies depending on user-role, location and different control state information. It uses a distributed policy zone architecture for systematic enforcement of the spatio-temporal access control policies in the network. The security properties of the framework have been verified using Boolean satisfiability analysis.

    2. End-to-end protocol to secure ad hoc networks against wormhole attacks (pages 994–1002)

      Sandhya Khurana and Neelima Gupta

      Article first published online: 12 JAN 2011 | DOI: 10.1002/sec.272

      Thumbnail image of graphical abstract

      Most of the protocols to defend ad hoc networks against wormhole attacks rely on ‘trust your neighbor’ relationship. We present an algorithm against wormhole attacks, which is end-to-end and more efficient than the existing one (end-to-end) both in terms of space and time. We do not need clock synchronization or any special type of hardware.

  3. Special Issue Articles

    1. Top of page
    2. Guest Editorial
    3. Special Issue Papers
    4. Special Issue Articles
    5. Special Issue Papers
    6. Call for Papers
    1. Local geometric algorithm for hole boundary detection in sensor networks (pages 1003–1012)

      Amit Shirsat and Bharat Bhargava

      Article first published online: 11 MAR 2011 | DOI: 10.1002/sec.271

      Thumbnail image of graphical abstract

      Graphical representation of boundary of regions in an ad hoc network using a local geometric algorithm.

  4. Special Issue Papers

    1. Top of page
    2. Guest Editorial
    3. Special Issue Papers
    4. Special Issue Articles
    5. Special Issue Papers
    6. Call for Papers
    1. An efficient approach of secure group association management in densely deployed heterogeneous distributed sensor network (pages 1013–1026)

      Al-Sakib Khan Pathan, Muhammad Mostafa Monowar, Jinfang Jiang, Lei Shu and Guangjie Han

      Article first published online: 13 DEC 2010 | DOI: 10.1002/sec.277

      Thumbnail image of graphical abstract

      A new deployment model for distributed sensor networks is presented. Based on this model, a secure group association management scheme is proposed. We have analyzed our model and the proposed schemes from various angles and found that the proposed approach could perform well in practical deployment cases.

    2. An efficient scheme to handle bursty behavior in secure group communication using binomial key trees (pages 1027–1043)

      R. Aparna and B. B. Amberker

      Article first published online: 4 OCT 2010 | DOI: 10.1002/sec.250

      Thumbnail image of graphical abstract

      In secure group communication model users in the group communicate among themselves securely. A group key is used to provide security for the messages. Some applications like pay-per-view, periodical electronic information distribution etc., are relied on secure group communication model, many users join and leave the group at the same moment known as bursty behavior. In this paper we propose a scheme for handling bursty behavior. We use binomial key tree for managing the secure group, which is quite efficient in handling rekeying strategies. We show that our scheme is efficient by comparing with other existing schemes.

    3. Digital forensics of WLM 8.1 via check point methodology within corporate intranet in future communication security (pages 1044–1062)

      Hai-Cheng Chu, Der-Jiunn Deng and Han-Chieh Chao

      Article first published online: 15 JUL 2010 | DOI: 10.1002/sec.233

      Thumbnail image of graphical abstract

      The overall system architecture is depicted in the figure.We proposed the CP methodology, which would collect the digital evidences with respect to a generic WLM session. The CP methodology includes the digital evidence collection on both crime scene and non-crime scene. As the figure illustrates, Check Point 1 is the crime scene and Check Point 2 is the non-crime scene.

    4. Improved IPsec performance utilizing transport-layer-aware compression architecture (pages 1063–1074)

      Jung-Shian Li, Che-Jen Hsieh, Chih-Ying Chang and Naveen Chilamkurti

      Article first published online: 5 NOV 2010 | DOI: 10.1002/sec.257

      Thumbnail image of graphical abstract

      IPsec is the most commonly used to improve network security. However it results in a large packet size and a long processing time. This paper proposes new compression architecture, designated as Efficient Secure Pipe (ES_PIPE), to improve both the security and the performance of IPv6 networks. The ES_PIPE provides a transport-layer-aware compression capability for different types of packets. The experimental results show that the proposed scheme provides a more efficient compression performance than IPsec.

    5. A self-stabilized random access protocol against denial of service attack in wireless networks (pages 1075–1087)

      Jahangir H. Sarker and Hussein T. Mouftah

      Article first published online: 3 DEC 2010 | DOI: 10.1002/sec.248

      Thumbnail image of graphical abstract

      The stability of multi-channel Slotted ALOHA in the presence of random attacking noise packets signals is studied in this paper. The use of multichannel schemes of Slotted ALOHA can reduce the collisions. A message packet is more powerful for colliding with another message packet than that of an attacking noise packet. Throughput with message packet perfect capture is higher than that of the throughput with attacking noise packet perfect capture.

  5. Call for Papers

    1. Top of page
    2. Guest Editorial
    3. Special Issue Papers
    4. Special Issue Articles
    5. Special Issue Papers
    6. Call for Papers
    1. You have free access to this content

SEARCH

SEARCH BY CITATION