Leader Election in Opportunistic Networks

Dragan, Radu; Ciobanu, Radu-Ioan; Dobre, Ciprian

doi:10.1109/ispdc.2017.10

Cited by 7 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The core idea in this algorithm is to count the availability ratio, dependency ratio, and weight coefficient as weights in the topology of human activities to find the optimal routing path. Dragan et al 13 suggested that communities can be divided according to the intimacy between nodes and the amount of time they have been together, each of which can select a leader, and the leader will be responsible for making decisions with consensus. Tao et al 14 proposed that the use of the destination probability is expected to raise the routing efficiency in heavy traffic networks in the paper.…”

Section: Relevant Workmentioning

confidence: 99%

An effective data transmission scheme based on IoT system in opportunistic social networks

Huang

2021

Int J Communication

View full text Add to dashboard Cite

Summary With the advent of the era of Big Data, users are increasingly demanding network bandwidth and data storage in the Internet of Things (IoT) system. While current research on the opportunistic social network does not take the redundant influence of high‐speed data transmission into account, which leads to problems such as lower delivery ratio, we present an effective data transmission scheme based on IoT system (EDTS). To divide the community, which consists of devices with relatively close connections, we measure the social relationship of nodes by quantifying the remaining cache, social relation, and interest similarity in opportunistic social networks. An efficient strategy is designed in this paper to update the community by analyzing the change of edge weights between two nodes in the community, deciding whether the community should be further divided, and whether the nodes should join the larger community. The proposed scheme also involves data transmission methods based on community, which involve inter‐community forwarding and intra‐community forwarding. Simulation results show that EDTS outperforms other comparative algorithms with regard to average delivery ratio, end‐to‐end delay, and routing overhead.

show abstract

Section: Relevant Workmentioning

confidence: 99%

An effective data transmission scheme based on IoT system in opportunistic social networks

Huang

2021

Int J Communication

View full text Add to dashboard Cite

show abstract

“…By reliability, availability, and weighting factors are used as the weights of human activities to obtain the optimal cooperative node, but the algorithm has a high routing overhead. Drǎgan et al [35] proposed that nodes can be divided into several communities according to their intimacy and the time together. is community detection method does not fully consider all of the nodes in the community.…”

Section: Related Workmentioning

confidence: 99%

Efficient Data Transmission for Community Detection Algorithm Based on Node Similarity in Opportunistic Social Networks

Xiaokaiti

Qian

2021

Complexity

View full text Add to dashboard Cite

With the rapid development of 5G era, the number of messages on the network has increased sharply. The traditional opportunistic networks algorithm has some shortcomings in processing data. Most traditional algorithms divide the nodes into communities and then perform data transmission according to the divided communities. However, these algorithms do not consider enough nodes’ characteristics in the communities’ division, and two positively related nodes may divide into different communities. Therefore, how to accurately divide the community is still a challenging issue. We propose an efficient data transmission strategy for community detection (EDCD) algorithm. When dividing communities, we use mobile edge computing to combine network topology attributes with social attributes. When forwarding the message, we select optimal relay node as transmission according to the coefficients of channels. In the simulation experiment, we analyze the efficiency of the algorithm in four different real datasets. The results show that the algorithm has good performance in terms of delivery ratio and routing overhead.

show abstract

“…This routing scheme can improve the transmission ratio, but there is no significant improvement in routing overhead and transmission delay. Dragan et al [44] proposed that nodes could be divided into several communities according to their closeness and time spent together, and leaders could be selected in each community. This community division approach can improve the performance of opportunistic network routing algorithms.…”

Section: B the Proposed Community-based Routing Algorithmsmentioning

confidence: 99%

Effective Data Transmission Strategy Based on Node Socialization in Opportunistic Social Networks

Yan

Chen

et al. 2019

IEEE Access

View full text Add to dashboard Cite

With the development of big data and high-speed communication networks, traditional endto-end transmission mechanisms in social networks are difficult to achieve large amounts of data communication between mobile devices. Therefore, the implementation of effective data transmission in social networks requires ''opportunity''. Opportunistic social networks suggest choosing the most appropriate next hop nodes for effective data transmission. Most existing routing algorithms attempt to use the interest points of nodes and the social relationships between them to choose optimal relay nodes among neighbors. However, most community-based algorithms take node attributes and social relations into account but fail to consider the energy consumption of inefficient nodes which accounts for a large part of routing cost. To improve the transmission strategy, this paper proposes an effective transmission strategy based on node socialization (ETNS), which divides nodes in the network into several different communities. The proposed scheme also involves a community reduction method that removes some inefficient nodes according to the attributes of optimal relay nodes. The simulation results show that the packet delivery ratio of ETNS is 13% higher than the epidemic algorithm, and ETNS also has lower transmission delay and routing overhead.

show abstract

Leader Election in Opportunistic Networks

Cited by 7 publications

References 26 publications

An effective data transmission scheme based on IoT system in opportunistic social networks

An effective data transmission scheme based on IoT system in opportunistic social networks

Efficient Data Transmission for Community Detection Algorithm Based on Node Similarity in Opportunistic Social Networks

Effective Data Transmission Strategy Based on Node Socialization in Opportunistic Social Networks

Contact Info

Product

Resources

About