Forthcoming articles


International Journal of Security and Networks


These articles have been peer-reviewed and accepted for publication in IJSN, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.


Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.


Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.


Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.


Register for our alerting service, which notifies you by email when new issues of IJSN are published online.


We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.


International Journal of Security and Networks (3 papers in press)


Regular Issues


  • XOR-based Unexpanded Meaningful Visual Secret Sharing Scheme   Order a copy of this article
    by Suresh Prasad Kannojia, Jasvant Kumar 
    Abstract: Visual cryptography is a technique to conceal the secret information into n shares, distributed to n participants. When any k ≤ n, 2 ≤ k ≤ n, shares are printed on transparencies and stacked together, information about secret image can be revealed directly by the human visual system with poor visual quality. It is an issue for the researchers, to improve the quality of shares and reconstructed image. This paper proposes n-out-of- n, n = 2
    Keywords: Visually Pleasing shares;Meaningful Shares;Unexpanded Shares; XOR-operation; Secret Sharing; Visual Cryptography; Visual secret sharing Schemes; Pixel Expansion.

  • Group-IKEv2 for Multicast IPsec in the Internet of Things   Order a copy of this article
    by Kiki Rizki, Argyro Lamproudi, Marco Tiloca, Shahid Raza 
    Abstract: This paper presents Group-IKEv2, a group key management protocol supporting secure group communication based on multicast IPsec. Group-IKEv2 is an adaptation of the IKEv2 protocol for the IPsec suite, and is especially designed to address Internet of Things (IoT) scenarios composed of resource-constrained devices. Compared to static approaches, Group-IKEv2 enables dynamic and flexible establishment of IPsec Group Security Associations as well as group key material. Also, it enables the management and renewal of group key material on a periodical fashion and upon group membership changes. We have implemented Group-IKEv2 for the Contiki OS and tested it on the OpenMote resource-constrained platform. Our experimental performance evaluation confirms that Group-IKEv2 is affordable and deployable also on constrained IoT platforms.
    Keywords: Security; Group IKEv2; Multicast IPsec; Group communication; Secure communication; Key management; Internet of Things.

  • A DV-Hop Positioning algorithm Based on the Glowworm Swarm Optimization of Mixed Chaotic Strategy   Order a copy of this article
    by Ling Song, Liqin Zhao, Jin Ye 
    Abstract: DV-Hop, as a typical location algorithm without ranging, is widely used in node localization of wireless sensor networks. However, in the third phase of DV-Hop, a least square method is used to solve the nonlinear equations. Using this method to locate the unknown nodes will produce large coordinates errors, poor stability of positioning accuracy, low location coverage and high energy consumption. An improved localization algorithm based on hybrid chaotic strategy (MGDV-Hop) is proposed in this paper. Firstly, a glowworm swarm optimization of hybrid chaotic strategy based on chaotic mutation and chaotic inertial weight updating (MC-GSO) is proposed. Then, MC-GSO is used to replace the least square method in estimating node coordinates. By establishing the error fitness function, the linear solution of coordinates is transformed into a two-dimensional combinatorial optimization problem. Simulation results show that the average location error is reduced, while the location coverage is increased and the energy consumption is decreased.
    Keywords: node positioning; DV-Hop algorithm; glowworm swarm optimization algorithm.