Dynamic Power Control and Optimization Scheme for QoS-Constrained Cooperative Wireless Sensor Networks
|
|
- Clementine Daniel
- 5 years ago
- Views:
Transcription
1 IEEE ICC 2016 Ad-hoc and Sensor Networking Symposium ynamic Power Conol and Optimization Scheme for QoS-Consained Cooperative Wireless Sensor Networks Ziqiang Feng, Ian Wassell Computer Laboratory University of Cambridge, UK {zf232, Absact Cooperative ansmission can significantly reduce the power consumption associated with long distance ansmission in wireless sensor networks WSNs. In this paper, we analyze the optimal power consumption of cluster-based multi-hop ansmission for a cooperative WSN. With specific Quality of Service QoS consaints on delay and channel capacity, we show that the power optimization problem of the whole network has no closed-form solution in a slow flat Rayleigh fading environment. Thus we propose a dynamic power conol and optimization PCO scheme that can jointly determine the optimal number of cooperative sensors and their ansmission power. We further propose a channel approximation algorithm that can significantly reduce the computational complexity of the PCO scheme. I. INTROUCTION Energy optimization is an important issue in wireless sensor networks WSNs where the low-power sensors are expected to operate for many years without battery replacement. Furthermore, certain applications may have Quality of Service QoS requirements on delay and channel capacity. For instance, it is important for the sink node to receive data in a timely manner in an indusial conol system [1]. Traditional energy optimization techniques may not always guarantee the QoS requirements in WSNs, especially in fading environments. It has been proved that multi-antenna system use less energy for data ansmission in fading channels compared to singleantenna systems [2]. However, a multi-antenna system requires complex ansceiver circuits that are not practical for low-cost wireless sensors. Cooperative multiple-input-multiple-output MIMO [3] and virtual MIMO techniques [4] are proposed to enable MIMO techniques to be utilized in WSNs. For the single-hop cooperative MIMO systems analyzed in [3], it is shown that for long-distance ansmission, they are more energy efficient compared to a single-antenna system. In [5], multi-hop cooperative MIMO channels are analyzed, where the design target is to minimize the outage probability given an energy consaint and target outage channel capacity. However, the minimum outage probability may not give the maximum average outage channel capacity [6]. Minimizing the outage probability may also lead to full-power operation which significantly decreases the lifetime of the WSN. In this paper, we investigate the energy consumption in a cluster-based multi-hop cooperative WSN with QoS requirements on delay and channel capacity. We mainly focus on the physical layer optimization and we assume that the clustering and routing problems are handled by upper layers. The multi-hop ansmission consists of several single-hop cluster-to-cluster ansmissions. Each single-hop ansmission consists of three phases, namely the Preparation Phase PP, the Broadcast Phase BP and the Cooperation Phase CP. In the PP, the cluster head of the ansmitter cluster calculates the ansmission power to be used in the BP and CP. In the BP, the cluster head broadcasts the data along with the power conol message in the ansmitter cluster. In the CP, all nodes of the ansmitter cluster that received the data successfully in the BP cooperatively ansmit the data to the cluster head of the receiver cluster through a multiple-input-single-output MISO channel. For ina-cluster ansmission in the BP, we assume that all nodes in the cluster have perfect ansmit and receive channel state information CSI. For inter-cluster ansmission in the CP, we assume that nodes in the receiver cluster know the CSI and that nodes in both clusters know the disibution of the CSI. Note that our MISO approach can be extended to a MIMO approach by utilizing selection diversity in the receiver cluster [5]. To minimize the total energy consumption, we propose a dynamic power conol and optimization PCO scheme that can optimize the total energy consumption without violating the QoS requirements. Given the number of cooperative n- odes as an input condition, the scheme first calculates the conditional optimal power consumption using the dynamic power conol PC algorithm. Then it determines the optimal number of cooperative sensors using the results of conditional optimal power consumption. We show that the PC algorithm converges to the optimum in O 1 iterations. We further propose a channel approximation algorithm that can significantly reduce the computational complexity of the PCO scheme. The rest of the paper is organized as follows: Section II describes the system model of the multi-hop cluster-based cooperative WSN and expresses the QoS requirements. The PCO scheme is proposed in Section III. We further propose an approximation algorithm to reduce the computational complexity of the PCO scheme. Section IV shows the simulation results of the proposed scheme. Finally, we conclude the paper in Section V. II. SYSTEM MOEL We consider a multi-hop cluster-based WSN. The ansmission between two adjacent clusters is defined as a single /16/$ IEEE
2 Fig. 1. Multi-hop cluster-based cooperative wireless sensor network hop ansmission. In our model, we assume that the nodes are grouped into N clusters and we have N 1 hops during the ansmission. The routing path is predefined. Before the ansmission, each cluster selects a node as its cluster head. Efficient clustering and routing algorithms such as those in [7], [8] can be used. The cluster head of cluster 1 is assumed to be the source node. The system model of the cooperative WSN is shown in Fig. 1. A. Transmission Scheme The ansmission between adjacent clusters has three phases, namely the preparation phase PP, the broadcast phase BP and the cooperation phase CP. The time duration of the three phases are λ 1 T, λ 2 T and λ 3 T respectively where λ 1 +λ 2 +λ 3 =1and T is the time duration of each single-hop ansmission. We assume that each cluster contains n sensors that are uniformly deployed in the cluster and the cluster head is located near the center of the cluster. 1 Preparation Phase: In the PP, the cluster head in the ansmitter cluster calculates the optimal number of cooperative nodes n, the ansmission power in the BP P bt and CP P ct using the PCO scheme. The value of n, P bt and P ct are carried in the power conol message and sent to other cooperative nodes along with the data in BP. 2 Broadcast Phase: In the BP, the cluster head broadcasts the data along with the power conol message to the cooperative sensors within its cluster with power P bt. The sensors that received the data successfully are selected to ansmit with the cluster head in the CP. Since we assume that the sensors in the cluster are uniformly deployed and the cluster head is located in the center of the cluster, the number of the active sensors is proportional to P bt and the total number of sensors n in each cluster. By selecting an appropriate level of P bt to broadcast the data, we can have n nodes selected as the cooperative nodes including the cluster head itself in the CP. 3 Cooperation Phase: In the CP, the cooperative nodes jointly ansmit the data to the cluster head in the receiver cluster using an orthogonal Space-Time Block Code STBC. We assume that the number of cooperative nodes is n, including the cluster head itself. The total ansmission power P ct is equally divided among the cooperative nodes. The ansmission power used by each sensor is consequently Pct n. B. QoS Requirements We consider a multi-hop cluster-to-cluster communication scheme containing N clusters see Fig. 1. We assume the cluster head is located in the center of each cluster. The distance between the centers of two adjacent clusters is denoted by d. We also assume long-range ansmission between adjacent clusters since cooperative ansmission is more energy efficient in that case [3]. Therefore the distances between the sensors in the adjacent clusters are approximately equal. We modeled the channel in the BP and CP using the additive white Gaussian noise AWGN channel and slow flat Rayleigh fading channel with AWGN respectively, since the inter-cluster distance is much larger than the ina-cluster distance [3]. Without loss of generality, we consider the ansmission between cluster m and cluster m+1. In the CP, the cooperative sensors jointly ansmit the data to the next cluster head using STBC through a MISO channel. The received signal at the cluster head of cluster m +1 is given by: Y m+1 = ΛHX m + N m+1 1 where Λ=βd α is the path loss, β is the path loss constant related to the channel and antennas i.e., the wavelength of the signal and the antenna gain and α is the path loss exponent. The elements of the 1 n channel vector H are independent identical disibution complex Gaussian random variables with zero mean and unit variance. X m is the n l ansmitted signal with ansmission power Pct n, where l is the length of the STBC. N m+1 N 0,σ 2 is the l 1 AWGN at the receiver. The ansmission power of the ansmitted space-time codeword is Pct n per node. Considering the nodes in the ansmitter cluster only know the disibution of the CSI, the outage capacity C out [bps/hz] of the CP is defined as [6]: C out = λ 3 log γ out, 2 where γ out is the minimum signal-to-noise ratio SNR for successful decoding at the receiver side. The outage probability p out is defined as: p out =Prγ<γ out, 3 where γ is the actual SNR at the receiver side. According to our channel model in 1, γ is given by: γ = ΛP ct H 2 F n σ 2, 4 where σ 2 is the noise power and H 2 F is the squared Frobenius norm of the 1 n channel vector H. According to the definition of H, H 2 F χ2 2n is a chi-square variable with 2n degrees of freedom. The average outage capacity is given by: C out =1 p out C out = λ 3 log γ out. 5 1 elay Requirement: We consider the delay of the multihop cluster-to-cluster communication using an automatic repeat request ARQ protocol. We assume that the outage probabilities are equal in each of the N 1 hops. Therefore,
3 for ansmission through N 1 hops, the number of failures k follows the negative binomial disibution: k NBN 1; p out. 6 The probability mass function of the negative binomial disibution is k + N 2 f k; N 1,p out = p k k out N 1. 7 Proposition 1: Given the delay requirement, the average delay of the ansmission through N 1 hops is given by: T = E [k + N 1 T ]= N 1 T. 8 Thus we can have reliable ansmission if p out 1 N 1T for any delay requirement >N 1 T.If N 1 T, it is impossible to have reliable ansmission under the delay requirement. Proof: We first prove that E [k] = N 1pout 1 p out. Since the number of failures k follows the negative binomial disibution, the mean value of k can be calculated as: E [k] = kf k; N 1,p out k=0 k k + N 2! = p k k!n 2! out N 1 k=0 = N 1 p out k + N 2! k 1! N 1! pk 1 out N = N 1 p out = N 1 p out. k=1 f k; N,p out 9 k=0 Note that in 8 N and T are constants. Thus the average delay is given by: T = E [k + N 1 T ]= N 1 T. 10 For any delay requirement > N 1 T, we must have T = N 1T 1 p out and thus p out 1 N 1T to satisfy the reliable ansmission requirement. Note that 0 <p out < 1. If N 1 T, we should have p out 1 N 1T 0 for reliable ansmission, which is impossible to satisfy. 2 Capacity Requirement: We assume that there are a total of L bits for ansmission. In order to have reliable ansmission in the CP, we have L T R ct C out, 11 where R ct [bps/hz] is the ansmission data rate in the CP. In the BP, the ansmission data rate R bt [bps/hz] should be no less than the ansmission data rate in the CP. Thus we have R bt R ct L T. 12 Proposition 2: For any ansmission under the QoS requirement and > N 1 T, there exists p out that can maximize C out, which can be denoted as follows C out =max{λ 3 log γ out } p out s.t. Cout L T, 0 <p 13 out 1 N 1T where γ out = ΛPctF 1 p out 2n n σ and F 1 p v is the inverse chi-square cumulative disibution 2 function CF for a given probability p and v degrees of freedom. Proof: From 2, 3 and 5, we know that F 1 p v is directly proportional to p for any given v. Let ξ = F 1 1 NT 2n ].Forpout 0, 1 N 1T,wehave lim C out =0, p out 0 lim p out 1 NT C out = λ 3 log 2 1+ ΛPctξ n σ 2 14 Since lim C out > 0 and 5 is continuous at p out p out 1 NT ] 0, 1 N 1T, according to the exeme value theorem, ] there exists p out 0, 1 N 1T that can maximize C out. C. Energy Consumption Analysis For the ansmission in each hop, the total power consumption is given by: P t = λ 1 P PCO + λ 2 P bt + λ 3 P ct + n P cir, 15 where P PCO is the power consumption of the PCO scheme in the PP, P cir is the circuit power consumption of the sensor and n is the number of sensors used for ansmission. The total energy consumption for the ansmission through N 1 hops is give by: E t = P t T = N 1 P t T. 16 In the BP, we assume the channel is AWGN with free space path loss i.e., α =2. Thus given the ansmission data rate R bt,wehave P bt = r 2 σ 2 2 R bt λ 2 1, 17 where r is the inacluster ansmission range. We assume that the average cluster range is r c and n sensors are normally deployed in each cluster. Therefore the approximate number of sensors that can successfully decode the broadcast message is given by: 2 r P bt n n = n =. 18 r c rcσ R bt λ 2 1 In the CP, a slow flat Rayleigh fading channel is assumed in the channel model. From 4 and 5, we have γ out n σ 2 P ct = ΛF 1 p out 2n = 2 C out λ 3 1 p out 1 ΛF 1 p out 2n n σ 2. 19
4 From 19, we can see that there is no closed-form solution for cooperative ansmission power. In the next section, we propose a dynamic power conol and optimization PCO scheme to determine the optimal value of n, P bt and P ct for the total energy consumption. We further propose an approximation algorithm for the PCO scheme that can reduce its computational complexity. III. YNAMIC POWER CONTROL AN OPTIMIZATION SCHEME A. Scheme escription For each single-hop ansmission, the PCO scheme is running in the PP. Given any QoS requirement with the delay > N 1 T, we aim to find the optimal value of P ct, P bt, n and p out for each single-hop ansmission and thus minimize the total energy consumption of the multihop ansmission 16. Note that n is directly related to P bt given the value of R bt in 18. Thus n and P bt are jointly optimized. From Proposition 2 and 19, we know that given n, the ansmission power P ct n is directly proportional to the maximum average outage capacity C out. According to the QoS requirement, we have C out L T and p out 1 N 1T. P ct n is optimized when p out n =p out n and C out = L T. Therefore, P ct and p out are also jointly optimized. The optimization problem can now be denoted as: { P ct n,n } = argmin P ct n,n E t Pct n,n. 20 Note that the value of Pct n depends on the choice of n. However in order to determine n, we need to figure out Pct n for every possible n. P ct n and n are interrelated with each other in the optimization process. P ct v In the PCO scheme, we first find the conditional optimal for all possible v, which is given by: Pct v =argmin E t Pct v v, 1 v n P ct v s.t. P ct,min P ct v P ct,max, 21 where P ct,min and P ct,max are the minimum and maximum value of P ct v respectively. Then we can determine the optimal n as n =argmine t v Pct v, 1 v n. 22 v We then have the optimal Pct n, P bt n and thus the optimal Et according to 15 and 16. Since there is no closed-form solution for cooperative ansmission power P ct v, we use a dynamic power conol PC algorithm to find the conditional optimal Pct v. We will show that given any n = v, P ct v converges to its optimum with a sufficient small change δ in O 1 iterations. P ct v In Algorithm 1, we use P ct v,imax as the approximation of Pct v since Pct v,imax Pct v δ where δ is sufficient small. For energy saving purpose, there is no need to cooperatively ansmit the data if the QoS requirement cannot be fulfilled with the maximum ansmission power P ct,max. Algorithm 1 PCO scheme Initialization: n =1, E t,min =, P ct n = P ct,max for each v Ω={1, 2,...,n} do PC algorithm initialization: P ct v,0 = P ct,max, η 0 =1, π 0 = Pct,max Pct,min M, M Z + for 1 i I max do 1 According to 13, calculate C out,i using P ct v,i 1. 2 η i = sgn C out,i L T where sgn is the signum function. } 3 π i =min{ 3+ηi 1η i 4, 1 π i 1. 4 ˆP ct v,i = P ct v,i 1 { { η i π i. } 5 P ct v,i =max min ˆPct v,i,p ct,max,p ct,min }. if P ct v,i =P ct,max then break the current for loop end if end for Calculate E t v using P ct v,imax and v. if P ct,min <P ct v <P ct,max and E t v <E t,min then E t,min = E t v, n = v, P ct n = P ct v end if end for if P ct n = P ct,max then No possible ansmission can fulfill the QoS requirement. end if Proposition 3: Given n = v in the PC algorithm, P ct v converges to Pct v with a sufficient small change δ in O 1 iterations and we can use P ct v,imax as the approximation of P ct vṗroof: If P ct,min <P ct v <P ct,max, Pct v must fall into one of the M equal parts in interval [P ct,min,p ct,max ]. We also notice that π i will not halve its value until η i 1 η i = 1. Thus we have M iterations at most before π i halves its value. After the first time π i is decreased by half, it is easy to see that π i can only stay unchanged for two iterations at most. We define δ as δ = π 0 2 K = P ct,max P ct,min 2 K 23 M where K is a positive integer that makes δ sufficient small compared with π 0. According to the algorithm it is obvious that P ct v,i Pct v π i after π i first halves itself. Thus we have P ct v,i Pct v δ in O M +2K =O 1 iterations. Let I max >M+2K and we can then use P ct v,imax as the approximation of P. ct v We assume that n sensors are normally deployed in each cluster with the cluster range r c. Since the minimum value of R bt is L T,givenn = v, the optimal broadcast ansmission power Pbt v is denoted as vrcσ L λ 2T 1 Pbt v =. 24 n After we have Pct v and P bt v for all possible n = v, we can determine n according to 22 and thus in turn determine Pct n and P bt n.
5 B. Approximation Algorithm To reduce the computational complexity in the PCO scheme, we propose an approximation algorithm. Note that the computational complexity in PCO scheme is mainly inoduced by the PC algorithm. The PC algorithm is used for the optimization problem in 13 and 21 and there is no closed-form expression for F 1 p v. If we can get an approximation of F 1 p v which can be quickly evaluated, the computational complexity will be significantly reduced. Inspired by the work in [9], we estimate the MISO channel in our model using a Gaussian approximation. Since H 2 F in 4 follows a chi-square variable with 2n degrees of freedom, we can calculate the mean value of γ as: μ γ = ΛP ] ct [ H n σ 2 E 2 F = 2ΛP ct σ We also calculate the variance of γ as: 2 σγ 2 ΛPct = n σ 2 var H 2 F = 1 2 2ΛPct n σ If we expand 2 in Taylor series at μ γ we have k λ 3 μγ γ C out γ =λ 3 log μ γ. 27 k ln 2 1+μ γ k=1 According to 27 the second-order approximation for μ C is given by μ C =E [C out ] λ 3 log μ γ λ 2 3 σγ 28 2ln2 1+μ γ where σγ 2 is the variance of γ. Note that the approximation is only valid for γ μ γ < 1. If we expand Cout 2 in a Taylor series, the second-order approximation for σc 2 is given by: σc 2 = E [ Cout] 2 E [Cout ] 2 29 [ ] 2 λ3 σγ 2 ln μ γ 2 σγ μ γ 4. We assume that the approximate channel capacity C out follows a normal disibution with a mean μ C and a standard deviation σ C, which is denoted as C out N μ C,σC 2.We further define the outage probability p out for C out, which is given by: p out =Pr C < C out = Cout 2 erf μ C 30 2σC where erf is the error function. From 30 we have C out = μ C + 2σ C erf 1 2 p out 1 31 where erf 1 is the inverse error function, which can also be defined in terms of the Maclaurin series. π erf 1 z = z + π12 2 z3 + 7π2 480 z The approximate average outage capacity is defined as C out =1 p out C out 33 1 p π μ C σ C p + π12 p3 + 7π2 480 p5 Fig. 2. n Performance of the dynamic power conol algorithm with different where p =2 p out 1. Compared with 13, we can see that 33 is a polynomial function on p that has a saightforward solution for the optimization of C out. If we substitute C out for Cout and p out for p out respectively, the computational complexity in the first step of the PC algorithm can be significantly reduced. IV. SIMULATION AN ANALYSIS In this section, we give the simulation results to show the efficiency of PCO scheme. We also show that the approximation algorithm provides accurate channel estimations. The parameters in the simulation are given in TABLE I. TABLE I. PARAMETERS FOR SIMULATION Symbol escription Value β Path loss constant 1 α Path loss exponent 2 n Number of sensors per cluster 10 d Transmission distance 100 m r c Cluster range 10 m σ 2 Noise power 5 μw P ct,max Maximum of P ct 200 mw P ct,min Minimum of P ct 0mW π 0 Initial step in PC algorithm 10 mw P cir Circuit power consumption 10 mw L T Capacity Requirement 1 bps/hz λ 1, λ 2, λ 3 0.1, 0.15, 0.75 First, we investigate the PC algorithm. We set M =20 and π 0 =10mW. Given different n = v, the simulation results in Fig. 2 show that P ct v converges to its optimal value Pct v with sufficiently small difference in a limited number of iterations I max =30. Note that the optimal cooperative ansmission power Pct n is inversely proportional to the number of cooperative sensors n. In Fig. 3 we show that under the QoS requirement, there exists the optimal outage probability p out that can maximize the average outage capacity C out.givenn =6, Fig. 3 shows that Cout reaches its maximum value C out = 1 bps/hz at p out = We also see that the approximation algorithm gives a similar result to that for the actual channel. In this case, the approximate average outage capacity C out reaches its maximum value C out =0.998 bps/hz at p out =0.178.
6 Fig. 3. Average outage capacity with different p out for n = 6 and P ct n =53mW Fig. 5. Performance of the dynamic power conol algorithm with different values of n Fig. 4. Optimal outage probability with different n We give the optimal outage probability p out for various values of n in Fig. 4. It shows that p out is inversely proportional to n. We also note that the approximation algorithm gives a similar result. The relation of P t and n is given in Fig. 5. From 15 and taking into account the reansmissions, we define the average total power consumption as P t n = P t n 1 p out n 34 where p out n is the optimal outage probability corresponding to n. From Fig. 5, we see that P t and P t reach their minimum value at n = 2 and n = 3 respectively. We choose n = 3 as the optimal solution according to the definition in 16 and 34. Note that for the optimal n, the optimal outage probability p out n should fulfill the QoS requirement p out n 1 N 1T.Ifp out n is out of range p out n > 1 N 1T, the new optimal value ˆn should be the smallest n n,n] that fulfills the QoS requirement, since P t monotonically increases with n n,n] and p out n is inversely proportional to n. V. CONCLUSION In this paper, we investigated the power consumption and optimization in a multi-hop QoS-consained cooperative WSN in a fading environment. We showed that there is no closed form solution for the power optimization problem with certain QoS consaints in the fading environment. For each singlehop ansmission, we proposed a three-phase ansmission scheme. We then proposed the PCO scheme to optimize the power consumption. By using PCO scheme, cooperative diversity is utilized and the power consumption of the multi-hop ansmission is minimized. We further proposed a channel approximation algorithm to reduce the computational complexity of PCO scheme. The simulation results showed the efficiency of the PCO scheme. REFERENCES [1] V. Gungor and G. Hancke, Indusial wireless sensor networks: Challenges, design principles, and technical approaches, Indusial Eleconics, IEEE Transactions on, vol. 56, no. 10, pp , Oct [2] A. Paulraj, R. Nabar, and. Gore, Inoduction to Space-Time Wireless Communications, 1st ed. New York, NY, USA: Cambridge University Press, [3] S. Cui, A. Goldsmith, and A. Bahai, Energy-efficiency of mimo and cooperative mimo techniques in sensor networks, Selected Areas in Communications, IEEE Journal on, vol. 22, no. 6, pp , Aug [4] S. Jayaweera, Virtual mimo-based cooperative communication for energy-consained wireless sensor networks, Wireless Communications, IEEE Transactions on, vol. 5, no. 5, pp , May [5] A. el Coso, U. Spagnolini, and C. Ibars, Cooperative disibuted mimo channels in wireless sensor networks, Selected Areas in Communications, IEEE Journal on, vol. 25, no. 2, pp , February [6] A. Goldsmith, Wireless Communications. New York, NY, USA: Cambridge University Press, [7] O. Younis and S. Fahmy, Heed: a hybrid, energy-efficient, disibuted clustering approach for ad hoc sensor networks, Mobile Computing, IEEE Transactions on, vol. 3, no. 4, pp , Oct [8] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energyefficient communication protocol for wireless microsensor networks, in System Sciences, Proceedings of the 33rd Annual Hawaii International Conference on, Jan 2000, pp. 10 pp. vol.2. [9] J. Perez, J. Ibanez, L. Vielva, and I. Santamaria, Closed-form approximation for the outage capacity of orthogonal stbc, Communications Letters, IEEE, vol. 9, no. 11, pp , Nov 2005.
Transmission Schemes for Lifetime Maximization in Wireless Sensor Networks: Uncorrelated Source Observations
Transmission Schemes for Lifetime Maximization in Wireless Sensor Networks: Uncorrelated Source Observations Xiaolu Zhang, Meixia Tao and Chun Sum Ng Department of Electrical and Computer Engineering National
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationLecture 4. Capacity of Fading Channels
1 Lecture 4. Capacity of Fading Channels Capacity of AWGN Channels Capacity of Fading Channels Ergodic Capacity Outage Capacity Shannon and Information Theory Claude Elwood Shannon (April 3, 1916 February
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More informationNOMA: Principles and Recent Results
NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve
More informationLecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
MIMO : MIMO Theoretical Foundations of Wireless Communications 1 Wednesday, May 25, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 20 Overview MIMO
More informationMulti-User Gain Maximum Eigenmode Beamforming, and IDMA. Peng Wang and Li Ping City University of Hong Kong
Multi-User Gain Maximum Eigenmode Beamforming, and IDMA Peng Wang and Li Ping City University of Hong Kong 1 Contents Introduction Multi-user gain (MUG) Maximum eigenmode beamforming (MEB) MEB performance
More informationMorning Session Capacity-based Power Control. Department of Electrical and Computer Engineering University of Maryland
Morning Session Capacity-based Power Control Şennur Ulukuş Department of Electrical and Computer Engineering University of Maryland So Far, We Learned... Power control with SIR-based QoS guarantees Suitable
More informationCensoring for Type-Based Multiple Access Scheme in Wireless Sensor Networks
Censoring for Type-Based Multiple Access Scheme in Wireless Sensor Networks Mohammed Karmoose Electrical Engineering Department Alexandria University Alexandria 1544, Egypt Email: mhkarmoose@ieeeorg Karim
More informationTitle. Author(s)Tsai, Shang-Ho. Issue Date Doc URL. Type. Note. File Information. Equal Gain Beamforming in Rayleigh Fading Channels
Title Equal Gain Beamforming in Rayleigh Fading Channels Author(s)Tsai, Shang-Ho Proceedings : APSIPA ASC 29 : Asia-Pacific Signal Citationand Conference: 688-691 Issue Date 29-1-4 Doc URL http://hdl.handle.net/2115/39789
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationChapter 4: Continuous channel and its capacity
meghdadi@ensil.unilim.fr Reference : Elements of Information Theory by Cover and Thomas Continuous random variable Gaussian multivariate random variable AWGN Band limited channel Parallel channels Flat
More informationVector Channel Capacity with Quantized Feedback
Vector Channel Capacity with Quantized Feedback Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 9697-65 Email: syed@ece.uci.edu,
More informationEnvironmental Issues for MIMO Capacity
2128 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 50, NO. 9, SEPTEMBER 2002 Environmental Issues for MIMO Capacity Daniel W. Bliss, Keith W. Forsythe, Alfred O. Hero, III, Fellow, IEEE, and Ali F. Yegulalp
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationBinary Compressive Sensing via Analog. Fountain Coding
Binary Compressive Sensing via Analog 1 Fountain Coding Mahyar Shirvanimoghaddam, Member, IEEE, Yonghui Li, Senior Member, IEEE, Branka Vucetic, Fellow, IEEE, and Jinhong Yuan, Senior Member, IEEE, arxiv:1508.03401v1
More informationDegrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel
/33 Degrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel Presented by Paul de Kerret Joint work with Antonio Bazco, Nicolas Gresset, and David Gesbert ESIT 2017 in Madrid,
More informationDiversity-Multiplexing Tradeoff in MIMO Channels with Partial CSIT. ECE 559 Presentation Hoa Pham Dec 3, 2007
Diversity-Multiplexing Tradeoff in MIMO Channels with Partial CSIT ECE 559 Presentation Hoa Pham Dec 3, 2007 Introduction MIMO systems provide two types of gains Diversity Gain: each path from a transmitter
More informationOn the Relation between Outage Probability and Effective Frequency Diversity Order
Appl. Math. Inf. Sci. 8, No. 6, 2667-267 (204) 2667 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/0.2785/amis/080602 On the Relation between and Yongjune Kim, Minjoong
More informationVariable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks
Variable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks Hideki Ochiai Department of Electrical and Computer Engineering, Yokohama National University 79-5 Tokiwadai, Hodogaya-ku,
More informationDEVICE-TO-DEVICE COMMUNICATIONS: THE PHYSICAL LAYER SECURITY ADVANTAGE
DEVICE-TO-DEVICE COMMUNICATIONS: THE PHYSICAL LAYER SECURITY ADVANTAGE Daohua Zhu, A. Lee Swindlehurst, S. Ali A. Fakoorian, Wei Xu, Chunming Zhao National Mobile Communications Research Lab, Southeast
More informationThe Optimality of Beamforming: A Unified View
The Optimality of Beamforming: A Unified View Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 92697-2625 Email: sudhirs@uciedu,
More informationMulti-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. X, NO. X, DECEMBER 007 Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective Melda Yuksel, Student Member, IEEE, and Elza
More informationReliability of Radio-mobile systems considering fading and shadowing channels
Reliability of Radio-mobile systems considering fading and shadowing channels Philippe Mary ETIS UMR 8051 CNRS, ENSEA, Univ. Cergy-Pontoise, 6 avenue du Ponceau, 95014 Cergy, France Philippe Mary 1 / 32
More informationCell throughput analysis of the Proportional Fair scheduler in the single cell environment
Cell throughput analysis of the Proportional Fair scheduler in the single cell environment Jin-Ghoo Choi and Seawoong Bahk IEEE Trans on Vehicular Tech, Mar 2007 *** Presented by: Anh H. Nguyen February
More informationPerformance Analysis of MIMO-OSTBC based Selective DF Cooperative Wireless System with Node Mobility and Channel Estimation Errors
System Model Performance Analysis of MIMO-OSTBC based Selective DF Cooperative Wireless System with Node Mobility and Channel Estimation Errors Multimedia Wireless Networks (MWN) Group, Indian Institute
More informationChannel Dependent Adaptive Modulation and Coding Without Channel State Information at the Transmitter
Channel Dependent Adaptive Modulation and Coding Without Channel State Information at the Transmitter Bradford D. Boyle, John MacLaren Walsh, and Steven Weber Modeling & Analysis of Networks Laboratory
More informationMedium Access Control and Power Optimizations for Sensor Networks with Linear Receivers
Medium Access Control and Power Optimizations for Sensor Networks with Linear Receivers Wenjun Li and Huaiyu Dai Department of Electrical and Computer Engineering North Carolina State University Raleigh,
More informationTraining-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks
Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks J Harshan Dept of ECE, Indian Institute of Science Bangalore 56001, India Email: harshan@eceiiscernetin B Sundar Rajan
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More informationSingle-User MIMO systems: Introduction, capacity results, and MIMO beamforming
Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,
More informationDETERMINING the information theoretic capacity of
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 7, JULY 007 369 Transactions Letters Outage Capacity and Optimal Power Allocation for Multiple Time-Scale Parallel Fading Channels Subhrakanti
More informationCapacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming
Capacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming Authors: Christian Lameiro, Alfredo Nazábal, Fouad Gholam, Javier Vía and Ignacio Santamaría University of Cantabria,
More informationSoft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas
Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antenn Jae-Dong Yang, Kyoung-Young Song Department of EECS, INMC Seoul National University Email: {yjdong, sky6174}@ccl.snu.ac.kr
More informationAsymptotic Distortion Performance of Source-Channel Diversity Schemes over Relay Channels
Asymptotic istortion Performance of Source-Channel iversity Schemes over Relay Channels Karim G. Seddik 1, Andres Kwasinski 2, and K. J. Ray Liu 1 1 epartment of Electrical and Computer Engineering, 2
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationSpatial and Temporal Power Allocation for MISO Systems with Delayed Feedback
Spatial and Temporal ower Allocation for MISO Systems with Delayed Feedback Venkata Sreekanta Annapureddy and Srikrishna Bhashyam Department of Electrical Engineering Indian Institute of Technology Madras
More informationTrust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems
Introduction Main Results Simulation Conclusions Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems Mojtaba Vaezi joint work with H. Inaltekin, W. Shin, H. V. Poor, and
More informationEnergy efficiency analysis of one-way and twoway relay systems
RESEARCH Open Access Energy effiency analysis of one-way and twoway relay systems Can Sun * and Chenyang Yang Abstract Relaying is supposed to be a low energy consumption technique since the long distance
More information4888 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 7, JULY 2016
4888 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 7, JULY 2016 Online Power Control Optimization for Wireless Transmission With Energy Harvesting and Storage Fatemeh Amirnavaei, Student Member,
More informationDistributed Power Control for Time Varying Wireless Networks: Optimality and Convergence
Distributed Power Control for Time Varying Wireless Networks: Optimality and Convergence Tim Holliday, Nick Bambos, Peter Glynn, Andrea Goldsmith Stanford University Abstract This paper presents a new
More informationResource Allocation for Wireless Fading Relay Channels: Max-Min Solution 1 2
Submitted to IEEE Trans. Inform. Theory, Special Issue on Models, Theory and odes for elaying and ooperation in ommunication Networs, Aug. 2006, revised Jan. 2007 esource Allocation for Wireless Fading
More informationApproximate Ergodic Capacity of a Class of Fading Networks
Approximate Ergodic Capacity of a Class of Fading Networks Sang-Woon Jeon, Chien-Yi Wang, and Michael Gastpar School of Computer and Communication Sciences EPFL Lausanne, Switzerland {sangwoon.jeon, chien-yi.wang,
More informationبسم الله الرحمن الرحيم
بسم الله الرحمن الرحيم Reliability Improvement of Distributed Detection in Clustered Wireless Sensor Networks 1 RELIABILITY IMPROVEMENT OF DISTRIBUTED DETECTION IN CLUSTERED WIRELESS SENSOR NETWORKS PH.D.
More informationApproximate Capacity of Fast Fading Interference Channels with no CSIT
Approximate Capacity of Fast Fading Interference Channels with no CSIT Joyson Sebastian, Can Karakus, Suhas Diggavi Abstract We develop a characterization of fading models, which assigns a number called
More informationMaximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary. Spatial Correlation
Maximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary Spatial Correlation Ahmed K Sadek, Weifeng Su, and K J Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More informationDiversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks
Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks Shuangqing Wei Abstract Synchronization of relay nodes is an important and critical issue in exploiting cooperative
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationUpper bound on the ergodic rate density of ALOHA wireless ad-hoc networks
Upper bound on the ergodic rate density of ALOHA wireless ad-hoc networks 1 Yaniv George, Itsik Bergel, Senior Member, IEEE, Ephraim Zehavi, Fellow, IEEE Abstract We present a novel upper bound on the
More informationOptimal matching in wireless sensor networks
Optimal matching in wireless sensor networks A. Roumy, D. Gesbert INRIA-IRISA, Rennes, France. Institute Eurecom, Sophia Antipolis, France. Abstract We investigate the design of a wireless sensor network
More informationOn the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels
On the Performance of 1 Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels arxiv:0711.1295v1 [cs.it] 8 Nov 2007 Emanuele Viterbo and Yi Hong Abstract The Golden space-time trellis
More informationCapacity of multiple-input multiple-output (MIMO) systems in wireless communications
15/11/02 Capacity of multiple-input multiple-output (MIMO) systems in wireless communications Bengt Holter Department of Telecommunications Norwegian University of Science and Technology 1 Outline 15/11/02
More informationWIRELESS COMMUNICATIONS AND COGNITIVE RADIO TRANSMISSIONS UNDER QUALITY OF SERVICE CONSTRAINTS AND CHANNEL UNCERTAINTY
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Theses, Dissertations, and Student Research from Electrical & Computer Engineering Electrical & Computer Engineering, Department
More informationTight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels
Tight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels Özgür Oyman ), Rohit U. Nabar ), Helmut Bölcskei 2), and Arogyaswami J. Paulraj ) ) Information Systems Laboratory, Stanford
More informationExploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless
Exploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless SPAWC 2003 Rome, Italy June 18, 2003 E. Yoon, M. Vu and Arogyaswami Paulraj Stanford University Page 1 Outline Introduction
More informationPhase Precoded Compute-and-Forward with Partial Feedback
Phase Precoded Compute-and-Forward with Partial Feedback Amin Sakzad, Emanuele Viterbo Dept. Elec. & Comp. Sys. Monash University, Australia amin.sakzad,emanuele.viterbo@monash.edu Joseph Boutros, Dept.
More informationOutline - Part III: Co-Channel Interference
General Outline Part 0: Background, Motivation, and Goals. Part I: Some Basics. Part II: Diversity Systems. Part III: Co-Channel Interference. Part IV: Multi-Hop Communication Systems. Outline - Part III:
More informationNearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 3, MARCH 2012 1483 Nearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR A. Taufiq Asyhari, Student Member, IEEE, Albert Guillén
More informationSecrecy Outage Performance of Cooperative Relay Network With Diversity Combining
Secrecy Outage erformance of Cooperative Relay Network With Diversity Combining Khyati Chopra Dept. of lectrical ngineering Indian Institute of Technology, Delhi New Delhi-110016, India mail: eez148071@ee.iitd.ac.in
More informationOn the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System
1 On the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System Chun Kin Au-Yeung, Student Member, IEEE, and David J. Love, Member, IEEE Abstract In multiple antenna wireless
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationMULTI-INPUT multi-output (MIMO) channels, usually
3086 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 8, AUGUST 2009 Worst-Case Robust MIMO Transmission With Imperfect Channel Knowledge Jiaheng Wang, Student Member, IEEE, and Daniel P. Palomar,
More informationSchur-convexity of the Symbol Error Rate in Correlated MIMO Systems with Precoding and Space-time Coding
Schur-convexity of the Symbol Error Rate in Correlated MIMO Systems with Precoding and Space-time Coding RadioVetenskap och Kommunikation (RVK 08) Proceedings of the twentieth Nordic Conference on Radio
More informationLattices and Lattice Codes
Lattices and Lattice Codes Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology Hyderabad
More informationDistributed Detection and Estimation in Wireless Sensor Networks: Resource Allocation, Fusion Rules, and Network Security
Distributed Detection and Estimation in Wireless Sensor Networks: Resource Allocation, Fusion Rules, and Network Security Edmond Nurellari The University of Leeds, UK School of Electronic and Electrical
More informationMinimum Mean Squared Error Interference Alignment
Minimum Mean Squared Error Interference Alignment David A. Schmidt, Changxin Shi, Randall A. Berry, Michael L. Honig and Wolfgang Utschick Associate Institute for Signal Processing Technische Universität
More informationEfficient Computation of the Pareto Boundary for the Two-User MISO Interference Channel with Multi-User Decoding Capable Receivers
Efficient Computation of the Pareto Boundary for the Two-User MISO Interference Channel with Multi-User Decoding Capable Receivers Johannes Lindblom, Eleftherios Karipidis and Erik G. Larsson Linköping
More informationErgodic and Outage Capacity of Narrowband MIMO Gaussian Channels
Ergodic and Outage Capacity of Narrowband MIMO Gaussian Channels Yang Wen Liang Department of Electrical and Computer Engineering The University of British Columbia April 19th, 005 Outline of Presentation
More informationNash Bargaining in Beamforming Games with Quantized CSI in Two-user Interference Channels
Nash Bargaining in Beamforming Games with Quantized CSI in Two-user Interference Channels Jung Hoon Lee and Huaiyu Dai Department of Electrical and Computer Engineering, North Carolina State University,
More informationVECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK
VECTOR QUANTIZATION TECHNIQUES FOR MULTIPLE-ANTENNA CHANNEL INFORMATION FEEDBACK June Chul Roh and Bhaskar D. Rao Department of Electrical and Computer Engineering University of California, San Diego La
More informationEstimation of Performance Loss Due to Delay in Channel Feedback in MIMO Systems
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Estimation of Performance Loss Due to Delay in Channel Feedback in MIMO Systems Jianxuan Du Ye Li Daqing Gu Andreas F. Molisch Jinyun Zhang
More informationA robust transmit CSI framework with applications in MIMO wireless precoding
A robust transmit CSI framework with applications in MIMO wireless precoding Mai Vu, and Arogyaswami Paulraj Information Systems Laboratory, Department of Electrical Engineering Stanford University, Stanford,
More informationLecture 7 MIMO Communica2ons
Wireless Communications Lecture 7 MIMO Communica2ons Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2014 1 Outline MIMO Communications (Chapter 10
More informationCommunication Over MIMO Broadcast Channels Using Lattice-Basis Reduction 1
Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction 1 Mahmoud Taherzadeh, Amin Mobasher, and Amir K. Khandani Coding & Signal Transmission Laboratory Department of Electrical & Computer
More informationOptimum Relay Position for Differential Amplify-and-Forward Cooperative Communications
Optimum Relay Position for Differential Amplify-and-Forard Cooperative Communications Kazunori Hayashi #1, Kengo Shirai #, Thanongsak Himsoon 1, W Pam Siriongpairat, Ahmed K Sadek 3,KJRayLiu 4, and Hideaki
More informationOutage-Efficient Downlink Transmission Without Transmit Channel State Information
1 Outage-Efficient Downlink Transmission Without Transmit Channel State Information Wenyi Zhang, Member, IEEE, Shivaprasad Kotagiri, Student Member, IEEE, and J. Nicholas Laneman, Senior Member, IEEE arxiv:0711.1573v1
More informationCooperative Communication with Feedback via Stochastic Approximation
Cooperative Communication with Feedback via Stochastic Approximation Utsaw Kumar J Nicholas Laneman and Vijay Gupta Department of Electrical Engineering University of Notre Dame Email: {ukumar jnl vgupta}@ndedu
More informationHalf-Duplex Gaussian Relay Networks with Interference Processing Relays
Half-Duplex Gaussian Relay Networks with Interference Processing Relays Bama Muthuramalingam Srikrishna Bhashyam Andrew Thangaraj Department of Electrical Engineering Indian Institute of Technology Madras
More informationTransmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback
IEEE INFOCOM Workshop On Cognitive & Cooperative Networks Transmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback Chao Wang, Zhaoyang Zhang, Xiaoming Chen, Yuen Chau. Dept.of
More informationSIGNAL STRENGTH LOCALIZATION BOUNDS IN AD HOC & SENSOR NETWORKS WHEN TRANSMIT POWERS ARE RANDOM. Neal Patwari and Alfred O.
SIGNAL STRENGTH LOCALIZATION BOUNDS IN AD HOC & SENSOR NETWORKS WHEN TRANSMIT POWERS ARE RANDOM Neal Patwari and Alfred O. Hero III Department of Electrical Engineering & Computer Science University of
More informationwarwick.ac.uk/lib-publications
Original citation: Jiang, Jing, Dianati, Mehrdad, Imran, Muhammad Ali, Tafazolli, Rahim and Zhang, Shunqing. (2014) Energy-efficiency analysis and optimization for virtual-mimo systems. IEEE Transactions
More informationJoint Energy and Route Optimization in MIMO Wireless Sensor Networks
Joint Energy and Route Optimization in MIMO Wireless Sensor Networks Rong Yu 1, Yan Zhang 2, Lingyang Song 3, and Wenqing Yao 1 1 South China University of Technology, China 2 Simula Research Laboratory,
More informationOnline Scheduling for Energy Harvesting Broadcast Channels with Finite Battery
Online Scheduling for Energy Harvesting Broadcast Channels with Finite Battery Abdulrahman Baknina Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park,
More informationLattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm
Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm HongSun An Student Member IEEE he Graduate School of I & Incheon Korea ahs3179@gmail.com Manar Mohaisen Student Member IEEE
More informationSIGNAL STRENGTH LOCALIZATION BOUNDS IN AD HOC & SENSOR NETWORKS WHEN TRANSMIT POWERS ARE RANDOM. Neal Patwari and Alfred O.
SIGNAL STRENGTH LOCALIZATION BOUNDS IN AD HOC & SENSOR NETWORKS WHEN TRANSMIT POWERS ARE RANDOM Neal Patwari and Alfred O. Hero III Department of Electrical Engineering & Computer Science University of
More informationA Coding Strategy for Wireless Networks with no Channel Information
A Coding Strategy for Wireless Networks with no Channel Information Frédérique Oggier and Babak Hassibi Abstract In this paper, we present a coding strategy for wireless relay networks, where we assume
More informationUpper Bounds on MIMO Channel Capacity with Channel Frobenius Norm Constraints
Upper Bounds on IO Channel Capacity with Channel Frobenius Norm Constraints Zukang Shen, Jeffrey G. Andrews, Brian L. Evans Wireless Networking Communications Group Department of Electrical Computer Engineering
More informationBlind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices
Blind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices Héctor J. Pérez-Iglesias 1, Daniel Iglesia 1, Adriana Dapena 1, and Vicente Zarzoso
More informationOutage Probability of Multiple-Input. Single-Output (MISO) Systems with Delayed Feedback
Outage Probability of Multiple-Input 1 Single-Output (MISO Systems with Delayed Feedback Venkata Sreekanta Annapureddy 1, Devdutt V. Marathe 2, T. R. Ramya 3 and Srikrishna Bhashyam 3 1 Coordinated Science
More informationLecture 7: Wireless Channels and Diversity Advanced Digital Communications (EQ2410) 1
Wireless : Wireless Advanced Digital Communications (EQ2410) 1 Thursday, Feb. 11, 2016 10:00-12:00, B24 1 Textbook: U. Madhow, Fundamentals of Digital Communications, 2008 1 / 15 Wireless Lecture 1-6 Equalization
More informationAdvanced Topics in Digital Communications Spezielle Methoden der digitalen Datenübertragung
Advanced Topics in Digital Communications Spezielle Methoden der digitalen Datenübertragung Dr.-Ing. Carsten Bockelmann Institute for Telecommunications and High-Frequency Techniques Department of Communications
More informationOn the Degrees of Freedom of the Finite State Compound MISO Broadcast Channel
On the Degrees of Freedom of the Finite State Compound MISO Broadcast Channel Invited Paper Chenwei Wang, Tiangao Gou, Syed A. Jafar Electrical Engineering and Computer Science University of California,
More informationDistributed Space-Frequency Coding over Amplify-and-Forward Relay Channels
Distributed Space-Frequency Coding over Amplify-and-Forward Relay Channels Karim G. Seddik and K. J. Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems Research University
More informationABSTRACT. Cooperative Detection and Network Coding in Wireless Networks. Mohammed W. Baidas, Master of Science, 2009
ABSTRACT Title of Thesis: Cooperative Detection and Network Coding in Wireless Networks Mohammed W. Baidas, Master of Science, 2009 Thesis directed by: Professor K. J. Ray Liu Department of Electrical
More informationA Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels
A Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels Mehdi Mohseni Department of Electrical Engineering Stanford University Stanford, CA 94305, USA Email: mmohseni@stanford.edu
More informationADAPTIVE CLUSTERING ALGORITHM FOR COOPERATIVE SPECTRUM SENSING IN MOBILE ENVIRONMENTS. Jesus Perez and Ignacio Santamaria
ADAPTIVE CLUSTERING ALGORITHM FOR COOPERATIVE SPECTRUM SENSING IN MOBILE ENVIRONMENTS Jesus Perez and Ignacio Santamaria Advanced Signal Processing Group, University of Cantabria, Spain, https://gtas.unican.es/
More informationPower Allocation and Coverage for a Relay-Assisted Downlink with Voice Users
Power Allocation and Coverage for a Relay-Assisted Downlink with Voice Users Junjik Bae, Randall Berry, and Michael L. Honig Department of Electrical Engineering and Computer Science Northwestern University,
More informationDiversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver Michael R. Souryal and Huiqing You National Institute of Standards and Technology Advanced Network Technologies Division Gaithersburg,
More informationPerformance Analysis of Spread Spectrum CDMA systems
1 Performance Analysis of Spread Spectrum CDMA systems 16:33:546 Wireless Communication Technologies Spring 5 Instructor: Dr. Narayan Mandayam Summary by Liang Xiao lxiao@winlab.rutgers.edu WINLAB, Department
More information