http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Joint Routing, Scheduling and Power Control for Large Interference Wireless Networks
Javad Kazemitabar,Vahid Tabatabaee,Hamid Jafarkhani 한국통신학회 2017 Journal of communications and networks Vol.19 No.4
We consider the problem of joint routing, scheduling andpower control in multi-hop wireless networks. We use a linear relationbetween link capacity and signal to interference noise ratio inour formulation. In a previous work, using a duality approach, theoptimal link scheduling and power control that minimizes the totalaverage transmission power is found. We formulate this problemas a linear programming problem with exponential number of constraints. To cope with the exponential number of constraints, wepropose an iterative algorithm based on the cutting plane method. The separation oracle for the cutting plane algorithm turns out tobe an element-wise concave optimization problem that can be effectivelysolved using branch and bound algorithm. We extend thesame method to find the optimal routing scheduling and powercontrol. Simulation results show that this methodology is more efficientand scalable compare to the previously proposed algorithm.
A Study of Connectivity in MIMO Fading Ad-Hoc Networks
Yousefi'zadeh, H.,Jafarkhani, H.,Kazemitabar, J. The Korea Institute of Information and Commucation 2009 Journal of communications and networks Vol.11 No.1
We investigate the connectivity of fading wireless ad-hoc networks with a pair of novel connectivity metrics. Our first metric looks at the problem of connectivity relying on the outage capacity of MIMO channels. Our second metric relies on a probabilistic treatment of the symbol error rates for such channels. We relate both capacity and symbol error rates to the characteristics of the underlying communication system such as antenna configuration, modulation, coding, and signal strength measured in terms of signal-to-interference-noise-ratio. For each metric of connectivity, we also provide a simplified treatment in the case of ergodic fading channels. In each case, we assume a pair of nodes are connected if their bi-directional measure of connectivity is better than a given threshold. Our analysis relies on the central limit theorem to approximate the distribution of the combined undesired signal affecting each link of an ad-hoc network as Gaussian. Supported by our simulation results, our analysis shows that (1) a measure of connectivity purely based on signal strength is not capable of accurately capturing the connectivity phenomenon, and (2) employing multiple antenna mobile nodes improves the connectivity of fading ad-hoc networks.
A Study of Connectivity in MIMO Fading Ad-Hoc Networks
H. Yousefi’zadeh,H. Jafarkhani,J. Kazemitabar 한국통신학회 2009 Journal of communications and networks Vol.11 No.1
We investigate the connectivity of fading wireless ad-hoc networks with a pair of novel connectivity metrics. Our first metric looks at the problem of connectivity relying on the outage capacity of MIMO channels. Our second metric relies on a probabilistic treatment of the symbol error rates for such channels. We relate both capacity and symbol error rates to the characteristics of the underlying communication system such as antenna configuration, modulation, coding, and signal strength measured in terms of signal-to-interference-noise-ratio. For each metric of connectivity, we also provide a simplified treatment in the case of ergodic fading channels. In each case, we assume a pair of nodes are connected if their bi-directional measure of connectivity is better than a given threshold. Our analysis relies on the central limit theorem to approximate the distribution of the combined undesired signal affecting each link of an ad-hoc network as Gaussian. Supported by our simulation results, our analysis shows that (1) a measure of connectivity purely based on signal strength is not capable of accurately capturing the connectivity phenomenon, and (2) employing multiple antenna mobile nodes improves the connectivity of fading ad-hoc networks.