Tree-Based Routing Protocol for Cognitive Wireless Access Networks

Zhang, Bing; Takizawa, Yukio; Hasagawa, A.; Yamaguchi, A.; Obana, Sadao

doi:10.1109/wcnc.2007.768

Cited by 29 publications

(18 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There exist many studies on the routing protocol design for cognitive radio networks [10,[13][14][15][16][17]. A highthroughput spectrum-aware routing protocol was investigated in [10].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks

Cheng

Chen

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

A challenging problem in cognitive radio networks (CRNs) is to design a throughput efficient routing and scheduling algorithm for end-to-end communications between secondary users (SUs) in a distributed manner. Due to the opportunistic nature of CRN routing, we consider a framework with randomized path selection in this paper. Motivated by the back-pressure scheduling policy, we adopt the differential queue backlog as the routing metric to achieve throughput efficiency. Moreover, we demonstrate the sufficient condition for our framework to achieve throughput optimality by analyzing the Lyapunov drift. We further propose a distributed medium access control algorithm that can approximately satisfy the required condition when the transmission attempt probability is low. The performance of our proposed scheme is evaluated in a simulation platform, and the evaluation results verify the effectiveness of our distributed scheme.

show abstract

“…There exist many studies on the routing protocol design for cognitive radio networks [10,[13][14][15][16][17]. A highthroughput spectrum-aware routing protocol was investigated in [10].…”

Section: Related Workmentioning

confidence: 99%

“…A highthroughput spectrum-aware routing protocol was investigated in [10]. In [13], the authors developed a treebased routing algorithm that can achieve low end-to-end delay. These protocols all use a predefined single path for all transmissions.…”

Section: Related Workmentioning

confidence: 99%

Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks

Cheng

Chen

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Cognitive tree based routing (CTBR) [19] is an extension of tree based routing protocol (TBR) proposed for wireless mesh networks [17][18]. It uses global and local decision schemes for route calculation.…”

Section: Cognitive Tree-based Routing (Ctbr)mentioning

confidence: 99%

Routing Techniques In Cognitive Radio Networks: A Survey

Ali¹,

Iqbal²,

Baig³

et al. 2011

IJWMN

View full text Add to dashboard Cite

show abstract

“…In particular, many emerging wireless systems, such as the IEEE WiMAX 802.16 [15], nextgeneration LTE-Advanced systems [16][17][18], or cognitive ad hoc networks [19][20][21], involve communications over hierarchical architectures, such as a multi-hop tree for uplink transmission [16][17][18], [22][23][24][25][26][27][28]. The interplay between the need for ensuring secrecy and the formation of such a tree architecture is an important problem that has been relatively unexplored in the literature.…”

Section: Introductionmentioning

confidence: 99%

Tree Formation with Physical Layer Security Considerations in Wireless Multi-Hop Networks

Saad

Zhou

Maham

et al. 2012

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Physical layer security has emerged as a promising technique that complements existing cryptographic approaches and enables the securing of wireless transmissions against eavesdropping. In this paper, the impact of optimizing physical layer security metrics on the architecture and interactions of the nodes in multi-hop wireless networks is studied. In particular, a game-theoretic framework is proposed using which a number of nodes interact and choose their optimal and secure communication paths in the uplink of a wireless multihop network, in the presence of eavesdroppers. To this end, a tree formation game is formulated in which the players are the wireless nodes that seek to form a network graph among themselves while optimizing their multi-hop secrecy rates or the path qualification probabilities, depending on their knowledge of the eavesdroppers' channels. To solve this game, a distributed tree formation algorithm is proposed and is shown to converge to a stable Nash network. Simulation results show that the proposed approach yields significant performance gains in terms of both the average bottleneck secrecy rate per node and the average path qualification probability per node, relative to classical bestchannel algorithms and the single-hop star network. The results also assess the properties and characteristics of the resulting Nash networks.Index Terms-Physical layer security, network formation, game theory, multi-hop networks.

show abstract

Tree-Based Routing Protocol for Cognitive Wireless Access Networks

Cited by 29 publications

References 3 publications

Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks

Distributed back-pressure scheduling with opportunistic routing in cognitive radio networks

Routing Techniques In Cognitive Radio Networks: A Survey

Tree Formation with Physical Layer Security Considerations in Wireless Multi-Hop Networks

Contact Info

Product

Resources

About