http://romisatriawahono.net/lecture/rm/survey/machine%20learning/Afsar%20-%20Clustering%20in%20Sensor%20Networks%20-%202014.pdf

Clustering in sensor networks

Clustering Objectives in Wireless Sensor Networks: A Survey and Research Direction Analysis

Hierarchical routing in wireless sensor networks (WSNs) is a very important topic that has been attracting the research community in the last decade. Typical hierarchical routing is called clustering routing, in which the network is divided into multiple clusters. Recently, some types of atypical hierarchical routing arise, including chain-based, tree-based, grid-based routing, and area-based routing. There are several survey papers that present and compare the hierarchical routing protocols from various perspectives, but a survey on atypical hierarchical routing is still missing. This paper makes a first attempt to provide a comprehensive review on atypical hierarchical routing. We offer a classification of atypical hierarchical routing of WSNs, and give detailed analysis of different logical topologies. The most representative atypical hierarchical routing protocols are described, discussed, and qualitatively compared. In particular, the advantages and disadvantages of different atypical hierarchical routing protocols are analyzed with respect to their significant performances and application scenarios. Finally, we put forward some open issues concerning the design of hierarchical WSNs. This survey aims to provide useful guidance for system designers on how to evaluate and select appropriate logical topologies and hierarchical routing protocols for specific applications.

Atypical Hierarchical Routing Protocols for Wireless Sensor Networks: A Review

One of the emerging networking standards that gap between the physical world and the cyber one is the Internet of Things. In the Internet of Things, smart objects communicate with each other, data are gathered and certain requests of users are satisfied by different queried data. The development of energy efficient schemes for the IoT is a challenging issue as the IoT becomes more complex due to its large scale the current techniques of wireless sensor networks cannot be applied directly to the IoT. To achieve the green networked IoT, this paper addresses energy efficiency issues by proposing a novel deployment scheme. This scheme, introduces: (1) a hierarchical network design; (2) a model for the energy efficient IoT; (3) a minimum energy consumption transmission algorithm to implement the optimal model. The simulation results show that the new scheme is more energy efficient and flexible than traditional WSN schemes and consequently it can be implemented for efficient communication in the IoT.

/pdf/a-novel-scheme-for-an-energy-efficient-internet-of-things-5aqnfudng6.pdf

A Novel Scheme for an Energy Efficient Internet of Things Based on Wireless Sensor Networks

In wireless sensor networks, exploiting the sink mobility has been considered as a good strategy to balance the nodes energy dissipation. Despite its numerous advantages, the data dissemination to the mobile sink is a challenging task for the resource constrained sensor nodes due to the dynamic network topology caused by the sink mobility. For efficient data delivery, nodes need to reconstruct their routes toward the latest location of the mobile sink, which undermines the energy conservation goal. In this paper, we present a virtual grid-based dynamic routes adjustment (VGDRA) scheme that aims to minimize the routes reconstruction cost of the sensor nodes while maintaining nearly optimal routes to the latest location of the mobile sink. We propose a set of communication rules that governs the routes reconstruction process thereby requiring only a limited number of nodes to readjust their data delivery routes toward the mobile sink. Simulation results demonstrate reduced routes reconstruction cost and improved network lifetime of the VGDRA scheme when compared with existing work.

/pdf/vgdra-a-virtual-grid-based-dynamic-routes-adjustment-scheme-3dzg2aftsz.pdf

VGDRA : a virtual grid-based dynamic routes adjustment scheme for mobile sink-based wireless sensor networks

http://www.hit.bme.hu/~buttyan/publications/SchafferFHHB12comnet.pdf

Survey Secure and reliable clustering in wireless sensor networks: A critical survey

In recent years, social media has played an increasingly important role in reporting world events. The publication of crowd-sourced photographs is one of the reasons behind the high impact. However, the use of a camera can draw the photographer into a situation of conflict. Examples include citizen journalists posting photographs of incidents of human rights violations on the Internet. The published images contain unambiguous clues about the location of the photographer such as the angle from which the scene was captured. Further, in the context of adversary operated CCTV systems, knowledge of the photographer's potential location allows the adversary to identify the photographer by reviewing relevant footage. This is the camera location detection attack --- a novel privacy threat against photographers seeking anonymity while posting images. In order to resist such powerful attacks, we introduce the notion of camera location anonymisation; by combining multiple input images captured from different viewpoints, we produce a single image that appears to have been shot from a randomly chosen angle. To this end, we examine the use of view synthesis algorithms from computer vision literature as concrete defences. We show (both analytically and experimentally) that such defences could be a promising step in the direction of providing probabilistic anonymity guarantees. We analyse the extent of anonymity such techniques can provide in various scenarios and describe the challenges posed by scene geometry.

pdf/who-clicks-there-anonymising-the-photographer-in-a-camera-3j1k29qa7g.pdf

Who clicks there!: anonymising the photographer in a camera saturated society

Routing in delay and disruption-tolerant networks (DTNs) relies on intermediary nodes, called custodians, to deliver messages to destination. However, nodes usually differ significantly in terms of available resources: energy, buffer space and bandwidth. Routing algorithms need to make the most efficient use of custodian resources while also making sure those in limited supply are not exhausted. This paper proposes a distributed scheme for calculating resources available in node vicinity as a tool to support meaningful routing decisions. A generic model is developed first and is then applied to individual network assets. The model is based on a sparse network, where resources are potentially not uniformly distributed. It uses recent encounters to estimate resource availability in node vicinity. It is shown that a store-carry-forward scheme may benefit from accessing vicinity resource estimates. This knowledge allows nodes to implement meaningful custodian election and queue management strategies, approached here from a holistic perspective. It is demonstrated that routing protocols not only use up fewer resources overall but also consume resources preferentially from nodes with higher resource levels, sparing nodes with limited supplies. As a result, disparities in available resources across the node population are significantly reduced, and nodes are less likely to leave the network as a consequence of resource depletion. Copyright © 2012 John Wiley & Sons, Ltd.

/pdf/exploiting-resource-heterogeneity-in-delay-tolerant-networks-49wust58i8.pdf

Exploiting resource heterogeneity in delay-tolerant networks†

Resilient Aggregations: Statistical Approach

Wireless sensor networks with hundreds of sensor nodes have emerged in recent years as important platforms for a wide spectrum of monitoring tasks ranging from environmental to military applications. In order to support scalability and increase lifetime of these networks, sensor nodes are preferably grouped into clusters. A large number of clustering protocols have been proposed in the literature with different aims, requirements and efficiency. Previous comparative studies of such protocols were usually based on simulation, which, however, only provides average case results on the limited state space explored. To mend this situation, in this paper, we evaluate and compare four state-of-the-art clustering protocols, i.e., LEACH, GEN-LEACH, HEED and PANEL, with full state space exploration. Within our analytical framework that consists of a network configuration and an energy consumption model, we aim at analyzing the correctness and performance of the investigated protocols. Our analysis is conducted formally through probabilistic model checking using PRISM and has its focus on the quantitative aspects of the protocols.

/pdf/comparative-analysis-of-clustering-protocols-with-2y0mvzjwcb.pdf

Comparative Analysis of Clustering Protocols with Probabilistic Model Checking

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

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

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

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.

Peter Schaffer

Author Tools

Chat about Author