Message Delivery Ratio Research Articles

A game-theoretic incentive scheme for social-aware routing in selfish mobile social networks

Cooperative data forwarding can improve the performance of data routing in Mobile Social Networks (MSNs). However, previous studies mainly assumed that mobile nodes show selfish behaviors in data relaying merely due to their limited device resources. Nevertheless, the observation of everyday experience infers that they mitigate their selfishness based on their social relationships and content knowledge to achieve their social objective, i.e., they are socially selfish (SS). Therefore, how to promote SS nodes to participate in data forwarding becomes peculiarly challenging in MSNs. In this paper, we propose Game-theoretic Incentive Scheme for Social-aware rOuting, namely GISSO, to stimulate SS nodes in message relaying and guarantee that the routing performance gets maximized when SS nodes follow the scheme. First, we identify the social utility of each message to an intermediate node based on the strength of her social ties and message properties. Then, we apply an alternating-offers bargaining game in which SS nodes trade their messages with the aim of maximizing their social utility. We not only use subgame perfect Nash equilibrium as the agreement of two players to prove the efficiency of our game but also extensively evaluate the performance of GISSO using simulations over two real datasets. The comparison of GISSO with some benchmark social-aware protocols illustrates that GISSO overcomes SS nodes and outperforms the other algorithms regarding message delivery ratio and delay while generates low communication cost.

GALSR: Geographical Based Adaptive Lifetime Secure Routing Protocol For Wireless Sensor Network

Wireless sensor networks (WSNs) are potentially increased in research field due to their wide range of application. The topology of advanced WSNs form Multi-Hop WSNs. The Main issues in this topology is location based security and lifetime preserving in energy resources. In this paper, we projected a Geographical based Adaptive Lifetime Security Routing (GALSR) Protocol and GALSR Algorithm to improve the lifetime and security of WSNs. This algorithm enhanced with Greedy for Shortest path finder and Direct Random Propagation for Random Walking. We then determine that the energy consumption is rigorously disproportional to the uniform energy deployment for the given network topology, which greatly reduces the lifetime of the sensor networks. To resolve this issue, we introduce non-uniform energy deployment to optimize the lifetime and message delivery ratio under same energy resources and security. This energy balancing is set by Energy balance control (EBC) and security parameter using Metric Energy Balancer (MEB).We validate our finding in both Quantitative and Qualitative measures. Our quantitative measures is shown out of NetSim Simulator similarly our implementation is an best prove for our qualitative measures, Our proposed model shows that we achieved with increased Lifetime, Adaptive Security and Monetary efficient protocol.

Data Dissemination in Mobile Social Networks with the Acknowledgment Feedback

Most existing dissemination schemes in Mobile Social Networks (MSNs) only consider the data dissemination. However, there are two types of messages: data and the control message (i.e., acknowledgment) in MSNs, and receiving acknowledgment is very important in many applications (e.g., the mobile trade and the incentive mechanism). In order to maximize the desired message delivery ratio, we have to identify the priority of each message in the network during the limited contact opportunity. Therefore, we propose a generic priority-based compare-split routing scheme, which proves to be the optimal buffer exchange strategy. During each contact opportunity, relays compare their forwarding abilities to different destinations based on two types of criteria: the contact probability and the social status. Ideally, each relay keeps the messages whose destinations meet the current relay frequently. Then, an adaptive priority-based exchange scheme, which considers the priority within each type of messages and the relative priority between two types of messages, is proposed to exchange the most benefit messages. The effectiveness of our scheme is verified through extensive simulations in synthetic and real traces.

Utility-Based Exploration for Performance Enhancement in Opportunistic Mobile Networks

Opportunistic mobile networks (OMNs), which are formed by mobile devices carried by human users, present an interesting communication paradigm in the absence of access to global network connectivity or any form of network infrastructure. In this work, we combine the natural mobility of the human users—which has been shown to resemble Levy Walk—in OMNs, together with intentional explorations . We consider the case where the human users in an OMN undergo explorations, i.e., occasionally visit a set of fixed point of interests (PoI), for example, shopping malls. The objective of this work is two-fold-1) Establishing that limited explorations of the users can help in enhancing the performance of OMNs, and 2) Formulating a method to decide whether or not a user should undergo exploration. In this regard, we propose two schemes based on prospect theory (PT) and expected utility theory (EUT). The results of extensive simulation-based performance evaluation indicate that limited exploration can promote the delivery ratio of messages by large levels—about $7$ - $33$ percent depending on the number of randomly placed PoI, and about $36$ percent depending upon the terrain size. Moreover, the time spent in exploration, on an average, is negligibly small—a typical value is about $0.55$ percent of the simulation duration, which indicates its feasibility in real life.

An Energy Aware Cellular Learning Automata Based Routing Algorithm for Opportunistic Networks

Message transmission in opportunistic networks is accomplished via the encounters of mobile nodes while moving around. The distributing of nodes greatly impacts the performance of message delivery ratio due to their sparse encounter opportunities. Nodes with exhaust energy can’t participate in message transfer process. So it is very meaningful to make nodes energetic and balance the energy consumption between nodes. In this paper, a novel dynamic irregular cellular multiple learning automata (DICMLA) model and the corresponding routing algorithm are proposed to optimize the energy consumption of nodes. The proposed routing algorithm utilizes the characteristics of cellular learning automata to reduce the energy consumption of nodes and improve the delivery ratio of message transmission. The simulation results show that the proposed algorithm can obviously balance energy consumption of nodes and thus prolong the lifetime of the network.

Opportunistic Piggyback Marking for IP Traceback

IP traceback is a solution for attributing cyber attacks, and it is also useful for accounting user traffic and network diagnosis. Marking-based traceback (MBT) has been considered a promising traceback approach, and has received considerable attention. However, we find that the traceback message delivery problem in MBT, which is important to the successful completion of a traceback, has not been adequately studied in the literature. To address this issue, we present the design, analysis, and evaluation of opportunistic piggyback marking (OPM) for IP traceback in this paper. The OPM distinguishes itself from the existing works by decoupling the traceback message content encoding and delivery functions in MBT, and efficiently achieves expedited and robust traceback message delivery by exploiting piggyback marking opportunities. Based on the proposed OPM scheme, we then present the flexible marking-based traceback framework, which is a novel design paradigm for IP traceback and has several favorable features for practical deployment of IP traceback. Through the numerical analysis and the comprehensive simulation evaluations, we demonstrate that our design effectively reduces the traceback completion delay and router processing overhead, and increases the message delivery ratio compared with other baseline approaches.

Hierarchical routing algorithm for ad hoc networks using mobile VMN

One of the most significant challenges introduced by routing protocol in mobile networks is coping with the unpredictable motion and the unreliable behaviour of mobile nodes. In this paper, we present a hierarchical routing algorithm based on virtual mobile node VMN. A routing path can be found rapidly by exchanging path information between VMNs without accurate topology information. We discuss the routing process and the implementing details of the proposed routing algorithm. Finally, we evaluate the performance of our hierarchical routing algorithm through simulations, and the results show that the number of mobile WAVE generated by routing algorithm is well satisfied with the quality of service QoS requirements of all source and destination nodes. Furthermore, we compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing approaches, the results show that we can obtain magnitude better performance by HRA-VMN than hierarchical state routing HSR and non-hierarchical routing approach.

A Unified Routing Framework for Integrated Space/Air Information Networks

The aerospace-based communications can be managed more efficiently through the construction of an integrated space/air information network by the convergence of satellite (space) and unmanned aerial vehicle (air) networks. Such an integrated network would best fit the advent of delay- and disruption-tolerant networking, in which the data transmission can tolerate long delay and disruption under a store-carry-forward mechanism. Such a network, however, has some challenging research needs due to the network’s high mobility of nodes and time-varying topology that may result in high error bit rate and long delay. In this paper, we propose a unified routing framework for this integrated network, where a Hybrid time-space Graph supporting Hierarchical Routing (HGHR) algorithm is achieved. More specifically, the HGHR performs on a hybrid time-space graph, including two subgraphs: a deterministic graph for the space network and a semi-deterministic one for the air network. This latter graph is based on a discrete time homogeneous semi-Markov prediction model. The hybrid time-space graph is then transformed into a state-space graph, based on which, a message forwarding rule under the store-carry-forward mechanism is adopted. Simulation results show that the proposed HGHR algorithm has good performance in terms of message delivery ratio, end-to-end delay, and power consumption.

Performance Analysis of Message Dissemination in ICMN under the Last-Create-First-Relay Scheme

With encounter-based communication introduced in intermittently connected mobile networks (ICMNs), the message dissemination in mobile Internet subscriber/publisher services can be augmented through near-distance communication of mobile nodes. Specifically, mobile nodes with Internet connectivity can help those without to obtain messages once stored and currently carried by the former. We model such a system, particularly considering the time-critical property of messages, the limited communication bandwidth, and the existence of multiple sources. Based on the model, we propose analytical methods for obtaining the performance of message delivery ratio and average delay under the 1-hop or the 2-hop relaying mode specified in this paper, respectively. Through extensive simulations, we validate the proposed methods and discuss system performance under different parameter settings and relaying schemes.

A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.

Probabilistic routing algorithm based on contact duration and message redundancy in delay tolerant network

SummaryThe Delay Tolerant Network (DTN) is a novel Wireless Sensor Network architecture for an opportunistic network environment, in which environment end‐to‐end connection cannot be set up constantly between source and destination nodes pairs. In this paper, we have proposed a novel routing algorithm based on a hybrid of message delivery probability and message redundancy to reduce the communication overhead while keeping the high message delivery ratio. In this algorithm, the message delivery probability is calculated by the combined impact of meeting frequency and length of contact duration. Further, the maximum number of copies of the message is designated in the source node, and the forwarding task of message copies is assigned to relay nodes based on the pattern of a binary tree, so that multi‐path parallel transmission can be implemented on message forwarding. Simulated results showed that the proposed routing algorithm can achieve a higher efficiency of message delivery than the related existing routing algorithms and it can also reduce the communication overhead significantly in general DTNs. Copyright © 2015 John Wiley & Sons, Ltd.

A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters

ABSTRACTSudden disasters such as earthquake, flood and hurricane necessitate the employment of communication networks to carry out emergency response activities. Routing has a significant impact on the functionality, performance and flexibility of communication networks. In this article, the routing problem is studied considering the delivery ratio of messages, the overhead ratio of messages and the average delay of messages in mobile opportunistic networks (MONs) for enterprise-level emergency response communications in sudden disaster scenarios. Unlike the traditional routing methods for MONS, this article presents a new two-stage spreading and forwarding dynamic routing algorithm based on the proposed social activity degree and physical contact factor for mobile customers. A new modelling method for describing a dynamic evolving process of the topology structure of a MON is first proposed. Then a multi-copy spreading strategy based on the social activity degree of nodes and a single-copy forwarding strategy based on the physical contact factor between nodes are designed. Compared with the most relevant routing algorithms such as Epidemic, Prophet, Labelled-sim, Dlife-comm and Distribute-sim, the proposed routing algorithm can significantly increase the delivery ratio of messages, and decrease the overhead ratio and average delay of messages.

DirMove: direction of movement based routing in DTN architecture for post-disaster scenario

Network architecture based on opportunistic Delay Tolerant Network (DTN) is best applicable for post-disaster scenarios, where the controlling point of relief work is any fixed point like a local school building or a hospital, whose location is known to everyone. In this work, 4-tier network architecture for post-disaster relief and situation analysis is proposed. The disaster struck area has been divided into clusters known as Shelter Points (SP). The architecture consists of mobile Relief Workers (RW) at tier 1, Throw boxes (TB) at tier 2 placed at fixed locations within SPs. Data Mules (DM) like vehicles, boats, etc. operate at tier 3 that provide inter-SP connectivity. Master Control Station (MCS) is placed at tier 4. The RWs are provided with smart-phones that act as mobile nodes. The mobile nodes collect information from the disaster incident area and send that information to the TB of its SP, using DTN as the communication technology. The messages are then forwarded to the MCS via the DMs. Based on this architecture, a novel DTN routing protocol is proposed. The routing strategy works by tracking recent direction of movement of mobile nodes by measuring their consecutive distances from the destination at two different instants. If any node moves away from the destination, then it is very unlikely to carry its messages towards the destination. For a node, the fittest node among all its neighbours is selected as the next hop. The fittest node is selected using parameters like past history of successful delivery and delivery latency, current direction of movement and node's recent proximity to the destination. Issues related to routing such as fitness of a node for message delivery, buffer management, packet drop and node energy have been considered. The routing protocol has been implemented in the Opportunistic Networks Environment (ONE) simulator with customized mobility models. It is compared with existing standard DTN routing protocols for efficiency. It is found to reduce message delivery latency and improve message delivery ratio by incurring a small overhead .

An adaptive vehicular epidemic routing method based on attractor selection model

Vehicular ad hoc networks (VANETs) is an emerging technology that can support many vehicular safety and comfort applications through intervehicle communications. However, VANETs could face a great challenge arising from rapidly varying network topology. It is an essential issue to design an efficient and reliable solution for message dissemination in dynamic VANETs. In this paper, we propose an epidemic routing method with capability of self-adapting to the highly dynamic nature of VANETs. To ensure a good trade-off between reachability and efficiency of message dissemination, an adaptive probabilistic infection and an adaptive limited-time forwarding mechanisms are also proposed for the epidemic broadcasting. Moreover, inspired by the self-adaptability and robustness of the cellular gene regulatory networks, we use the attractor selection mechanism to enhance routing messages in dynamic VANETs. Through comparative simulations under different traffic scenarios, we validate our proposed method and prove that it can guarantee message reachability and achieve high delivery efficiency in terms of message delivery ratio, average routing latency and cost.

CONCOR: context-aware community-oriented routing for intermittently connected network

Delay-Tolerant Networks (DTNs) are characterized by time-varying and partially connected network topology. In such networks, mobility of node may be by virtue of its carrier. Social beings such as humans may act as a carrier of mobile nodes, and therefore mobility pattern of node follows a social-based movement model. Due to intermittent connectivity, end-to-end path between source and destination is rare and therefore message delivery is a challenge in such networks. In this paper, we present a new routing approach, context-aware community-oriented routing (CONCOR) that exploits the community and the context awareness of nodes, for efficient message delivery. Nodes with a common point of interest form a dynamic community. We have identified a set of node’s attribute (context) and formulated a utility function to determine its capability to deliver a message. CONCOR is a multihop routing approach exploiting the nodes as message relays (store-carry-forward). Through simulation, we validated the effectiveness of node’s attributes in estimation of message delivery probability. The simulations were done for our approach using the social movement-based data set on Opportunistic Network Environment (ONE) simulator. We compared our approach with dynamic social grouping (DSG)-based routing and context-aware routing(CAR) on three metrics viz. message delivery ratio, message traffic ratio and average message delay. We found that the results of our approach outperforms the DSG and CAR on all the three metrics.

Protocols for mitigating blackhole attacks in delay tolerant networks

High node mobility and infrequent connectivity in delay tolerant networks (DTNs) makes it challenging to implement traditional security algorithms for detecting malicious nodes. In DTN, most of the routing algorithms are based on the announcement of routing metrics like probability of delivery, contact strength or social group strength by the nodes in contact. Blackhole in DTN exploits these characteristics of routing protocols and either announces a high value of these metrics or tries to attain a high value for them by following fast, repeated movement patterns. Dynamic social grouping (DSG) based routing algorithm shows that social behavior of nodes helps to make better forwarding decisions and to achieve highest message delivery ratio amongst other existing routing algorithms. We examine the impact of blackholes, intermittent blackholes and tailgating attack on DSG. We propose a suit of three solutions. Our first solution detects blackholes and tailgating malicious nodes in the network, however, is not suitable for intermittent blackholes. Second solution handles intermittent blackholes and performs well when the nodes are well connected. The third and final solution handles intermittent blackholes in sparsely connected as well as in well-connected networks. In all proposed solutions, blackholes are not able to degrade the performance of the protocols by changing their geographical locations. We demonstrate through simulation that our protocols improve upon the message delivery ratio over the existing solutions. An appropriate protocol from the suit may be used depending upon an application.

Cost-Aware SEcure Routing (CASER) Protocol Design for Wireless Sensor Networks

Lifetime optimization and security are two conflicting design issues for multi-hop wireless sensor networks (WSNs) with non-replenishable energy resources. In this paper, we first propose a novel secure and efficient Cost-Aware SEcure Routing (CASER) protocol to address these two conflicting issues through two adjustable parameters: energy balance control (EBC) and probabilistic-based random walking. We then discover that the energy consumption is severely disproportional to the uniform energy deployment for the given network topology, which greatly reduces the lifetime of the sensor networks. To solve this problem, we propose an efficient non-uniform energy deployment strategy to optimize the lifetime and message delivery ratio under the same energy resource and security requirement. We also provide a quantitative security analysis on the proposed routing protocol. Our theoretical analysis and OPNET simulation results demonstrate that the proposed CASER protocol can provide an excellent tradeoff between routing efficiency and energy balance, and can significantly extend the lifetime of the sensor networks in all scenarios. For the non-uniform energy deployment, our analysis shows that we can increase the lifetime and the total number of messages that can be delivered by more than four times under the same assumption. We also demonstrate that the proposed CASER protocol can achieve a high message delivery ratio while preventing routing traceback attacks.

Research on Routing Protocols and Simulation Analysis for Opportunistic Networks

Opportunistic networks are a kind of Ad Hoc networks that make use of meeting opportunities from mobile nodes to realize the network communication which doesn't need a full path between the source nodes and destination nodes. It’s tolerant in latency and network division. It’s a great challenge to design routing protocols in opportunistic networks in that the movements of nodes are uncertain leading to intermittent connection which make it hard to transmit message to its destination. However, the problems have also attracted more and more attention from researchers. Firstly, in this paper, we introduced the basic concept of opportunistic networks. Secondly we classified and interpreted routing protocols according to the infrastructure, scenario, forwarding mechanism etc. Thirdly, we carried out the computer simulation and analysis for opportunistic network routing protocols in aspect of message delivery ratio, network latency, routing overhead and the number of lost packets. Then we summarized the advantages and disadvantages of routing protocol and discussed its applicability. Finally we looked ahead the hotspot of recent routing protocols under opportunistic networks.

이동 방향 정보를 이용한 DTN 라우팅: TAILWIND

In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

Distributed Information-Based Cooperative Strategy Adaptationin Opportunistic Mobile Networks

Cooperation among nodes is a fundamental necessity in opportunistic mobile networks (OMNs), where the messages are transferred using the store-carry-and-forward mechanism, due to sporadic inter-node wireless connectivity. While multiple works have addressed this issue, they are often constrained in their assumptions on solutions (e.g., requirement of central authority, and tracing the recipient nodes for providing reward or punishment). In this work, we address this research lacuna by taking an evolutionary theory-based approach. In evolutionary theory, the players analyze alternative strategies and select the best one to survive in a population. Inspired by this, in this work, we propose a Distributed Information-Based Cooperation Ushering Scheme (DISCUSS) to promote cooperation in message forwarding between nodes. In this scheme, the nodes maintain and exchange information with one another during contacts about the messages created and delivered in the network. Based on this, the nodes evaluate their own performance and compare that with the approximated network performance to adapt the most successful forwarding strategy. Simulation results show that the message delivery ratio in the network improves upto 31 percent, when the nodes dynamically switch their strategies, as compared to the case when they do not. Furthermore, the DISCUSS scheme fared closely to its variant with the nodes having complete knowledge about the network-wide performance.