In this paper, we propose a novel compressive sensing (CS) based approach for sparse target counting and positioning in wireless sensor networks. While this is not the first work on applying CS to count and localize targets, it is the first to rigorously justify the validity of the problem formulation. Moreover, we propose a novel greedy matching pursuit algorithm (GMP) that complements the well-known signal recovery algorithms in CS theory and prove that GMP can accurately recover a sparse signal with a high probability. We also propose a framework for counting and positioning targets from multiple categories, a novel problem that has never been addressed before. Finally, we perform a comprehensive set of simulations whose results demonstrate the superiority of our approach over the existing CS and non-CS based techniques.

/pdf/sparse-target-counting-and-localization-in-sensor-networks-j30pzycvs5.pdf

Sparse target counting and localization in sensor networks based on compressive sensing

Summary

User authentication is a prominent security requirement in wireless sensor networks (WSNs) for accessing the real-time data from the sensors directly by a legitimate user (external party). Several user authentication schemes are proposed in the literature. However, most of them are either vulnerable to different known attacks or they are inefficient. Recently, Althobaiti et al. presented a biometric-based user authentication scheme for WSNs. Although their scheme is efficient in computation, in this paper, we first show that their scheme has several security pitfalls such as (i) it is not resilient against node capture attack; (ii) it is insecure against impersonation attack; and (iii) it is insecure against man-in-the-middle attack. We then aim to propose a novel biometric-based user authentication scheme suitable for WSNs in order to withstand the security pitfalls found in Althobaiti et al. scheme. We show through the rigorous security analysis that our scheme is secure and satisfies the desirable security requirements. Furthermore, the simulation results for the formal security verification using the most widely used and accepted Automated Validation of Internet Security Protocols and Applications tool indicate that our scheme is secure. Our scheme is also efficient compared with existing related schemes. Copyright © 2015 John Wiley & Sons, Ltd.

A secure and effective biometric‐based user authentication scheme for wireless sensor networks using smart card and fuzzy extractor

The rapid increase in the complexity and the extent of personalization of services in the Internet of Things IoT has led to a greater demand for frequent collaboration among heterogeneous devices. Moreover, with the inseparable relations between human and devices, the paradigm of Social IoT SIoT is gaining popularity in recent years. How to effectively facilitate the access to quality services and credible devices in large-scale networks via defining, establishing, and managing social architectures among things has become a critical issue. In this paper, a scheme of access service recommendation for the SIoT is presented with the understanding of inherent constraints and factors that influence the security and stability of IoT networks. In which, timeliness properties are considered in each transaction for dynamic performance enhancements. With the benefits of promoting service discovery and composition, social relationships among things are introduced in the proposed scheme. An energy-aware mechanism is also utilized as a restrictive factor in trustworthiness evaluation. Finally, the recommendation is based not only on the past performance but also on the social relationship and the energy status of nodes. Simulation experiments demonstrate the effectiveness and benefits of our scheme from three aspects including rating accuracy, dynamic behavior, and network stability. Copyright © 2015 John Wiley & Sons, Ltd.

A scheme of access service recommendation for the Social Internet of Things

40th Annual IEEE Conference on Local Computer Networks

Wireless Sensor Networks WSNs are being used in wide areas of applications for data collection and processing. Energy management is one of the crucial issues that need special attention in WSNs. But most of the existing solutions for energy management are restricted in defining the number of levels for node heterogeneity for efficient energy management. Due to this restriction, a performance degradation has been observed in most of the applications in WSNs. Hence, keeping in the view of the aforementioned issue, in this paper, we proposed a new energy-efficient multilevel heterogeneous routing EEMHR protocol for WSNs. Nodes are divided in to k levels of hierarchy in the proposed solution. A variable threshold defined by the ratio of number of alive nodes for current round to the total number of nodes is proposed for the selection of cluster heads. The performance of the proposed approach is evaluated by varying the various parameters of the network in comparison with other state-of-the-art protocols such as stable election protocol SEP and multihop communication routing MCR. Simulation results show that by varying the initial energy and node heterogeneity parameters, the network lifetime of EEMHR is improved by 17% in comparison with SEP and MCR. Moreover, EEMHR provides better stability and distribution of cluster heads in comparison with SEP and MCR. Copyright © 2014 John Wiley & Sons, Ltd.

EEMHR: Energy-efficient multilevel heterogeneous routing protocol for wireless sensor networks

Collisions and interferences among nodes pose a challenge for data aggregation in many applications, such as target tracking by adopting dynamic convey tree-based collaboration (DCTC). Because coordination with a time division multiple access (TDMA) medium access control (MAC) might provide an opportunity for better interference control, in this paper, we refine slot allocation to nodes in a dynamic convey tree and design an energy efficient MAC protocol called dynamic-time division multiple access (D-TDMA). The D-TDMA protocol avoids collisions and interferences and allocates contiguous active slots to nodes as far as possible during data aggregation from leaf nodes to a root node. As a result, energy consumption in switching from sleep to active state is saved. In comparison with Always-On scheme, theoretical analysis results show that the proposed protocol D-TDMA improves energy efficiency by up to 28.3% during one data aggregation. Furthermore, simulation results show that D-TDMA does not suffer from collisions and interferences among nodes in a dynamic convey tree and performs similar throughput to that of Always-On scheme. Because of its advantage of parallel and continuous scheduling among node pairs in the convey tree, D-TDMA outperforms efficient slot reservation in both energy efficiency and low delay because of to slot saving. Copyright © 2012 John Wiley & Sons, Ltd.

An energy efficient medium access control protocol for target tracking based on dynamic convey tree collaboration in wireless sensor networks

Distance estimation is fundamental for many functionalities of wireless sensor networks and has been studied intensively in recent years. A critical challenge in distance estimation is handling anisotropic problems in sensor networks. Compared with isotropic networks, anisotropic networks are more intractable in that their properties vary according to the directions of measurement. Anisotropic properties result from various factors, such as geographic shapes, irregular radio patterns, node densities, and impacts from obstacles. In this paper, we study the problem of measuring irregularity of sensor networks and evaluating its impact on distance estimation. In particular, we establish a new metric to measure irregularity along a path in sensor networks, and identify turning nodes where a considered path is inflected. Furthermore, we develop an approach to construct a virtual ruler for distance estimation between any pair of sensor nodes. The construction of a virtual ruler is carried out according to distance measurements among beacon nodes. However, it does not require beacon nodes to be deployed uniformly throughout sensor networks. Compared with existing methods, our approach neither assumes global knowledge of boundary recognition nor relies on uniform distribution of beacon nodes. Therefore, this approach is robust and applicable in practical environments. Simulation results show that our approach outperforms some previous methods, such as DVDistance and PDM.

Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks

In the application of target tracking based on dynamic convey tree-based collaboration (DCTC) in wireless sensor networks, collisions and interferences among nodes pose a challenge for data aggregation In this paper, we refine slot allocation to the nodes in dynamic convey tree and design an energy efficient MAC protocol called D-TDMA, which avoids collisions and interferences and allocates contiguous active slots to nodes as far as possible during data aggregation from leaf nodes to a root node As a result, the energy consumption in switching from sleeping to active state is saved Simulation results show that D-TDMA not only gets rid of the impact of collisions and interferences among nodes in dynamic convey tree, but also performs similar throughput to that of CSMA-like mechanism where nodes work without active/sleep scheduling strategy Our protocol outperforms ESR in both energy efficiency and low delay

D-TDMA: An Approach of Dynamic TDMA Scheduling for Target Tracking in Wireless Sensor Networks

Most sensor networks require application-specific network-wide performance guarantees, suggesting the need for adaptive parameters and flexible network optimization. Since sleep scheduling degrades the end-to-end delay performance in asynchronous duty-cycle wireless sensor networks, we propose a Cross-Layer Adaptive Duty Cycle (CLA-DC) control by dynamically adjusting the sleep interval to achieve the desired end-to-end delay guarantees. CLA-DC extracts information from the application, routing, data link and MAC layers to estimate the single-hop transmission delays along a multi-hop path that affect the end-to-end delay requirement. Experimental results verify the availability of the single-hop delay mode for end-to-end delay guarantees in CLA-DC, and prove that CLA-DC outperforms Simple-DC on meeting the end-to-end delay requirements by adopting cross-layer design approach, especially when the number of flows increases.

Cross-Layer Adaptive End-to-End Delay Control for Asynchronous Duty-Cycle Wireless Sensor Networks

Wireless sensor networks (WSN) are affected by underlying environments in which sensors are deployed randomly. Inevitably, there are many irregular holes in a WSN because of the existence of obstacles or the death of some sensors. To detect these holes is of great importance to both WSN applications and networking functionalities. Holes are described by a set of sensor nodes on their boundaries. In this paper, we study the problem of identifying boundaries of holes in a WSN. By extracting hidden geometric features in the topology of a WSN, we are able to recognize sensor nodes on both inner and outer boundaries of holes. Methods proposed in this paper relies on neither the knowledge of localization nor the unit-disk communication model. We also propose a distributed algorithm to discover holes and identify nodes on boundaries. Simulation results show that our method works well for WSNs with many inner holes and irregular outer boundaries.

Boundary recognition in sensor networks by building relative contours

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Kai Li

Author Tools

Chat about Author