M-GeRaf analysis: Performance improvement of a Multisink ad hoc and sensor network geographical random routing protocol

In this paper we investigate the behaviour of M-GeRaf, Multisink GeRaf, a data dissemination protocol for multisink wireless sensor network environments based on a geographic random forwarding routing approach. The protocol exploits the intrinsic broadcast nature of the wireless channel in order to allow a reliable and efficient data delivery to a set of data sink nodes in networks with an aggressive power-off strategy without any knowledge of neighbour node positions. Previous works focus the analysis on the multi-hop performances in term of the average amount of hops to reach all the destinations. In this work we introduce a protocol modification in order to reduce the probability of not reach some destinations and in order to complete the data delivery as soon as possible. Therefore we modify the back-off metric in order to reduce the average data transmission amount required to reach all the sink nodes. Furthermore we investigate the effects of errors in the node position estimations.