Energy-Efficient Optimal Relay Selection in Cooperative Cellular Networks Based on Double Auction

Li, Yun; Liao, Chao; Wang, Yong; Wang, Chonggang

doi:10.1109/twc.2015.2416715

Cited by 127 publications

(80 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Under the AF mode, RVs receive signals from SVs and then amplify and transmit them to the destination. In order to represent the performance of relay assignment among SVs, we assume that the direct transmission diversity between SVs and the destination would not exist [2]. The capacity without direct transmission diversity is expressed as,…”

Section: A System Modelmentioning

confidence: 99%

“…In the relay model with a large number of UAVs, only suitable relay selections can lead to better performances. Although the relay selection of ground communication has been studied [2]- [8], these results are not fully applicable to UAV networks. The reason is that one UAV may need to complete diverse information transmissions for different tasks at the same time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed relay selection for heterogeneous UAV communication networks using a many-to-many matching game without substitutability

Liu¹,

Xu²,

Xu³

et al. 2017

2017 IEEE/CIC International Conference on Communications in China (ICCC)

View full text Add to dashboard Cite

This paper proposes a distributed multiple relay selection scheme to maximize the satisfaction experiences of unmanned aerial vehicles (UAV) communication networks. The multi-radio and multi-channel (MRMC) UAV communication system is considered in this paper. One source UAV can select one or more relay radios, and each relay radio can be shared by multiple source UAVs equally. Without the center controller, source UAVs with heterogeneous requirements compete for channels dominated by relay radios. In order to optimize the global satisfaction performance, we model the UAV communication network as a many-to-many matching market without substitutability. We design a potential matching approach to address the optimization problem, in which the optimizing of local matching process will lead to the improvement of global matching results. Simulation results show that the proposed distributed matching approach yields good matching performance of satisfaction, which is close to the global optimum result. Moreover, the many-tomany potential matching approach outperforms existing schemes sufficiently in terms of global satisfaction within a reasonable convergence time.

show abstract

Section: A System Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Distributed relay selection for heterogeneous UAV communication networks using a many-to-many matching game without substitutability

Liu¹,

Xu²,

Xu³

et al. 2017

2017 IEEE/CIC International Conference on Communications in China (ICCC)

View full text Add to dashboard Cite

show abstract

“…The wellknown double auction mechanisms are McAfee [22] and Vickrey-Clarke-Groves auction [23]. These double auction mechanisms and their variations have been applied on many communication problems, such as the spectrum allocation for cognitive radio networks and cooperative communications [24][25][26][27][28]. However, these works only consider the single-unit goods double auctions and few refer to multi-unit double auction for communication resource trading.…”

Section: Related Workmentioning

confidence: 99%

Truthful double auction of spectrum trading for femtocell service provision

Gao

Feng

2016

Wirel. Commun. Mob. Comput.

View full text Add to dashboard Cite

The femtocell has been considered as a promising technology to improve indoor mobile network coverage co-working with macrocell networks. However, lack of licensed spectrum limits the development of the femtocell service provision. A feasible solution is that a femtocell service provider (FSP) leases spectrum from the existing licensed spectrum holder, the macrocell service provider (MSP). Existing research focuses on the interaction between a single FSP and MSP. In this paper, we investigate a spectrum trading framework for multiple FSPs and MSPs. Under such a scenario, both FSPs and MSPs have to compete with their peers in the trading. To balance the revenue and the cost from the spectrum trading, an analysis is made on how to determine the acceptable spectrum trading prices and volumes for both MSPs and FSPs. To guarantee the fairness of the transaction, we introduce a truthful double auction mechanism for the spectrum trading between FSPs and MSPs, which compels them to report their bids or asks honestly according to their valuations. In particular, the truthfulness and other properties of the spectrum double auction have been proved. Finally, the numerical results illustrate how the acceptable spectrum trading prices and volumes are determined and also how the spectrum double auction mechanism works. of the auction mechanism and their proof are presented. Section 6 gives the numerical results. The paper is concluded in the final section.

show abstract

“…According to the network structure based on user relationships, there are two kinds of relationships between the selected SPU and SDU, belonging to the same community and different communities. To control the redundant packet copies, the relay user selections for different relationships should be designed separately [10,11,12,13,14,15,16,17,18,19,20]. …”

Section: Introductionmentioning

confidence: 99%

Service Demand Discovery Mechanism for Mobile Social Networks

Wang

Yan

Wang

et al. 2016

Sensors

View full text Add to dashboard Cite

In the last few years, the service demand for wireless data over mobile networks has continually been soaring at a rapid pace. Thereinto, in Mobile Social Networks (MSNs), users can discover adjacent users for establishing temporary local connection and thus sharing already downloaded contents with each other to offload the service demand. Due to the partitioned topology, intermittent connection and social feature in such a network, the service demand discovery is challenging. In particular, the service demand discovery is exploited to identify the best relay user through the service registration, service selection and service activation. In order to maximize the utilization of limited network resources, a hybrid service demand discovery architecture, such as a Virtual Dictionary User (VDU) is proposed in this paper. Based on the historical data of movement, users can discover their relationships with others. Subsequently, according to the users activity, VDU is selected to facilitate the service registration procedure. Further, the service information outside of a home community can be obtained through the Global Active User (GAU) to support the service selection. To provide the Quality of Service (QoS), the Service Providing User (SPU) is chosen among multiple candidates. Numerical results show that, when compared with other classical service algorithms, the proposed scheme can improve the successful service demand discovery ratio by 25% under reduced overheads.

show abstract

Energy-Efficient Optimal Relay Selection in Cooperative Cellular Networks Based on Double Auction

Cited by 127 publications

References 27 publications

Distributed relay selection for heterogeneous UAV communication networks using a many-to-many matching game without substitutability

Distributed relay selection for heterogeneous UAV communication networks using a many-to-many matching game without substitutability

Truthful double auction of spectrum trading for femtocell service provision

Service Demand Discovery Mechanism for Mobile Social Networks

Contact Info

Product

Resources

About