Energy‐Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks

Abstract

A backbone is a subset of sensors that is sufficient for performing assigned tasks. The exact definition depends on the task or the particular desirable properties of a backbone. We discuss two specific kinds of backbones, neighbor and area dominating sets, that we believe are the essential and perhaps only backbones required for sensor networks. A sensor is covered by a backbone if it is in the backbone or is a neighbor to a sensor in the backbone. This type of backbone is referred to here as neighbor-dominating sets, or simply dominating sets. A point within a monitoring area is covered by a sensor backbone if it is within sensing range of at least one sensor from the backbone. This type of backbone is called area-dominating set. In a broadcasting (also known as data-dissemination) task, a message is sent from one node, which could be a monitoring center, to all nodes in the network. Sensors, which are randomly placed in an area, decide which of them should be active and monitor an area, and which of them may sleep and become active at a later time. The communication connectivity is important so that the measured data can be reported to a monitoring center. This problem is known as the sensor-area coverage problem, and needs to be solved efficiently to enable sensor functioning for a prolonged time. Sensors may also be placed deterministically in an area to optimize coverage and reduce power consumption. Most solutions considered in this chapter are based Handbook of Sensor Networks: Algorithms and Architectures, Edited by I. Stojmenovic ÍSBN 0-471-68472-4

Energy Efficient Mobile Routing in Actuator and Sensor Networks with Connectivity Preservation

“…Dai and Wu [3] introduced a generalized DS concept, where coverage can be provided by an arbitrary number of connected one-hop neighbors. The definition was modified by [15], to avoid message exchange between neighbors, as follows. Node a is covered by its one-hop neighbors b, c, .…”

Power-source-aware backbone routing in wireless sensor networks

“…Vast majority of these studies are related to energy efficient data dissemination and gathering, in other words, routing in WSNs. As Simplot-Ryl et al enumerate in [1], backbone-based approaches for data dissemination and gathering are rather well-studied. As in other related studies, in [1], backbone is considered to be either neighbor-or areadominating set of a network.…”

Energy-Aware Georouting with Guaranteed Delivery in Wireless Sensor Networks with Obstacles

“…Early fallback mechanism is to return from face routing mode to greedy forwarding mode as soon as possible. And the boundary circle is used to restrict a searching area in similar way as OAFR (Other Adaptive Face Routing) [6]. It reduces exploring a boundary of faces far away from the destination.…”

“…Dai and Wu [22] introduced a generalized DS concept, where coverage can be provided by an arbitrary number of connected one-hop neighbors. The definition was modified by [6], to avoid message exchanges between neighbors, to the following form. Node a is covered by its one-hop neighbors b, c, .…”

“…Each node has position information by using geographic positioning system (GPS) or other localization means [2] and routing decisions are made at each node using only local neighborhood information. Within this framework, energy-aware routing schemes use power consumption as metric and have been proposed in [3,4,5,6,7,8].…”