Geir E. Oien
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Geir E. Oien has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Anders Gjendemsjo
Department of Electronics and Telecommunications, Norwegian University of Science and Technology (NTNU), 7491 Trondheim, Norway
4 shared publications - Changmian Wang
NTNU
4 shared publications - Liuguo Yin
Tsinghua University
4 shared publications - Sebastien de la Kethulle de Ryhove
Norwegian University of Science and Technology, Dept. of Electronics and Telecommunications, O.S. Bragstads plass 2B, N-7491 Trondheim, Norway. Tel: +47-73594315
4 shared publications - Hong-Chuan Yang
Dept. of ECE, University of Victoria, Victoria, Canada
3 shared publications - Mohamed-Slim Alouini
King Abdullah University of Science and Technology
3 shared publications
Latest Publications
- 7 July 2009
- Published by Springer Nature in International Journal of Wireless Information Networks
- Vol. 16 (3) , 154-164
An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks
- 7 July 2009
- Published by Springer Nature in International Journal of Wireless Information Networks
- Vol. 16 (3) , 154-164
An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks
- 12 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 56 (12) , 2214-2222
Exact capacity expressions for dual-branch ricean MIMO channels
In this paper we derive exact expressions for the mutual information (MI) probability density function and the MI cumulative distribution function of dual-branch multipleinput multiple-output (MIMO) systems (either two transmit (Tx) or two receive (Rx) antennas) communicating over a Ricean channel with no constraint on the rank of the line-of-sight (LOS) channel matrix. This is done both for the case where the channel is only known at the Rx, and for the case where the channel is known both at the Tx and the Rx. As an example, to evaluate the expressions, we employ uniform linear arrays and give expressions for the eigenvalues of the LOS channel matrix for the dual-branch case.
- 12 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 56 (12) , 2214-2222
Exact capacity expressions for dual-branch ricean MIMO channels
In this paper we derive exact expressions for the mutual information (MI) probability density function and the MI cumulative distribution function of dual-branch multipleinput multiple-output (MIMO) systems (either two transmit (Tx) or two receive (Rx) antennas) communicating over a Ricean channel with no constraint on the rank of the line-of-sight (LOS) channel matrix. This is done both for the case where the channel is only known at the Rx, and for the case where the channel is known both at the Tx and the Rx. As an example, to evaluate the expressions, we employ uniform linear arrays and give expressions for the eigenvalues of the LOS channel matrix for the dual-branch case.
- 25 June 2008
- Published by Springer Nature in Wireless Personal Communications
- Vol. 50 (1) , 57-67
On the Minimization of Communication Energy Consumption of Correlated Sensor Nodes
- 25 June 2008
- Published by Springer Nature in Wireless Personal Communications
- Vol. 50 (1) , 57-67
On the Minimization of Communication Energy Consumption of Correlated Sensor Nodes
- 17 June 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (7) , 3221-3231
On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels
The memoryless noncoherent single-input-single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions are derived for the mutual information between the output and the input of this channel when the input magnitude distribution is discrete and is restricted to having two mass points. It is subsequently shown how these expressions can be used to obtain closed-form expressions for the capacity of this channel for signal to noise ratio (SNR) values of up to approximately 0 dB, and a tight capacity lower bound for SNR values between 0 dB and 10 dB. The expressions for the channel capacity and its lower bound are given as functions of a parameter which can be obtained via numerical root-finding algorithms.
- 17 June 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (7) , 3221-3231
On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels
The memoryless noncoherent single-input-single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions are derived for the mutual information between the output and the input of this channel when the input magnitude distribution is discrete and is restricted to having two mass points. It is subsequently shown how these expressions can be used to obtain closed-form expressions for the capacity of this channel for signal to noise ratio (SNR) values of up to approximately 0 dB, and a tight capacity lower bound for SNR values between 0 dB and 10 dB. The expressions for the channel capacity and its lower bound are given as functions of a parameter which can be obtained via numerical root-finding algorithms.
- 1 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Uplink Distributed Binary Power Allocation for Cognitive Radio Networks
Motivated by the desire for efficient spectral utilization, we present a novel algorithm for power allocation for sum rate maximization in cognitive radio context while preserving a guaranteed QoS for the primary network. To this effect, we propose a distributed cognitive radio coordination that maximizes the cognitive radio network (CRN) sum rate while minimizing the interference to the primary users (PU). Our goal is to realize spectrum sharing by optimally allocating secondary users (SU) transmit powers in order to maximize the total SU throughput under interference and noise impairments. Both theoretical and simulation results under realistic wireless network settings are shown to exhibit interesting features in term of CRN deployment while maintaining QoS for the primary system.
- 1 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Uplink Distributed Binary Power Allocation for Cognitive Radio Networks
Motivated by the desire for efficient spectral utilization, we present a novel algorithm for power allocation for sum rate maximization in cognitive radio context while preserving a guaranteed QoS for the primary network. To this effect, we propose a distributed cognitive radio coordination that maximizes the cognitive radio network (CRN) sum rate while minimizing the interference to the primary users (PU). Our goal is to realize spectrum sharing by optimally allocating secondary users (SU) transmit powers in order to maximize the total SU throughput under interference and noise impairments. Both theoretical and simulation results under realistic wireless network settings are shown to exhibit interesting features in term of CRN deployment while maintaining QoS for the primary system.
- 10 December 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 6 (12) , 4215-4220
Throughput guarantees for wireless networks with opportunistic scheduling: a comparative study
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with a given mean and variance of the bit-rate in a time-slot, and a given distribution for the number of time-slots allocated within a time-window. Based on this general result, we evaluate closed-form expressions for the TGVPs for four well-known scheduling algorithms. Through simulations we also show that our TGVP approximation is tight for a realistic network with moving users with correlated channels and realistic throughput guarantees.
- 10 December 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 6 (12) , 4215-4220
Throughput guarantees for wireless networks with opportunistic scheduling: a comparative study
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with a given mean and variance of the bit-rate in a time-slot, and a given distribution for the number of time-slots allocated within a time-window. Based on this general result, we evaluate closed-form expressions for the TGVPs for four well-known scheduling algorithms. Through simulations we also show that our TGVP approximation is tight for a realistic network with moving users with correlated channels and realistic throughput guarantees.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10586393,p. 1075-1079
Joint Adaptive Modulation, Diversity Combining, and Power Control for Downlink Transmission in Two-cell Wireless Networks
We consider the joint application of power control, adaptive modulation and diversity combining in a two-cell wireless network. The goal is to derive a practical low-complexity, bandwidth-efficient, and battery-power efficient transmission scheme addressing the challenges of downlink transmission. Employing full spectral reuse, coordination of the transmit power levels is used to optimize the spectral efficiency by managing co-channel interference, also taking into account the limited processing power of a mobile unit. Through a mathematical analysis, the proposed scheme is thoroughly evaluated in terms of spectral efficiency and number of combined diversity branches.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10586393,p. 1075-1079
Joint Adaptive Modulation, Diversity Combining, and Power Control for Downlink Transmission in Two-cell Wireless Networks
We consider the joint application of power control, adaptive modulation and diversity combining in a two-cell wireless network. The goal is to derive a practical low-complexity, bandwidth-efficient, and battery-power efficient transmission scheme addressing the challenges of downlink transmission. Employing full spectral reuse, coordination of the transmit power levels is used to optimize the spectral efficiency by managing co-channel interference, also taking into account the limited processing power of a mobile unit. Through a mathematical analysis, the proposed scheme is thoroughly evaluated in terms of spectral efficiency and number of combined diversity branches.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 401-406
Scheduling Algorithms for Increased Throughput Guarantees in Wireless Networks
For cellular wireless networks carrying real-time traffic, it is in the interest of both network operators and customers that throughput guarantees can be offered. In this paper, we formulate an optimization problem which aims at maximizing the throughput that can be guaranteed to the mobile users. By building on results obtained by Borst and Whiting and by assuming that the distributions of the users' carrier-to-noise ratios are known, we find the solution to this problem for users with different channel quality distributions, both for the scenario where all the users have the same throughput guarantee, and for the scenario where all the users have different throughput guarantees. Based on these solutions, we propose an adaptive scheduling algorithm that performs significantly better than other well-known scheduling algorithms.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 401-406
Scheduling Algorithms for Increased Throughput Guarantees in Wireless Networks
For cellular wireless networks carrying real-time traffic, it is in the interest of both network operators and customers that throughput guarantees can be offered. In this paper, we formulate an optimization problem which aims at maximizing the throughput that can be guaranteed to the mobile users. By building on results obtained by Borst and Whiting and by assuming that the distributions of the users' carrier-to-noise ratios are known, we find the solution to this problem for users with different channel quality distributions, both for the scenario where all the users have the same throughput guarantee, and for the scenario where all the users have different throughput guarantees. Based on these solutions, we propose an adaptive scheduling algorithm that performs significantly better than other well-known scheduling algorithms.