1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Nick Feamster CS 4251 Computer Networking II Spring 2008
The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
5/11/20151 Computer Networks COE 549 Random Access Tarek Sheltami KFUPM CCSE COE
1 DOA-ALOHA: Slotted ALOHA for Ad Hoc Networking Using Smart Antennas Harkirat Singh & Suresh Singh Portland State University, OR, USA.
MAC Layer (Mis)behaviors Christophe Augier - CSE Summer 2003.
NCKU CSIE CIAL1 How Optimal are Wireless Scheduling Protocols? Authors: Thomas Moscibroda, Yvonne Anne Oswald and Roger Wattenhofer Publisher: IEEE INFOCOM.
The Capacity of Wireless Ad Hoc Networks
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Presented by Scott McLaren Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
CS Dept, City Univ.1 The Complexity of Connectivity in Wireless Networks Presented by LUO Hongbo.
MAC Layer Protocols for Sensor Networks Leonardo Leiria Fernandes.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Using Directional Antennas for Medium Access Control in Ad Hoc Networks MOBICOM 2002 R. Roy Choudhury et al Presented by Hyeeun Choi.
Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks CIS 888 Prof. Anish Arora The Ohio State University.
A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
Opersating Mode DCF: distributed coordination function
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
MAC Protocols and Security in Ad hoc and Sensor Networks
Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
Selecting Transmit Powers and Carrier Sense Thresholds in CSMA Jason Fuemmeler, Nitin Vaidya, Venugopal Veeravalli ECE Department & Coordinated Science.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
TRANSMISSION POWER CONTROL FOR AD HOC WIRELESS NETWORKS: THROUGHPUT, ENERGY AND FAIRNESS Lujun Jia; Xin Liu; Noubir, G.; Rajaraman, R.; Wireless Communications.
Joint Scheduling and Power Control for Wireless Ad Hoc Networks Advisor: 王瑞騰 Student: 黃軍翰.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
1 POWMAC: A Single-Channel Power-Control Protocol for Throughput Enhancement in Wireless Ad Hoc Network Alaa Muqattash and Marwan Krunz The University.
1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks Tijs van Dam, Koen Langendoen In ACM SenSys /1/2005 Hong-Shi Wang.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
Medium Access Control in Wireless networks
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
1 A Power Control MAC Protocol for Ad Hoc Networks EUN-SUN JUNG, NITIN H. VAIDYA, Wireless Networks 11, 55–66, Speaker: Han-Tien Chang.
Structure-Free Data Aggregation in Sensor Networks.
1 Effectiveness of Physical and Virtual Carrier Sensing in IEEE Wireless Ad Hoc Networks Fu-Yi Hung and Ivan Marsic WCNC 2007.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Power Controlled Dual Channel (PCDC) Medium Access Protocol for Wireless Ad Hoc Networks Alaa Muqattash and Marwan Krunz IEEE INFOCOM 2003 Speaker: Chien-Wen.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
MAC Protocols for Sensor Networks
1 Wireless Networking Understanding the departure from wired networks, Case study: IEEE (WiFi)
TCP and MAC interplay in Wireless Ad Hoc Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Power Efficient Communication ----Joint Routing, Scheduling and Power Control Design Presenter: Rui Cao.
Presentation transcript:

1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore IEEE TRANSACTIONS ON MOBILE COMPUTING OCTBER 2008

2 Outline Introduction Related Work Power Control For RTS/CTS-Based Systems Discussions on RTS/CTS-Based Systems Experimental Results Conclusion Comments

3 Introduction In wireless network, both the space and time utilized for transmissions as shared resource Efficient utilization of this limited resource is key to improving the performance of ad hoc networks Transmission power control Reducing the transmission power causes less interference to nearby receivers More links can be activated simultaneously Improving the overall throughput to the network

4 Introduction (cont’d) Common belief that Using just-enough power to reach the receiver will both reduce the transmission power consumption and increase the network throughput Linear power assignment [6] achieves a just-enough received power level for the receiver Centralized vs. Distributed Distributed MAC protocols Disseminate collision avoidance information (CAI) Carry the CAI… RTS/CTS exchange, physical carrier sensing, or busy tone [6] T. Moscibroda and R. Wattenhofer, “The Complexity of Connectivity in Wireless Networks,” Proc. IEEE INFOCOM, 2006.

5 Introduction (cont’d) Linear power assignment Achieves the same received power level at the receiving end for different link length All receivers have the same tolerance for future interference no matter how close the transmitter-receiver pair is Clear the same size of region around the receiver (CTS) A short link with linear power assignment may need to block senders in a large region for a collision-free transmission wastes the limited space-time resource.

6 Introduction (cont’d) Basic trade-off between Transmission power (transmitter) determines how much interference the link has introduced to the channel Interference tolerance (receiver) determines how many future transmissions are blocked by the link If the transmitter reduces its power, the receiver is more susceptible to interference and will have to block transmissions in a larger area.

7 Introduction (cont’d) Use simple model (RTS/CTS, fixed rate) Investigate this basic trade-off in distributed MAC systems Transmission floor of a link the union of the RTS/CTS region In order to increase the aggregated throughput minimize the transmission floor used in each transmission subject to the SINR constraint of capture threshold β

8 Introduction (cont’d) Contributions Optimal RTS/CTS-based MAC scheme Minimize the transmission floor Routing mechanisms Favor short hops over long hops give at most a constant factor improvement in network throughput power control should reside at the MAC layer and not at the routing layer Extend the results drawn from the RTS/CTS system to other distributed MAC systems Changing the transmission rate with respect to the link distance can at most increase the throughput by a factor of 2

9 Related Work Two major objectives for power control Improve the space-time utilization Save the energy used in transmission Physical carrier sensing [8][9] Protecting long-distance transmissions in Sensing area is centered at the transmitter Reserves a larger transmission floor than the CTS area Busy-tone-based approach [3][4] To avoid collision, the receiver will send a busy tone in a separate channel to inform nearby nodes A single channel solution [5] (POWMAC) Centralized link scheduling [6][12] Construct an efficient scheduling algorithm for network connectivity

10 Power Control For RTS/CTS-Based Systems System Model and Assumptions Assumptions A node has no knowledge of future transmissions in the vicinity before they occur RTS messages and data packets are transmitted at the same power level Node i is sending data to node j with transmission power P t (i), the distance between node i and j is d ij,and the received power at node j is P r (i) (j) Antenna Gain Path-loss Factor 2~4

11 Power Control For RTS/CTS-Based Systems (cont’d) The SINR at the receiver is larger than a predefined capture threshold β where P r (k) (j) is the interference caused by the simultaneous transmission of node k, and P n (j) is the noise level at node j.

12 Power Control For RTS/CTS-Based Systems (cont’d) Use the metric of Transport Capacity [2] to evaluate the performance of a network define its transport throughput as the sum of products of the rate and link length over all simultaneously active links Transport throughput is measured in bit-meters per second

13 Power Control For RTS/CTS-Based Systems (cont’d) RTS range can serve as a measurement of how much interference the sender introduces to its neighbors when transmitting the RTS/data packet CTS range can serve as the measurement of “interference” introduced by the receiver that blocks future transmissions around it. Goal minimizes the overall “interference” so that the spatial utilization can be increased.

14 Power Control For RTS/CTS-Based Systems (cont’d) Each link can only independently minimize its own transmission floor, to improve the spatial utilization of the whole network Theorem 1 For a transmitter-receiver pair (i,j) separated by the distance of d ij, the minimum transmission floor reserved by the RTS/CTS-based system isΘ(β 1/α d max d ij ), where d max is the maximum transmission range used in the network.

15 Power Control For RTS/CTS-Based Systems (cont’d) The maximal interference that the receiver j can tolerate If a node k is transmitting at the maximal power P max and has a distance of d kj to the receiver and if we have

16 Power Control For RTS/CTS-Based Systems (cont’d) Define, which is the distance threshold within which a node transmitting at P max can interfere with node j’s reception from node i. The transmission range of CTS for node j should be at least d int (j) P recv is the receiver sensitivity CTS transmission power

17 Power Control For RTS/CTS-Based Systems (cont’d) The transmission power P t (j) of the CTS is inversely proportional to the transmission power P t (i) of data and RTS. When we reduce the power of the data packet, we need to increase the power of CTS accordingly, since the receiver is more vulnerable to interference The maximal transmission range

18 Power Control For RTS/CTS-Based Systems (cont’d) The transmission range of CTS and RTS, respectively d c = d r = will satisfy,

19 Power Control For RTS/CTS-Based Systems (cont’d) Let the area of the transmission floor be A ij (d c,d r ) Result (when d c * = d r * ) The area of reserved floor is Θ(β 1/α d max d ij ), when using the optimal power control scheme

20 Power Control For RTS/CTS-Based Systems (cont’d) Comparison with linear power assignment a transmission power to guarantee a fixed receiving power level of ρP recv The transmission range of CTS is d int (j) = (β/ρ) 1/α d max which is a constant comparable to d max When nodes i and j are very close to each other, node j still needs to send the CTS to clear a transmission floor with an area proportional to πd max 2

21 Discussions on RTS/CTS-Based Systems Routing-Layer Choice Uniform Link Length vs. Heterogeneous Link Length Theorem 2. For a network deployed in a field with area A, if all links are using the same transmission range of d and the transmission rate of R, the maximal total transport throughput of the network is for a fixed maximal transmission range, no matter how small the link length d chosen by the routing layer is, the transport throughput can at most be improved by a constant factor

22 Discussions on RTS/CTS-Based Systems (cont’d) Link Asymmetry cause fairness problems in RTS/CTS-base systems The nearby long link (k,l) cannot hear the RTS/CTS of link (i,j),so it will always assume that the channel is idle, even when (i,j) is transmitting. In the optimal power control scheme The transmission power for node i in this scheme is large enough so that node k cannot interfere link (i,j) once the transmission of node i has started

23 Experiment Result Simulation Setup Parameters Used in simulation  Maximal transmission rage d max ≒ 250m  Single channel system String topology

24 Experiment Result (cont’d) Comparison to Other Power Control Schemes NTPC (no power control) TPC-O (optimal power control) RTS, CTS, and data are sent at the optimal power TPC-L1 (linear power assignment 1) Use linear power assignment for RTS and data  ensures that the received power is just 3 dB above P recv. CTS is sent using maximal power to prevent collisions TPC-L2 (linear power assignment 2) CTS power is the same as RTS/data TPC-E (power control for energy saving) RTS/CTS  Maximal Power, data  linear power assignment

25 Experiment Result (cont’d) The collision rate of TPC-L2 rises when d is close to 150 m, where node B’s CTS cannot be heard by node C. Yet, it will interfere with node D’s reception.

26 Experiment Result (cont’d)

27 Experiment Result (cont’d) Random Networks 500m * 500m network with 200 randomly deployed nodes. randomly choose 20 source destination pairs that are apart by more than 250 m

28 Experiment Result (cont’d) Random Networks Routing Scheme 1 The next-hop node is chosen to be the one that is closest to the destination and is not more than 250 m from the source. Routing scheme 2 This scheme is similar to scheme 1 but restricts the next- hop node to be within 100 m. Routing scheme 3 This scheme prefers shorter links. The next-hop node is selected as the closest node to the current transmitter among nodes that provide a positive progress toward the destination.

29 Experiment Result (cont’d)

30 Experiment Result (cont’d)

31 Experiment Result (cont’d) Fig. 9. Experiment results on random networks of different sizes with optimal power control (a) Average link length. (b) Aggregated throughput (c) Transport throughput.

32 Conclusions Investigated the trade-off between transmission power and interference tolerance in distributed MAC systems The transport throughput is determined by the maximal transmission range rather than the choice of routing protocols

33 Comments Discuss power control in RTS/CTS-based system in multi-dimension Plentiful experiment result