Evidence map›Paper›PMID 27409082›Full record

ArticlePloS one2016

A New Random Walk for Replica Detection in WSNs.

Mohammed Y Aalsalem, Wazir Zada Khan, N M Saad, Md Shohrab Hossain, Mohammed Atiquzzaman, Muhammad Khurram Khan

Open access · goldAbstract read
In one paragraph

Article in PloS one, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
2.7field-weighted citation impact, top 9% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed, 21 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors at 5 institutions in 4 countries.

Mohammed Y AalsalemFarasan Networking Research Laboratory, Faculty of CS & IS, Jazan University, Jazan, Kingdom of Saudi Arabia.
Wazir Zada KhanFarasan Networking Research Laboratory, Faculty of CS & IS, Jazan University, Jazan, Kingdom of Saudi Arabia.ORCID http://orcid.org/0000-0003-0819-4236
N M SaadElectrical and Electronic Engineering Department, Universiti Teknologi PETRONAS, Bandar Seri Iskandar, Tronoh, Perak Malaysia.
Md Shohrab HossainDepartment of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh.
Mohammed AtiquzzamanSchool of Computer Science, University of Oklahoma, Norman, Oklahoma, United States of America.
Muhammad Khurram KhanCenter of Excellence in Information Assurance, King Saud University, Riyadh, Kingdom of Saudi Arabia.
Jazan University · SABangladesh University of Engineering and Technology · BDKing Saud University · SAUniversiti Teknologi Petronas · MYUniversity of Oklahoma · US

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.

Indexed as

Computer Communication NetworksComputer SecurityWireless TechnologyAlgorithmsComputer SimulationSoftware

Identifiers

PMID27409082
PMCPMC4943645
OpenAlexW2469880262

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.