© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

As the number of nodes in wireless sensor networks (WSNs) increases, new challenges have to be faced in order to maintain their performance. A fundamental requirement of several applications is the correct transmission of the measurements to their final destinations. Thus, it is crucial to guarantee a high probability of connectivity, which characterizes the ability of every node to report to the fusion center. This network metric is strongly affected by both the fading characteristics and the different routing protocols that are used for the dissemination of data. In this paper, we study the probability of a network to be fully connected for two widely employed routing mechanisms, namely unicast and K-anycast. The analytical derivations and the simulations evaluate the trade-offs among the different routing mechanisms and provide useful guidelines on the design of WSNs.

Peer Reviewed