this paper, we argue that the above notion of locality is unduly restrictive and propose a new F-locality model, where the set of nodes known to v is the set F (v) of nodes with whom v shares a face in the planarized network graph (See Section 2)

In this paper, we present a new ”spatiotemporal multicast”, called a ”mobicast”, protocol for supporting applications which require spatiotemporal coordination in sensornets. The spatiotemporal character of a mobicast is to forward a mobicast message to all sensor nodes that will be present at time t in some geographic zone (called the forwarding zone) Z, where both the location and shape of the forwarding zone are a function of time over some interval (tstart,tend). The mobicast is constructed of a series of forwarding zones over different intervals (tstart,tend), and only sensor nodes located in the forwarding zone in the time interval (tstart,tend) should be awake in order to save power and extend the network lifetime. Existing protocols for a spatiotemporal variant of a multicast system were designed to support a forwarding zone that moves at a constant velocity, − → v, in sensornets. To consider the path of a mobile entity which includes turns, this work mainly develops a new mobicast routing protocol, called the variant-egg-based mobicast (VE-mobicast) routing protocol, by utilizing the adaptive variant-egg shape of the forwarding zone to achieve high predictive accuracy. To illustrate the performance achievement, a mathematical analysis is conducted and simulation results are examined.

Energy efficiency and network capacity are two of the most important issues in wireless sensor networks. Topology-control algorithms have been proposed to maintain network connectivity while reducing energy consumption and improving network capacity. Several studies have also been performed to investigate critical conditions on several network parameters in order to ensure network k-connectivity (in the asymptotic sense). In this chapter, several problems (and their corresponding solutions) related to topology construction, maintenance, and connectivity in wireless sensor networks are discussed. Specifically, topics discussed include (1) various communication models and generation of random network topologies; (2) neighbor discovery and maintenance; (3) basic connectivity properties of wireless sensor networks (with the random unit graph model as the underlying model); (4) localized topology construction algorithms, along with their associated geometric structures in both homogeneous and heterogeneous networks; and (5) how to enhance fault tolerance in topology construction and connectivity. 10.1

Wireless sensor networks find its application in areas such as target detection and tracking, environmental monitoring, industrial process monitoring, and tactical systems. Energy efficiency is one of the important research issues in WSNs, since it determines the lifetime of the sensor network deployed for the intended applications. Target tracking is one of the killer applications of wireless sensor networks and energy-efficient target tracking algorithms are used for accurate tracking. In this paper, the focus is mainly driven over the survey of the energy-efficient target tracking routing algorithms for Wireless Sensor Network.