7.2 GENERAL APPROACHES IN STATIC SENSOR NETWORKS

When the nodes are static, controlling the topology amounts to selecting only a subset of the possible links for effective use according to some desired criteria (distance between nodes, remaining level of energy, avoidance or favoring of cycles, etc.). There are essentially three ways of proceeding:

  1. Selecting particular neighbors based on other criteria than the sole distance between them. We refer to Blough et al. (2006) as an example of such selection, where the criterion is to minimize the number of symmetric links so that interferences are bounded. The topology is designed by maintaining the number of neighbors of each node below a value k while guaranteeing the overall connectivity with high probability. The proposed protocol consists of two message exchanges. First, all nodes transmit their ID using the maximal emission power. Upon reception, each node i builds a list Li containing its k nearest neighbors. Then each node transmits its list using again, the maximum power. A link between two nodes is then kept if and only if it belongs to the k closest neighbors of each other. While the value k needed for connectivity with high probability is logarithmic, their experiments showed that k = 6 was the “magic” number above which the network is always connected in practice.
  2. Using an adjusted transmission range, possibly being different for each node, and then using all neighbors within that range. While being very energy efficient, ...

Get Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.