A controllable multi‐replica routing approach for opportunistic networks

Zhao, Ruonan; Wang, Xiaoming; Lin, Yaguang; Yang, Yunhui; Hui, Tiantian; Zhang, Lichen

doi:10.1002/tee.22437

Cited by 6 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the past few years, many researchers focus on the study of MONs, especially on designing efficient routing algorithms for MONs, such as the optimization based routing algorithms, energy consumption equilibrium routing algorithms, and the social-aware routing algorithms [25,29,30,32,33].…”

Section: Related Workmentioning

confidence: 99%

A novel energy-efficient probabilistic routing method for mobile opportunistic networks

Zhao

Zhang

Wang

et al. 2018

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

In mobile opportunistic networks (MONs), a large number of intelligent devices carried by moving people can conduct message transmission without the support of communication infrastructures. Routing is one of the concerning and challenging research hotspots in MONs because of nodes' mobility, intermittent connectivity, limited nodes' energy, and the dynamic changing quality of the wireless channel. However, only one or several of the above factors are considered in most current routing methods. Moreover, owing to the high mobility of nodes, it is particularly important to decide the time when to make the forwarding decision and which nodes can be selected as the relay nodes. Additionally, due to the dynamic changing quality of the wireless channel, the predetermined relay nodes for the next hop may not receive the message. In this paper, we propose a novel energy-efficient probabilistic routing method for MONs, in which energy and mobility of nodes and the quality of wireless channel are all taken into account. Firstly, we explore the regularity of nodes' mobility and the encounter probability among nodes to decide the time when to forward messages to other nodes. Secondly, by maintaining the energy fairness among nodes, the network lifetime can be prolonged. Thirdly, by fully taking the dynamic changing quality of the wireless channel into consideration, the retransmission number of messages can be effectively reduced. Additionally, we adopt a forwarding authority transfer policy for each message, which can effectively control the number of replicas for each message. The extensive simulation results show that the proposed method outperforms the existing routing algorithms in terms of the delivery ratio and the overhead ratio.

show abstract

Section: Related Workmentioning

confidence: 99%

A novel energy-efficient probabilistic routing method for mobile opportunistic networks

Zhao

Zhang

Wang

et al. 2018

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, if the resources are limited, the epidemic routing performs poorly. To deal with this issue, plenty of replicas‐limited approaches that aim to control the replicas of messages are proposed. One of the classical replicas‐limited routing algorithms is the spray‐and‐wait, proposed by Spyropoulos et al, in which the maximum number of the replicas of a message is fixed and the transmission process of a message is divided into 2 phases.…”

Section: Related Workmentioning

confidence: 99%

“…On the contrary, in multiple-copy-based routing algorithms, each message in a network usually has more than one replica; thus, it could achieve a higher delivery ratio at the expense of consuming more network resources. The multiple-copy-based routing algorithms can be divided into flooding-based algorithms, 19 replicas-limited algorithms, 20,21 and probability-based algorithms. 22 As for flooding-based algorithms, one of the most representative routing algorithms is the epidemic algorithm 19 in which a message can be propagated by its carriers to each possible relay node.…”

Section: Related Workmentioning

confidence: 99%

“…On the contrary, in multiple‐copy–based routing algorithms, each message in a network usually has more than one replica; thus, it could achieve a higher delivery ratio at the expense of consuming more network resources. The multiple‐copy–based routing algorithms can be divided into flooding‐based algorithms, replicas‐limited algorithms, and probability‐based algorithms …”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Zhao

Wang

Zhang

et al. 2017

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard 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.

show abstract

“…In order to transfer data packets from source to destination routing plays an important role. Much of research has happened on routing techniques [17]- [20] for wireless sensor networks and existing CDNs. If these routing techniques are directly implemented in multi hop CDNs or cognitive enabled IoT devices these routing techniques will fail.…”

Section: Introductionmentioning

confidence: 99%

Quality and Availability of spectrum based routing for Cognitive radio enabled IoT networks

Kaushik

Yoganandam

Sahoo

2018

JCOMSS

View full text Add to dashboard Cite

Abstract-With the recent emergence and its wide spread applicability Internet of Things (IoT) is placing pressure on network resources and most importantly on availability of spectrum. Spectrum scarcity is the issue to be addressed in networking within IoT. Cognitive radio is the technology which addresses the problem of spectrum scarcity in an efficient way. Equipping the IoT devices with cognitive radio capability will lead to a new dimension called cognitive radio enabled IoT devices. To achieve ON-demand IoT solutions and interference free communications cognitive radio enabled IoT devices will become an effective platform for many applications. As there is high dynamicity in availability of spectrum it is challenging for designing an efficient routing protocol for secondary users in cognitive device networks. In this work we are going to estimate spectrum quality and spectrum availability based on two parameters called global information about spectrum usage and instant spectrum status information. Enhanced energy detector is used at each and every node for better probability of detection. For estimating spectrum quality and availability we are introducing novel routing metrics. To have restriction on the number of rerouting and to increase the performance of routing in our proposed routing metric only one retransmission is allowed. Then, two algorithms for routing are designed for evaluating the performance of routing and we find that the bit error rates of proposed algorithms (nodes are dynamic) have decreased a lot when compared to conventional methods (nodes are static) and throughput of proposed algorithm also improved a lot.

show abstract

A controllable multi‐replica routing approach for opportunistic networks

Cited by 6 publications

References 18 publications

A novel energy-efficient probabilistic routing method for mobile opportunistic networks

A novel energy-efficient probabilistic routing method for mobile opportunistic networks

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

Quality and Availability of spectrum based routing for Cognitive radio enabled IoT networks

Contact Info

Product

Resources

About