Impact of Node Density on the QoS Parameters of Routing Protocols in Opportunistic Networks for Smart Spaces

Garg, Puneet; Dixit, Ashutosh; Sethi, Preeti; Pinheiro, Plácido Rogerio

doi:https://doi.org/10.1155/2020/8868842

Mobile Information Systems

On this page

Abstract Introduction Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Personal Communication Technologies for Smart Spaces

View this Special Issue

Research Article | Open Access

Volume 2020 | Article ID 8868842 | https://doi.org/10.1155/2020/8868842

Impact of Node Density on the QoS Parameters of Routing Protocols in Opportunistic Networks for Smart Spaces

Puneet Garg,¹Ashutosh Dixit,¹Preeti Sethi,¹and Plácido Rogerio Pinheiro²

Academic Editor: Ali Kashif Bashir

Received27 May 2020

Revised28 Jun 2020

Accepted08 Jul 2020

Published01 Aug 2020

Abstract

The need and importance of Smart Spaces have been potentially realized by the researchers due to its applicability in the current lifestyle. Opportunistic network, a successor of mobile ad hoc networks and a budding technology of network, is a best-suited technology for implementing Smart Spaces due to its wide range of applications in real-life scenarios ranging from building smart cities to interplanetary communication. There are numerous routing protocols which are available in opportunistic network, each having their pros and cons; however, no research till the time of listing has been done which can quantitatively demonstrate the maximum performance of these protocols and standardize the comparison of opportunistic routing protocols which has been a major cause of ambiguous performance evaluation studies. The work here presents a categorical view of the opportunistic routing protocol family and thereby compares and contrasts the various simulators suited for their simulation. Thereafter, the most popular protocols (selecting at least one protocol from each category) are compared based on node density on as many as 8 standard performance metrics using ONE simulator to observe their scalability, realism, and comparability. The work concludes by presenting the merits and demerits of each of the protocols discussed as well as specifying the best routing protocol among all the available protocols for Smart Spaces with maximum output. It is believed that the results achieved by the implemented methodology will help future researchers to choose appropriate routing protocol to delve into their research under different scenarios.

1. Introduction

In the era of consistently changing environment, communication devices are getting intelligent day by day and delivering rapid and robust connections. New applications are emerging with an advanced approach in wireless networking arena which is attracting new researchers in this field for further efforts. Due to the tremendous research in the wireless section, communication has become promising even in remote regions where previously, constructing a simple communication network was a huge challenge.

Owing to the pervasive applications of networking, existing technologies on wireless networking like vehicular ad hoc wireless network, wireless sensor networks, mobile ad hoc networks are observed to be insufficient in some instances such as interplanetary communication [1], Smart Spaces [2], and social networks [3] to cope up with all the aspects and challenges concerned to the wireless networking, Some detected major difficulties with these technologies are connection failure and links discontinuation which degrades the overall performance of the network. To counter this challenge, researchers worked hard to create a new networking technology that led to the development of opportunistic networks (OppNets). According to Shu et al. [4], opportunistic networks (OppNets) are one of the categories of delay-tolerant networks [5], which support data communication through movement in nodes as it does not need any long-lasting links from sender to receiver nodes.

According to Kushwaha and Gupta [6], opportunistic network sare one of the rising advancements of the network system. In opportunistic networks, nodes can communicate with one another regardless of whether the route between source to destination does not exist at that given moment. Opportunistic networks must be delay-tolerant (i.e., ready to tolerate bigger delays). Delay-tolerant network (DTN) utilizes the idea of “store-carry-forward” of data packets. DTNs can move data or set up a correspondence in a remote area or emergency condition where there is no network set up. DTNs have numerous applications like to provide smooth Internet arrangements in remote areas, in vehicular networks, noise observing, extraordinary terrestrial situations, and so on. It is in this manner promising to recognize viewpoints for reconciliation and integration of opportunistic network systems and advances into delay-tolerant networking.

OppNet is different than mobile ad hoc networks (MANETs) in the aspect of connectivity of participating nodes carrying data [7, 8]. The nodes participating in ad hoc networks for data communication remain connected constantly whether the nodes are in motion or static; on the other hand, nodes get to connect with other nodes in the OppNet when the communication is to be done between the nodes that make it a better approach in real-world applications. Therefore, conventionally defined protocols such as TCP/IP, DSR, AODV, and DSDV fail to function properly in opportunistic networks [9–11].

Rather, OppNet which is a type of delay-tolerant network is considered as the next generation of ad hoc networks which is further derived from standard wireless networks. Figure 1 clearly illustrates the evolution of opportunistic networks originating from the wireless networks domain through step-by-step growth. Every growth in each progressive step indicates the extension of personal communication networks towards solving further real-life problems which were a challenge earlier.

According to Nayyar et al. [12], the primary aim of developing opportunistic networks is to handle critical situations with effective manner such as disaster handling, war-field communications [13], satellite communications, flying warplanes/drones networking, underwater sensor networks [14], and forest surveillance. OppNets are highly useful where communication encounters high delays, no reliable connectivity, and high error rates. Nodes participating in OppNet are equipped with several attributes such as short communication range, high dynamic mobility, and low density. OppNet is designed specifically to connect almost every device which is capable of being connected through any wireless medium such as Bluetooth and Wi-Fi, etc. thereby making it a perfect choice for network designers all over the world. A general scenario of the opportunistic network connection is depicted in Figure 2.

1.1. Advantages and Disadvantages of Opportunistic Networks

According to Nayyar et al. [12], opportunistic networks are considered a strong option among the available networking technologies due to the following advantages:(1)OppNets can tolerate high delays if the destination or another intermediate node is not responding due to any reason during data communication(2)OppNet may allow data transfer with asymmetric data rates(3)OppNets can prevent data loss due to connection failure as it follows the store-carry-forward approach(4)OppNets can manage data communication even in continuous ups and downs with network state as it is specifically designed for operating under the situation of intermittent connection

Despite all the abovementioned advantages, there are certain challenges [15] in OppNet communication that needs to be dealt with. The various shortcomings of OppNet are as follows:(1)OppNet requires high buffer space as it stores the data to be forwarded which further increases its operational cost.(2)Due to intermittent connectivity, a node communicating in OppNet requires a large amount of energy as it may wait for a long time for forwarding the data it holds.(3)OppNet faces a challenge of security also like MANET because like MANET, nodes participating in OppNet forward the data towards destination via intermediate nodes. These intermediate nodes may be malicious sometime. Therefore, choosing a secure route between two communicating nodes is a challenge.

It is believed that the above-discussed challenges will soon be resolved by upcoming researchers through their continuous efforts to make OppNet better than its current version.

1.2. Role of Opportunistic Networks in Smart Spaces

In the era of Digital Connectivity, a large amount of population is equipped with smartphones that connect a person to the digital world via the Internet [16, 17]. Besides connecting the Internet, a smartphone comes with a different mode of connectivity with other devices such as Bluetooth and Wi-Fi [18]. According to Samaniego et al. [19], “Smart Spaces are common spaces that have capabilities to get data from the environment and apply knowledge to fulfill requirements of mobility, distribution, and context awareness of its inhabitants.” Smart Space is nothing but a virtual world full of information as per the interest of member nodes [2, 20]. According to Ismagiloiva et al. [21], the concept of Smart Spaces complements IoT technology specifically for designing smart cities.

These different modes of smartphone enable its user to make his/her private network as per the requirements as well as preferences of connected persons. These small and customizable networks are termed as Smart Spaces in the real world [22, 23]. The connected devices in such Smart Spaces are known as nodes in the networking terminology [2, 24]. For its smooth connectivity, opportunistic network is the best suited due to its inherent traits. The nodes in opportunistic networks use Wi-Fi or Bluetooth for interconnectivity and primarily initiate functioning with a single node known as seed OppNet and expand further by implementing it among more member nodes that facilitate data forwarding in the network [25, 26].

Routing in OppNets relies upon contact opportunity between the nodes which is required due to their versatile nature. The most huge technique used in OppNet for routing movement is the store-carry-forward technique, where a message can be forwarded among intermediary nodes, and accordingly, the message is passed on to the destination node. The store-carry- forward technique is seen as a capable technique to ensure message delivery to destination nodes where message delivery may bear high delays. Thus, OppNets are a subclass of DTN where nodes must be outfitted with high buffer space to store messages for a strange timeframe to evade packet dropping.

Short-distance communication feature enabled node may help OppNet to gain large improvements and numerous scopes covering almost every industry such as information attacking, energy utilization, communication engineering, and information gathering. However, maintaining a stable network topology in OppNet is a cumbersome task; also, predicting the network topology is very difficult due to the frequent mobility among nodes and large communication range.

This paper initially presents the introduction of opportunistic networks followed by its role in building Smart Spaces and applications of OppNets which are presented in Section 2. Section 3 highlights various routing protocols associated with this class of networks. Section 4 elaborates numerous research simulators available in OppNets followed by the enlightenment of Java-based simulator ONE (Opportunistic Network Environment). Section 5 presents the analysis of the total nine standard routing protocols over standard QoS parameters. The paper concludes by submitting future work in this area.

2. Applications of Opportunistic Networks

Opportunistic networks have become ubiquitous nowadays. It has numerous applications in real-life scenarios covering almost all levels of modern communication requirements. Figure 3 demonstrates OppNet applications in the real world.

Some of the popular ones are described as follows:(a)LASSO: Saloni et al. [27] developed LASSO, a general-purpose smartphone-based application that uses the opportunistic networking feature using Bluetooth or smartphone for group monitoring. It has proved to be highly advantageous for the interconnectivity of a group of some persons roaming in a smart city and monitoring their locations to track if someone got missed. Its unique feature of decentralization device-to-device mode of operation makes it able to be used in any mobile scenario. Also, it does not need any pre-existence of any communication infrastructure. LASSO has performed well on small-scale implementation (i.e., 250 persons over a small geographic area) and it is being underdevelopment for further enhancements.(b)Shared wireless infostation model (SWIM): Small and Haas [28] proposed an infostation concept with the integration of opportunistic networking. It was experimented to observe the whale species by tying sensors on whale’s back, thereby making them radiotagged whales. All sensor nodes are connected via opportunistic networking and data are forwarded in the same fashion as in OppNet and finally delivers to the infostation. This application has proved to be excellent to monitor whales’ life closely.(c)Underwater communication networks: Detweiller et al. [29] experimented with a communication setup consisting of mobile sensor nodes with acrylic closure and other communications support hardware to establish underwater communication network. It is a quiet application of opportunistic networks as it can tolerate delay and respond accordingly to commensurate the real-life challenges in a typical sea environment. An experimental study proved it successful along with TDMA protocols with depths less than 100 meters for comprehension and demonstrating coral reefs. It can likewise support more prominent depths by supplanting acrylic enclosure with a glass/titanium enclosure.(d)ZebraNet: ZebraNet [30] is an OppNet-based project implemented by Princeton University under Mpala Research to track and monitor wild creatures in the forest of Kenya with the help of powerful sensors tied at animals’ neck. Every sensor being used in it is enabled with wireless transceiver, CPU, and GPS. All sensors fitted on animal bodies interchange their sensed information in OppNet fashion and finally deliver to the desired station. It is focused to develop for monitoring the movement and speed of wild creatures in forests.(e)Composable Distributed Mobile Applications: Papadaki et al. [31] presented a system design that permits application developers to consider the future environment as a generic execution that opportunistically distributes and executes automatically the components of their applications. The concept of permitting mobile clients to utilize the resources present in the environment with the help of location-aware services relates this application to opportunistic networking and opportunistic computing. The primary aim of this system design is to hold a vision to a futuristic environment where clients do not require to search and use services already existing in the environment, rather, to use the environment to implement their custom applications. It has experimented successfully with the help of a prototype evaluation.(f)Saratoga: Wood et al. [1] presented Saratoga which is a light-weight protocol based on opportunistic networks. It was developed by Surrey Satellite Technology Limited (SSTL) for file transfers of data recorded in image format by IP-based Disaster Monitoring Constellation (DMC) satellites revolving around earth from low orbit. Saratoga follows opportunistic routing as it only forwards the data packet when link connectivity is available which guarantees that the maximum possible data are transferred to the node during a 12-minute pass over a satellite ground station. Saratoga is fully operational for many years.(g)Underwater acoustic communication: underwater communication networks have been the prime area of research in recent years due to its various applications such as oil spills detection, disaster detection and avoidance, sea exploration, and detection of submarines. Menon and Prathap discussed [32] numerous opportunistic routing protocols developed especially for underwater acoustic communication. Two major categories of such protocols are pressure-based protocols and location-based protocols. Rahman et al. [33] proposed a routing algorithm named TORA (totally opportunistic routing algorithm) with a focus to overcome issues about underwater acoustic communication such as void nodes, horizontal transmission, high end-to-end delay, low throughput, and high battery drain. According to extensive simulation studies, TORA has been proved a better option over the existing algorithm up to a considerable extent.

These are some of the major applications opportunistic networks possess. But its scope has not been limited to the mentioned applications; rather, it has vast scope in airborne networks [34], space operations [35], backend support in smart cities [36, 37], and many other domains that are not discussed in this paper.

3. Routing Protocols in OppNets

Opportunistic networks contain a huge number of routing protocols. These protocols came into existence as a result of the rigorous efforts of several researchers done in the domain of opportunistic networking [3, 38–40].

According to Juyal et al. [41], numerous protocols can be categorized into various classes, viz., flooding-based routing protocols (e.g., Epidemic routing protocol and Spray-and-Wait routing protocol), forwarding-based routing protocol (e.g., Direct Delivery routing protocol and First Contact routing protocol), probability-based routing protocols (e.g., PRoPHET and MaxProp), knowledge-based routing protocols (e.g., Epidemic Oracle routing protocol), social relationship-based routing protocols (e.g., FRESH routing protocol), and off-course hybrid routing protocols (e.g., RAPID protocol). The work presents the exhaustive survey of all these protocols in each category of routing protocols in opportunistic networks.

The taxonomy of routing protocols is depicted in Figure 4.

(a)Epidemic routing protocol: the functioning of Epidemic protocol may be described as an epidemic disease spread in an area; therefore, any contact developed in such an infected area will spread it further. The only difference is that here, the disease is considered as a message containing data, and the area is considered as transmission range. Vahadat and Becker [42] introduced a message delivery technique, in which there is no connected path between source and destination. Initially, in mobile ad hoc networks, existing techniques available at that time were unable to counter this situation. Later on, it was adapted for opportunistic networks. Thus, epidemic routing was introduced where random pairwise interchanges of messages among participating nodes guarantee eventual message delivery. The Epidemic routing protocol is one of the oldest routing protocols in opportunistic networks. The Epidemic routing protocol is easy to understand and implement.(b)Direct Delivery routing protocol: Spyropoulos et al. [43] presented this protocol with an idea of single-copy routing in opportunistic networks. In this routing protocol, the message needs not to be forwarded via intermediate nodes rather; it is held by the sender node itself. It waits for sending the message until it comes into contact with the destination node directly. It is the most simple and easy to understand among all the protocols currently available in opportunistic networks. The methodology adapted is not sufficiently reliable as the sender node may have to wait for infinite delay for destination node come into its contact. If this kind of situation happens, the entire message will be lost as the whole network would have only a single of that message. Spyropoulos et al. [43] defined the formula for calculating ED direct delivery as follows: where K ⟶ transmission range of each node and N ⟶ covered area.(c)Spray-and-Wait routing protocol: Spyropoulos et al. [44] proposed this scheme with a focus to improvise the performance of the Epidemic routing protocol. It was found to be a better performer than Epidemic and other protocols that lie in the same category on the ground of simulations as well as theory. With the increase of network size or connectivity level, Spray-and-Wait protocol also proved itself as a very scalable protocol. Also, Spray-and-Wait protocol generates less number of message replicas, thereby reducing the buffer space and relevant parameters. The functioning of this protocol can be divided into two phases, i.e., Spray phase and Wait phase. In the Spray phase, message replicas are broadcasted by source nodes among other nodes in its transmission range. All nodes accept the message from the source node and save it in their respective buffer. In the Wait phase, the nodes holding the message received from the source node wait for the opportunity to forward the message when another node comes into its contact [45]. The primary objective of Spray-and-Wait protocol is to reduce the number of message replicas to be forwarded like Epidemic routing protocol, thereby reducing the expected delay in data transmission. As per Spyropoulos et al. [44], the expected delay (ED) in Spray-and-Wait routing protocol is shown as follows: where H_n ⟶ n^th harmonic number, viz., and n ⟶ total number of nodes. After the comparison between the formulas of expected delay of Spray-and-Wait and Direct Delivery, it may be easily concluded that Spray-and-Wait protocol saves a considerable amount of time in data delivery.(d)First Contact routing protocol: Jain et al. [46] developed a scheme that requires limited additional knowledge about network topology, considerably less than the entire topology. This scheme is known as the First Contact routing protocol. In this protocol, the sender node disseminates the message to the very first node it encountered, and this node forwards it to the next first encountered node. The process continues until the message is received by the destination node. The encounters between the nodes are based on random walk search. The message will be retained in the buffer of the node if it does not find any other node through the encounter. It is found experimentally that First Contact routing protocol performs poor as it forwards the node based on random encounter and no topology or geographic condition is taken care of for message transmission towards the destination node. It is easy for implementation and may be used as a better option for multicast messages. Packet dropping and high delays are some of the problems that arise due to the First Contact routing protocol.(e)PRoPHET routing protocol: Lindgren et al. [47] proposed a new routing algorithm named Probabilistic Routing Protocol using History of Encounters and Transitivity (PRoPHET) in intermittently connected networks. It has similar functionality like Epidemic routing protocol, but the only difference is that in PRoPHET, every node participating in opportunistic networks calculates a “probabilistic metric” also known as delivery predictability for each evaluated/known destination which empowers the source node to find out the accomplishment of message delivery. Delivery predictability can be updated as per the following equation: where P_init (0, 1) and a, b ⟶ nodes in the network. If a pair of two nodes does not have any experience of any cooperation in data forwarding due to any reason, their respective delivery predictability must be reduced as the time grows. Therefore, delivery predictability may be updated as per the aging constant γ [γ (0, 1)] as mentioned in the following equation: where K ⟶ time units. Moreover, delivery predictability also follows the property of transitivity, i.e., if node A has high probability metric with node B and similarly node B has high probability metric with node C, then node A and node C would have also high probability metric due to the property of transitivity in PRoPHET protocol even though node A and node C do not have any recent experience of any cooperation in data forwarding. The following equation illustrates the effect of transitivity on delivery predictability: where β is a scaling constant and β [0, 1]. The computation of delivery predictability is done based on encountered nodes history or nodes visited history. At the point when two nodes came in contact with each other, summary vectors are interchanged containing delivery predictability. On the off chance that two nodes are encountered on a routine basis, they will have higher delivery predictability and those nodes which are having less predictability or never encountered have fewer changes of effective message delivery to the destination. The delivery predictability shifts from time to time. Simulation-based investigation explains that PRoPHET protocol takes fewer message interchanges, low communication overhead, and less delay and has a better packet delivery ratio when contrasted with epidemic routing.(f)MaxProp routing protocol: Burgess et al. [48] proposed MaxProp protocol. This protocol is based on prioritizing two kinds of schedules, i.e., schedule of messages to be dropped and schedule of messages to be transferred to other nodes. The main aim of designing this protocol is to improvise delivery rate and average latency. It functions by ranking the stored packets in nodes’ memory on the ground of cost assigned. The formula for calculating cost between source node a and destination node d is shown as follows: where ⟶ probability of successful message transfer from node x towards x + 1. MaxProp prevents duplication of packets and giving high priority to new packets. The priorities of the message are assigned based on the head start of a new message, hop count, previous intermediate nodes, and historical data. The functioning of MaxProp routing protocol starts from transmitting all the messages destined for the immediate neighbour in the network, after that, routing information is transmitted followed by acknowledgments of messages being delivered regardless of sender and receiver nodes. At last, high priority has been given to those messages which are not delivered to the destined nodes for communication. MaxProp protocol is found better than Dijkstra, ME/DLE, and random routing protocols after experimental evaluation.(g) Epidemic Oracle routing protocol: Jain et al. [46] presented it and placed under the category of knowledge-based routing protocols as it maintains a history of all participating nodes in the entire opportunistic network. Epidemic Oracle routing protocol carries the message to be forwarded until there would be enough probability of delivering the message to the right destination. It has a knowledge database concerning future connectedness; therefore, it falls under the Knowledge-based routing protocols. Epidemic Oracle routing protocol delivers a better delivery probability than Epidemic protocol, PRoPHET protocol, and Direct Delivery protocol, but sometimes it may lead to prolonged delays in a case when there would be no sufficient probability of delivering the message to the right destination. Like other routing protocols, one of the major objectives of this protocol is to achieve optimum delay. The expected delay (ED) in Epidemic Oracle routing protocol is described as follows: where ⟶ summation of data segments of message K which is received by node in time duration of I_q, ⟶ summation of all data segments of message K transmitted over edge e during the time duration of I I_E, and ⟶ time duration consumed since the start of message transfer.(h)FRESH routing protocol: Dubois-Ferriere et al. [49] proposed FResher Encounter SearcH (FRESH) algorithm for path discovery in opportunistic networks in an efficient manner. In FRESH, participating nodes maintain a record of their most recent encounter times with other nodes. When a node requires forwarding the message to some another node, then it searches for any intermediate node with having the most recent encounters and forward the message to it. The intermediate node follows the same process up to when the message reaches the desired location. Calculating search cost (C_s) in finding a route between source s towards destination d can be considered as a composition of several successive searches and the mathematical expression is given in the following equation: where X_i ⟶ positions of i^th node and ⟶ radius of the search area. FRESH protocol results in cheap route discovery by replacing a single whole network search to the series of small searches. It has been found experimentally that FRESH protocol reduces the flooding overhead to a considerable extent.(i)RAPID routing protocol: Balasubramanian et al. [50] presented the RAPID protocol to maximize the performance of specific performance parameters. It uses the utility function (U_i) to assign utility value to every message on the ground of the average delay parameter. Primarily, it involves routing of packets by replicating until a copy reaches to the destination node. At a transfer opportunity, it repeats a packet that locally brings about the most noteworthy increment in utility. By and large, U_i is characterized as the expected contribution of i to the given routing metric. For instance, the metric limit average delay is estimated by adding the delay of packets. In like manner, the utility of a packet is its normal delay. Along these lines, RAPID is a heuristic dependent on locally improving marginal utility, i.e., the normal increment in utility per unit resource utilized. RAPID imitates packets in diminishing requests of their marginal utility at each transfer opportunity. The equation for calculating expected delay (ED) to deliver I is expressed as follows:

where ⟶ expected time of x_j to reach node z and ⟶ the number of times each of the j nodes, respectively, required to contact the destination to deliver I directly.

It has been found through simulation that RAPID performs better than MaxProp, Spray-and-Wait, PRoPHET on the ground of average delay, packet delivery ratio, and overall efficiency in opportunistic networks.

4. Simulation Trends in Opportunistic Networks

Various researchers developed numerous simulators and made them available for simulation purposes. Some of the popular simulation tools are as shown in Table 1.

In addition to the abovementioned simulators, various custom-built simulators are also being an option for pursuing research in opportunistic networks. These simulators help to share original coding work for its reuse in the future. Few examples of such simulators are MONICA [57], E-ONE [58], and UDTNSim [59].

Kuppusamy et al. [15] surveyed the simulation trend followed by researchers focusing on opportunistic networks. The results reveal that there has been a substantial increase in the use of ONE simulator during the current decade. Figure 5 presents the contribution of different available simulators towards OppNet research.

Also, Kuppusamy et al. [15] have brought in to light the fact that the foremost reason for selecting ONE simulator as a major tool is that it is capable of supporting the maximum number of participating nodes during simulation among all discussed simulators (except custom-based simulators). However, it has some limitations regarding the underlay layers such as the MAC sublayer, but that can be ignored for the research work of this paper. Further, it is also found as the most accurate simulator which allows the researcher to get results with the maximum number of QoS parameters among all its counterparts.

Based on the abovementioned details, it may be stated that ONE (Opportunistic Network Environment) simulator is the most widely used simulator among researchers. Therefore, this paper uses ONE simulator for the implementation of the mentioned routing protocols aiming to cover a large group of researchers engaged in the opportunistic network research domain.

4.1. ONE Simulator

ONE (Opportunistic Network Environment) is a Java-based discrete event simulator whose main functions are node movement modeling, routing, message-handling, and internode contacts, Result collection and analysis are achieved through visualization and other postprocessing tools.

The results which are generated as a result of the simulation are generally logs of events that are further processed by external tools such as Graphviz for plotting graphs. Figure 6 illustrates the simulation environment of ONE simulator.

The popularity of ONE simulator is because it provides various tools to generate difficult mobility scenarios that are closer to real-life situations than any other available simulator in current time. Some of its features such as GPS Map data and Working Day Movement Model make it a better option to reality.

However, still, ONE simulator has some challenges; for example, the message generation process may perform better if group relationship and context information be added. Also, it must be mentioned here that several research groups are putting their efforts into enhancing supporting features in ONE simulator. Maybe, a newer version of ONE simulator will be added with some better features.

5. Performance Evaluation of Routing Protocols for Smart Spaces

Rigorous review uncovers the fact that though numerous routing protocols have been proposed by various eminent researchers, yet none of them has quantitatively evaluated them. The authors in this work showed that there is an urgent need to do the same to determine which protocol is best suited in a given environment. Keeping this in mind, the authors have meticulously compared the numerous protocols of opportunistic networks.

In this section, nine different routing protocols are compared based on standard Quality-of-Service (QoS) parameters by varying the number of participating nodes. It is believed that this simulation comparison will describe the performance behavior of different protocols on the ground of node density [26, 38]. The main purpose of choosing node density as a primary factor is that it correlates to the real-life scenario of Smart Spaces very closely, for example, if we consider mobile handset device as participant node connected to OppNet via Bluetooth/Wi-Fi, then it would be around 50–60 nodes per square km in case of a park in opportunistic networks, but it can increase up to 500 or more in the situation of a conference hall. If we talk about interplanetary communication, then the number of participant nodes would be at most 1 or even less than 1 per square km. The ratio of the number of nodes per square km becomes 100–150 when a normal highway situation is considered. It may be increased up to 200–250 when a busy pedestrian path is taken as an example. There are many other real-life situations as well where node density differs as per the environment which directly affects the overall performance of Smart Spaces. Therefore, this paper aims to find the suitability of the protocol being used in different scenarios. The simulation comparison will result in the performance of different protocols in different node densities; it will help upcoming researchers to choose routing protocol accordingly for establishing different Smart Spaces.

5.1. Common Parameters Used in Each Case

Besides the variation in node density with a different routing protocol, several other parameters are kept constant to analyze the performance change only due to the change in several participating nodes. The details of these parameters are listed in Table 2.

5.2. Quality-of-Service (QoS) Parameters Used

The comparison needs some standard parameters, so that the performance comparison could explain which is better and which is worse [60–64]. Table 3 explains the various standard parameters that have been taken to decide the behavior of routing protocols for a different number of participating nodes.

(1)Number of participating nodes: as already mentioned earlier, this paper aims to inspect the behavioral change of different routing protocols when several participating nodes vary to observe its suitability for setting up different Smart Spaces of different capabilities in different places for different purposes. The simulation study starts with several nodes 50 and it ends to 500 nodes in a particular simulation area (4500 × 3400 square meters). Therefore, this paper considers it as the primary QoS metric for judging the quality of different routing protocols under various situations concerning node density.(2)Message delivered: as per the message delivered is concerned, it is observed that FRESH routing protocol shows the best behavior for 50–250 nodes, but Spray-and-Wait protocol takes the lead as the participating nodes grow from 270 to 500. PRoPHET protocol also shows good performance after FRESH protocol for 100–250 nodes, but it lags when the number of nodes grows more than 250. Also, MaxProp starts giving good results when the number of nodes grows from 250 nodes. First Contact protocol behaves worse from starting values to the end, and also Direct Delivery protocol showed similar performance but somewhat better than First Contact protocol. Comparative performance may also be viewed by the following graph depicted in Figure 7.(3)Message dropped: it may be easily analyzed that FRESH protocol shows best behavior, i.e., zero message dropped in every case of node density. Direct Delivery protocol also shows the same but only when the number of nodes becomes more than 150. First Contact protocol also delivers minimal message drop after the FRESH protocol and Direct Delivery protocol. Epidemic protocol gives the highest most message drops up to the node density of 350 and also in the case when the number of nodes is equal to 450. Besides Epidemic, PRoPHET protocol follows the higher drop rate and delivers the highest message drops in node density of 500. The comparative graph is available for reference as depicted in Figure 8.(4)Delivery probability: from the observations, it can be clearly stated that FRESH protocol shows the best performance up to the node density of 270. Spray-and-Wait protocol leads after the number of nodes is equal to 270 to 500, whereas the First Contact protocol and Direct Delivery protocol shows the worse performance on every case of the node number. The comparative graph is available for reference as depicted in Figure 9.(5)Overhead ratio: the Direct Delivery protocol exhibits zero overhead ratio. Spray-and-Wait protocol also delivers the second-most lowest overhead ratio after the Direct Delivery protocol in every case of node density. As far as other protocols are concerned, Epidemic Oracle Protocol delivers almost maximum overhead ratio up to the node density of 150, Epidemic protocol leads after that, and PRoPHET protocol also exhibits the high overhead ratio but somewhat less than Epidemic for the number of nodes higher than 150 and Epidemic Oracle for the number of nodes less than 150. FRESH protocol also delivers a very less overhead ration up to the 200 nodes in the simulation area, but it slightly changes its behavior when it grows from 200 towards 500 in node density. Refer to the graph as depicted in Figure 10.(6)Average latency: from the given graph as depicted in Figure 11, it may be easily concluded that Epidemic protocol gives the least average latency in the case of 50 nodes, but it surprisingly changes the behavior from least to higher values when many nodes grow from 50 to 100. Similarly, Direct Delivery protocol also behaves surprisingly. It exhibits considerable low average latency in case of node density of 50, 150, 250, and 350–450 as compared to the case when the number of nodes is 100, 200, 300, and 500. MaxProp and RAPID protocols consistently show a huge average latency in every case of node density. FRESH protocol shows the best performance in this parameter by exhibiting low average latency in each case of node density.(7)Average hop count: as far as the average hop count is concerned, it may be summarized that Direct Delivery as per its methodology delivers messages only with one hop count. If this protocol is sided apart, then Spray-and-Wait and MaxProp protocols require the least average hop count to deliver a message in every case of node density. PRoPHET protocol also requires less average hop count but after Spray-and-Wait and MaxProp protocols. Epidemic Oracle protocol requires the highest average hop count except in the case of node density of 320–410. First Contact protocol also requires the highest average hop count for node density of 300–400, but its requirement surprisingly falls when the number of nodes is from 400 towards the higher side. FRESH protocol exhibits a consistent behavior in this parameter; it continually grows as the number of nodes grows. See the graph as depicted in Figure 12.(8)Average buffer time: as per the buffer time is concerned, it can be easily understood that the Direct Delivery protocol needs least most buffer time when the number of nodes is greater than 150. FRESH protocol also requires considerably less buffer time throughout every case of node density. Also, it has been observed that the requirement of average buffer time of almost every routing protocol (observed here) reduces as the number of nodes increases except Spray-and-Wait protocol; rather, it shows that it requires more buffer time as the number of nodes grows. See the comparative graph as depicted in Figure 13.

5.3. Analysis of Performance Evaluation

Total nine protocols (Epidemic protocol, PRoPHET protocol, Spray-and-Wait protocol, Epidemic Oracle protocol, MaxProp protocol, Direct Delivery protocol, First Contact protocol, RAPID protocol, and FRESH protocol) among the six different categories of routing protocols of opportunistic networks (flooding-based routing protocols, forwarding-based routing protocols, probability-based routing protocols, knowledge-based routing protocols, social relationship-based routing protocols, and hybrid routing protocols) over eight different QoS parameters (number of participating nodes, message delivered, message dropped, delivery probability, overhead ratio, average latency, average hop count, and average buffer time) have been thoroughly explored in this paper. Besides it, some protocols are observed superior in particular cases of node density concerning mentioned QoS parameters. A comprehensive evaluation of the suitability of routing protocols over node density has been prepared in Table 4 based on our simulation study.

(1)Epidemic protocol: it is a simple protocol that replicates the maximum message to be forwarded. It provides the best delivery probability in case of node density of populated environment and its average buffer time reduces as the node density increases.(2)Spray-and-Wait protocol: it must be termed as the finest routing protocol along with FRESH routing protocol among all discussed protocols in this paper. It delivers good performance and proved as a better option in all varieties of node density. It is also found better than FRESH protocol based on the criteria of overhead ratio, average hop count, message delivered, and delivery probability.(3)Direct Delivery protocol: it is the simplest protocol OppNet can have. It is a good protocol up to the node density of 400 nodes per square km. It provides zero packet drop and average delivery probability throughout all node densities.(4)First Contact protocol: First Contact protocol is suited well in node density ranging from 6 to 25 nodes per square kilometer. Packet dropping and high delays are some problems that arise in this protocol when node density increases.(5)PRoPHET protocol: PRoPHET protocol functions of the basis of the history of encounters and transitivity. Due to this feature, it achieves high delivery probability as compared to many traditional protocols. Like Epidemic, its average buffer time reduces as the node density increases.(6)MaxProp protocol: the primary objective of this protocol is to improvise delivery rate and average latency. It functions by ranking the stored packets in nodes’ memory on the ground of cost assigned. It is proved a good choice in almost all categories of node densities in opportunistic networks.(7)Epidemic Oracle protocol: it falls under knowledge-based routing protocols as it maintains a knowledge database of all participating nodes in the entire opportunistic networks which makes it a good option for Sparse Opportunistic Network Environment. But its performance degrades when the number of nodes increases due to the overhead of knowledge database.(8)FRESH protocol: it is also the finest routing protocol along with Spray-and-Wait routing protocol in every case of node density discussed here. When compared to the Spray-and-Wait protocol, FRESH protocol is found better on the criteria of the number of messages dropped, average latency, and average buffer time.(9)RAPID protocol: this protocol uses utility function to assign utility value to every message on the ground of average delay parameter which helps it to perform well in every situation, but it is proved a good choice only for the extremely sparse and sparse environment when compared to the other routing protocols discussed in this paper.

It has been experimentally observed that two of the routing protocols (Spray-and-Wait and FRESH protocols) are found finest in every instance of node density. However, these routing protocols are leading as well as lagging to each other based on individual QoS parameters. The comparative performances of the two finest emerged protocols have been presented along with QoS metrics in Table 5.

From the observations made from Table 5, it can be summarized that Spray-and-Wait and FRESH protocols are exhibiting their best performance on different QoS metrics. However, due to the absence of common QoS parameters, it is hard to declare one protocol to be best among the discussed protocols on the mentioned criteria, but, for making a viable conclusion, one protocol must be declared as the best one.

To cope up with this problem, the importance of individual QoS metric must be evaluated based on its suitability for the best performance under Smart Space Environment. Literature survey [65, 66] reveals the fact that certain QoS metrics such as message dropped, average latency, and average buffer time are of significant importance for accurate and fast delivery with least additional storage requirement other than data packet to be transmitted which is an ideal condition for receiving best results in Smart Space Environment. In light of this fact, it can be stated that FRESH protocol is optimally suited to Smart Space Environment.

6. Conclusion and Future Scope

This paper in depth explores various routing protocols of opportunistic networks which can be used for establishing Smart Spaces. It also discusses in detail various simulation trends prevailing in the arena of opportunistic networks. The protocols are thereafter compared based on node density to determine the best-suited protocol for building Smart Spaces in the given simulation environment. The paper concludes with the fact that Spray-and-Wait outperforms the FRESH protocol by giving better results on the 5 standard QoS parameters. However, with the eye and muscle of Smart Space Environment, the paper also highlights the fact that certain QoS metrics such as message dropped, average latency, and average buffer Time are of significant importance for getting the best outcome in Smart Space Environment. Therefore, FRESH protocol must be considered as the best routing protocol suited for Smart Spaces Environment.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this article.

Acknowledgments

The simulation work of this paper was carried out in the Research Lab of J. C. Bose University of Science and Technology YMCA, Faridabad, Haryana, India. The authors are thankful to J. C. Bose University of Science and Technology YMCA, Faridabad, Haryana, India for permitting them to use the Lab Facilities. The authors are also thankful to the National Council for Scientific and Technological Development (CNPq) for the support received via grant no. 305805/2017-7.

References

L. Wood, W. M. Eddy, W. Ivancic, J. McKim, and C. Jackson, “Saratoga: a delay-tolerant networking convergence layer with efficient link utilization,” in Proceedings of the 2007 International Workshop on Satellite and Space Communications, pp. 168–172, IEEE, Salzburg, Austria, September 2007.
View at: Publisher Site | Google Scholar
S.-L. Shaw and D. Sui, “Understanding the new human dynamics in smart spaces and places: toward a splatial framework,” Annals of the American Association of Geographers, vol. 110, no. 2, pp. 339–348, 2020.
View at: Publisher Site | Google Scholar
A. Socievole, A. Caputo, F. De Rango, and P. Fazio, “Routing in mobile opportunistic social networks with selfish nodes,” Wireless Communications and Mobile Computing, vol. 2019, Article ID 6359806, 15 pages, 2019.
View at: Publisher Site | Google Scholar
J. Shu, J. Xiong, L. Xu, X. Geng, and L. Liu, “An improved opportunistic sensor networks connectivity monitoring model based on network connectivity,” in China Conference on Wireless Sensor Networks, pp. 64–76, Springer, Singapore, 2018.
View at: Google Scholar
A. Bujari, S. Gaito, D. Maggiorini, C. E. Palazzi, and C. Quadri, “Delay tolerant networking over the metropolitan public transportation,” Mobile Information Systems, vol. 2016, Article ID 8434109, 14 pages, 2016.
View at: Publisher Site | Google Scholar
V. Kushwaha and R. Gupta, “Delay tolerant networks: architecture, routing, congestion, and security issues,” in Handbook of Research on Cloud Computing and Big Data Applications in IoT, pp. 448–480, IGI Global, Hershey, PA, USA, 2019.
View at: Google Scholar
S. Prabhavat, W. Narongkhachavana, T. Thongthavorn, and C. Phankaew, “Low overhead localized routing in mobile ad hoc networks,” Wireless Communications and Mobile Computing, vol. 2019, Article ID 9652481, 15 pages, 2019.
View at: Publisher Site | Google Scholar
J. Molina-Gil, P. Caballero-Gil, and C. Caballero-Gil, “Comparative study of cooperation tools for mobile ad hoc networks,” Mobile Information Systems, vol. 2016, Article ID 3435674, 9 pages, 2016.
View at: Publisher Site | Google Scholar
S. H. Ahmed, A. K. Bashir, M. Elhoseny, W. Guibene, and S. H. Bouk, “Research on efficient data forwarding in vehicular networks,” Mobile Information Systems, vol. 2019, Article ID 2353478, 2 pages, 2019.
View at: Publisher Site | Google Scholar
H. Patel, D. Singh Rajput, G. Thippa Reddy, C. Iwendi, A. Kashif Bashir, and O. Jo, “A review on classification of imbalanced data for wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 16, no. 4, 2020.
View at: Publisher Site | Google Scholar
A. K. Bashir, A. H. Akbar, S. A. Chaudhary, C. S. Hussain, and K. H. Kim, “Collaborative detection and agreement protocol for routing malfunctioning in wireless sensor networks,” in Proceedings of the 2006 8th International Conference Advanced Communication Technology, vol. 1, pp. 327–332, IEEE, Phoenix Park, South Korea, February 2006.
View at: Publisher Site | Google Scholar
A. Nayyar, R. S. Batth, D. B. Ha, and G. Sussendran, “Opportunistic networks: present scenario-a mirror review,” International Journal of Communication Networks and Information Security, vol. 10, no. 1, pp. 223–241, 2018.
View at: Google Scholar
A. U. H. Yasar, H. Malik, and Z. Khan, “Mobile sensor networks applications and confidentiality,” Mobile Information Systems, vol. 2015, Article ID 893438, 2 pages, 2015.
View at: Publisher Site | Google Scholar
M. Cobos, F. Antonacci, A. Mouchtaris, and B. Lee, “Wireless acoustic sensor networks and applications,” Wireless Communications and Mobile Computing, vol. 2017, Article ID 1085290, 3 pages, 2017.
View at: Publisher Site | Google Scholar
V. Kuppusamy, U. Thanthrige, A. Udugama, and A. Förster, “Evaluating forwarding protocols in opportunistic networks: trends, advances, challenges and best practices,” Future Internet, vol. 11, no. 5, p. 113, 2019.
View at: Publisher Site | Google Scholar
S. Shelke and B. Aksanli, “Static and dynamic activity detection with ambient sensors in smart spaces,” Sensors, vol. 19, no. 4, p. 804, 2019.
View at: Publisher Site | Google Scholar
C. R. Lynch and V. J. Del Casino Jr., “Smart spaces, information processing, and the question of intelligence,” Annals of the American Association of Geographers, vol. 110, no. 2, pp. 382–390, 2020.
View at: Publisher Site | Google Scholar
F. Al-Turjman, “5G-enabled devices and smart-spaces in social-IoT: an overview,” Future Generation Computer Systems, vol. 92, pp. 732–744, 2019.
View at: Publisher Site | Google Scholar
M. Samaniego, C. Espana, and R. Deters, “Suspicious transactions in smart spaces,” 2019, https://arxiv.org/abs/1909.10644.
View at: Google Scholar
F. Alrimawi, L. Pasquale, and B. Nuseibeh, “On the automated management of security incidents in smart spaces,” IEEE Access, vol. 7, pp. 111513–111527, 2019.
View at: Publisher Site | Google Scholar
E. Ismagiloiva, L. Hughes, N. Rana, and Y. Dwivedi, “Role of smart cities in creating sustainable cities and communities: a systematic literature review,” in International Working Conference on Transfer and Diffusion of IT, pp. 311–324, Springer, Cham, Switzerland, 2019.
View at: Google Scholar
S. A. Al Ayyat, S. G. Aly, and K. A. Harras, “On integrating space syntax metrics with social-aware opportunistic forwarding,” in Proceedings of the 2019 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1–7, IEEE, Marrakesh, Morocco, April 2019.
View at: Publisher Site | Google Scholar
L. M. Funes, , Systems and methods for smart spaces, U.S. Patent No. 10168677, U.S. Patent and Trademark Office, Washington, DC, USA, 2019.
M. Gelsomini, G. Leonardi, and F. Garzotto, “Embodied learning in immersive smart spaces,” in Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems, pp. 1–14, Honolulu, HI, USA, April 2020.
View at: Google Scholar
J. W. Lee and S. Helal, “Context awareness computing in smart spaces using stochastic analysis of sensor data,” in Advances in Intelligent Systems and Computing, pp. 3–9, Springer, Cham, Switzerland, 2019.
View at: Publisher Site | Google Scholar
S. E. Loudari and N. Benamar, “Effects of selfishness on the Energy consumption in opportunistic networks: a performance assessment,” in Proceedings of the 2019 International Conference on Wireless Technologies, Embedded and Intelligent Systems (WITS), pp. 1–7, IEEE, Fez, Morocco, April 2019.
View at: Publisher Site | Google Scholar
M. Saloni, C. Julien, A. L. Murphy, and G. P. Picco, “Lasso: a device-to-device group monitoring service for smart cities,” in Proceedings of the 2017 International Smart Cities Conference (ISC2), pp. 1–6, IEEE, Wuxi, China, September 2017.
View at: Publisher Site | Google Scholar
T. Small and Z. J. Haas, “The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way),” in Proceedings of the 4th ACM International Symposium on Mobile ad Hoc Networking & Computing, pp. 233–244, ACM, Annapolis, MD, USA, June 2003.
View at: Google Scholar
C. Detweiller, I. Vasilescu, and D. Rus, “An underwater sensor network with dual communications, sensing, and mobility,” in Proceedings of the Oceans 2007-Europe, pp. 1–6, IEEE, Aberdeen, UK, June 2007.
View at: Publisher Site | Google Scholar
M. Martonosi, The Princeton Zebranet Project: Sensor Networks for Wildlife Tracking, Princeton University, Princeton, NJ, USA, 2004.
C. Papadaki, T. Kärkkäinen, and J. Ott, “Composable distributed mobile applications and services in opportunistic networks,” in Proceedings of the 2018 IEEE 19th International Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM), pp. 14–23, IEEE, Chania, Greece, June 2018.
View at: Publisher Site | Google Scholar
V. G. Menon and P. J. Prathap, “Comparative analysis of opportunistic routing protocols for underwater acoustic sensor networks,” in Proceedings of the 2016 International Conference on Emerging Technological Trends (ICETT), pp. 1–5, IEEE, Kollam, India, October 2016.
View at: Publisher Site | Google Scholar
Z. Rahman, F. Hashim, M. F. A. Rasid, and M. Othman, “Totally opportunistic routing algorithm (TORA) for underwater wireless sensor networks,” PLoS One, vol. 13, no. 6, Article ID e0197087, 2018.
View at: Publisher Site | Google Scholar
https://www.airbornewirelessnetwork.com/index.asp#advantages.
https://www.nasa.gov/mission_pages/station/research/experiments/explorer/Investigation.html?#id=717.
M. Zhou, Q. Liang, H. Wu, W. Meng, and K. Xu, “Wireless sensor networks for smart communications,” Wireless Communications and Mobile Computing, vol. 2018, Article ID 4727385, 2 pages, 2018.
View at: Publisher Site | Google Scholar
M. Xie, Y. Bai, Z. Hu, and C. Shen, “Weight-aware sensor deployment in wireless sensor networks for smart cities,” Wireless Communications and Mobile Computing, vol. 2018, Article ID 5913836, 15 pages, 2018.
View at: Publisher Site | Google Scholar
T. Gautam and A. Dev, “Opportunistic network routing protocols: challenges, implementation and evaluation,” in Proceedings of the 2019 9th International Conference on Cloud Computing, Data Science & Engineering (Confluence), pp. 100–106, Noida, India, January 2019.
View at: Publisher Site | Google Scholar
D. Chen, G. Navarro-Arribas, C. Pérez-Solà, and J. Borrell, “Message anonymity on predictable opportunistic networks,” Journal of Ambient Intelligence and Humanized Computing, vol. 10, pp. 1–14, 2019.
View at: Publisher Site | Google Scholar
T. E. Amah, M. Kamat, K. Abu Bakar, W. Moreira, A. Oliveira Jr., and M. A. Batista, “Preparing opportunistic networks for smart cities: collecting sensed data with minimal knowledge,” Journal of Parallel and Distributed Computing, vol. 135, pp. 21–55, 2020.
View at: Publisher Site | Google Scholar
V. Juyal, N. Pandey, and R. Saggar, “Impact of varying buffer space for routing protocols in delay tolerant networks,” in Proceedings of the 2016 International Conference on Communication and Signal Processing (ICCSP), pp. 2152–2156, IEEE, Melmaruvathur, India, April 2016.
View at: Publisher Site | Google Scholar
A. Vahdat and D. Becker, “Epidemic routing for partially connected Ad Hoc networks,” 2000.
View at: Google Scholar
T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Single-copy routing in intermittently connected mobile networks,” in Proceedings of the 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004, pp. 235–244, IEEE, Santa Clara, CA, USA, October 2004.
View at: Publisher Site | Google Scholar
T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking—WDTN’05, pp. 252–259, ACM, Philadelphia, PA, USA, August 2005.
View at: Google Scholar
P. Dwivedi and R. S. Pippal, “Performance evaluation of spray and wait DTN routing protocol under different mobility models,” Journal of the Gujarat Research Society, vol. 21, no. 16, pp. 186–192, 2019.
View at: Google Scholar
S. Jain, K. Fall, and R. Patra, “Routing in a delay tolerant network,” ACM SIGCOMM Computer Communication Review, vol. 34, no. 4, pp. 145–158, 2004.
View at: Publisher Site | Google Scholar
A. Lindgren, A. Doria, and O. Schelén, “Probabilistic routing in intermittently connected networks,” in Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc, Annapolis, MD, USA, June 2003.
View at: Google Scholar
J. Burgess, B. Gallagher, D. D. Jensen, and B. N. Levine, “MaxProp: routing for vehicle-based disruption-tolerant networks,” in Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, vol. 6, Barcelona, Spain, April 2006.
View at: Publisher Site | Google Scholar
H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, “Age matters: efficient route discovery in mobile ad hoc networks using encounter ages,” in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 257–266, ACM, Annapolis, MD, USA, June 2003.
View at: Google Scholar
A. Balasubramanian, B. Levine, and A. Venkataramani, “DTN routing as a resource allocation problem,” ACM SIGCOMM Computer Communication Review, vol. 37, no. 4, pp. 373–384, 2007.
View at: Publisher Site | Google Scholar
N. Papanikos, D. G. Akestoridis, and E. Papapetrou, “Adyton: a network simulator for opportunistic networks,” 2015.
View at: Google Scholar
R. I. Ciobanu, R. C. Marin, and C. Dobre, “Mobemu: a framework to support decentralized ad-hoc networking,” in Modeling and Simulation in HPC and Cloud Systems, pp. 87–119, Springer, Cham, Switzerland, 2018.
View at: Google Scholar
G. F. Riley and T. R. Henderson, “The ns-3 network simulator,” in Modeling and Tools for Network Simulation, pp. 15–34, Springer, Berlin, Heidelberg, 2010.
View at: Google Scholar
A. Varga, “The OMNeT++ discrete event simulation system,” in Proceedings of the European Simulation Multiconference, Prague, Czech Republic, June 2001.
View at: Google Scholar
A. Udugama, A. Förster, J. Dede, and V. Kuppusamy, “Simulating opportunistic networks with omnet++,” in Recent Advances in Network Simulation, pp. 425–449, Springer, Cham, Switzerland, 2019.
View at: Google Scholar
A. Keränen, J. Ott, and T. Kärkkäinen, “The ONE simulator for DTN protocol evaluation,” in Proceedings of the 2nd International Conference on Simulation Tools and Techniques, p. 55, Rome, Italy, March 2009.
View at: Google Scholar
P. Yuan and M. Song, “MONICA one simulator for mobile opportunistic,” in Proceedings of the 11th EAI International Conference on Mobile Multimedia Communications, pp. 21–32, Qingdao, China, September 2018.
View at: Google Scholar
S. Saha, R. Verma, S. Saika, P. S. Paul, and S. Nandi, “e-ONE: enhanced ONE for simulating challenged network scenarios,” Journal of Networks, vol. 9, no. 12, p. 3290, 2014.
View at: Publisher Site | Google Scholar
S. Babu, G. Jain, and B. S. Manoj, “Urban delay tolerant network simulator (UDTNSim v0. 1),” 2017, https://arxiv.org/abs/1709.05645.
View at: Google Scholar
S. B. M. Baskaran, G. Raja, A. K. Bashir, and M. Murata, “QoS-aware frequency-based 4G+ relative authentication model for next generation LTE and its dependent public safety networks,” IEEE Access, vol. 5, pp. 21977–21991, 2017.
View at: Publisher Site | Google Scholar
M. Cuka, D. Elmazi, K. Bylykbashi, E. Spaho, M. Ikeda, and L. Barolli, “Implementation and performance evaluation of two fuzzy-based systems for selection of IoT devices in opportunistic networks,” Journal of Ambient Intelligence and Humanized Computing, vol. 10, no. 2, pp. 519–529, 2019.
View at: Publisher Site | Google Scholar
E. Spaho, K. Dhoska, K. Bylykbashi, L. Barolli, V. Kolici, and M. Takizawa, “Performance evaluation of routing protocols in DTNs considering different mobility models,” in Advances in Intelligent Systems and Computing, pp. 205–214, Springer, Cham, Switzerland, 2019.
View at: Publisher Site | Google Scholar
M. W. Kang, D. Y. Seo, and Y. W. Chung, “An efficient opportunistic routing protocol for ICN,” in Proceedings of the 6th ACM Conference on Information-Centric Networking, pp. 159-160, Macao, China, September 2019.
View at: Google Scholar
J. Gandhi and Z. Narmawala, “Fair comparative analysis of opportunistic routing protocols: an empirical study,” in Data Communication and Networks, pp. 285–294, Springer, Singapore, 2020.
View at: Google Scholar
H. Liu, H. Ning, Q. Mu et al., “A review of the smart world,” Future Generation Computer Systems, vol. 96, pp. 678–691, 2019.
View at: Publisher Site | Google Scholar
K. Rook, B. Witt, R. Bailey, J. Geigel, P. Hu, and A. Kothari, “A study of user intent in immersive smart spaces,” in Proceedings of the 2019 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops), pp. 227–232, IEEE, Kyoto, Japan, March 2019.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2020 Puneet Garg et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1055

Downloads

758

Citations