Topology Control in Sensor, Actuator, and Mobile Robot Networks

摘要

The chapter starts with a discussion on the main general approaches used to control the connectivity in static sensor networks. The emphasis is put in particular on the problem of finding minimum transmission radii so that the network is connected. This problem is actually closely related to the problem of finding a minimum spanning tree (MST), since the longest edge of such structure corresponds to the minimal common radius achieving the connectivity. The second part of the chapter is concerned with problems related to biconnectivity. The question of detecting local critical nodes and links in a distributed fashion is first covered. It then discusses several scenarios involving biconnectivity of mobile robots. The first two scenarios address the problem of deploying biconnected sensors around a given point of interest (POI), whereas the two last scenarios address the problem of biconnecting a network that is initially 1-connected. Controlled Vocabulary Terms wireless sensor networks