Connectivity in Selfish, Cooperative Networks

Liu, Chi Harold; Zhang, Qinqing; Leung, Kin K.

doi:10.1109/lcomm.2010.091010.101173

Cited by 17 publications

(12 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multi-way relay communications were studied for a group of single-antenna users with regenerative relaying strategies in [7]. By using stochastic geometry and percolation theory, the authors analyzed the connectivity of cooperative ad hoc network with selfishness in [18]. Using non-coherent fast frequency hopping (FFH) techniques, information exchange among a group of users was studied in [9] where information exchange could be accomplished within only two time slots regardless of the number of users.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis for Multi-Way Relaying in Rician Fading Channels

Xue

Sellathurai

Ratnarajah

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, the multi-way relaying scenario is considered with M users who want to exchange their information with each other with the help of N relays (N ≫ M ) among them. There are no direct transmission channels between any two users. Particularly all users transmit their signals to all relays in the first time slot and M − 1 relays are selected later to broadcast their mixture signals during the following M − 1 time slots to all users. Compared to the transmission with the help of single relay, the multi-way relaying scenario reduces the transmit time significantly from 2M to M time slots. Random and semiorthogonal relays selections are applied. Rician fading channels are considered between the users and relays, and analytical expressions for the outage probability and ergodic sum rate for the proposed relaying protocol are developed by first characterizing the statistical property of the effective channel gain based on random relays selection. Also, the approximation of ergodic sum rate at high signal-to-noise ratio (SNR) regime is derived. In addition, the diversity order of the system is investigated for both random and semiorthogonal relay selections. Meanwhile, it is shown that when the relays are randomly separated into L groups of M −1 relays, the group with maximum average channel gain can achieve the diversity order L which will increase when more relays considered in the scheme. Furthermore, when semiorthogonal selection (SS) algorithm is applied to select the relays with semiorthogonal channels, it is shown that the system will guarantee that all the users can decode the others information successfully. Moreover, the maximum of channel gain after semiorthogonal relays selection is investigated by using extreme value theory, and tight lower and upper bounds are derived. Simulation results demonstrate that the derived expressions are accurate.Index Terms-Cooperative communication, extreme value theory, multi-way relaying, semiorthogonal relays selection. 0090-6778 (c)

show abstract

Section: Introductionmentioning

confidence: 99%

Performance Analysis for Multi-Way Relaying in Rician Fading Channels

Xue

Sellathurai

Ratnarajah

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…From [4], we know that the network capacity is decreased with increasing transmission radius, since the number of simultaneous transmissions is decreased. We can enhance the transmission power to offset the impact of node density, which also provides sufficient conditions to guarantee the connectivity of the network [20]. In addition, we also give a comparison with previous works in Figure 5b.…”

Section: Discussionmentioning

confidence: 97%

“…In this work, we study the throughput of wireless ad hoc networks with selfish nodes under general node density. We denote these networks as SWANETs, which were widely researched in connectivity [20] and routing protocol [21]. Minho Jo [22] et al proposed an easy and efficient cooperative of neighboring (COOPON) technique to detect the selfish cognitive radio attack.…”

Section: Introductionmentioning

confidence: 99%

Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density

et al. 2016

View full text Add to dashboard Cite

Abstract:In this paper, we study the throughput capacity of wireless networks considering the selfish feature of interaction between nodes. In our proposed network model, each node has a probability of cooperating to relay transmission. According to the extent of selfishness, we, by the application of percolation theory, construct a series of highways crossing the network. The transmission strategy is then divided into three consecutive phases. Comparing the rate in each phase, we find the bottleneck of rate is always in the highway phase. Finally, the result reveals that the node's selfishness degrades the throughput with a factor of square root of the cooperative probability, whereas the node density has trivial impact on the throughput.

show abstract

“…In addition, in both BA and DS, the preferential attachment for a node applies to all the other nodes in the network. Actually, nodes prefer or have to connect with their local neighbors in many real networks [16]. Taking these into account, this paper proposes NLL model.…”

Section: Neighborhood Log-on and Log-off Modelmentioning

confidence: 99%

NLL: A Complex Network Model with Compensation for Enhanced Connectivity

et al. 2013

Self Cite

View full text Add to dashboard Cite

The canonical scale-free model to describe complex networks is BA model with an power-law exponent γ = 3. Researchers further propose DS model (1 < γ ≤ 4) to consider link failure besides node growth in preferential attachment. However, both models assume globally preferential attachment which is difficult to achieve in real networks. This paper proposes a new scale-free model, i.e. Neighborhood Log-on and Log-off model (NLL) which considers locally preferential connectivity. NLL incorporates both node growth and removal in topology evolvement. Unlike BA and DS, NLL adds compensation mechanism to enhance connectivity. The analysis shows that NLL has 1 < γ ≤ 3. We conduct simulations to evaluate NLL performance and show that, NLL has short average path length and large clustering coefficient, compared with BA and DS models.Index Terms-Complex network, BA model, scale-free.

show abstract

Connectivity in Selfish, Cooperative Networks

Cited by 17 publications

References 10 publications

Performance Analysis for Multi-Way Relaying in Rician Fading Channels

Performance Analysis for Multi-Way Relaying in Rician Fading Channels

Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density

NLL: A Complex Network Model with Compensation for Enhanced Connectivity

Contact Info

Product

Resources

About