Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks

Abstract

In the context of Opportunistic Networking (OppNet), designing routing and delivery protocols is currently an open and active line of research. In some OppNet scenarios, destination addresses are not always known by sending applications. Profile-cast models solve this problem by allowing message destinations to be users or groups of users defined by their profiles. These profiles provide very effective ways of characterizing nodes in terms of node's attributes such as their profession, interests or typical whereabouts, for example. However, there are strong limitations in OppNet Profile-casting. There is no current way of representing special profiles defined by relative delivery functions such as best, maximum or over-the-average: nodes belong to these relative profiles taking into account not only attributes from the very same node but also relative to others from the same profile. In this article, we introduce Relcast, a Profile-cast model that allows messages to be sent to profiles defined in terms of relative delivery functions. Additionally, we present Explore and Wait, a composite routing-delivery scheme that uses optimal stopping theory-based delivery strategies to route Relcast messages. We show, using simulations that this routing-delivery scheme performs better than traditional approaches that use state-of-the-art routing-delivery primitives.

An Efficient location‐aware routing approach in opportunistic networks

“…We utilize the well‐known opportunistic network environment simulator to evaluate the routing performance of our proposed LAOR by comparing it with four other relevant routing methods, namely Epidemic, Prophet, HBPR, and LPFR‐MC, in terms of delivery ratio, overhead ratio, average delay of messages, and number of messages dropped, which are described as follows: Delivery ratio: Delivery ratio is defined by T a / T g , where T a is the number of delivered messages and T g is the number of generated messages. Overhead ratio: Overhead ratio is defined by ( T f − T a )/ T a , where T f is the total number of forwarded messages and T a is the number of delivered messages. Average delay of messages: The average delay of messages is defined by T t / N m , where T t is the total time of all messages delivered to their destination nodes and N m is the total number of messages arrived at their destination. Number of messages dropped: Number of messages dropped is the total number of messages dropped during the transmission process. …”

“…We utilize the well-known opportunistic network environment simulator [34] to evaluate the routing performance of our proposed LAOR by comparing it with four other relevant routing methods, namely Epidemic, Prophet, HBPR, and LPFR-MC, in terms of delivery ratio, overhead ratio, average delay of messages, and number of messages dropped, which are described as follows: Calculate P (X n + 1 = l -L) and obtain M ; 3:…”

An Adaptive Routing-Forwarding Control Scheme Based on an Intelligent Fuzzy Decision-Making System for Opportunistic Social Networks

“…To improve the data dissemination environment, K. Liu et al [6] proposed a fuzzy routing-forwarding approach, which utilizes a type of comprehensive node similarity that is the combination of mobile and social similarities to make an accurate decision on relay node selection and message forwarding. Borrego C et al [22] recommended a composite routing-delivery scheme, namely explore and wait, for node profile-casting in OSNs. In the explore phase, a profile-based model that allows data packets to be transmitted to profiles that are defined by a delivery function; and message carriers wait until it encounters a node that satisfies the delivery function and then sends data packets to the node in the wait phase.…”

“…Then, several routing protocols have been proposed to reduce the high overhead through controlling the number of message copies. Moreover, there are many other routing protocols based on message replication [19], direct delivery [20], mobility prediction [21], phase division [22], and probability evaluation [23] that have been utilized in the OSNs. Meanwhile, profile-based routing protocols employ different social attributes of mobile users such as spatial and temporal mobility features, social bonds, social influence, or node similarity, to enhance transmission efficiency in the OSNs, which mainly focus on single or multiple attribute characteristics of message users such as hobbies and interests, selfish behavior, encounter history, or distance and location of node mobility [24][25][26].…”

Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks

“…Carlos Borrego et al [18] recommended a routing-delivery scheme (Explore and Wait) for profile-casting based on PRoPHET [19] algorithm. The algorithm consists of two phases: Explore phase and Wait phase.…”