| 1. |
|
|
| 2. |
- Ding, Lianghui, et al.
(author)
-
Energy minimization in wireless multihop networks using two-way network coding
- 2011
-
In: IEEE 73rd Vehicular Technology Conference (VTC-2011-Spring), Budapest, Ungern. - 9781424483310
-
Conference paper (peer-reviewed)abstract
- The total energy minimization in wireless multihop networks using two-way network coding is investigated in this paper. The problem is first formulated as a linear programming problem, then decomposed into two sub-problems using the Lagrangian decomposition, and finally solved with the subgradient method. After that, the backpressure based algorithm is proposed to solve the problem in a distributed manner. The performance of the algorithm is evaluated first in a simple topology for analysis and then in a random topology with different number of flows for practical consideration. Simulation results show that the convergence time increases as the number of nodes in the network, and the energy cost per packet can be saved up to 30% by using two-way network coding.
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Wang, Hao, et al.
(author)
-
Minimum rate guaranteed call admission control for cumulative rate distribution based scheduling
- 2011
-
In: IEEE Communications Letters. - 1089-7798 .- 1558-2558. ; 15:11, s. 1181-1183
-
Journal article (peer-reviewed)abstract
- In this letter, we investigate call admission control (CAC) for cumulative rate distribution based scheduling (CS) in wireless communication networks. We first analyze the multi-user diversity gain (MDG) of CS, which is applicable to general channel conditions. Then we propose the minimum rate guaranteed CS/ORR based CAC algorithm, COCAC, which jointly uses CS and opportunistic round robin (ORR) for resource prediction and CAC decision. Furthermore, we evaluate the performance of our COCAC algorithm through simulation. Results show that COCAC can significantly reduce the new call blocking rate, while strictly guarantee the minimum rate requirements of all serving users.
|
|
| 9. |
|
|
| 10. |
- Xu, Yanli, et al.
(author)
-
Capacity analysis of selection cooperation in wireless ad-hoc networks
- 2011
-
In: IEEE Communications Letters. - 1089-7798 .- 1558-2558. ; 15:11, s. 1212-1214
-
Journal article (peer-reviewed)abstract
- In this letter, we analyze the transmission capacity of selection cooperation (SC) in wireless ad-hoc networks. We first derive the distribution of decoded relay set which follows inhomogeneous Poisson point process (PPP) and then present the closed-form expressions for the outage probability and transmission capacity. Furthermore, we propose an upper bound of source node density given an outage probability constraint and find an optimal transmitter density at which the transmission capacity reaches its maximum. Numerical results show that the performance gain provided by SC can be optimally adjusted by selecting appropriate node density. It is also shown that SC further expands advantage at severer large-scale fading.
|
|
