Hybrid journal (It can contain Open Access articles) ISSN (Print) 2048-2175 - ISSN (Online) 2048-2183 Published by Inderscience Publishers[439 journals]
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Tri Ratna Saridewi, Akhmad Fauzi Pages: 269 - 282 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 pre-distribution process. This scheme is invariant to the environment where the clusters are formed dynamically and periodically. Keywords: wireless sensor network; WSN; clustering; key management; authentication Citation: International Journal of Network Science, Vol. 1, No. 4 (2019) pp. 269 - 282 PubDate: 2019-09-16T23:20:50-05:00 DOI: 10.1504/IJNS.2019.102269 Issue No:Vol. 1, No. 4 (2019)
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Shamsan M. Qaashah, Rabie A. Ramadan, Magda B. Fayek Pages: 283 - 298 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 ad hoc network; VANET; multi-channel coordination; priority in vehicular network; emergency warning messages; EWMs; status safety messages; SSMs; dedicated short-range communication; DSRC Citation: International Journal of Network Science, Vol. 1, No. 4 (2019) pp. 283 - 298 PubDate: 2019-09-16T23:20:50-05:00 DOI: 10.1504/IJNS.2019.102276 Issue No:Vol. 1, No. 4 (2019)
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Natarajan Meghanathan, Fei Yang Pages: 299 - 324 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 neighbourhood 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; EBWC; neighbourhood overlap; NOVER; correlation; computationally-heavy; computationally-light Citation: International Journal of Network Science, Vol. 1, No. 4 (2019) pp. 299 - 324 PubDate: 2019-09-16T23:20:50-05:00 DOI: 10.1504/IJNS.2019.102284 Issue No:Vol. 1, No. 4 (2019)
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Mahzabin Akhter, Md Atiqur Rahman, Natarajan Meghanathan Pages: 325 - 343 Abstract: We model a disease-disease network as an undirected graph of diseases (vertices) wherein two vertices are connected with an edge if the corresponding diseases have one or more common associated genes (the number of common genes is the weight of the edge). In such a weighted graph, a disease with a larger number of common genes with several other diseases is more likely to incur a higher eigenvector centrality (EVC). Our hypothesis is that a person with a higher EVC disease is more likely to acquire other related diseases compared to a person with a lower EVC disease. We tested our hypothesis on the disease-disease network constructed from the results of the disease-gene association studies reported in the NIH GWAS catalogue and OMIM database. The disease EVC values exhibited a Pareto distribution (80-20 rule): around 18 % of the diseases have larger and significantly different EVC values and the remaining 82% of the diseases had lower and similar EVC values. This implies that around 18% of the diseases in humans are more likely to have a larger likelihood of leading to other diseases. Keywords: eigenvector centrality; EVC; disease-disease network; disease-gene association; Pareto distribution Citation: International Journal of Network Science, Vol. 1, No. 4 (2019) pp. 325 - 343 PubDate: 2019-09-16T23:20:50-05:00 DOI: 10.1504/IJNS.2019.102296 Issue No:Vol. 1, No. 4 (2019)
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Shiva Karimi, Yousef Darmani Pages: 344 - 356 Abstract: Internet of things (IoT) is defined by networks of physical objects called smart things able to sense the environment, compute the results and communicate among themselves. IoT development needs to overcome many challenges regarding its constraints. Using IoT devices in delay tolerant networks (DTNs) scheme seems to be a solution to overcome its resource constraints and intermittent connectivity. Limited available battery and buffer size in small objects motivates the researchers to find optimised DTN routing schemes. DTNs are wireless networks that do not often have an end to end path between the source and destination objects. Epidemic routing (ER) protocol is a simple way to perform routing in such networks which is not effective from the energy point of view. To solve this problem the probabilistic epidemic (p-epidemic) routing protocol for the heterogeneous sets of smart objects is suggested. The accuracy of this forwarding method is supported by simulation results. Keywords: delay tolerant networks; DTN; energy consumption; heterogeneous network; probabilistic epidemic forwarding; transmission probability; internet of things; IoT Citation: International Journal of Network Science, Vol. 1, No. 4 (2019) pp. 344 - 356 PubDate: 2019-09-16T23:20:50-05:00 DOI: 10.1504/IJNS.2019.102300 Issue No:Vol. 1, No. 4 (2019)