Opportunistic Networks Routing Algorithm Based on the Uncertain Social Relationship

Xu, Gang; Xu, Zhendong; He, Yuchen; Zhou, Jian; Guo, Ying; Guo, Xiaodong

doi:10.1109/cscwd.2018.8465201

Cited by 5 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So any routing mechanism that relies on static social interactivity does have some limits. G. Xu et al [128] evaluated the drawbacks of OppNets' routing methods based on dynamic social connections and proposed a novel opportunistic routing mechanism based on dynamic social relationships. However, the role of the Seed OppNet is (Not Defined).…”

Section: E Oppnets Routingmentioning

confidence: 99%

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

2021

View full text Add to dashboard Cite

Opportunistic Networks is a new concept that is increasingly gaining ground since it appears as a concrete example of the Internet of Things, Internet of Vehicles, Industrial Internet of Things, and the Internet of Everything with Mobile ad hoc Networks' characteristics. An Opportunistic Network starts with a Seed OppNet that sets up the network; expands from the Seed OppNet to an extended Seed OppNet through devices' discovery. The characteristics of Opportunistic Networks make OppNets more challenging than any other networks. So, a deep understanding of OppNets' characteristics and demands is an unavoidable precondition before proposing any OppNets related scheme. However, under OppNets' constraints, the relevance of the Opportunistic Networks related articles in literature is yet to be established. Also, most surveys tackling Opportunistic Networks do not give a complete insight into what Opportunistic Networks stand for. This work reviews state of the art on Opportunistic Networks providing three main contributions. First, resorting to the primary definition of Opportunistic Networks, it elucidates what OppNets are, pointing out the particularities of an OppNet, its domains of applications, and challenges. Second, it provides a comprehensive review that encompasses most Opportunistic Networks' research areas: routing, intrusion detection, authentication, privacy protection, data aggregation, and the technology for OppNets, organising them in a taxonomy. Third, it evaluates the role of the Seed OppNet in Opportunistic Networks related schemes. Any proposed OppNets related scheme, to be relevant to OppNets' research, should include OppNets' characteristics and demands.

show abstract

Section: E Oppnets Routingmentioning

confidence: 99%

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

2021

View full text Add to dashboard Cite

show abstract

“…Based on both encountering frequency and social closeness of two linked nodes in social map, it decides the weight of each link to reflect the packet delivery probability between these two nodes. Xu et al [18] investigates the problem of opportunistic routing based on the dynamic social relationship and proposes a new prediction method to predict the movement pattern and the encounter time. PeopleRank [19] protocol is originated from classical PageRank algorithm and it calculates the node centrality in distributed way to reduce the complexity of traditional social network analysis.…”

Section: • Replica Based Routingmentioning

confidence: 99%

Design of Routing Protocol for Opportunistic Network Based on Adaptive Motion

et al. 2020

View full text Add to dashboard Cite

Opportunistic network takes advantage of the contact opportunities introduced by node movement for data transmission. Data is usually piggybacked during the movement of the carrier, which guarantees its independence, however, the system performance is impaired. Inspired from the motion nature of nodes, this paper proposes an adaptive motion based opportunistic routing protocol to address the problem. It develops a data forwarding priority model from the perspective of data communication and determines data transmission rules in combination with node activity range partition scheme. A differential replica transfer strategy is thus proposed to achieve a tradeoff between transmission efficiency and system overhead. A free motion degree model is constructed based on which a utility function is deduced to choose appropriate nodes for data relaying. The simulation results show that the proposed algorithm achieves higher packet delivery ratio and less transmission latency while satisfying application requirements and restraining network overhead. INDEX TERMS Data forwarding priority, free motion degree, opportunistic routing, utility function, activity range partition.

show abstract

P-TECS: An Energy Balance Algorithm for Opportunistic Networks Integrating Multiple Node Attributes

Yang

Chen

et al. 2023

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Opportunistic Networks Routing Algorithm Based on the Uncertain Social Relationship

Cited by 5 publications

References 10 publications

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

Design of Routing Protocol for Opportunistic Network Based on Adaptive Motion

P-TECS: An Energy Balance Algorithm for Opportunistic Networks Integrating Multiple Node Attributes

Contact Info

Product

Resources

About