428 research outputs found
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
Maximizing the Delivery of MPR Broadcasting Under Realistic Physical Layer Assumptions
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 a more realistic model should be considered for experimental simulations. Previous work on realistic scenarios has been focused on unicast, however broadcast requirements are fundamentally different and cannot be derived from the unicast case. Therefore, the broadcast protocols must be adapted in order to still be efficient under realistic assumptions. In this paper, we study the well-known multipoint relay broadcast protocol (MPR), in which each node has to choose a set of 1-hop neighbors to act as relays in order to cover the whole 2-hop neighborhood. We give experimental results showing that the original strategy used to select these multipoint relays does not suit a realistic model. On the basis of these results, we propose new selection strategies solely based on link quality. One of the key aspects of our solutions is that our strategies do not require any additional hardware and may be implemented at the application layer, which is particularly relevant to the context of ad hoc and sensor networks where energy savings are mandatory. We finally provide new experimental results that demonstrate the superiority of our strategies under realistic physical assumption
Surveying Position Based Routing Protocols for Wireless Sensor and Ad-hoc Networks
A focus of the scientific community is to design network oriented position-based routing protocols and this has resulted in a very high number of algorithms, different in approach and performance and each suited only to particular applications. However, though numerous, very few position-based algorithms have actually been adopted for commercial purposes. This article is a survey of almost 50 position-based routing protocols and it comes as an aid in the implementation of this type of routing in various applications which may need to consider the advantages and pitfalls of position-based routing. An emphasis is made on geographic routing, whose notion is clarified as a more restrictive and more efficient type of position-based routing. The protocols are therefore divided into geographic and non-geographic routing protocols and each is characterized according to a number of network design issues and presented in a comparative manner from multiple points of view. The main requirements of current general applications are also studied and, depending on these, the survey proposes a number of protocols for use in particular application areas. This aims to help both researchers and potential users assess and choose the protocol best suited to their interest
Maximizing the Delivery of MPR Broadcasting under Realistic Physical Layer Assumptions
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 a more realistic model should be considered for experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are fundamentally different and cannot be derived from the 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 broadcast protocol (MPR). In the latter, each node has to choose a set of 1-hop neighbors to act as relays in order to cover the whole 2-hop neighborhood. We give experimental results showing that the original strategy used to select these multipoint relays does not suit to a realistic model. Based on these results, we propose new selection strategies solely based on link quality. One of the key aspects of our solutions is that they do not require any additional hardware and may be implemented at the application layer, which is particularly relevant to the context of ad hoc and sensor networks where energy savings are mandatory. We finally provide new experimental results that demonstrate the superiority of our strategies under realistic physical assumptions
Network lifetime maximising distributed forwarding strategies in Ad Hoc wireless sensor networks
International audienceThe authors propose three variants of distributed and stateless forwarding strategies for wireless sensor networks, namely greedy minimum energy consumption forwarding protocol (GMFP), lifetime maximising GMFP (LM-GMFP) and variance minimising GMFP (VAR-GMFP), which aim at maximising the network lifetime while achieving a high forwarding success rate. GMFP selects a forwarding node that minimises per-packet energy consumption while maximising the forwarding progress. LM-GMFP extends the GMFP algorithm by also taking into account the remaining energy at the prospective one-hop forwarding nodes. In VAR-GMFP, on the other hand, the packet is forwarded to the next node that ensures a locally high mean and low variance of nodal remaining energy. Through simple probabilistic analysis the authors prove the intuition behind the optimum forwarding node selection for network lifetime maximisation. They then model the lifetime maximisation of a sensor network as an optimisation problem and compare the practical protocol-dependent network lifetime with the theoretical upper bound. Through extensive simulations the author demonstrate that the proposed protocols outperform the existing energy-aware protocols in terms of network lifetime and end-to-end delay
Energy efficient geographic routing for wireless sensor networks.
A wireless sensor network consists of a large number of low-power nodes equipped with wireless radio. For two nodes not in mutual transmission range, message exchanges need to be relayed through a series of intermediate nodes, which is a process known as multi-hop routing. The design of efficient routing protocols for dynamic network topologies is a crucial for scalable sensor networks. Geographic routing is a recently developed technique that uses locally available position information of nodes to make packet forwarding decisions. This dissertation develops a framework for energy efficient geographic routing. This framework includes a path pruning strategy by exploiting the channel listening capability, an anchor-based routing protocol using anchors to act as relay nodes between source and destination, a geographic multicast algorithm clustering destinations that can share the same next hop, and a lifetime-aware routing algorithm to prolong the lifetime of wireless sensor networks by considering four important factors: PRR (Packet Reception Rate), forwarding history, progress and remaining energy. This dissertation discusses the system design, theoretic analysis, simulation and testbed implementation involved in the aforementioned framework. It is shown that the proposed design significantly improves the routing efficiency in sensor networks over existing geographic routing protocols. The routing methods developed in this dissertation are also applicable to other location-based wireless networks
- …