David Simplot-Ryl

The internet of things [Guest Editorial]

The Internet has experienced a tremendous growth in the past three decades, evolving from a network of a few hundred hosts to a platform linking billions of things globally, including individual people as well as enterprises of various sizes, through computers and computerized devices of any conceivable size and capability and the applications running on them. The growth of the Internet shows no signs of slowing down and it steadily becomes the cause of a new pervasive paradigm in computing and communications. This new paradigm enhances the traditional Internet into a smart Internet of Things (IoT) created around intelligent interconnections of diverse objects in the physical world, such as vehicles, cell phones, habitats, and habitat occupants. It utilizes low-cost information gathering and dissemination devices, such as sensors and RFID tags, that facilitate fast-paced interactions among the objects themselves as well as the objects and persons in any place and at any time. IoT will usher in a wide range of smart applications and services to cope with many of the challenges individuals and organizations face in their everyday lives. For example, remote healthcare monitoring systems could aid in managing costs and alleviating the shortage of healthcare personnel; intelligent transportation systems could aid in reducing traffic congestion and inevitably the ills caused by it such as air pollution; smart distribution systems from utility grids to supply chains could aid in improving the quality and reducing the cost of their respective goods and services; tagged objects could result in more systematic recycling and effective waste disposal, and so on.

EMD: Energy-Efficient P2P Message Dissemination in Delay-Tolerant Wireless Sensor and Actor Networks

In this paper, we address the problem of peer-to-peer networking for data dissemination among actors in wireless sensor and actor networks (WSANs), which consist of static sensors, responsible for environment monitoring, and mobile actors, in charge of data collection and task performing. This problem has not been received much attention although peer-to-peer networking has achieved great successes in other networks such as the Internet and mobile ad hoc networks (MANETs). Unlike the Internet and MANETs, WSANs contain static sensors that are energy-constrained and actors that cannot communicate with each other directly. These unique characteristics make the data dissemination problem in WSANs extremely challenging. We present an Energy-Efficient Message Dissemination protocol (EMD) to solve this problem in delay-tolerant WSANs. EMD is grounded on a novel principle of Carry-Disseminate-Store-and-Forward proposed for the first time here. While traveling, a source actor disseminates messages (data) to sensors upon contact, which will store the messages and forward them to other actors when they come into communication range. The actors receiving the messages from sensors work as source actors and help to distribute the messages. We theoretically analyze the data dissemination strategy under which the original source actor can distribute its messages to all other actors at minimum communication cost within a given delay bound. Through extensive simulations we demonstrate the performance of EMD.

Guaranteed Delivery for Geographical Anycasting in Wireless Multi-Sink Sensor and Sensor-Actor Networks

In the anycasting problem, a sensor wants to report event information to one of sinks or actors. We describe the first localized anycasting algorithms that guarantee delivery for connected multi-sink sensor-actor networks. Let

Energy efficient k -anycast routing in multi-sink wireless networks with guaranteed delivery

S(x)

Promoting quality of service in substitution networks with controlled mobility

be the closest actor/sink to sensor

An energy efficient adaptive HELLO algorithm for mobile ad hoc networks

x

Incremental power topology control protocol for Wireless Sensor Networks

, and

Hypocomb: Bounded-Degree Localized Geometric Planar Graphs for Wireless Ad Hoc Networks

|xS(x)|

Connectivity preservation and key distribution in wireless sensor networks using multi-deployment scheme

be distance between them. In greedy phase, a node

Range assignment and λ-proximity in wireless sensor networks with a realistic physical layer

s