Displaying publications 1 - 20 of 89 in total

Abstract:
Sort:
  1. Fulltext Fairness-Oriented Semichaotic Genetic Algorithm-Based Channel Assignment Technique for Node Starvation Problem in Wireless Mesh Networks
    Ghaleb FA, Al-Rimy BAS, Boulila W, Saeed F, Kamat M, Foad Rohani M, et al.
    Comput Intell Neurosci, 2021;2021:2977954.
    PMID: 34413885 DOI: 10.1155/2021/2977954
    Wireless mesh networks (WMNs) have emerged as a scalable, reliable, and agile wireless network that supports many types of innovative technologies such as the Internet of Things (IoT), Wireless Sensor Networks (WSN), and Internet of Vehicles (IoV). Due to the limited number of orthogonal channels, interference between channels adversely affects the fair distribution of bandwidth among mesh clients, causing node starvation in terms of insufficient bandwidth distribution, which impedes the adoption of WMN as an efficient access technology. Therefore, a fair channel assignment is crucial for the mesh clients to utilize the available resources. However, the node starvation problem due to unfair channel distribution has been vastly overlooked during channel assignment by the extant research. Instead, existing channel assignment algorithms equally distribute the interference reduction on the links to achieve fairness which neither guarantees a fair distribution of the network bandwidth nor eliminates node starvation. In addition, the metaheuristic-based solutions such as genetic algorithm, which is commonly used for WMN, use randomness in creating initial population and selecting the new generation usually leading the search to local minima. To this end, this study proposes a Fairness-Oriented Semichaotic Genetic Algorithm-Based Channel Assignment Technique (FA-SCGA-CAA) to solve node starvation problem in wireless mesh networks. FA-SCGA-CAA maximizes link fairness while minimizing link interference using a genetic algorithm (GA) with a novel nonlinear fairness-oriented fitness function. The primary chromosome with powerful genes is created based on multicriterion links ranking channel assignment algorithm. Such a chromosome was used with a proposed semichaotic technique to create a strong population that directs the search towards the global minima effectively and efficiently. The proposed semichaotic technique was also used during the mutation and parent selection of the new genes. Extensive experiments were conducted to evaluate the proposed algorithm. A comparison with related work shows that the proposed FA-SCGA-CAA reduced the potential node starvation by 22% and improved network capacity utilization by 23%. It can be concluded that the proposed FA-SCGA-CAA is reliable to maintain high node-level fairness while maximizing the utilization of the network resources, which is the ultimate goal of many wireless networks.
    Matched MeSH terms: Computer Communication Networks*
  2. Fulltext A Neighborhood and Machine Learning-Enabled Information Fusion Approach for the WSNs and Internet of Medical Things
    Khan ZA, Naz S, Khan R, Teo J, Ghani A, Almaiah MA
    Comput Intell Neurosci, 2022;2022:5112375.
    PMID: 35449734 DOI: 10.1155/2022/5112375
    Data redundancy or fusion is one of the common issues associated with the resource-constrained networks such as Wireless Sensor Networks (WSNs) and Internet of Things (IoTs). To resolve this issue, numerous data aggregation or fusion schemes have been presented in the literature. Generally, it is used to decrease the size of the collected data and, thus, improve the performance of the underlined IoTs in terms of congestion control, data accuracy, and lifetime. However, these approaches do not consider neighborhood information of the devices (cluster head in this case) in the data refinement phase. In this paper, a smart and intelligent neighborhood-enabled data aggregation scheme is presented where every device (cluster head) is bounded to refine the collected data before sending it to the concerned server module. For this purpose, the proposed data aggregation scheme is divided into two phases: (i) identification of neighboring nodes, which is based on the MAC address and location, and (ii) data aggregation using k-mean clustering algorithm and Support Vector Machine (SVM). Furthermore, every CH is smart enough to compare data sets of neighboring nodes only; that is, data of nonneighbor is not compared at all. These algorithms were implemented in Network Simulator 2 (NS-2) and were evaluated in terms of various performance metrics, such as the ratio of data redundancy, lifetime, and energy efficiency. Simulation results have verified that the proposed scheme performance is better than the existing approaches.
    Matched MeSH terms: Computer Communication Networks*
  3. Blind source computer device identification from recorded VoIP calls for forensic investigation
    Jahanirad M, Anuar NB, Wahab AWA
    Forensic Sci Int, 2017 Mar;272:111-126.
    PMID: 28129583 DOI: 10.1016/j.forsciint.2017.01.010
    The VoIP services provide fertile ground for criminal activity, thus identifying the transmitting computer devices from recorded VoIP call may help the forensic investigator to reveal useful information. It also proves the authenticity of the call recording submitted to the court as evidence. This paper extended the previous study on the use of recorded VoIP call for blind source computer device identification. Although initial results were promising but theoretical reasoning for this is yet to be found. The study suggested computing entropy of mel-frequency cepstrum coefficients (entropy-MFCC) from near-silent segments as an intrinsic feature set that captures the device response function due to the tolerances in the electronic components of individual computer devices. By applying the supervised learning techniques of naïve Bayesian, linear logistic regression, neural networks and support vector machines to the entropy-MFCC features, state-of-the-art identification accuracy of near 99.9% has been achieved on different sets of computer devices for both call recording and microphone recording scenarios. Furthermore, unsupervised learning techniques, including simple k-means, expectation-maximization and density-based spatial clustering of applications with noise (DBSCAN) provided promising results for call recording dataset by assigning the majority of instances to their correct clusters.
    Matched MeSH terms: Computer Communication Networks*
  4. The development and design of an electronic patient record using open source web-based technology
    Syed-Mohamad SM, Ali SH, Mat-Husin MN
    Health Inf Manag, 2010;39(1):30-5.
    PMID: 20335647
    This paper describes the method used to develop the One Stop Crisis Centre (OSCC) Portal, an open source web-based electronic patient record system (EPR) for the One Stop Crisis Center, Hospital Universiti Sains Malaysia (HUSM) in Kelantan, Malaysia. Features and functionalities of the system are presented to demonstrate the workflow. Use of the OSCC Portal improved data integration and data communication and contributed to improvements in care management. With implementation of the OSCC portal, improved coordination between disciplines and standardisation of data in HUSM were noticed. It is expected that this will in turn result in improved data confidentiality and data integrity. The collected data will also be useful for quality assessment and research. Other low-resource centers with limited computer hardware and access to open-source software could benefit from this endeavour.
    Matched MeSH terms: Computer Communication Networks
  5. Malaysia's 21st century goal: IT-based health gains for one and all
    Spohr MH
    Healthc Inform, 2000 Apr;17(4):49-52, 54.
    PMID: 11066568
    Matched MeSH terms: Computer Communication Networks/organization & administration*
  6. Developing a Web 2.0 telemedical education system: the AJAX-Cocoon portal
    Mohammed S, Orabi A, Fiaidhi J, Orabi M, R. Benlamri
    Int J Electron Healthc, 2008;4(1):24-42.
    PMID: 18583294
    Web 2.0 technologies such as wikis, podcasts/vodcasting, blogs and semantic portals could be quite effective tools in e-learning for health professionals. If effectively deployed, such tools can offer a way to enhance students', clinicians' and patients' learning experiences, and deepens levels of learners' engagement and collaboration within medical learning environments. However, Web 2.0 requires simplicity of use as well as integration with modern web technologies. This article presents a Web 2.0 telemedical portal, which provides a social community-learning paradigm from the desk of the physician, the student, the hospital administrator, or the insurer. The presented portal utilises RESTful web services and techniques like content syndication, mushups and Asynchronous JavaScript API and XML (AJAX). The designed portal is based on the Apache Cocoon RESTful framework for sharing Digital Imaging and Communications in Medicine (DICOM) medical case studies. Central to this article is the integration between Cocoon and AJAX. The proposed AJAX-Cocoon portal utilises a JSP portlet architecture, which manages the interaction dynamics and overcomes the shortcomings of the JSR 168 and WSRP 1.0 standards.
    Matched MeSH terms: Computer Communication Networks/organization & administration
  7. Fulltext A model for online interactive remote education for medical physics using the Internet
    Woo MK, Ng KH
    J Med Internet Res, 2003 Jan-Mar;5(1):e3.
    PMID: 12746208
    Medical physics is a relatively small community but it spans great geographical distances, usually with a scarcity of experts whose expertise could greatly benefit students entering into the field. In addition there are many software systems for which an interactive education method would be most advantageous.
    Matched MeSH terms: Computer Communication Networks/economics; Computer Communication Networks/trends
  8. A novel strategy for load balancing of distributed medical applications
    Logeswaran R, Chen LC
    J Med Syst, 2012 Apr;36(2):483-90.
    PMID: 20703702 DOI: 10.1007/s10916-010-9493-0
    Current trends in medicine, specifically in the electronic handling of medical applications, ranging from digital imaging, paperless hospital administration and electronic medical records, telemedicine, to computer-aided diagnosis, creates a burden on the network. Distributed Service Architectures, such as Intelligent Network (IN), Telecommunication Information Networking Architecture (TINA) and Open Service Access (OSA), are able to meet this new challenge. Distribution enables computational tasks to be spread among multiple processors; hence, performance is an important issue. This paper proposes a novel approach in load balancing, the Random Sender Initiated Algorithm, for distribution of tasks among several nodes sharing the same computational object (CO) instances in Distributed Service Architectures. Simulations illustrate that the proposed algorithm produces better network performance than the benchmark load balancing algorithms-the Random Node Selection Algorithm and the Shortest Queue Algorithm, especially under medium and heavily loaded conditions.
    Matched MeSH terms: Computer Communication Networks/organization & administration
  9. Node status algorithm for load balancing in distributed service architectures at paperless medical institutions
    Logeswaran R, Chen LC
    J Med Syst, 2008 Dec;32(6):453-61.
    PMID: 19058649
    Service architectures are necessary for providing value-added services in telecommunications networks, including those in medical institutions. Separation of service logic and control from the actual call switching is the main idea of these service architectures, examples include Intelligent Network (IN), Telecommunications Information Network Architectures (TINA), and Open Service Access (OSA). In the Distributed Service Architectures (DSA), instances of the same object type can be placed on different physical nodes. Hence, the network performance can be enhanced by introducing load balancing algorithms to efficiently distribute the traffic between object instances, such that the overall throughput and network performance can be optimised. In this paper, we propose a new load balancing algorithm called "Node Status Algorithm" for DSA infrastructure applicable to electronic-based medical institutions. The simulation results illustrate that this proposed algorithm is able to outperform the benchmark load balancing algorithms-Random Algorithm and Shortest Queue Algorithm, especially under medium and heavily loaded network conditions, which are typical of the increasing bandwidth utilization and processing requirements at paperless hospitals and in the telemedicine environment.
    Matched MeSH terms: Computer Communication Networks/organization & administration*
  10. Evaluation of the first international teleconference in ophthalmology
    Papakostopoulos D, Williams A, Ramani V, Hart CJ, Dodson K, Papakostopoulos S
    J Telemed Telecare, 1999;5 Suppl 1:S17-20.
    PMID: 10534828
    The First International Teleconference in Ophthalmology was held during March 1998 between five sites in the UK, USA, Greece and Malaysia. ISDN transmission at 128 kbit/s was used to reduce costs while maintaining the clarity of the presented material. Specialized lecture theatres were not available at all sites and conventional halls had to be adapted for videoconferencing. For this reason initial point-to-point testing was carried with Bristol to simplify problem solving. Thereafter, a multipoint bridge was used to connect all sites together. During the conference a number of individual presentations were given, all followed by extensive discussion periods. Special instructions were given beforehand on the production of slide material, with particular reference to font sizes and colour combinations. Full use was made of various presentation media, including slides, videos and live demonstrations. The conference was attended by over 500 delegates, all of whom were specialists in ophthalmology. The technology employed was ideal for teaching purposes. However, if used in a clinical field, it should be kept in mind that the choice of transmission rate makes certain features not easily apparent in images but they become clearer when pointed out by the presenter.
    Matched MeSH terms: Computer Communication Networks
  11. Locating fish bomb blasts in real-time using a networked acoustic system
    Showen R, Dunson C, Woodman GH, Christopher S, Lim T, Wilson SC
    Mar Pollut Bull, 2018 Mar;128:496-507.
    PMID: 29571401 DOI: 10.1016/j.marpolbul.2018.01.029
    Results are presented of a demonstration of real-time fish blast location in Sabah, Malaysia using a networked hydroacoustic array based on the ShotSpotter gunshot location system. A total of six acoustic sensors - some fixed and others mobile - were deployed at ranges from 1 to 9 km to detect signals from controlled test blasts. This allowed the blast locations to be determined to within 60 m accuracy, and for the calculated locations to be displayed on a map on designated internet-connected computers within 10 s. A smaller three-sensor system was then installed near Semporna in Eastern Sabah that determined the locations of uncontrolled blasts set off by local fishermen. The success of these demonstrations shows that existing technology can be used to protect reefs and permit more effective management of blast fishing activity through improved detection and enforcement measures and enhanced community engagement.
    Matched MeSH terms: Computer Communication Networks
  12. Fulltext Perceived COVID-19 vaccine effectiveness, acceptance, and drivers of vaccination decision-making among the general adult population: A global survey of 20 countries
    Marzo RR, Ahmad A, Islam MS, Essar MY, Heidler P, King I, et al.
    PLoS Negl Trop Dis, 2022 01;16(1):e0010103.
    PMID: 35089917 DOI: 10.1371/journal.pntd.0010103
    BACKGROUND: Mass vaccination campaigns have significantly reduced the COVID-19 burden. However, vaccine hesitancy has posed significant global concerns. The purpose of this study was to determine the characteristics that influence perceptions of COVID-19 vaccine efficacy, acceptability, hesitancy and decision making to take vaccine among general adult populations in a variety of socioeconomic and cultural contexts.

    METHODS: Using a snowball sampling approach, we conducted an online cross-sectional study in 20 countries across four continents from February to May 2021.

    RESULTS: A total of 10,477 participants were included in the analyses with a mean age of 36±14.3 years. The findings revealed the prevalence of perceptions towards COVID-19 vaccine's effectiveness (78.8%), acceptance (81.8%), hesitancy (47.2%), and drivers of vaccination decision-making (convenience [73.3%], health providers' advice [81.8%], and costs [57.0%]). The county-wise distribution included effectiveness (67.8-95.9%; 67.8% in Egypt to 95.9% in Malaysia), acceptance (64.7-96.0%; 64.7% in Australia to 96.0% in Malaysia), hesitancy (31.5-86.0%; 31.5% in Egypt to 86.0% in Vietnam), convenience (49.7-95.7%; 49.7% in Austria to 95.7% in Malaysia), advice (66.1-97.3%; 66.1% in Austria to 97.3% in Malaysia), and costs (16.0-91.3%; 16.0% in Vietnam to 91.3% in Malaysia). In multivariable regression analysis, several socio-demographic characteristics were identified as associated factors of outcome variables including, i) vaccine effectiveness: younger age, male, urban residence, higher education, and higher income; ii) acceptance: younger age, male, urban residence, higher education, married, and higher income; and iii) hesitancy: male, higher education, employed, unmarried, and lower income. Likewise, the factors associated with vaccination decision-making including i) convenience: younger age, urban residence, higher education, married, and lower income; ii) advice: younger age, urban residence, higher education, unemployed/student, married, and medium income; and iii) costs: younger age, higher education, unemployed/student, and lower income.

    CONCLUSIONS: Most participants believed that vaccination would effectively control and prevent COVID-19, and they would take vaccinations upon availability. Determinant factors found in this study are critical and should be considered as essential elements in developing COVID-19 vaccination campaigns to boost vaccination uptake in the populations.

    Matched MeSH terms: Computer Communication Networks
  13. Fulltext Improving the performance of opportunistic routing using min-max range and optimum energy level for relay node selection in wireless sensor networks
    Yee PL, Mehmood S, Almogren A, Ali I, Anisi MH
    PeerJ Comput Sci, 2020;6:e326.
    PMID: 33816976 DOI: 10.7717/peerj-cs.326
    Opportunistic routing is an emerging routing technology that was proposed to overcome the drawback of unreliable transmission, especially in Wireless Sensor Networks (WSNs). Over the years, many forwarder methods were proposed to improve the performance in opportunistic routing. However, based on existing works, the findings have shown that there is still room for improvement in this domain, especially in the aspects of latency, network lifetime, and packet delivery ratio. In this work, a new relay node selection method was proposed. The proposed method used the minimum or maximum range and optimum energy level to select the best relay node to forward packets to improve the performance in opportunistic routing. OMNeT++ and MiXiM framework were used to simulate and evaluate the proposed method. The simulation settings were adopted based on the benchmark scheme. The evaluation results showed that our proposed method outperforms in the aspect of latency, network lifetime, and packet delivery ratio as compared to the benchmark scheme.
    Matched MeSH terms: Computer Communication Networks
  14. Fulltext Geographic wormhole detection in wireless sensor networks
    Sookhak M, Akhundzada A, Sookhak A, Eslaminejad M, Gani A, Khurram Khan M, et al.
    PLoS One, 2015;10(1):e0115324.
    PMID: 25602616 DOI: 10.1371/journal.pone.0115324
    Wireless sensor networks (WSNs) are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS) attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS) attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP). The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS), Authentication of Nodes Scheme (ANS), Wormhole Detection uses Hound Packet (WHOP), and Wormhole Detection with Neighborhood Information (WDI) using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR) in the geographic routing protocols.
    Matched MeSH terms: Computer Communication Networks*
  15. Fulltext A lightweight distributed framework for computational offloading in mobile cloud computing
    Shiraz M, Gani A, Ahmad RW, Adeel Ali Shah S, Karim A, Rahman ZA
    PLoS One, 2014;9(8):e102270.
    PMID: 25127245 DOI: 10.1371/journal.pone.0102270
    The latest developments in mobile computing technology have enabled intensive applications on the modern Smartphones. However, such applications are still constrained by limitations in processing potentials, storage capacity and battery lifetime of the Smart Mobile Devices (SMDs). Therefore, Mobile Cloud Computing (MCC) leverages the application processing services of computational clouds for mitigating resources limitations in SMDs. Currently, a number of computational offloading frameworks are proposed for MCC wherein the intensive components of the application are outsourced to computational clouds. Nevertheless, such frameworks focus on runtime partitioning of the application for computational offloading, which is time consuming and resources intensive. The resource constraint nature of SMDs require lightweight procedures for leveraging computational clouds. Therefore, this paper presents a lightweight framework which focuses on minimizing additional resources utilization in computational offloading for MCC. The framework employs features of centralized monitoring, high availability and on demand access services of computational clouds for computational offloading. As a result, the turnaround time and execution cost of the application are reduced. The framework is evaluated by testing prototype application in the real MCC environment. The lightweight nature of the proposed framework is validated by employing computational offloading for the proposed framework and the latest existing frameworks. Analysis shows that by employing the proposed framework for computational offloading, the size of data transmission is reduced by 91%, energy consumption cost is minimized by 81% and turnaround time of the application is decreased by 83.5% as compared to the existing offloading frameworks. Hence, the proposed framework minimizes additional resources utilization and therefore offers lightweight solution for computational offloading in MCC.
    Matched MeSH terms: Computer Communication Networks*
  16. Fulltext Cryptanalysis and Improvement of "A Secure Password Authentication Mechanism for Seamless Handover in Proxy Mobile IPv6 Networks"
    Alizadeh M, Zamani M, Baharun S, Abdul Manaf A, Sakurai K, Anada H, et al.
    PLoS One, 2015;10(11):e0142716.
    PMID: 26580963 DOI: 10.1371/journal.pone.0142716
    Proxy Mobile IPv6 is a network-based localized mobility management protocol that supports mobility without mobile nodes' participation in mobility signaling. The details of user authentication procedure are not specified in this standard, hence, many authentication schemes have been proposed for this standard. In 2013, Chuang et al., proposed an authentication method for PMIPv6, called SPAM. However, Chuang et al.'s Scheme protects the network against some security attacks, but it is still vulnerable to impersonation and password guessing attacks. In addition, we discuss other security drawbacks such as lack of revocation procedure in case of loss or stolen device, and anonymity issues of the Chuang et al.'s scheme. We further propose an enhanced authentication method to mitigate the security issues of SPAM method and evaluate our scheme using BAN logic.
    Matched MeSH terms: Computer Communication Networks*
  17. Fulltext Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks
    Al-Nahari A, Mohamad MM
    PLoS One, 2016;11(6):e0156670.
    PMID: 27258013 DOI: 10.1371/journal.pone.0156670
    Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.
    Matched MeSH terms: Computer Communication Networks*
  18. Fulltext Pliable Cognitive MAC for Heterogeneous Adaptive Cognitive Radio Sensor Networks
    Al-Medhwahi M, Hashim F, Ali BM, Sali A
    PLoS One, 2016;11(6):e0156880.
    PMID: 27257964 DOI: 10.1371/journal.pone.0156880
    The rapid expansion of wireless monitoring and surveillance applications in several domains reinforces the trend of exploiting emerging technologies such as the cognitive radio. However, these technologies have to adjust their working concepts to consider the common characteristics of conventional wireless sensor networks (WSNs). The cognitive radio sensor network (CRSN), still an immature technology, has to deal with new networks that might have different types of data, traffic patterns, or quality of service (QoS) requirements. In this paper, we design and model a new cognitive radio-based medium access control (MAC) algorithm dealing with the heterogeneous nature of the developed networks in terms of either the traffic pattern or the required QoS for the node applications. The proposed algorithm decreases the consumed power on several fronts, provides satisfactory levels of latency and spectrum utilization with efficient scheduling, and manages the radio resources for various traffic conditions. An intensive performance evaluation is conducted to study the impact of key parameters such as the channel idle time length, node density, and the number of available channels. The performance evaluation of the proposed algorithm shows a better performance than the comparable protocols. Moreover, the results manifest that the proposed algorithm is suitable for real time monitoring applications.
    Matched MeSH terms: Computer Communication Networks*
  19. Fulltext An Efficient Next Hop Selection Algorithm for Multi-Hop Body Area Networks
    Ayatollahitafti V, Ngadi MA, Mohamad Sharif JB, Abdullahi M
    PLoS One, 2016;11(1):e0146464.
    PMID: 26771586 DOI: 10.1371/journal.pone.0146464
    Body Area Networks (BANs) consist of various sensors which gather patient's vital signs and deliver them to doctors. One of the most significant challenges faced, is the design of an energy-efficient next hop selection algorithm to satisfy Quality of Service (QoS) requirements for different healthcare applications. In this paper, a novel efficient next hop selection algorithm is proposed in multi-hop BANs. This algorithm uses the minimum hop count and a link cost function jointly in each node to choose the best next hop node. The link cost function includes the residual energy, free buffer size, and the link reliability of the neighboring nodes, which is used to balance the energy consumption and to satisfy QoS requirements in terms of end to end delay and reliability. Extensive simulation experiments were performed to evaluate the efficiency of the proposed algorithm using the NS-2 simulator. Simulation results show that our proposed algorithm provides significant improvement in terms of energy consumption, number of packets forwarded, end to end delay and packet delivery ratio compared to the existing routing protocol.
    Matched MeSH terms: Computer Communication Networks
  20. Fulltext Distributed clone detection in static wireless sensor networks: random walk with network division
    Khan WZ, Aalsalem MY, Saad NM
    PLoS One, 2015;10(5):e0123069.
    PMID: 25992913 DOI: 10.1371/journal.pone.0123069
    Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.
    Matched MeSH terms: Computer Communication Networks/instrumentation*
Related Terms
Filters
Contact Us

Please provide feedback to Administrator (afdal@afpm.org.my)

External Links