Energy‐aware congestion control scheme in opportunistic networks

IEEJ Transactions Elec Engng

Lin

et al. 2018

Self Cite

The purposes of research of routing algorithms in the mobile opportunistic networks are to improve the message delivery ratio, control overhead, and reduce the end-to-end delay. Now the performance of routing algorithms is very low because the opportunistic network structure is sparse and the network topology is variable. In this article, we use the Markov random process to propose a new segmented routing algorithm with a higher efficiency in opportunistic networks. In the stage of multicopy, we propose a forwarding strategy with the Markov decision process (MPD) to forward messages to multiple relay nodes quickly. In the stage of singe copy, we establish a precise delivery model to forward messages to the destination node with less relay nodes by combining the MPD with historical encountering information of nodes. The two-stage segmented routing algorithm not only balances the relationship between the delivery ratio and the network overhead, but also saves network resources. Compared with other routing algorithms, our proposed segmented routing algorithm is superior to the existing routing algorithms in the message delivery ratio, message delay, and network overhead.

Section: Related Workmentioning

confidence: 99%

A novel segmented routing algorithm based on the markov decision process in mobile opportunistic networks

Zhang

IEEJ Transactions Elec Engng

Lin

et al. 2018

Self Cite

“…Thus, the delivery ratio of the opportunistic network is reduced, and also the performance of the routing algorithm is deeply affected. Zhang et al proposed an energy‐aware congestion control (EACC) scheme for opportunistic networks to enhance energy utilization through reducing packet replacements under congestion conditions. Nodes dynamically update their residual energy level and query the residual energy level of their neighbors in current local environment and adjust their threshold ratio using the learning automata principle while moving around.…”

Section: Related Workmentioning

confidence: 99%

“…As for the EACC approach, it may be strange that its delivery ratio is first ascending and then descending with the increase of nodes' buffer size. The reason for its descending trend is that the node using the EACC approach starts receiving a new packet without congestion control if it has sufficient space for the packet . Once the buffer is full, the node will take the congestion control measure in which nodes will only receive packets whose remaining TTL proportion of initial TTL is larger than the threshold ratio when congestion occurs.…”

Section: Simulation Evaluationmentioning

confidence: 99%

A controllable multi‐replica routing approach for opportunistic networks

Zhao

IEEJ Transactions Elec Engng

Lin

et al. 2017

Self Cite

Opportunistic networks take full advantage of opportunistic encounters among nodes to transfer packets. According to the characteristics of the limited energy of nodes and the frequent link variation in opportunistic networks, we introduce a novel routing metric that comprehensively takes into consideration the energy consumption of nodes, the probability of relay nodes meeting their destination, the time-to-live of the packet, and the approximate number of packet copies. Based on this metric, we propose a controllable multi-replica routing approach in which a single-branch diffusion strategy is applied to achieve the goal of dynamically controlling the number of replicas of packets. Our simulation results show that the proposed approach can avoid excessive load on individual nodes, guarantee the energy fairness among nodes, prolong the network lifetime, and effectively improve the delivery ratio of packets.Correspondingly, our design focuses on two challenges: (i) how to maintain the energy fairness among nodes in an opportunistic network to prolong the network lifetime while achieving a high delivery ratio, and (ii) how to dynamically control the number of copies of packets in an opportunistic network without affecting the packet delivery ratio. Our main contributions are summarized as follows:

“…Routing is one of the hot issues in MOSNs, and many routing algorithms have been proposed. [5][6][7][8][13][14][15] Technically, according to the number of single-message copies, the routing algorithms for MOSNs can be classified as single-copy-based and multiple-copy-based.…”

Section: Related Workmentioning

confidence: 99%

A social‐aware probabilistic routing approach for mobile opportunistic social networks

Zhao

Trans Emerging Tel Tech

Zhang

et al. 2017

Self Cite

In mobile opportunistic social networks (MOSNs), mobile users move around and conduct message transmission by using their portable devices without the support of communication infrastructures, in which routing is a challenge due to high connection intermittency and node mobility. The current routing schemes for MOSNs only focus on the improvement of cost‐effective delivery by using the characteristics of users' interests or mobility. In this paper, we propose a novel routing approach for MOSNs in which the probabilistic and social‐aware strategies are combined and the multiple‐copy policy is adopted. We first model an MOSN into some overlapping regions and then propose 2 region‐related centrality degrees related to users' social characteristics with the consideration of users' centrality, mobility, and interactions among users. According to the definition of centrality degrees, we design a social‐aware probabilistic routing approach in which a message replica control policy is applied to allow a user with higher encounter probability to the destination and the user could obtain more message replicas. The simulation results show that the proposed approach outperforms the previous routing algorithms in terms of delivery ratio and overhead ratio.