Integrated Routing Protocol for Opportunistic Networks (original) (raw)

Performance Comparison of Social Context Aware Opportunistic Network Routing Protocols

— Opportunistic network (OppN's) is a type of multi-hop Ad Hoc network and comes under the category of delay tolerant networks. These networks experience frequent and long lasting partitions due to the absence of topology of nodes. The opportunistic network has attracted increasing attention recently. Opportunistic network uses human mobility concept and related wireless contacts between mobile devices to forward data. Designing algorithms and protocols for such networks is challenging as the research is either based on the knowledge of social relations, mobility or communication. Numerous routing protocols have tackled the challenging problem of routing in opportunistic networks. Keeping this in mind, the aim of this paper is to analyze the proposed ERON routing algorithm that support forwarding of data in topology-less environment and to compare with studied algorithms in terms of their performances based on various metrics. The obtained results illustrates that the proposed method (ERON) gives better performance than the previous studied algorithms.

Analysis of routing and forwarding protocols in opportunistic networks

The role of opportunistic networks can be crucial in data transmission. Here message forwarding depends solely on node cooperation. Opportunistic networks use store-and-carry forward mechanism. The frequent disconnection of nodes is very common in these networks because of dynamic nature of mobile nodes. Therefore use of suitable routing protocol is very important in message delivery. In this paper, three social context aware routing protocols that support message forwarding in opportunistic networks i.e. HiBop, Propicman and CAOR are analysed in terms of performance metrics viz. delivery probability, overhead ratio, number of hops and delay. The results show that CAOR outperform the other two protocols in all these aspects. The delivery probability of CAOR is higher whereas the overhead ratio, number of hops and delay are less than those for HiBop and Propicman routing protocols.

Social context-aware macroscopic routing scheme for opportunistic network

Opportunistic networks (OppNets) have attracted widespread attention as wireless technologies have advanced. OppNets are widely used in delay-tolerant applications because they route messages using a store-carry-forward mechanism. Recently, socially aware routing has been increasingly modeled for message dissemination in OppNets, where the message is routed selectively through cooperative nodes based on user interests; however, routing becomes extremely difficult as node density and data size increase. However, the current method fails to reduce data redundancy, message overhead, delay, and improve performance efficiency. To address the issues, this article proposes social context-aware microscopic routing (SCAMR) for OppNets. SCAMR uses cluster-based communication, novel social-context association mapping, and an improved lost packet retrieval mechanism with minimal messaging overhead. In this work, the experiment was performed by considering three scenarios: varying node size, varying buffer size, and varying time-to-live size. The experimental results show that the SCAMR scheme improves delivery ratio by 71.25%, 67.87%, 69.18%, reduces delay by 33.93%, 26.68%, 35.36%, reduces the number of hop nodes (i.e., messaging overhead) by 77.84%, 71.53%, 76.04% over existing approaches namely, SCARF (SoCial-Aware Reliable Forwarding Technique for Vehicular Communications), SRS (secure routing strategy), and EDT (effective data transmission) considering different scenarios, respectively.

Towards designing a routing protocol for opportunistic networks

2010

Intermittently connected opportunistic networks experience frequent disconnections and shorter contact durations. Therefore routing of messages towards their destinations needs to be handled from various points of view. Predictability and connectedness are two features which can be determined by participating mobile nodes of an opportunistic content distribution network using their past contacts. Epidemic or probabilistic routing protocols such as PRoPHET do not fully utilize these features to route messages towards their destinations. In this paper we describe the design, implementation, experiment set up and the performance validation of a new, adaptive routing protocol which utilizes the predictability and connectedness features to route messages efficiently. Simulation based comparative studies show that the proposed routing protocol outperforms existing Epidemic and Probabilistic routing protocols in delivering messages.

IICAR-Inheritance Inspired Context Aware Routing Protocol for opportunistic networks

Journal of Ambient Intelligence and Humanized Computing, 2018

Opportunistic network (OppNet) is a network of wirelessly connected nodes with an unstable network topology where the nodes transmit messages to each other opportunistically if they fall in the same communication range. They face various challenges with respect to stable connections, high message delivery ratio, fast delivery of messages and many more aspects. The prime reason for such challenges is that the nodes are oblivious of the network topology and there never exists an end to end path between the source and the destination. Despite these issues, opportunistic networks promise to provide a highly connected world in the coming future and therefore, intense research is going on to develop efficient routing protocols for the same. In this paper, a generalized context aware routing method named as Inheritance Inspired Context Aware Routing Protocol (IICAR) based on Mendel's Laws of Inheritance is proposed. The protocol utilizes the context information stored by the nodes and takes intelligent decisions by predicting the path a message may take. The simulation results obtained for IICAR protocol reflects that the proposed protocol provides high message delivery ratio along with less consumption of network resources when compared to the Epidemic, Prophet, Hibop and HBPR routing protocols.

EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network

Mobile Information Systems, 2018

In opportunistic networks, the nature of intermittent and disruptive connections degrades the efficiency of routing. Epidemic routing protocol is used as a benchmark for most of routing protocols in opportunistic mobile social networks (OMSNs) due to its high message delivery and latency. However, Epidemic incurs high cost in terms of overhead and hop count. In this paper, we propose a hybrid routing protocol called EpSoc which utilizes the Epidemic routing forwarding strategy and exploits an important social feature, that is, degree centrality. Two techniques are used in EpSoc. Messages’ TTL is adjusted based on the degree centrality of nodes, and the message blocking mechanism is used to control replication. Simulation results show that EpSoc increases the delivery ratio and decreases the overhead ratio, the average latency, and the hop counts as compared to Epidemic and Bubble Rap.

Centrality Based Routing Protocol with Message Relay Control in Opportunistic Networks

2018

Opportunistic Networks are a subclass of Delay Tolerant Networks (DTN), which aim at wireless data delivery in severely partitioned networks. There exist several protocols that route messages on a best effort basis. In most cases, the nodes copy and forward messages to nodes that are more likely to meet the destination. But, the major challenge is to design a routing protocol that offers the best tradeoff between cost (number of message replicas) and rate of successful message delivery. In this research paper, the tradeoff is being efficiently handled by using the concept of Google Pagerank like centrality to rank nodes in a network using social information. Unlike other nodes in the network, central nodes act as influential nodes to facilitate the message forwarding. Furthermore, to the centrality routing, a mechanism of message relay control is designed and linked to keep the network overhead ratio low. The proposed Centrality Based Routing Protocol (CBRP) with Message Relay Contr...

A Social-Aware Routing Protocol For Opportunistic Networks

Expert Systems with Applications, 2016

This work proposes the Cultural Greedy Ant (CGrAnt) protocol to solve the problem of data delivery in opportunistic and intermittently connected networks referred to as Delay Tolerant Networks (DTNs). CGrAnt is a hybrid Swarm Intelligence-based forwarding protocol designed to address the dynamic and complex environment of DTNs. CGrAnt is based on: (1) Cultural Algorithms (CA) and Ant Colony Optimization (ACO) and (2) operational metrics that characterize the opportunistic social connectivity between wireless users. The most promising message forwarders are selected via a greedy transition rule based on local and global information captured from the DTN environment. Using simulations, we first analyze the influence of the ACO operators and CA knowledge on the CGrAnt performance. We then compare the performance of CGrAnt with the PROPHET and Epidemic protocols under varying networking parameters. The results show that CGrAnt achieves the highest delivery ratio (gains of 99.12% compared with PROPHET and 40.21% compared with Epidemic) and the lowest message replication (63.60% lower than PROPHET and 60.84% lower than Epidemic).