An experimental approach to prove the efficiency of a cyclic topology of a sensor network

The main contribution of this paper is to find an optimal topology to provide radio coverage of the total trajectory of mobile sensor. We propose also a geographic routing algorithm to minimize the transmission time of messages. Then, we show that by using this algorithm we will have a better network performance (energy consumption, transmission delay and packet delivery rate). The geographic routing algorithm proposed is based on the calculation of the position, such that each sensor recognizes the adjacent sensors, its pre-successor and immediate successor geographical positions. Each sensor measures the acceleration nodes and updates its coordinates x, y which is estimated using a Luenberger observer. When a mobile sensor wants to send a message (or relay a message) it compares, through his knowledge of its position, the best path (the closest geographically) between him and the destination and finally transmits the message to the next node in the way. This work was realized and validated by measurements performed on an experimental platform that will be also presented in this paper.