Beruflich Dokumente
Kultur Dokumente
5/14/2012
Outline
Mobile Ad Hoc Networks (MANETs) Broadcasting and its Importance Common Problems of Broadcasting in MANETs Related Work on and Limitations Motivation Proposed Contributions Plan of Work and Structure of the Thesis Conclusions
5/14/2012
Potential use: communication in battlefield, home networking, temporary local area networks, disaster recovery operations, group communication.
5/14/2012
Important Issues
What is Broadcasting
Broadcasting is a fundamental operation in MANETs, a source sends the same message to all the network nodes. In the one-to-all model, a transmission by a given node reach all nodes that are within its transmission radius.
Characteristics
Spontaneous
Unreliable:
No ACK required . ACK may cause additional medium contention.
5/14/2012
Why Broadcasting?
Broadcasting has many important uses, and several MANET protocols assume the availability of an underlying broadcast service. Applications which make use of broadcasting include Paging a particular host Finding a route to particular host, It can also be used for route discovery in routing protocols. E.g., a number of MANET routing protocols such as Dynamic Source Routing (DSR), Ad Hoc on Demand Distance Vector (AODV), Zone Routing Protocol (ZRP), and Location Aided Routing (LAR) use broadcasting to establish routes One of the first proposed mechanisms is blind flooding.
5/14/2012
5/14/2012
Common Problems
Redundant retransmission
Host rebroadcasts packet although neighbors may already have it.
Contention
Simultaneous rebroadcast attempts by neighbours. Rather obvious; the more crowded the area, the more the contention
Collision
No Request to Send/Clear to send (RTS/CTS) scheme No CD, entire packet transmitted anyways
5/14/2012
2. Counter-based scheme
Rebroadcast if the number of received duplicate packets is less than a threshold
3. Distance-based scheme
Uses the relative distance between nodes to make the decision
4. Location-based scheme
Based on pre-acquired location information of neighbors
5.
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, Wireless Networks, vol. 8, no. 2, pp.153-167, 2002
5/14/2012
In the distance-based scheme and location-based scheme, it is assumed that each node is equipped with a positioning device such as GPS which is another overhead In selecting forwarding neighbours, the goal is to minimize the number of relay points. The computation of a multipoint relay set with minimal size is NP-complete problem,
Y.-C. Tseng, S.-Y. Ni, E.-Y. Shih, Adaptive approaches to relieving broadcast storm in a wireless multihop mobile ad hoc network, IEEE Transactions on Computers, vol. 52, no 5, 2003.
5/14/2012
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, Wireless Networks, vol. 8, no. 2, pp.153-167, 2002
5/14/2012
10
J. Cartigny and D. Simplot. Border node retransmission based probabilistic broadcast protocols in ad-hoc networks. Telecommunication Systems, vol. 22, no 14, pp. 189204, 2003. Qi Zhang and Dharma P. Agrawal , Dynamic probabilistic broadcasting in MANETs, J. Parallel Distrib. Comput. Vol 65, pp. 220233, 2005
5/14/2012
11
Motivation
The broadcast storm problem can be avoided by providing efficient broadcast algorithms that aim to reduce the number of nodes that retransmit the broadcast packet while still guaranteeing all nodes receive the packet. My research work focuses on providing some efficient probabilistic broadcast algorithms that can dynamically adjust the broadcast probability to take into account the current state of the node in one and two hopes in order to ensure a certain level of control over rebroadcasting, and thus helps to improve reachability and saved rebroadcasts to reduce the broadcast redundancy in MANETs.
5/14/2012
12
Motivation
There has not been so far any attempt to analyse its performance behaviour in a MANET environment. For example, The effects of a number of important system parameters in a MANETs, including node speed, pause time, traffic load, and node density on the performance of probabilistic flooding.
5/14/2012
13
Proposed Contributions
Performance Analysis of Probabilistic Flooding Analysis of Topological Characteristic The Adjusted Probabilistic Flooding Algorithm The Highly Adjusted Probabilistic Flooding Algorithm
5/14/2012
14
There has not been so far any attempt to analyse the performance probabilistic flooding behaviour in MANETs. We are the first who investigates the effects of a number of important parameters in a MANET on the performance of probabilistic flooding using extensive ns-2 simulations:
1. 2. 3.
Speed and Node Pause Time Mobility and Density Mobility and Traffic Load
M. Bani Yassein, M. Ould-Khaoua, S. Papanastasiou, On the Performance of Probabilistic Flooding in Mobile Ad Hoc Networks, to appear in the Proc. of International Workshop on Performance Modelling in Wired, Wireless, Mobile Networking and Computing in conjunction with 11th (ICPADS-2005),IEEE Computer Society Press, 20 - 22 July 2005.
5/14/2012
15
Simulation Experiments
1- We have studied the effects of mean node speed and pause time of the random waypoint model on the probabilistic flooding in MANETs.
We have done this through simulation by using NS-2 packet level simulator v.2.27.
Assumptions: Each mobile node is equipped with CSMA/CA (carrier sense multiple access with collision avoidance) which can access the air medium following the 802.11 protocol.
5/14/2012
16
Simulation Experiments
Input parameters
Transmitter range Bandwidth Interface queue length Simulation time No of node Max. Speed Packet size Topology size Pause time 250 m 2Mbits 50 packets 900 sec 25,50,75,100 1,5,10,20 m/sec 512 bytes 600X600 m2 0 ,20 ,40sec
5/14/2012
17
Simulation Experiments
Performance metrics:
Saved Rebroadcasts (SRB): is computed as (r - t)/r where r is the number of nodes receiving the broadcast message, and t the number of nodes that actually transmitted the message. Reachability (RE): is the percentage of mobile nodes receiving the broadcast message divided by the total number of mobile nodes that are reachable, directly or indirectly.
5/14/2012
18
Simulation Experiments
Probability Vs Reachability
100 95
RE
RE at 20 m/s
90 85 80
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
Probability
Probability
Fig. 1: Effects of speed on saved rebroadcast using probabilistic flooding with pause time 0 .
done.
5/14/2012
19
Simulation Experiments
SRB
Probability
Probability
Fig. 4: Effects of pause time on saved rebroadcast using Probabilistic flooding with speed 5 m/s
Fig. 3: Effects of pause time on saved rebroadcast using probabilistic flooding with speed 1m/s.
don1
5/14/2012
20
5/14/2012
21
Simulation Experiments
Re at 25 100 RE at 50 80 RE at 75
80 100
Re at 25 Re at 50 Re at 75 Re at 100
RE
RE
RE at 100
P r obabi l i ty
P r obabi l i ty
Fig. 6: Impact of density on reachability for different network densities with node speed 1 m/s..
Fig. 5: Impact of density on reachability for different network densities with node speed of 10 m/s..
done.
5/14/2012
22
Simulation Experiments
SRB
SRB
0.98 0.96 0.94 0.92 0.9 0.88 0.86 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 P r obabi l i ty 1
0.96 0.94 0.92 0.9 0.88 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 P r obabi l i ty 1
SRB at 100
Fig. 8: Impact of density on saved rebroadcast for different network densities with node speed 1 m/s.
Fig. 7: Impact of density on saved rebroadcast for different Network densities with node speed of 10 m/s..
done.
5/14/2012
23
5/14/2012
24
Simulation Experiments
RE at 1m/ s RE at 5m/ s 100 80 RE at 10m/ s RE at 20m/ s
100 80 RE at 1m/ s RE at 5m/ s RE at 10m/ s RE at 20m/ s
RE
RE
Pro b ab ilit y
Pro b ab ilit y
Figure 10 : The impact of load on reachability at one broadcast/ second for different node speedtime.
Figure 9: The impact of traffic load on reachability at three broadcasts/second for different node speeds
done.
5/14/2012
25
Simulation Experiments
Figure 12 : The impact of load on reachability at one broadcast/ second for different node speedtime.
Fig. 11: Impact of load on saved rebroadcast 3 messages/s for node speeds 1, 5, 10, and 20 m/s.
done.
5/14/2012
26
Proposed Contributions
We present the analysis of average number of neighbour to provide the basis for the selection of the value of p. Figures 13-14 show the minimum, average and maximum number of neighbours for different node number with the network area of 600 m 600 m, 800 m 800 m, and 1000 m 1000 m, respectively. The higher is the maximum number of neighbours, the denser the network is. Lower the minimum number of neighbours is sparser the network is. From the minimum, average and maximum number of neighbours, we can estimate the value of rebroadcast probability.
M. Bani Yassein, M. Ould-Khaoua, S. Papanastasiou, On the Performance of Probabilistic Flooding in Mobile Ad Hoc Networks, to appear in the Proc. of International Workshop on Performance Modelling in Wired, Wireless, Mobile Networking and Computing in conjunction with 11th (ICPADS-2005),IEEE Computer Society Press, 20 - 22 July 2005. 5/14/2012 27
Simulation Experiments
done.
5/14/2012
28
The adjusted probabilistic flooding algorithm operates as follows. On hearing a broadcast message m at node X, the node rebroadcast a message according to a high probability if the message is received for the first time, and the number of neighbours of node X is less than average number of neighbours typical of its surrounding environment. Hence, if node X has a low degree (in terms of the number of neighbours), retransmission should be likely. Otherwise, if X has a high degree its rebroadcast probability is set low
5/14/2012 29
Generate a random number RN over [0, 1]. If RN <= p rebroadcast the received message; otherwise, drop it
5/14/2012
30
Simulation Experiments
110 100 90 80 70 60 50 40 30 20 10 0 20 40 60 80 100 120 140 160 Number of nodes
Reachability
Figure 15: saved rebroadcast of three broadcast schemes against network density with node speed 10m/s.
done.
5/14/2012
31
The highly adjusted probabilistic flooding algorithm operates as follows when a broadcast message is received for the first time by a node, it is rebroadcast according to a probability distribution which depends on the nodes degree. The message is re-broadcast with probability which depends on the nodes degree if the node is inside a sparse node population. Similarly, it is re-broadcast with the probability is if the degree denotes a medium density node population. Finally, in dense node populations the node will rebroadcast the message with a lower probability. Sparse, medium and dense populations correspond to minimum, average and maximum threshold values which we will determine through simulation..
5/14/2012
32
5/14/2012
5/14/2012
34