On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas Minglu Li ( Department of Computer Science and Engineering, Shanghai Jiao Tong University ) Ling Ding, Yifeng Shao ( Department of Computer Science, Texas University at Dallas, Richardson ) Zhensheng Zhang ( Argon ST (formerly SDRC) Inc., San Diego, CA ) BoLi ( Department of Computer Science and Engineering, Hong Kong University ) IEEE Transactions on Vehicular Technology, TVT 2010
Page: 2 WMNL Introduction Virtual Link Reduction-based Protocol Performance Evaluation Conclusion
Page: 3 WMNL Broadcasting is essential in ad hoc networks for –Data dissemination –Route discovery –Resource discovery –Management –…–…
Page: 4 WMNL Broadcasting mechanism can categorize into three types –Simple flooding –Probability based –Neighbor knowledge based Waste too much network bandwidth Consume too much energy Waste too much network bandwidth Consume too much energy
Page: 5 WMNL Broadcasting mechanism can categorize into three types –Simple flooding –Probability based –Neighbor knowledge based Waste too much network bandwidth Consume too much energy Waste too much network bandwidth Consume too much energy Full delivery may not be guaranteed
Page: 6 WMNL Broadcasting mechanism can categorize into three types –Simple flooding –Probability based –Neighbor knowledge based Waste too much network bandwidth Consume too much energy Waste too much network bandwidth Consume too much energy Full delivery may not be guaranteed More efficient than flooding and probability based methods
Page: 7 WMNL Omnidirectional antennas in wireless ad hoc networks are highly inefficient in terms of power and capacity. –Rather small portion of the transmission power is actually intercepted by the antenna of the intended receiver Receiver Unwanted and harmful interference 10 350 Sender
Page: 8 WMNL Directional antennas achieve better signal-to-noise ratio and reduce interference. Sender Receiver
Page: 9 WMNL Several protocols have been proposed toward efficient broadcasting using directional antennas. However, most of them –Are probability based approaches –Rely on location information –Rely on Angle-of-Arrival (AoA) information –Assume specific antenna models
Page: 10 WMNL This paper focus on applying directional antennas to broadcasting. –Achieving full delivery –Reducing transmission cost and redundancy –Reducing bandwidth consumption –No location or AOA information is used –Using a general antenna model
Page: 11 WMNL There is no packet collision. –Otherwise, full delivery cannot be achieved even under flooding.
Page: 12 WMNL General antenna model. –Directional beams do not have to be regular, aligned, or nonoverlapping. Directional transmission, Omnidirectional reception
Page: 13 WMNL VLR -based Protocol
Page: 14 WMNL VLR -based Protocol
Page: 15 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a First round exchanged
Page: 16 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a N(i)N(i)c Dx→yDx→y 2 N(d)N(d)c Dx→yDx→y 1 N(a)N(a)c Dx→yDx→y 2 First round exchanged
Page: 17 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a N(i)N(i)c Dx→yDx→y 2 N(d)N(d)c Dx→yDx→y 1 N(a)N(a)c Dx→yDx→y 2 N(c)N(c)adi Dx→yDx→y 434 First round exchanged
Page: 18 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a N(i)N(i)cjh Dx→yDx→y 241 N(d)N(d)acefg Dx→yDx→y N(a)N(a)cbd Dx→yDx→y 242 N(c)N(c)adi Dx→yDx→y 434 N(b)N(b)a Dx→yDx→y 2 N(j)N(j)i Dx→yDx→y 2 N(h)N(h)i Dx→yDx→y 3 N(g)N(g)def Dx→yDx→y 433 N(f)N(f)deg Dx→yDx→y 441 N(e)N(e)dfg Dx→yDx→y 121 First round exchangedSecond round exchanged
Page: 19 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a N(i)N(i)cjh Dx→yDx→y 241 N(d)N(d)acefg Dx→yDx→y N(a)N(a)cbd Dx→yDx→y 242 N(c)N(c)adi Dx→yDx→y 434 N(b)N(b)a Dx→yDx→y 2 N(j)N(j)i Dx→yDx→y 2 N(h)N(h)i Dx→yDx→y 3 N(g)N(g)def Dx→yDx→y 433 N(f)N(f)deg Dx→yDx→y 441 N(e)N(e)dfg Dx→yDx→y 121 Second round exchanged
Page: 20 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a N(i)N(i)cjh Dx→yDx→y 241 N(a)N(a)cbd Dx→yDx→y 242 N(c)N(c)adi Dx→yDx→y 434 N(b)N(b)a Dx→yDx→y 2 N(j)N(j)i Dx→yDx→y 2 N(h)N(h)i Dx→yDx→y 3 N(g)N(g)def Dx→yDx→y 433 N(f)N(f)deg Dx→yDx→y 441 N(e)N(e)dfg Dx→yDx→y 121 N(d)N(d)acefg Dx→yDx→y Second round exchanged
Page: 21 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a N(i)N(i)cjh Dx→yDx→y 241 N(a)N(a)cbd Dx→yDx→y 242 N(c)N(c)adi Dx→yDx→y 434 N(b)N(b)a Dx→yDx→y 2 N(j)N(j)i Dx→yDx→y 2 N(h)N(h)i Dx→yDx→y 3 N(g)N(g)def Dx→yDx→y 433 N(f)N(f)deg Dx→yDx→y 441 N(e)N(e)dfg Dx→yDx→y 121 N(d)N(d)acefg Dx→yDx→y Second round exchanged
Page: 22 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding e e b b h h i i j j f f d d c c g g a a 12 43
Page: 23 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Link Weight Given a network G =(V,E), weight(u 1,v 1 ) ＜ weight(u 2,v 2 ) if and only if: (1) min(ID(u 1 ), ID(v 1 )) ＜ min(ID(u 2 ), ID(v 2 )) (2) min(ID(u 1 ), ID(v 1 )) ＝ min(ID(u 2 ), ID(v 2 )) and max(ID(u 1 ), ID(v 1 )) ＜ max(ID(u 2 ), ID(v 2 )). Given a network G =(V,E), weight(u 1,v 1 ) ＜ weight(u 2,v 2 ) if and only if: (1) min(ID(u 1 ), ID(v 1 )) ＜ min(ID(u 2 ), ID(v 2 )) (2) min(ID(u 1 ), ID(v 1 )) ＝ min(ID(u 2 ), ID(v 2 )) and max(ID(u 1 ), ID(v 1 )) ＜ max(ID(u 2 ), ID(v 2 )) ＞ ＞
Page: 24 WMNL e e b b h h i i j j f f d d c c g g a a Local Topology Information Maintenance Virtual Link Reduction Forwarding
Page: 25 WMNL ab dc Local Topology Information Maintenance Virtual Link Reduction Forwarding
Page: 26 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm1: VLR Rule at Each Node v 1 Based on N 2 (v), a node v computes the localized broadcasting tree T v = (V(N 2 (v)), E(T v )) by applying Prim’s algorithm. 2 Reduced(v,w)= true if (v,w) E(T v ) = ∅. 3 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is a neighbor of a known forward node u and is within one of u’s forward directions. 4 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is the parent of v. 5 Return the reduced link set L v (Unreduced) = {(v,w)|w ∈ N(v) and Reduced(v,w)= false}. ab dc
Page: 27 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc
Page: 28 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm1: VLR Rule at Each Node v 2 Reduced(v,w)= true if (v,w) E(T v ) = ∅. 3 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is a neighbor of a known forward node u and is within one of u’s forward directions. 4 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is the parent of v. ab dc
Page: 29 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm2: VLR-Based Broadcasting (at Each Node v) 1Compute the reduced link set L v (Unreduced) based on the VLR rule. 2 If L v (Unreduced) = ∅, the broadcast packet is dropped. 3 Otherwise, v becomes a forward node, and F(v) = {d v→w | (v,w) ∈ L v (Unreduced)}. ab dc
Page: 30 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding F(1) ={b, d} ab dc
Page: 31 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm1: VLR Rule at Each Node v 2 Reduced(v,w)= true if (v,w) E(T v ) = ∅. 3 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is a neighbor of a known forward node u and is within one of u’s forward directions. 4 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is the parent of v. ab dc F(1) ={b, d}
Page: 32 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm1: VLR Rule at Each Node v 2 Reduced(v,w)= true if (v,w) E(T v ) = ∅. 3 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is a neighbor of a known forward node u and is within one of u’s forward directions. 4 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is the parent of v. ab dc F(1) ={b, d}
Page: 33 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm1: VLR Rule at Each Node v 2 Reduced(v,w)= true if (v,w) E(T v ) = ∅. 3 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is a neighbor of a known forward node u and is within one of u’s forward directions. 4 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is the parent of v. ab dc F(1) ={b, d} N(4)N(4)13567 dx→ydx→y dacbb N(1)N(1)324 Dx→yDx→y bdb
Page: 34 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm1: VLR Rule at Each Node v 2 Reduced(v,w)= true if (v,w) E(T v ) = ∅. 3 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is a neighbor of a known forward node u and is within one of u’s forward directions. 4 Reduced(v,w)= true if (v,w) ∈ E(T v ) and if w is the parent of v. ab dc F(1) ={b, d}
Page: 35 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d} 2 2
Page: 36 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d}
Page: 37 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d}
Page: 38 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d} Algorithm2: VLR-Based Broadcasting (at Each Node v) 1Compute the reduced link set L v (Unreduced) based on the VLR rule. 2 If L v (Unreduced) = ∅, the broadcast packet is dropped. 3 Otherwise, v becomes a forward node, and F(v) = {d v→w | (v,w) ∈ L v (Unreduced)}.
Page: 39 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d} F(3) ={b} F(4) ={a, d}
Page: 40 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d} F(3) ={b} F(4) ={a, d}
Page: 41 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d} F(3) ={b} F(4) ={a, d} F(9) ={b, c}
Page: 42 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d} F(3) ={b} F(4) ={a, d} F(9) ={b, c}
Page: 43 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc F(1) ={b, d} F(3) ={b} F(4) ={a, d} F(9) ={b, c}
Page: 44 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding ab dc Further conserve energy
Page: 45 WMNL v uw
Page: 46 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm3: Adjust Angle of the Directional Antenna 1 Reduce the angle of one directional antenna by m degrees. The new angle of the antenna should not be smaller than a predefined threshold (minimal_angle). 2 After the angle reduction, compare the number of nodes covered by the new angle with that by the old angle. If the new number is the same as the old number, go to step 1. If the new number is smaller than the old number, use the old angle, and go to step 3. 3 Return the modified angle of the directional antenna.
Page: 47 WMNL Local Topology Information Maintenance Virtual Link Reduction Forwarding Algorithm3: Adjust Angle of the Directional Antenna minimal_angle = 20 m = 20 minimal_angle = 20 m = 20 90 70 50 30 10 30 b b c c a a Further conserve energy The number of nodes covered by the new angle should not be smaller than the old number. The new angle should not be smaller than minimal_angle. Use the old angle
Page: 48 WMNL Simulation Parameters Simulator ds (Wireless Routing Simulation Suite) － Considers only functions in the network layer － Assuming an ideal MAC layer without contention, collision, or node mobility Size of network 1000 1000m 2 Number of nodes30~160 Deployment Communication range250 m Antenna pattern K-sector (4 K 360) Simulation times
Page: 49 WMNL Performance metrics Transmission cost |F| Redundancy ratio Impact factor Number of nodes (30 ~ 160nodes) Number of sectors (1 ~ 130) A(i)=90 N(i, v)=3 | F(v) |=3 The total number copies of a packet received by all nodes The total number of nodes in the network The total number copies of a packet received by all nodes The total number of nodes in the network
Page: 50 WMNL Comparison DSP “Broadcasting in ad hoc networks based on self-pruning” IEEE INFOCOM 2003 Omnidirectional Self-Pruning (OSP) “Efficient broadcasting in ad hoc wireless networks using directional antennas” IEEE TPDS 2006
Page: 51 WMNL VLR vs. DSP Normalized Transmission CostRedundancy Ratio DSP VLR K=4 K=8 K=16 K=32 K=360
Page: 52 WMNL VLR vs. OSP and Blind flooding Normalized Transmission CostRedundancy Ratio OSP VLR, K=8 Blind Flooding OSP VLR, K=8 Blind Flooding
Page: 53 WMNL Transmission Cost for different values of c 100 nodes80 nodes60 nodes
Page: 54 WMNL Transmission Cost for different values of c 100 nodes80 nodes60 nodes
Page: 55 WMNL Transmission Cost for different values of c 100 nodes80 nodes60 nodes
Page: 56 WMNL Transmission Cost for different values of c 100 nodes80 nodes60 nodes
Page: 57 WMNL Redundancy ratio for different network size 8 sectors, 100 nodes
Page: 58 WMNL The number of forward directions for different network size 8 sectors, 100 nodes
Page: 59 WMNL Transmission cost by applying the angle adjustment algorithm 1000 1000m 2, 100 nodes
Page: 60 WMNL This paper proposed a novel and efficient broadcasting algorithm (VLR) in ad hoc networks using directional antennas. –Achieving full delivery –Much lower transmission cost and redundancy –Conserves bandwidth and energy consumption –Neither location nor AOA information is needed
Page: 61 WMNL Wireless & Mobile Network Laboratory (WMNL.) Department of Computer Science and Information Engineering, Tamkang University