Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Ph.D. Dissertation
- Language: Farsi
- Document No: 44159 (05)
- University: Sharif University of Technology
- Department: Electrical Engineering
- Advisor(s): Hossein Khalaj, Babak
- Abstract:
- We analyze the fundamental communication limits and capabilities of random wireless networks. In order to achieve this goal, we investigate and analyze efficient communication strategies in such networks. The traffic model considered is unicasting. Also, we consider two different channel models, namely, the geometric channel model and the random connections model.
In networks with random connection model, channel powers between different nodes are drawn from a common distribution in an independent manner. We assume an on-off strategy for operation of transmitters, and show that finding the optimum transmission strategy problem is an NP-hard problem. Thus, we propose a heuristic algorithm to overcome the complexity of the problem and analyze the throughput of this algorithm. We prove that this algorithm is order-optimal for networks with Nakagami fading. In addition, we analyze the robustness of the method when the feedback links in the network are not ideal.
In networks with geometric channel model, the main factor affecting the received signal strength is the path loss effect. We consider several important issues in methods based on cooperative MIMO techniques in such networks. By optimizing several parameters in such networks we show that a great performance improvement will result. In addition to analyzing the power allocation problem in such networks we investigate the effect of traffic localization on network performance - Keywords:
- Throughput ; Random Wireless Networks ; Random Connections Model ; Geometric Model ; Order Statistics
Digital Object List
-
محتواي کتاب
- view
Bookmark