Joint Scheduling and Power Control for Wireless Ad Hoc Networks

1. Joint Scheduling and Power Control for Wireless Ad Hoc Networks Advisor:王瑞騰 Student:黃軍翰

2. Introduction • Infrastructure Wireless Networks Wired Network Access Point Access Point

3. Introduction • Ad Hoc Wireless Networks

4. Abstract • In this paper,we introduce a cross-layer design framework to the multiple access problem in contention-based wireless ad hoc networks. • The motivation for this study is twofold, limiting multiuser interference to increase single-hop throughput and reducing power consumption to prolong battery life. • We focus on next neighbor transmissions where nodes are required to send information packets to their respective receivers subject to a constraint on the signal-to interference-and-noise ratio.

5. ASSUMPTIONS AND DEFINITIONS • Consider a wireless ad hoc network consisting of n nodes. • Each node is supported by an omni-directional antenna. • Each node knows the geographical location of all other nodes • Routing is not considered in this study. • The effect of users’ mobility is not considered in this study.

6. ASSUMPTIONS AND DEFINITIONS • Assume that all nodes share the same frequency band,and time is divided into equal size slots that are grouped into frames • The slot duration is assumed to be larger than the packet duration by an interval called a “guard band.” • In this study, we assume that the frame lengthis fixed throughout system operation. • Each node generates information packets of fixed length, destined to all other nodes, according to a Poisson distribution with aggregate rate λ packets/second.

7. ASSUMPTIONS AND DEFINITIONS • We assume that each generated packet is intended for a single neighbor only • We assume a maximum power level, denoted PMAX, that a node can use for transmission. • assume that the transmission range of any node is limited (typically circular) and beyond that range no interference • The power decay law is assumed to be inversely proportional to the fourth order of the distance between the transmitter and the receiver.

8. ASSUMPTIONS AND DEFINITIONS • We assume the existence of a separate feedback channel that enables receivers to send their SINR measurements to their respective transmitters in a contention-free manner • We assume the existence of a central controller responsible for executing the scheduling algorithms • Define the average slot throughout as the long-run average of the percentage of packets successfully received by single-hop neighbors in each time slot.

9. Algorithm Description • The proposed algorithm determines the admissible set of users that can safely transmit in the current slot without disrupting each other’s transmission. Accordingly, the objective is twofold • determine the set of users who can attempt transmission simultaneously in a given slot • specify the set of powers needed in order to satisfy SINR constraints at their respective receivers.

10. Algorithm Description • Definition 1: In TDMA wireless ad hoc networks, a transmission scenario is valid iff it satisfies the following three conditions. • A node is not allowed to transmit and receive simultaneously. • A node cannot receive from more than one neighbor at the same time. • A node receiving from a neighbor should be spatially separated from any other transmitter by at least a distance D.

11. k i 1 4 6 j 3 2 x 5 7 dkx<dkj , D=dkx

12. i 1 4 x 6 j 3 k 2 5 7 dkx<dkj , D=dkx

13. Algorithm Description • Definition 2: A transmission scenario involving m links is admissible iff there is a set of transmission powers,pij≧0 ,which solves the following minimization problem: s.t

14. DISTRIBUTED POWER CONTROL(TDMA Wireless Ad Hoc Networks) Where Pi power transmitted by node to its receiver SINRi signal-to-interference-and-noise ratio at BS N iteration number.

15. Algorithm Description

16. It is evident from the proposed algorithm that the objective is to pack the maximum number of transmissions that can be successfully detected at their respective receivers in each slot. The scheduling algorithm is responsible for solving two optimization problems, namely “valid scenario optimization”and “admissible scenario optimization” Scheduling Policies

17. Scheduling Policies • valid scenario optimization s.t. INV:invalid transmission scenario • admissible scenario optimization s.t. INA:vaild,yet inadmissable transmission scenario

18. 1 4 6 3 2 5 7 Node 1 2 3 4 5 6 7 7 7 2 3 6 7 4 Node 1 2 3 4 5 6 7 7 7 2 3 6 7 4 7 0 2 3 6 0 0 0 7 0 3 6 0 0 7 0 2 0 6 0 0

19. Node 1 2 3 4 5 6 7 7 7 2 3 6 7 4 7 0 2 0 6 0 0~3 0 7 0 3 6 0 0~3 0 0 2 0 6 0 4~3 7 0 0 3 6 0 0~3 0 0 2 0 6 0 4~3 0 0 2 0 0 7 0~2 0 0 2 0 6 0 4~3

20. 1 4 6 3 2 5 7 dkx<dkj Node 1 2 3 4 5 6 7 7 0 2 0 6 0 0 Node 1 2 3 4 5 6 7 7 0 0 0 0 0 0

21. 1 4 6 3 2 5 7 dkx<dkj Node 1 2 3 4 5 6 7 0 7 0 3 6 0 0 Node 1 2 3 4 5 6 7 0 7 0 0 0 0 0

22. 1 4 6 3 2 5 7 dkx<dkj Node 1 2 3 4 5 6 7 0 0 2 0 6 0 4 Node 1 2 3 4 5 6 7 0 0 0 0 6 0 4

23. Node 1 2 3 4 5 6 7 7 7 2 3 6 7 4 7 0 2 0 6 0 0~3 0 7 0 3 6 0 0~3 0 0 2 0 6 0 4~3 7 0 0 3 6 0 0~3 0 0 2 0 6 0 4~3 0 0 2 0 0 7 0~2 0 0 2 0 6 0 4~3 Node 1 2 3 4 5 6 7 7 7 2 3 6 7 4 7 0 0 0 0 0 0~1 0 7 0 0 0 0 0~1 0 0 0 0 6 0 4~2 7 0 0 0 0 0 0~1 0 0 0 0 6 0 4~2 0 0 2 0 0 0 0~1 0 0 0 0 6 0 4~2

24. 1 4 6 3 2 5 7

25. Simulation Parameters

26. Simulation

27. Simulation

28. Simulation

29. Simulation

30. Simulation

31. Simulation

32. Simulation

33. References • [1] L. Williams, “Technology advances from small unit operations situation awareness system development,” IEEE Personal Commun. Mag.pp. 30–33, Feb. 2001 • [2] M. Mauve, J.Widmer, and H. Hartenstein, “A survey on position-based routing in mobile ad hoc networks,” IEEE Networks, pp. 30–39,Nov./Dec. 2001. • [3] Tamer Elbatt,Anthony Ephremides,”Joint Scheduling and Power Control for Wireless Ad Hoc Networks” IEEE Trans. Commun,vol.3no.1,January 2004 • [4] S. Ulukus and R. Yates, “Stochastic power control for cellular radio systems,”IEEE Trans. Commun., vol. 46, pp. 784–798, June 1998.