ArticlePDF Available

Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks

Authors:

Abstract

: In this paper we discuss the mechanism of multipoint relays (MPRs) to e ciently do the ooding of broadcast messages in the mobile wireless networks. Multipoint relaying is a technique to reduce the number of redundant retransmissions while di using a broadcast message in the network. We discuss the principle and the functioning of MPRs, and propose a heuristic to select these MPRs in a mobile wireless environment. We also analyze the complexity of this heuristic and prove that the computation of a multipoint relay set with minimal size is NP-complete. Finally, we present some simulation results to show the e ciency of multipoint relays. Key-words: multipoint relays, mobile wireless networks, ooding of broadcast messages (Rsum : tsvp) Email: Amir.Qayyum@inria.fr, Laurent.Viennot@inria.fr, Anis.Laouiti@inria.fr Unite de recherche INRIA Rocquencourt Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex (France) Telephone : 01 39 63 55 11 - International : 33 1 39 ...
Multipoint Relaying: An Efficient Technique for
Flooding in Mobile Wireless Networks
Amir Qayyum, Laurent Viennot, Anis Laouiti
To cite this version:
Amir Qayyum, Laurent Viennot, Anis Laouiti. Multipoint Relaying: An Efficient Technique for
Flooding in Mobile Wireless Networks. [Research Report] RR-3898, 2000. <inria-00072756>
HAL Id: inria-00072756
https://hal.inria.fr/inria-00072756
Submitted on 24 May 2006
HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est
destin´ee au epˆot et `a la diffusion de documents
scientifiques de niveau recherche, publi´es ou non,
´emanant des ´etablissements d’enseignement et de
recherche fran¸cais ou ´etrangers, des laboratoires
publics ou priv´es.
ISSN 0249-6399 ISRN INRIA/RR--3898--FR+ENG
apport
de recherche
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
Amir Qayyum, Laurent Viennot, Anis Laouiti
No 3898
March 2000
TH
`
EME 1
Unit´e de recherche INRIA Rocquencourt
Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex (France)
T´el´ephone : 01 39 63 55 11 - International : +33 1 39 63 55 11
T´el´ecopie : (33) 01 39 63 53 30 - International : +33 1 39 63 53 30
S
node
retransmitting
24
retransmissions
to diffuse
a message
upto
3-hops
S
11
retransmissions
to diffuse
a message
upto
3-hops
retransmitting
nodes
c
d
e
f
g
b
a
a
b
c
e
d
f
a’
b’
c’
d’
e’
f’ g’
s
(i)
(ii)
g
0
10
20
30
40
50
60
70
80
90
100
0 20 40 60 80 100
Date(Duration of error in reception)
Probability of error in reception
Time duration to diffuse a message
Flooding using MPR
Pure flooding
0
10
20
30
40
50
60
70
80
90
100
0 20 40 60 80 100
Date(Duration of error in reception)
Probability of error in reception
End of activity in the network
Flooding using MPR
Pure flooding
0
200
400
600
800
1000
1200
0 20 40 60 80 100
Number of retransmissions
Probability of error in reception
Number of retransmissions in the network
Flooding using MPR
Pure flooding
0
5
10
15
20
25
30
0 20 40 60 80 100
Number of times, the same message is received
Probability of error in reception
Duplicate message reception
Flooding using MPR
Pure flooding
0
200
400
600
800
1000
1200
0 20 40 60 80 100
Number of nodes
Probability of error in reception
Effectiveness of multipoint relaying
Flooding using MPR
Pure flooding
Unit´e de recherche INRIA Lorraine, Technopˆole de Nancy-Brabois, Campus scientifique,
615 rue du Jardin Botanique, BP 101, 54600 VILLERS L
`
ES NANCY
Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex
Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST MARTIN
Unit´e de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex
Unit´e de recherche INRIA Sophia-Antipolis, 2004 route des Lucioles, BP 93, 06902 SOPHIA-ANTIPOLIS Cedex
´
Editeur
INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex (France)
ISSN 0249-6399
... Nodes transmit an overwhelming majority of packets via PF until the next FF, resulting in highly efficient network-wide broadcasts. Unlike prior deterministic protocols (e.g., MPR [10], OA [11]), ECHO does not use any control packets or explicit topology 1. Our simulations have shown that with a 1 mile (1600m) transmission range, we need only 25 nodes to connect a 3 mile 2 (4.8 km 2 ) area but need more than 1000 nodes if the range is 200m (WiFi range) [6] 2. Literature also refers to them as dominating, relay or rebroadcast information. ...
... We formally prove that the set of critical nodes that ECHO produces is sufficient for a source-independent network-wide broadcast. We show that for dense networks, the asymptotic communication complexity of ECHO is O(N ) lower than that of Flooding [12] and Multi-point Relay (MPR) [10], but the same as that of Opportunistic Announcement (OA) [11]. We have implemented ECHO, Flooding, MPR, and OA in ns3 [13] and simulated multihop wireless networks of varying size, density, network load, speed, and data rate. ...
... Area-based solutions introduced in [4] make forwarding decisions based either on the location of the nodes [29], network density [30], distance from the source node [31], or percolation theory [32]. Neighbor-based approaches collect and utilize 1-hop or 2hop neighborhood information for identifying nodes that need to forward packets [10], [33], [34], [35], [36]. ...
Article
Applications such as collaborative mapping motivate a need for network-wide broadcasting in Mobile Ad Hoc Networks (MANET) with low-rate long-range links. Existing MANET protocols are inadequate in such low-capacity regimes due to their high use of control packets. We present a novel protocol called ECHO that constructs and maintains a broadcast backbone without using any control packets. Instead, using a field in the data packet header, a node transmits and listens for an "echo" of the specific packet to determine its membership in the backbone. ECHO is deterministic, source-independent, fully distributed, accommodates mobility, and balances battery consumption across nodes. We prove ECHO's correctness and show that its communication complexity is lower than that of Multi-Point Relay (MPR) and Flooding, and comparable to that of Opportunistic Announcement (OA). Simulations over random mobile low-capacity networks show that ECHO provides at least a 30% better delivery ratio than Flooding, MPR, and OA for 50-node networks and dramatically reduces the communication load. Experiments on a 12-node testbed of goTenna mobile mesh networking devices show that ECHO reduces transmissions by about 3x and increases battery life by more than 50% over Flooding. ECHO's performance advantages are crucial for scalable broadcast in low-power, low-capacity wireless networks.
... One key idea is to reduce control overhead by reducing the number of broadcasts as compared with pure flooding mechanisms. The basic concept to support this idea in OLSR is the use of multipoint relays (MPRs) [1], [2]. The latency for OLSR has the highest values from 1 to 10 hops, and generally the highest slope. ...
... Therefore, information about all MPRS sets can be propagated to all nodes in the network with a small number of retransmissions. The total overhead in OLSR is shown in Equation (2). ...
Article
Past study of MANET routing protocols focused on designing new protocols, comparing existing protocols, or improving protocols before standard MANET routing protocols are established. Researchers have studied these protocols using simulations of arbitrary networks with certain traffic profiles. Due to the lack of consistent characterization of different MANET protocols, prior simulation experiments are not well designed. Some protocols that perform well, in terms of control overhead or throughput, in some scenarios may have poor performance under other conditions. Therefore, the conclusions based on these simulations cannot be generalized. These efforts can be aided by a framework that can characterize MANET routing protocols. We can describe MANET routing protocols with the RNS framework so that researchers can understand the protocols more easily. This framework characterizes different MANET routing protocols and highlights the internal relationships among different protocols. Quantitative models based on the RNS framework can be used to identify factors that affect control overhead for different MANET routing protocols. The framework allows comparison of routing protocols by analytical models coupled with network parameters and traffic profiles. Possible ideas for improving proposed MANET routing protocols can be found using the RNS framework. The RNS framework and the corresponding quantitative model can aid the design, evaluation, and validation of new MANET routing protocols with emphasis on control overhead. In this chapter, we concentrate on Comparison of Two Proactive Protocols: OLSR and TBRPF using the RNS (Relay Node Set) Framework. Based on the results and assumptions, OLSR usually has larger overhead in the maintenance module than TBRPF.
... It is demonstrated that the use of MPRs improves the network scalability[67] ...
Thesis
Full-text available
Nowadays, we live in a modern society in which people and devices are interconnected anywhere and anytime. Under this premise, both the infrastructure and the services offered have evolved and diversified in a drastic way. In fact, many of these services are transported in decentralized networks. Among them, Wireless mesh networks are decentralized networks that have been widely studied in different research areas such as community networks, public safety and surveillance. Wireless mesh networks have been also studied and evaluated in the Smart Grid scenario. Smart Grids are a new paradigm in which the electricity network is no longer focused only on the generation, distribution and transport of electricity to subscribers. Now, it is a robust network that includes a data communication network. The associated data network is divided in different subnetworks. This thesis is mainly focused on the improvement of the performance of one of those subnetworks, the so-called Smart Grid Neighborhood Area Network. Several applications are transmitted between the users and the control center. In general, upstream communication involves tasks such as meter reading, billing data or electricity consumption, while downstream communication allows the smart grid to take actions in different network situations such as power peaks or emergency situations. In the first part, the work is focused on improving the routing mechanism. To do this, a multipath routing mechanism is proposed, where the traffics that are most important are transmitted over the best communication links. In order to improve even more the benefits obtained, a multichannel scheme is proposed to separate both control traffic and data traffic, and use the less congested channels to transmit the most priority traffic types.Smart Grids offer many services and some of them are very demanding in terms of QoS. Besides, infrastructure failures, attacks and high congestion situations can greatly reduce the network performance. Therefore, the network must be able to offer a minimum QoS to the most priority applications handling some traffic control techniques. With this goal in mind, in this thesis some congestion control mechanisms are also proposed. In the first of these mechanisms, the decision of whether a packet should be retransmitted or not is made in a distributed and independent way by each one of the network nodes, depending on the network conditions that the node itself is observing. This mechanism considers again the existence of traffics with different priorities, so that, less priority traffic has a higher probability of being discarded. Furthermore, an emergency system is coupled to the congestion control mechanism. With this strategy, the NAN is able to take global actions (in a short time) to face anomalous situations.In a Smart grid scenario, the nodes are static and each of them transmits upstream data flows to the data concentrator. Therefore, depending on their geographical location, some nodes may be more favored than others. Besides, some nodes can monopolize the network resources if they are not regulated. For this reason, in this thesis another distributed solution is proposed that runs in each node. The objective here is to provide a fair distribution of network resources regardless of the geographical position and the transmission rate. The last contribution is focused on the application of machine learning techniques to obtain again a better performance of the data networks under study. In this sense, a new congestion control mechanism is proposed, which, like the previous ones, provides different quality of service to data flows with different priorities. For this, a complete framework is proposed, including the generation, preprocessing and evaluation of the data necessary for the training of the machine learning algorithms that will be used. The proposal is also implemented and evaluated in the Smart Grid NANs environment
... Timeout values and validity information is contained within the messages. Working of MPRs makes OLSR unique [10]. Figure 4 depicts the working of these MPRs. ...
Article
Full-text available
This paper rationalizes nine proactive protocols in terms of their efficiencies, inefficiencies and convergence properties. This is done in order to pinpoint challenges associated with these protocols, so that novel algorithms may be proposed for coping with the discovered issues. The methodology followed to put forward the said solutions is that of Bayesian inference. Bayesian inference is a statistical technique having wide applications in the decision theory. The paper highlights salient features of Bayesian inference and, in the meantime, scrutinizes its applicability as a problem solving mechanism in the decision making of proactive routing protocols.
Article
Secure group communication is a challenging task with respect to MANET’s. Since its introduction as a communication medium, wireless technology found broad application on the battlefield. Robust and reliable group communication plays a major role in developing distributed mobile application in which unannounced disconnections will occur frequently due to the mobility of the nodes which take part in mobile applications. Accompanying dramatic advances in wireless technology and the capabilities associated with small computing devices, the demand for advanced mechanisms to employ wireless technology in the battlefield continues to grow. The main objective here is to achieve robust and reliable group communication in mobile ad hoc network .Performance of the group communication is compared with the given protocols through simulation in NS-2. The analysis is made with respect to the throughput, packet transmission between source and destination. We propose four Ad hoc Routing Protocols AODV, DSR, and have given the comparative study.
Article
Full-text available
Ad hoc networks are a collection of nodes that are connected to rapidly changing topologies via a wireless medium. Attacks on protocols of ad-hoc network routing disturb network performance and solution reliability. We present briefly the most common protocols that are followed by on-demand approaches based on the table and source. The combined performance of the proposed solutions and ad hoc network parameters is demonstrated by stable protocols. The inherent characteristics make it an ideal choice in military and civil communication.Such types of networks' main performance constraints are due to security threats due to complex topology and the absence of centralized supervision. The normal functionality of the network is negatively affected by passive and active attacks. The network traffic and network nodes are monitored by passive attackers. Active attacks such as Blackhole attackers can partially or entirely drop packets from the network. A secure protocol can mask path, source and destination identities and locations, to ensure safety and privacy in the event of attacks by intruders.Therefore, this paper introduces a route selection method for MANET, which improves source, destination and route security features against passive and specified assaults. The method developed division the whole communication area dynamically into different zones and selects a position as a temporary destination from the divided zones. The position-approximate node is chosen as the random sponsor node and data is transmitted via random forwarder node with GPSR. The method is anonymous to the nodes both in terms of identity and location. Methods to prevent timing attacks are also proposed. 1. INTRODUCTION Many routing protocols were designed especially for WSNs in which energy knowledge is the main concern. The WSN's routing protocols vary according to the application and architecture of a network. Ad-hoc networks are a new wireless communication paradigm for mobile hosts that frequently modify the topology of node mobility. Ad hoc networks are autonomous structures made up of routers and hosts that can help mobile abilities and arbitrarily organize themselves. That makes it dynamic and impredictable to change the topology of the ad-hoc network.Moreover, without any administrative servers or infrastructure, ad hoc network can either be built or destroyed quickly and autonomously. The insider and outsider of the wireless network is certainly difficult for people without support from the fixed infrastructure. It is therefore not easy for us to distinguish between legal and unlawful wireless participants. The abovementioned properties have led to a major challenge when designing a wireless network system for the implementation of the security infrastructure.If ad hoc network nodes are mobile and wirelessly connectivityable, they are also called mobile ad hoc network (MANET). In situations that require a completely decentralized network without fixed base stations, such as fighting areas, military applications as well as other emergencies and catastrophes, they also need an extreme flexible communications technologies. Versatile hubs cooperate in a multi-jump impromptu remote system to make a system without utilizing framework, for example, passageways or base stations. The versatile hubs are then sending each other's bundles to permit correspondence between hubs outside the WiFi portfolio. The versatility of the hubs and the generously diminished limit of the remote condition alongside its impacts on remote transmission, for example, constriction, proliferation of multipaths and impedance, makes noteworthy difficulties for specially appointed directing conventions. Meanings of impromptu system utilizes differ from military activities and fiasco alleviation to assemble systems administration and understudy/meeting connection. Security in the steering convention is expected to ensure against assaults like a noxious directing confusion in these or other specially appointed systems administration applications. This article audits assaults on specially appointed systems and examines current strategies in impromptu system cryptography. We portray the condition of examination and its exploration challenges in safe specially appointed steering conventions.
Chapter
Passive clustering does not employ control packets to collect topological information in a Mobile Wireless Sensor Networks (MWSNs). The primary objective is to make Passive Clustering more practical, robust, and to minimize the quantity of cluster information on the data packets. In this chapter, we propose an intelligent gateway selection heuristic along with a time-out mechanism and an efficient passive clustering algorithm that employs an optimal number of gateways to reduce the number of rebroadcast and improve the QoS of the network. In this proposal, we avoid making frequent changes in cluster architecture, caused due to repeated election and re-election of cluster heads and gateways.
Chapter
Wireless (ad hoc) network is a group of nodes to communicate with each other over a wireless channel to receive and transmit data packets among their neighbors residing in the transmission range. We propose to build a wireless ad hoc network to maintain data transmission in a cost-effective way with minimal data packets. This transmission of data can commence in conditions/circumstances which are challenged and harsh to continue without failure caused by any network, environmental or other factors and ensure fault tolerance in such kind of noisy network. In spite of having vast research experiments in this area, existent studies shows lack effort in establishing both balanced coverage of two hop neighbors of sender and fault tolerance in the network with minimal message propagation at the same time. In this paper, a new algorithm using two hop distant neighbor information is proposed and a special version of set cover problem suited to ad hoc networks is used to output multiple forwarder lists by which, all the uncovered two hop neighbors are covered once. Extensive simulations made in NS2 implementation show that the algorithm provides high delivery rate (88% in average) of packets and transmission of average number of packets is lower than existent Dominant Pruning algorithm. Later we analyzed the reachability aspect of the algorithm by calculating the percentage of nodes (receivers) reached in presence of various fractions of malfunctioning nodes integrated deliberately by us in the network.
Chapter
Nowadays, we are moving towards smart environments and Internet of things. These new intelligent devices offer us an easy and comfortable life support the difficult work or complex tasks that humans have done so far. In such environment, the communication is a decisive way to ensure proper functioning of the intelligent system, especially in health and transportation. The mobile device collect important information and share knowledge between them or with the cloud to manage resources and assets. The routing protocols in such environment must meet the challenges and respect the characteristics of devices like restricted access to power, small computational capacity, and weak wireless signals, etc. The overhead generated by the routing protocol affects the quality requirements of smart applications in terms of reliability and availability. In network without infrastructure, as sensor or mobile ad hoc networks, reducing the overhead constitutes the major reason to build a reliable and efficient network. In this paper, we propose a hybrid zoning algorithm called the Zone Geographic Forwarding Rules (Z-GFR) that combines two zoning strategies in one and same routing protocol to enhance the performances of mobile communication in ad hoc network. We have implemented our solution in the optimized link state routing protocol (OLSR). We will study the enhancement of the Z-GFR technique compared to other zoning techniques and to the OLSR protocol in terms of bandwidth, packets delivery ratio and end-to-end delay. We will show by simulations that Z-GFR scales down the overhead related to the protocol and meets quality of service requirements while it ensures a good dissemination of the topology.
ResearchGate has not been able to resolve any references for this publication.