Change search
ReferencesLink to record
Permanent link

Direct link
Cooperative geographic routing in wireless mesh networks
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-2764-8099
2010 (English)Conference paper (Refereed)
Abstract [en]

We propose cooperative geographic routing (cGeo-routing) for wireless mesh networks by combining cooperative transmission with traditional geographic routing. We model and evaluate two cGeo-routing schemes including Cooperative-Random Progress Forwarding (C-RPF) and Cooperative-Nearest with Forward Progress (C-NFP). We show that cGeo-routing significantly increases the average transport capacity for a single hop in well connected mesh networks, and the gain increases with the transmitted signal-to noise ratio (SNR). Moreover, there exists an optimal topology knowledge range in C-RPF, whereas an optimal node density in C-NFP. Our results also suggest that hop-by-hop cooperation can increase transport capacity in high-connectivity and high-SNR regimes, however, it does not change the transport capacity scaling law of the mesh network.

Place, publisher, year, edition, pages
National Category
Communication Systems
Research subject
URN: urn:nbn:se:kth:diva-53570DOI: 10.1109/MASS.2010.5663887ScopusID: 2-s2.0-78650972414OAI: diva2:470360
IEEE International Workshop on Enabling Technologies and Standards for Wireless Mesh Networking (MeshTech). November 8, 2010. San Francisco, CA, USA
SRA TNG Network Layer Models

QC 20120109

Available from: 2011-12-28 Created: 2011-12-28 Last updated: 2013-05-17Bibliographically approved
In thesis
1. Cooperative and Cognitive Communication in Wireless Networks
Open this publication in new window or tab >>Cooperative and Cognitive Communication in Wireless Networks
2013 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In the last decade, significant efforts and progress have been made by both the industry and academia to meet the rapidly growing demand for wireless applications and services. To achieve more flexible, dynamic and intelligent use of the limited wireless spectrum, cooperative transmission and cognitive networking are proposed as two of the key technologies for the next generation wireless communication systems, such as Long-Term Evolution Advanced. Cooperative transmission techniques, such as cooperative relaying and Multiple-Input and Multiple-Output (MIMO) can increase spectrum efficiency by utilizing the diversity of wireless channels, while cognitive transmitters tune their transmission parameters according to the environment to optimize network level performance. In this thesis, we provide performance modeling and analysis of different cooperative and cognitive communication techniques to exploit their potential.

In the first part of the thesis, we investigate the performance of hop-by-hop cooperative communication on a multihop transmission path applying spatial reuse time division multiplexing, where interference from simultaneous transmissions exists. Based on the models, we compare the performance of hop-by-hop cooperation with the performance of traditional simple multihopping schemes, and give the regimes where hop-by-hop cooperation achieves significant gain. Considering random networks, we propose cooperative geographic routing, the integration of hop-by-hop cooperation with traditional geographic routing, and evaluate the effects of the topology knowledge range and the network density.

In the second part of the thesis, we discuss how cooperative transmission techniques can be utilized in cognitive and hierarchical spectrum sharing networks, where the primary users have transmission guarantees, and the coexisting secondary users need to be cognitive and adjust their transmissions in the shared spectrum bands to conform constraints from the primary users. We consider large-scale coexisting primary and secondary networks, where concurrent primary and secondary transmissions are allowed, and the secondary users provide cooperative relaying for the primary ones and control the interference at the primary receivers by tuning the probability of transmitting and by forming a primary exclusive region around each primary receiver within which all secondary users have to be silent. We define a unified analytic framework to model the performance of cooperative spectrum sharing and cognitive transmission control, characterize their achievable gains, and show that both of the networks have strong incentives to participate in the collaboration.

Finally, we investigate spectrum sharing networks where both primary and secondary users have stochastic packet arrival. Under the constraint that the performance of primary users does not degrade, we find the dilemma for the secondary users. That is, if a secondary user chooses to cooperate, it can transmit immediately even if the primary queue is not empty, but has additional costs for relaying primary packets, such as increased power consumption. We propose a dynamic cooperation scheme for the secondary user so that it can make sequential decision on whether to cooperate or not in each time slot based on the state of the network. We show that optimal sequential decision is necessary to efficiently trade off the cooperation cost and the packet delay of the secondary user.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2013. vii, 54 p.
TRITA-EE, ISSN 1653-5146 ; 2013:18
National Category
urn:nbn:se:kth:diva-122277 (URN)978-91-7501-731-0 (ISBN)
Public defence
2013-06-05, Q2, Osquldas väg 10, KTH, Stockholm, 10:00 (English)

QC 20130517

Available from: 2013-05-17 Created: 2013-05-16 Last updated: 2014-02-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Wang, LipingFodor, Viktoria
By organisation
Communication NetworksACCESS Linnaeus Centre
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 112 hits
ReferencesLink to record
Permanent link

Direct link