Evaluating (Geo) content sharing with the ONE simulator

In the vehicular delay-tolerant networks, (VDTN) association between the sources to the destination is not always achievable at any required period. Consequently, the carrier node saves the message in its intrinsic buffer until an opportunity occurs for forwarding. Fix nodes facilitate in message storage and message relaying. It also helps in improving the performance of VDTN. Considering the mobility of nodes, the bit error rate is high whereas the bit error rate in fixed nodes is comparatively low. In VDTN, bit error rate is not considered in most of the routing schemes. In this article, a composite routing approach is introduced to conquer aforementioned issues. Some features of vehicular ad hoc networks (VANET) are associated to PRoPHET routing protocol for VDTN. The propagation models of VANET are executed for mobile node communication and without it for VDTN. The effect of environmental hindrance is also considered, and this can be either positive or negative. This makes the composite routing approach two-dimensional and much competent. The simulation and performance analysis of the composite approach is done via opportunistic network environment (ONE) simulator. Results show that the composite routing approach outperforms the PRoPHET wrt. delivery ratio and average delivery delay.

In recent years, many packet forwarding protocols adopting the social concept have been proposed for vehicular social networks (VSN). However, these protocols do not consider that vehicle trajectory information and the social relationship between vehicles at different periods may be distinct significantly. In this paper, we propose the Socially-Aware Trajectory-based Routing (SATR) protocol, which analyzes vehicle trajectories and social relationships at different time intervals, designs the vehicle encounter graph and constructs the corresponding packet relay path graph to improve the performance of packet forwarding in VSN. We execute simulations for well-known trajectory-based and social-based routing protocols by the Opportunistic Network Environment (ONE) simulator under different parameter values. These results exhibit that SATR significantly improves low accuracies of social-based protocols to choose relay nodes and reduces high computation complexities of trajectory-based ones.

Intermittently Connected Mobile Networks (ICMNs) are sparse wireless networks where most of the time an end-to-end path does not exist from source to destination. These networks are characterized by opportunistic connectivity, long and variable delay, asymmetric data rate and high error rate. Hence, they can be appropriately modeled as Delay-Tolerant Networks (DTNs). In this paper, the performance of replication-based DTN routing protocols, namely Epidemic, PRoPHET, MaxProp, RAPID, Binary Spray-and-Wait, and Spray-and-Focus has been investigated in an ICMN scenario against varying message generation rates and number of mobile nodes, respectively. The performance is analyzed on the basis of three metrics: Delivery Probability, Average Latency, and Overhead Ratio. Opportunistic Network Environment (ONE) simulator is used as the simulation tool for evaluating these performance metrics. The outcome of this work shows that for the ICMN scenario and given simulation setting, the best DTN routing technique is Spray-and-Focus, whereas Epidemic routing exhibits the worst performance in terms of all the metrics considered here.

Usage of wireless gadgets is increasing day by day in both metropolitan and countryside localities. The network infrastructure does not reach all the localities; especially in rural areas, where the internet availability is inadequate to meet the network requirements. Devices in such rural locations will be out of the network for some period. This non-persistent connectivity problem can be solved by using the moving nodes as a carrier for data transmission. In this work, we classify the vehicular network into sparse, semi-sparse and dense network based on the number of static and moving nodes present in a location. In sparse and semi-sparse network, there won't be any continuous path between the source and destination nodes. In such networks, we can use Delay Tolerant Network (DTN) protocols for data transmission. In our work, we try to find the suitable DTN protocol for the sparse and semi-sparse network topology. The protocols considered in this work are Epidemic, Spray and Wait, and Maxprop and the parameters we analyzed are delivery ratio, average latency and overhead ratio. We simulated these protocols in a vehicular network with heterogeneous characteristics, for the dense, semi-sparse and sparse network topology. The routing protocols performance is analyzed by delivery ratio, average latency and overhead ratio using Opportunistic Network Environment (ONE) simulator for varying the message lifetime and node density.

Today’s network becomes more complex due to which performances of network decrease like message delivery ratio, overhead ratio, average latency, cost, etc. A new technique comes to forward the message on the basis of social infrastructure. In this paper, we analyze and compare the result of social-based opportunistic routing protocol with different mobility traces, and we compare the BubbleRap, DLife (daily life routine routing algorithm) and dLifeComm (daily life routine community-based routing algorithm) social routing protocol with different movement models and real traces with respect to delivery ratio, overhead ratio, and average latency. Comparison is based on the real human traces and synthetic mobility model. We use Opportunistic Network Environment (ONE) simulator for result analysis. As from the simulation result, delivery ratio of BubbleRap is better than DLife and dLifeComm when node follows the community-based movement.

Enhanced UAV-aided vehicular delay tolerant network (VDTN) routing for urban environment using a bio-inspired approach

Unmanned Arial Vehicle (UAV) Network is an autonomous wireless communication network, mainly used for natural disaster recovery operations to forward the captured images or video information to the ground vehicle. The UAV network can be applied in various applications essentially, search and rescue operations. This work concentrates on Delay Tolerant Network DTN based Decentralized Multi-layer UAV ad-hoc network assisting VANET for post-disaster scenarios. Because of unbalanced links in highly dynamic UAV networks, packet forwarding is a challenge. This work proposes a Binary Spray and wait routing protocol (BSnW) with controlled replication for DTN based Decentralized Multi-layer UAV networks. The Next Layer UAVs are presented to empower a well-organized Store and carry forward (SCF), in Multi-Layer UAV ad-hoc networks. Next Layer UAVs expands the accessibility of connecting tracks among the all DTN UAVs and the ground vehicle, hence reducing end-to-end delays and growing the packet delivery ratio and drop the packet drop ratio. The proposed BSnW with controlled replication protocol enables a high packet delivery ratio, which enables, and guarantees single-copy data forwarding to evade duplication of every message. Proposed protocol has been experimented using Opportunistic Network Environment (ONE) Simulator. Our simulated experiment show that the proposed protocol outstrips the epidemic routing protocols reported in the literature in terms of the packet delivery ratio, average delay, throughput and the routing overhead.

In this paper, we evaluate and compare the performance of single-copy and multiple-copy routing protocols in a realistic Vehicular Delay Tolerant Network (VDTN) scenario. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that multiple-copy protocols perform better in terms of delivery probability compared with singlecopy protocol. The single-copy protocol uses the highest average number of hops and higher average latency compared with multiple-copy protocols. Maxprop achieves the highest delivery ratio and lowest average latency. Spray and wait results are the lowest for overhead ratio, but the longest for average buffer time. First contact have a short buffer time, but it uses a big number of hops.

Compared with the traditional Internet architecture, Delay/Disruption Tolerant Networking (DTN) has a bundle layer between the application layer and transport layer and is able to tolerate delays and disruptions. In this paper, we simulate typical DTN routing protocols and configure a vehicular network environment to evaluate the protocol performance. We compare the performance evaluation indicators that include delivery ratio, overhead ratio, average delay, and average buffer time with different node numbers and buffer sizes. We finish the simulation using Opportunistic Network Environment (ONE) simulator and the DTN routing protocols are evaluated according to the simulation results.

An Opportunistic Network is an intermittently connected Mobile Ad-hoc Networks that exploits the communication opportunity between the nodes for data transmission whenever they are within the communication range of each other even for a short time. In contrast to the Mobile Ad-hoc Networks, Opportunistic Networks follow store-carry-forward approach for the data transmission. Routing in this type of network depends on many factors, like the direction of the node's movement, the supported interface bandwidth (Bluetooth, high-speed Internet, etc.), the node's speed, and the node's buffer size. In this research work, a context-aware routing protocol is proposed that uses the frequency of contacts among nodes as context information. The frequency of meetings between any two nodes is found to be a good heuristic to identify the message's best forwarder. The proposed routing protocol is simulated on opportunistic network environment (ONE) simulator and the results are compared with the most prominent routing protocols of context-oblivious and context-aware classes, and it was found that the proposed routing protocol performs better than other protocols in terms of delivery probability and buffer average time.

When a major disaster strikes, large parts of the critical infrastructure can be completely debilitated for weeks. In such situations the principal need is to quickly re-establish minimal communication infrastructures for support of rescue operations. For this purpose smart phone-based ad hoc opportunistic network can be built to rescue people from different affected areas. Relief workers from different agencies divide into small groups based on different categories of needs. In such sensational environments secure and immediate group communication among small groups and to the remote monitoring system is urgent as there can be some malicious nodes that intend to intercept and alter sensitive data for the purpose of corruption. To implement group communication using Delay Tolerant Network (DTN) some authorized carrier nodes can be allocated to deliver messages and shared group keys can be assigned for encryption-decryption purposes. The performance of the proposed scheme is evaluated on ONE simulator (The Opportunistic Network Environment Simulator) version 1.4.1.KeywordsAd hoc opportunistic networkGroup communicationDelay tolerant network

SummaryVehicular delay tolerant networks (VDTNs) suffer due to insufficient connection opportunities in sparse infrastructure. The sparsity of the network results in poor delivery ratio (DR). Deployment of additional small nodes named throwbox increases the contact opportunities, resulting in improved performance in terms of DR. However, randomly deployed throwboxes do not provide optimum results. Therefore, this article proposes the throwbox deployment as an optimization problem. Customized binary particle swarm optimization‐based optimization method is employed to solve the problem. With the objective of maximizing the DR, the method optimize the placement of‐throwboxes in the network. The performance of the proposed methods is tested and compared by simulating a VDTN model in opportunistic network environment simulator. The optimization framework was implemented in Matlab. Exhaustive experiments were carried out by varying the number of throwboxes (). A statistical comparison of the results with the existing throwbox deployment methods validates the effectiveness of the proposed optimization‐based approach. The article also presents an analysis for choice of value of for a desired network performance.

SummaryWith the advancement in wireless technology and portable devices, smart phones have become one of the belongings of human being. People share their data online, but it has limitations due to transmission range and mobility. Yet opportunistic mobile social network enables users to share data online even if there is no connected path between source and destination. The widespread use of mobile phones equipped with WiFi, Bluetooth, and several other components and contact opportunities among humans bridge the gap between internet available and nonavailable area. In this paper, we have proposed a new routing approach which utilizes both spatial and temporal attributes of user such as probability to meet a particular location and remaining intercontact time between two nodes to select better relay nodes. Generally, users visit different locations such as sports stadium and mall, with varying probability. Users with similar interest form group, and each user has different intercontact time with other users according to their point of interest and visiting pattern. By utilizing multiattributes, different forwarding strategies have been devised for both inter and intragroup routing. The proposed work “point of interest (PoI)‐based routing” is implemented in Opportunistic Network Environment simulator, and the performance is analysed in terms of delivery rate, latency, overhead, goodput, and energy consumed. The simulation results show that PoI diminishes 23% of overhead and yields 24% improvement in goodput over the state‐of‐the‐art protocol. Thus, the simulation results reveal that our proposed work provides the balance between routing performance and resource consumption.

In certain extreme environments where infrastructure such as base stations is absent, connections between nodes can be intermittent. Traditional networks struggle to function in these conditions. Delay Tolerant Network (DTN) are a network architecture designed for such scenarios. Utilizing Unmanned Aerial Vehicle (UAV) as nodes within DTN can enhance the network’s transmission capabilities and compensate for the deficiencies of ground nodes. However, previous routing methods have shortcomings. Given the high speed and greater freedom of movement of UAVs compared to ground nodes, the network topology is subject to constant and significant change. Traditional routing methods, which typically rely on predetermined rules for selecting forwarding nodes, struggle to adapt to such variations. This paper introduces Graph Neural Network (GNN) into routing decisions for DTN to learn network structural information and assist with routing decisions. In this paper, we first model the routing problem within DTN, accounting for the dynamic changes in network topology and limited resources. Subsequently, we propose a GNN-based dynamic routing method. This method utilizes a graph neural network model that takes as input the feature s of nodes at the current moment and the network’s connectivity information to generate optimal forwarding nodes for each data packet. The proposed method has been implemented in the Opportunistic Networking Environment (ONE) simulator. Experimental results indicate that our method achieves higher delivery ratio, lower latency, and reduced overhead compared to traditional methods.

PurposeIn this study, we discuss three DTN routing protocols, these are epidemic, PRoPHET and spray and wait routing protocols. A special simulator will be used; that is opportunistic network environment (ONE) to create a network environment. Spray and wait has highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others. This analysis of the performance of DTN protocols helps the researcher to learn better of these protocols in the different environment.Design/methodology/approachDelay-Tolerant Network (DTN) is a network designed to operate effectively over extreme distances, such as those encountered in space communications or on an interplanetary scale. In such an environment, nodes are occasional communication and are available among hubs, and determinations of the next node communications are not confirmed. In such network environment, the packet can be transferred by searching current efficient route available for a particular node. Due to the uncertainty of packet transfer route, DTN is affected by a variety of factors such as packet size, communication cost, node activity, etc.FindingsSpray and wait have highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others.Originality/valueThe primary goal of the paper is to extend these works in an attempt to offer a better understanding of the behavior of different DTN routing protocols with delivery probability, latency and overhead ratio that depend on various amounts of network parameters such as buffer size, number of nodes, movement ratio, time to live, movement range, transmission range and message generation rate. In this study, we discuss three DTN routing protocols: these are epidemic, PRoPHET and spray and wait routing protocols. A special simulator will be used; that is opportunistic network environment (ONE) to create a network environment. Spray and wait have highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others. This analysis of the performance of DTN protocols helps the researcher to learn better of these protocols in the different environment.