220 likes | 313 Views
A Busy-Tone based MAC Scheme for Wireless Ad Hoc Networks using Directional Antennas. Hong-Ning Dai, CUHK Kam-Wing Ng, CUHK Min-You Wu, SJTU. GLOBECOM 2007. Outline. Introduction Related work Busy-Tone based Directional MAC (BT-DMAC) Simulation results Conclusion. Introduction.
E N D
A Busy-Tone based MAC Scheme for Wireless Ad Hoc Networks using Directional Antennas Hong-Ning Dai, CUHK Kam-Wing Ng, CUHK Min-You Wu, SJTU GLOBECOM 2007
Outline • Introduction • Related work • Busy-Tone based Directional MAC (BT-DMAC) • Simulation results • Conclusion
Introduction • Benefit of directional antennas • Transmission range • Reduced interference • Increased spatial reuse
Introduction • Drawback of directional antennas • The hidden terminal problem • The deafness problem
RTS RTS Data Data CTS Hidden Terminal due to unheard RTS/CTS D Collision!! A B C
Introduction (Deafness) A RTS Data B C C does not know node A is busy. C keeps transmitting RTSs to node A
Related Work • Existing MAC protocols using directional antennas • Directional MAC (DMAC) • Dual Busy Tone Multiple Access with Directional Antennas (DBTMA/DA) • Circular-DMAC • Tone-based directional MAC (ToneDMAC)
Motivation and Goal • Motivation • There is no protocol that can completely solve both the hidden terminals and deafness problems with low overhead • Goal • Propose a new MAC protocolto attack the hidden terminal problem and the deafness problem
Antenna Model • Each node equipped with two interfaces: • Directional antenna(Switched beam) • two modes: omni-directional, directional • Data transmission • Omni-directional antenna • only used to send busy tones • notification
Busy Tone • Two omnidirectional busy tones: BTt (the transmitting busy tone) BTr (the receiving busy tone) • BTtand BTris encoded with a beam No. and node ID
Neighbor Discovery (NLT) • A node will record its neighbors’ info when it overhears any frames (RTS,CTS,data and ACK) C Neighbor Location Table (NLT) 3 0 The NLT of Node A A E No 10(ms) 2 1 D B
BT ( B , 2 ) BT ( A , 0 ) r t A scenario 3 0 C 2 1 3 0 3 0 D B 2 2 1 1 3 0 3 0 A 2 1 F 2 1 3 0 E 2 1
RTS DATA BT t CTS ACK BT r The time diagram of BT-DMAC A : Data transmission A : Busy tone B : Data transmission B : Busy tone
A B DATA C Deafness
Throughput Comparison 1 r= 2 and p = 0.008 ( trts=tcts=tack=5τ, tdata= 100τ)
Throughput Comparison 2 r= 2 and p = 0.008 ( trts=tcts=tack=5τ, tdata= 100τ)
Conclusion • We propose BT-DMAC to attack thehidden terminals and deafness problems. • Simulation experiments prove the effectiveness of our proposed protocol.