Energy-Efficient Routing in Multi-Community DTN with Social Selfishness Considerations

Opportunistic protocol based on social probability and resources efficiency for the intelligent and connected transportation system

“…The drawback of SEBAR is that it only considers the centrality of the node by the connection frequency between nodes instead of the global social information. Energy-Efficient Copy Limit-Optimized protocol [33] based on the Box's complex method for epidemic routing is proposed, which is designed to determine the optimal copy limit in multiple communities. Community-Based Energy-Aware Routing Protocol (CBEAR) [34] based on the MSN network is dynamically divided into several different communities, transferring and sharing news in the intra-community and inter-community, considering node energy consumption rate and the encounter probability between nodes and each community to make routing decisions, avoiding some nodes' energy consumptives too fast to realize load balance between nodes.…”

Cost-efficient dynamic quota-controlled routing in multi-community delay-tolerant networks

“…In CAS, the optimal quota on each hop is computed under the message TTL and a predefined expected delivery ratio with an enumeration method. Wu et al 20 proposed a performance model of multi-community epidemic routing with social selfishness with ordinary differential equations (ODEs) and an energy-efficient copy-limit-optimized algorithm, which is designed to determine the optimal copy limit in multiple communities for epidemic routing. However, all of them utilized the static quota-controlled routing schemes (e.g.…”

“…Such an assumption is a reasonable approximation in modeling and also adopted in previous work. 18–20 In view of the whole network, we model that the communities C i and C j communicate only via a pair of nodes, which are the most closely related nodes between the two communities and called the gateway nodes of the communities C i and C j . Then we can denote λ ij as the average contact rate between the communities C i and C j , which is equal to the average contact rate between the gateway nodes of the communities C i and C j .…”

“…Recently, a large number of routing protocols, which exploit the community structure of human networks and social relations among nodes to determine the way of message delivery, are presented. [12][13][14][15][16][17][18][19][20] SimBet 12 adopts the betweenness centrality and similarity metrics to determine the message forwarders. In Bubble Rap 13 , a node forwards the message to the encountered nodes with higher global or local degree centrality.…”

“…The goal of this protocol is to allocate the minimum number of message copies for a message while still achieving a high delivery ratio. Wu et al 20 developed a performance model of multi-community epidemic routing with social selfishness and proposed an energy-efficient copy-limit-optimized algorithm. However, to the best of our knowledge, none of them studied the cost efficiency of the dynamic quota-controlled routing in the multi-community DTNs.…”