Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Khalid, Khuram; Woungang, Isaac; Dhurandher, Sanjay Kumar; Singh, Jagdeep; Rodrigues, Joel J. P. C.

doi:10.3390/info11110504

Cited by 15 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the actual scenario of a completely opportunistic routing algorithm, the message transmission between nodes is forwarded randomly, and no performance optimization is required [16]. Typical algorithms include Epidemic, DirectDelivery, and FirstContact routing algorithms.…”

Section: Related Workmentioning

confidence: 99%

An effective data communication community establishment scheme in opportunistic networks

Hao

Gou

2023

IET Communications

View full text Add to dashboard Cite

The network transmission speed has been greatly improved, thanks to the power of 5G technology. The millisecond‐level communication delay has made a qualitative leap in communication quality. However, the sharp increase in the number of nodes connected to the internet has resulted in an explosion of traffic. Ensuring stable network transmission in the face of large data volumes has become an urgent problem to be solved. Existing research mainly optimizes for low data volumes of nodes, and cannot dynamically adapt to node transmission load to cope with explosive growth. This is because the node's cache is always at a high level, which causes community communication to be blocked. To address this issue, the authors have designed an effective data communication community establishment scheme. By adding a data information flow (DIF) attribute to each user and using the dynamic feedback adjustment (DFA) mechanism, the authors can combine the entire communication community and control the user's data information flow concentration at a relatively low level. This degree of optimization ensures that the user node maintains a relatively stable state for fast communication. The authors design an effective data communication community establishment scheme. By adding a data information flow (DIF) attribute to each user, using the dynamic feedback adjustment mechanism and combining the entire communication community, the user's data information flow concentration is controlled at a relatively low level.

show abstract

Section: Related Workmentioning

confidence: 99%

An effective data communication community establishment scheme in opportunistic networks

Hao

Gou

2023

IET Communications

View full text Add to dashboard Cite

show abstract

“…Yu et al [26] proposed a node social features relationship evaluation algorithm (NS-FRE), which builds a fuzzy similarity matrix based on the characteristics of the node characteristics and social attributes, and selects the forwarding node based on the weight. It can effectively improve the transmission success rate and reduce the transmission delay.…”

Section: Related Workmentioning

confidence: 99%

A Data Transmission Algorithm Based on Triangle Link Structure Prediction in Opportunistic Social Networks

et al. 2021

View full text Add to dashboard Cite

With the popularization of 5G communications, the scale of social networks has grown rapidly, and the types of messages have become increasingly complex. The rapid increases in the number of access nodes and the amount of data have put a greater burden on the transmission of information in the networks. However, when transferring data from a large number of users, the performance of traditional opportunistic network routing algorithms is insufficient, which often leads to problems such as high energy consumption, network congestion, and data packet loss. The way in which to improve this transmission environment has become a difficult task. Therefore, in order to ensure the effective transmission of data and reduce network congestion, this paper proposed a link prediction model based on triangular relationships in opportunistic social networks (LPMBT). In the topological structure of the social network, the algorithm scores links based on the frequency of use and selects the optimal relay node based on the score. It can also efficiently track the target node and reconstruct the sub-community. The simulation experimental results showed that the algorithm had excellent performance, effectively reduced overhead, reduced the end-to-end delay, and greatly improved the data transfer rate in the opportunistic network.

show abstract

“…The digital network modeling is certainly a challenging task because phenomena such as error channel (physical layer) and congestion, collision, and error in the data packetization (Data Link and transport layer) can be complex to model in terms of analytical equations, being commonly used support algorithms for the equations [ 18 , 19 , 20 , 21 , 22 ]. However, as previously mentioned, the simulation and emulation of networks in the laboratory can be an extensive and complex task.…”

Section: Introductionmentioning

confidence: 99%

A Novel Theoretical Probabilistic Model for Opportunistic Routing with Applications in Energy Consumption for WSNs

Galarza

Palma

Morais

et al. 2021

Sensors

View full text Add to dashboard Cite

This paper proposes a new theoretical stochastic model based on an abstraction of the opportunistic model for opportunistic networks. The model is capable of systematically computing the network parameters, such as the number of possible routes, the probability of successful transmission, the expected number of broadcast transmissions, and the expected number of receptions. The usual theoretical stochastic model explored in the methodologies available in the literature is based on Markov chains, and the main novelty of this paper is the employment of a percolation stochastic model, whose main benefit is to obtain the network parameters directly. Additionally, the proposed approach is capable to deal with values of probability specified by bounded intervals or by a density function. The model is validated via Monte Carlo simulations, and a computational toolbox (R-packet) is provided to make the reproduction of the results presented in the paper easier. The technique is illustrated through a numerical example where the proposed model is applied to compute the energy consumption when transmitting a packet via an opportunistic network.

show abstract

Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Cited by 15 publications

References 14 publications

An effective data communication community establishment scheme in opportunistic networks

An effective data communication community establishment scheme in opportunistic networks

A Data Transmission Algorithm Based on Triangle Link Structure Prediction in Opportunistic Social Networks

A Novel Theoretical Probabilistic Model for Opportunistic Routing with Applications in Energy Consumption for WSNs

Contact Info

Product

Resources

About