A Survey on Human-Centric Communications in Non-Cooperative Wireless Relay Networks

Jedari, Behrouz; Xia, Feng; Ning, Zhaolong

doi:10.1109/comst.2018.2791428

Cited by 40 publications

(30 citation statements)

References 195 publications

(280 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is possible that multiple nodes have the largest generalized Nash product and any such node can be the head. In such cases, the node with the lowest index will be selected as the head without loss of generality 6 . The above steps is summarized in Algorithm 1.…”

Section: Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Joint head selection and airtime allocation for data dissemination in mobile social networks

Mao

Jiang

et al. 2020

Computer Networks

View full text Add to dashboard Cite

By forming a temporary group, users in mobile social networks (MSNs) can disseminate data to others in proximity with short-range communication technologies. However, due to user mobility, airtime available for users in the same group to disseminate data is limited. In addition, for practical consideration, a star network topology among users in the group is expected. For the former, unfair airtime allocation among the users will undermine their willingness to participate in MSNs. For the latter, a group head is required to connect other users. These two problems have to be properly addressed to enable real implementation and adoption of MSNs. To this aim, we propose a joint head selection and airtime allocation scheme for data dissemination within the group using Nash bargaining theory. Specifically, we consider two cases in terms of user preference on the data to be disseminated: a homogeneous case and a heterogeneous case. For each case, a Nash bargaining solution (NBS) based optimization problem is proposed. The existence of optimal solutions to the optimization problems is proved, which guarantees Pareto optimality and proportional fairness. Next, an algorithm that allows distributed implementation is introduced. Finally, numerical results are presented to evaluate the performance, validate intuitions and derive insights of the proposed scheme.

show abstract

Section: Algorithmmentioning

confidence: 99%

“…Output: (x , a ) 1: for i ∈ G do end while 11: end for 6. Certainly, there are other approaches to determine the final group head, such as selecting the node with the highest battery power.…”

Section: Algorithm 1 Joint Head Selection and Airtime Allocationmentioning

confidence: 99%

Joint head selection and airtime allocation for data dissemination in mobile social networks

Mao

Jiang

et al. 2020

Computer Networks

View full text Add to dashboard Cite

show abstract

“…In DTNs, there exist various schemes that deal with selfish/misbehaving nodes during data delivery. The existing schemes aim to encourage the selfish nodes in message forwarding by providing them incentives.…”

Section: Related Workmentioning

confidence: 99%

Social‐based reputation‐aware data forwarding for improved multicast delivery in the presence of selfish nodes in DTNs

Roy

Acharya

Bit

2019

Int J Communication

View full text Add to dashboard Cite

Delay/disruption tolerant networks (DTNs) are potentially applicable in the challenged scenarios like post-disaster environments. In such networks, data forwarding generally relies on the mutual cooperation of the nodes. However, in reality, despite the availability of necessary resources for data forwarding, a node could misbehave by dropping messages received from other nodes with whom it has no strong social ties. Such a node is called a socially selfish node, which would cause a poor delivery ratio in the network. In this paper, we aim to address the problem of multicast data forwarding in the presence of such selfish nodes, by means of efficient relay selection in DTNs. First, we define a realistic reputation model, in contrast to existing models, to define the socially selfish/misbehaving nodes in the network. Further, a game-theoretic analysis is carried out that implies data forwarding cost is also an influential parameter in handling selfishness/misbehavior. Subsequently, the problem is formulated as a constrained optimization problem, which is NP hard. Therefore, a heuristic is proposed by combining the reputation of a node and the cost of message forwarding to appropriately identify relay nodes, thus improve the performance of the multicast message delivery in the network. We utilize a social metric, centrality to minimize the message forwarding cost in terms of the number of relay nodes. Finally, the comparative performance evaluation in ONE simulator with practical scenarios shows the superiority of the proposed scheme over the other prominent schemes. KEYWORDScentrality, delay tolerant networks, multicast, reputation, selfishness/misbehavior Int J Commun Syst. 2020;33:e4235.wileyonlinelibrary.com/journal/dac

show abstract

“…In addition to density and mobility, there are many other factors that play a role in maintaining connectivity, such as available resources, whether charging facilities are available, context and social information or relationships (Jedari et al, 2018). This can lead to non-cooperative behaviour among relaying nodes.…”

Section: Introductionmentioning

confidence: 99%

“…This can lead to non-cooperative behaviour among relaying nodes. Based on the behaviour of nodes, literature (Jedari et al, 2018) classifies mobile nodes in three main categories,…”

Section: Introductionmentioning

confidence: 99%

Ad Hoc Communication Topology Switching during Disasters from Altruistic to Individualistic and Back

Banerjee

Warnier

Brazier

2020

Proceedings of the 5th International Conference on Complexity, Future Information Systems and Risk

View full text Add to dashboard Cite

Disaster communication has made immense progress in the last thirty years. At present, disaster research focuses on bottom-up approaches such as civilian inclusion in disaster response. With the advent of smartphones, citizen-based emergency communication has become possible. Present ad hoc communication technologies typically form a fully connected mesh network, which connects all phones that are within each other's transmission range. This facilitates low-latency direct communication between citizens, but it quickly drains the battery of phones. Alternative ad hoc communication networks form an adaptive energy-efficient network topology, that is most draining to batteries of phones that have a higher charge, while low-energy phones are spared from relaying messages, thereby preserving battery and thus maintaining their connection with the rescue communication network. Both of these approaches have their own advantages. Which one is best for communication needs depends on the context. This position paper discusses the possibility of a decision model as an approach to automatically switch between the two alternative ad hoc communication networks. This ensures that citizens in disasters can make use of the optimal communication system at all times.

show abstract

A Survey on Human-Centric Communications in Non-Cooperative Wireless Relay Networks

Cited by 40 publications

References 195 publications

Joint head selection and airtime allocation for data dissemination in mobile social networks

Joint head selection and airtime allocation for data dissemination in mobile social networks

Social‐based reputation‐aware data forwarding for improved multicast delivery in the presence of selfish nodes in DTNs

Ad Hoc Communication Topology Switching during Disasters from Altruistic to Individualistic and Back

Contact Info

Product

Resources

About