Have you asked your neighbors? A Hidden Market approach for device-to-device offloading

Chatzopoulos, Dimitris; Ahmadi, Mahdieh; Kosta, Sokol; Hui, Pan

doi:10.1109/wowmom.2016.7523497

Cited by 20 publications

(16 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Considering that there are some selfish nodes in the task allocation algorithm, Chatzopoulos et al . [30] proposed a design method that integrated incentive scheme and reputation mechanism framework, which followed the hidden market design method and allowed users to determine the amount of resources that should be obtained by participating in the task unloading. The algorithm can achieve higher offload rate and lower network consumption.…”

Section: Related Workmentioning

confidence: 99%

Cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks

Zheng

Chen

et al. 2020

IET Communications

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks

Zheng

Chen

et al. 2020

IET Communications

View full text Add to dashboard Cite

“…Regarding cooperation, UEs may be inclined to behave selfishly to save battery or to avoid increasing traffic volumes in pay-per-use plans. On one hand, suitable incentives and reputation-based schemes, such as those discussed in [28,29], could mitigate the problem. On the other hand, MDB services are supposed to be used also by embedded applications (e.g., application software running on cars), which have access to an energy source (e.g., the vehicle's battery) and are not under the control of the end user (i.e., the car owner or pilot).…”

Section: Multihop D2d Broadcastingmentioning

confidence: 99%

A Fast and Reliable Broadcast Service for LTE-Advanced Exploiting Multihop Device-to-Device Transmissions

2017

View full text Add to dashboard Cite

Several applications, from the Internet of Things for smart cities to those for vehicular networks, need fast and reliable proximity-based broadcast communications, i.e., the ability to reach all peers in a geographical neighborhood around the originator of a message, as well as ubiquitous connectivity. In this paper, we point out the inherent limitations of the LTE (Long-Term Evolution) cellular network, which make it difficult, if possible at all, to engineer such a service using traditional infrastructure-based communications. We argue, instead, that network-controlled device-to-device (D2D) communications, relayed in a multihop fashion, can efficiently support this service. To substantiate the above claim, we design a proximity-based broadcast service which exploits multihop D2D. We discuss the relevant issues both at the UE (User Equipment), which has to run applications, and within the network (i.e., at the eNodeBs), where suitable resource allocation schemes have to be enforced. We evaluate the performance of a multihop D2D broadcasting using system-level simulations, and demonstrate that it is fast, reliable and economical from a resource consumption standpoint.

show abstract

“…Chatzopoulos et al [35] also integrated an incentive scheme and a reputation mechanism, and proposed a framework which addressed any mechanism that considers selfish users. The peer-to-peer reputation exchange scheme showed that the degrees of trust of nodes could be calculated using the feedback of the other nodes.…”

Section: Trust Modelmentioning

confidence: 99%

A Cloud Theory-Based Trust Computing Model in Social Networks

Liu

Zhu

et al. 2016

Entropy

View full text Add to dashboard Cite

How to develop a trust management model and then to efficiently control and manage nodes is an important issue in the scope of social network security. In this paper, a trust management model based on a cloud model is proposed. The cloud model uses a specific computation operator to achieve the transformation from qualitative concepts to quantitative computation. Additionally, this can also be used to effectively express the fuzziness, randomness and the relationship between them of the subjective trust. The node trust is divided into reputation trust and transaction trust. In addition, evaluation methods are designed, respectively. Firstly, the two-dimension trust cloud evaluation model is designed based on node's comprehensive and trading experience to determine the reputation trust. The expected value reflects the average trust status of nodes. Then, entropy and hyper-entropy are used to describe the uncertainty of trust. Secondly, the calculation methods of the proposed direct transaction trust and the recommendation transaction trust involve comprehensively computation of the transaction trust of each node. Then, the choosing strategies were designed for node to trade based on trust cloud. Finally, the results of a simulation experiment in P2P network file sharing on an experimental platform directly reflect the objectivity, accuracy and robustness of the proposed model, and could also effectively identify the malicious or unreliable service nodes in the system. In addition, this can be used to promote the service reliability of the nodes with high credibility, by which the stability of the whole network is improved.

show abstract

Have you asked your neighbors? A Hidden Market approach for device-to-device offloading

Cited by 20 publications

References 18 publications

Cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks

Cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks

A Fast and Reliable Broadcast Service for LTE-Advanced Exploiting Multihop Device-to-Device Transmissions

A Cloud Theory-Based Trust Computing Model in Social Networks

Contact Info

Product

Resources

About