Maximizing the Probability of Delivery of Multipoint Relay Broadcast Protocol in Wireless Ad Hoc Networks with a Realistic Physical Layer

It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are fundamentally different and cannot be derived from unicast case. Therefore, broadcast protocols must be adapted in order to still be efficient under realistic assumptions. In this paper, we study the well-known multipoint relay protocol (MPR). In the latter, each node has to choose a set of neighbors to act as relays in order to cover the whole 2-hop neighborhood. We give experimental results showing that the original method provided to select the set of relays does not give good results with the realistic model. We also provide three new heuristics in replacement and their performances which demonstrate that they better suit to the considered model. The first one maximizes the probability of correct reception between the node and the considered relays multiplied by their coverage in the 2-hop neighborhood. The second one replaces the coverage by the average of the probabilities of correct reception between the considered neighbor and the 2-hop neighbors it covers. Finally, the third heuristic keeps the same concept as the second one, but tries to maximize the coverage level of the 2-hop neighborhood: 2-hop neighbors are still being considered as uncovered while their coverage level is not higher than a given coverage threshold, many neighbors may thus be selected to cover the same 2-hop neighbors

A Nonuniform Sensor Distribution Strategy for Avoiding Energy Holes in Wireless Sensor Networks

The energy hole problem exerts great impact on the energy efficiency and lifetime of wireless sensor networks (WSNs) based on many-to-one communication model. Unequal cluster emerged in recent years is a good way to alleviate the energy hole problem by dispersing cluster heads' burden. However, it fails to address this problem fundamentally due to its inherent characteristics. The single non-uniform nodes distribution strategy can alleviate the energy hole problem well by setting more nodes in networks to achieve energy balance, yet it may result in low energy efficiency and high cost of the networks. In this paper, by analyzing and minimizing intra- and inter-cluster energy consumption, we construct a suboptimal unequal cluster for WSNs. We propose a non-uniform sensor distribution strategy based on the previous unequal cluster in accordance with the energy balance principle. Simulation results show that our proposed non-uniform sensor nodes distribution strategy can not only achieve good energy efficiency as the unequal cluster method, but also ensure the network energy consumption balance and resolve the energy hole problem completely as the non-uniform sensor distribution approach. Furthermore, our algorithm needs fewer sensors to be settled than single non-uniform node distribution

Experimental trade-offs between different strategies for multihop communications evaluated over real deployments of wireless sensor network for environmental monitoring

Although much work has been done since wireless sensor networks appeared, there is not a great deal of information available on real deployments that incorporate basic features associated with these networks, in particular multihop routing and long lifetimes features. In this article, an environmental monitoring application (Internet of Things oriented) is described, where temperature and relative humidity samples are taken by each mote at a rate of 2 samples/min and sent to a sink using multihop routing. Our goal is to analyse the different strategies to gather the information from the different motes in this context. The trade-offs between 'sending always' and 'buffering locally' approaches were analysed and validated experimentally, taking into account power consumption, lifetime, efficiency and reliability. When buffering locally, different options were considered such as saving in either local RAM or FLASH memory, as well different alternatives to reduce overhead with different packet sizes. The conclusion is that in terms of energy and durability, the best option is to reduce the overhead. Nevertheless, sending larger packets is not worthy when the probability of retransmission is high. If real-time monitoring is required, then sending always is better than buffering locally

Dynamic Localized Broadcast Incremental Power Protocol and Lifetime in Wireless Ad Hoc and Sensor Networks

International audienceThis paper deals with the problem of broadcasting messages and lifetime in wireless ad-hoc and sensor networks. The study is based on the best known localized algorithm, namely LBIP, which is based on a centralized one, BIP, whose principle consists in constructing a broadcast tree rooted on the source node, taking into account the specificities of wireless networks. Even if LBIP has excellent performances regarding energy consumption, it selects for each broadcast the same nodes to retransmit the message; if the source of the broadcast, the base station in a sensor network, is always the same, this will lead to deplete quickly the energy of relay nodes. In this paper, we propose DLBIP, a new localized broadcast algorithm based on LBIP, which dynamically changes the broadcast tree to balance energy consumption on nodes without any additional messages. We show that proposed strategy can significantly increase the number of broadcasts before the network failure. We provide simulations results that clearly demonstrates the lifetime enhancement due to our optimization