Forthcoming articles


International Journal of Network Science


These articles have been peer-reviewed and accepted for publication in IJNS, 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 IJNS 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 Network Science (3 papers in press)


Regular Issues


  • Reliable and Authenticated Data Communication in Wireless Sensor Networks   Order a copy of this article
    by Asis Kumar Tripathy 
    Abstract: In this paper, a reliable and authenticated data communication procedure for clustered wireless sensor networks (CWSN) is proposed. The scheme has several steps, like, assigning the identity, shared secret key and an encryption key to the sensor nodes by the base station (BS). Determined by the innovation propels in micro-electronics, it is conceivable to run some key management techniques at each sensor level. This step helps in authentication of the sensors and secured communication in the network. Hence the sensor nodes are deployed in the threatening environments, because of the self healing nature of the sensors, they will form a network to transmit the data. The secured communicating protocol described in this paper ensures that, when two sensor nodes are in correspondence, they must have experienced prior authentication and key predistribution process. This scheme is invariant to the environment where the clusters are formed dynamically and periodically.
    Keywords: Wireless sensor network; clustering; key management;authentication.

  • A Priority Multi-channel Coordination MAC Protocol in Road-side Unit- Assisted Vehicular Networks   Order a copy of this article
    by Shamsan M.Qaashah, Rabie A. Ramadan, Magda B. Fayek 
    Abstract: This paper presents a priority-based RSU Assisted Multi-channel Coordination MAC protocol (PRAMC) for vehicular ad hoc network (VANET), The paper provides the priority for vehicles in the RSU polling list in order to poll vehicles according to their priorities. So, vehicles can transmit the high priority and important messages before low priority ones . A vehicle includes its priority with the association request frame. After RSU receives the association request, it adds the vehicle to a polling list according to its priority. RSU in this situation is responsible for control and safety messages broadcasted and non-safety application. The proposed protocol in this paper is an enhancement to the previous RAMC MAC protocol where no priority messages were considered. Our simulation results show high throughput for non-safety applications as compared to previous works. In addition, the results achieve high delivery ratios for different priorities of emergency warning messages (EWMs) and status safety messages in different traffic densities.
    Keywords: vehicular adhoc network; Multi-channel Coordination; Priority in vehicular network; emergency warning messages EWMs; status safety messages SSMs; Dedicated short-range communication (DSRC).

  • Correlation Analysis: Edge Betweenness Centrality vs. Neighborhood Overlap   Order a copy of this article
    by Natarajan Meghanathan, Fei Yang 
    Abstract: We explore the correlation between two well-known edge centrality metrics: a computationally-heavy metric called edge betweenness centrality (EBWC) and a computationally-light metric called neighborhood overlap (NOVER). Three different correlation measures are used for the analysis: Spearman's correlation measure (for network-wide ranking), Kendall's correlation measure (for pair-wise relative ordering) and Pearson's correlation measure (for regression-based prediction). A suite of 47 real-world networks of diverse degree distributions have been used for the correlation study. Results of the correlation analysis indicate that NOVER could be used as a computationally-light alternative to rank the edges (network-wide) in lieu of EBWC, but might not be appropriate to predict the actual EBWC values.
    Keywords: Edge betweenness centrality; Neighborhood overlap; Correlation; Computationally-heavy; Computationally-light.