Sensor Network

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (15 November 2012) | Viewed by 31391

Special Issue Editor


E-Mail Website
Guest Editor
TCS - Sensor Lab, Centre Universitaire d'Informatique, Battelle batiment A, Route de Drize 7, CH-1227 Carouge, Geneva, Switzerland
Interests: sensor networks; energy balance mechanisms; dynamical analysis; geographic routing; optimal data propagation; networks lifetime

Keywords

  • local (distributed) algorithms
  • localized algorithms
  • localization systems
  • tracking/exploration algorithms
  • wireless medium access control
  • routing and data propagation algorithms
  • geographic routing
  • virtual coordinates and networks
  • energy-aware algorithms
  • energy models
  • data gathering
  • mobility in wireless sensor networks
  • dynamic networks
  • roving agents
  • distributed collaborative information processing
  • computation and programming model
  • fault tolerance and dependability
  • scheduling and load balancing
  • network deployment and topology control

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

442 KiB  
Article
Enforcing Security Mechanisms in the IP-Based Internet of Things: An Algorithmic Overview
by Simone Cirani, Gianluigi Ferrari and Luca Veltri
Algorithms 2013, 6(2), 197-226; https://doi.org/10.3390/a6020197 - 2 Apr 2013
Cited by 84 | Viewed by 13879
Abstract
The Internet of Things (IoT) refers to the Internet-like structure of billions of interconnected constrained devices, denoted as “smart objects”. Smart objects have limited capabilities, in terms of computational power and memory, and might be battery-powered devices, thus raising the need to adopt [...] Read more.
The Internet of Things (IoT) refers to the Internet-like structure of billions of interconnected constrained devices, denoted as “smart objects”. Smart objects have limited capabilities, in terms of computational power and memory, and might be battery-powered devices, thus raising the need to adopt particularly energy efficient technologies. Among the most notable challenges that building interconnected smart objects brings about, there are standardization and interoperability. The use of IP has been foreseen as the standard for interoperability for smart objects. As billions of smart objects are expected to come to life and IPv4 addresses have eventually reached depletion, IPv6 has been identified as a candidate for smart-object communication. The deployment of the IoT raises many security issues coming from (i) the very nature of smart objects, e.g., the adoption of lightweight cryptographic algorithms, in terms of processing and memory requirements; and (ii) the use of standard protocols, e.g., the need to minimize the amount of data exchanged between nodes. This paper provides a detailed overview of the security challenges related to the deployment of smart objects. Security protocols at network, transport, and application layers are discussed, together with lightweight cryptographic algorithms proposed to be used instead of conventional and demanding ones, in terms of computational resources. Security aspects, such as key distribution and security bootstrapping, and application scenarios, such as secure data aggregation and service authorization, are also discussed. Full article
(This article belongs to the Special Issue Sensor Network)
Show Figures

Figure 1

250 KiB  
Article
Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering
by Stefanos A. Nikolidakis, Dionisis Kandris, Dimitrios D. Vergados and Christos Douligeris
Algorithms 2013, 6(1), 29-42; https://doi.org/10.3390/a6010029 - 18 Jan 2013
Cited by 175 | Viewed by 17012
Abstract
The wide utilization of Wireless Sensor Networks (WSNs) is obstructed by the severely limited energy constraints of the individual sensor nodes. This is the reason why a large part of the research in WSNs focuses on the development of energy efficient routing protocols. [...] Read more.
The wide utilization of Wireless Sensor Networks (WSNs) is obstructed by the severely limited energy constraints of the individual sensor nodes. This is the reason why a large part of the research in WSNs focuses on the development of energy efficient routing protocols. In this paper, a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP), which pursues energy conservation through balanced clustering, is proposed. ECHERP models the network as a linear system and, using the Gaussian elimination algorithm, calculates the combinations of nodes that can be chosen as cluster heads in order to extend the network lifetime. The performance evaluation of ECHERP is carried out through simulation tests, which evince the effectiveness of this protocol in terms of network energy efficiency when compared against other well-known protocols. Full article
(This article belongs to the Special Issue Sensor Network)
Show Figures

Graphical abstract

Back to TopTop