Blockchain Advances and Security Practices in WSN, CRN, SDN, Opportunistic Mobile Networks, Delay Tolerant Networks

2021 ◽  
pp. 1-34
Author(s):  
Eranda Harshanath Jayatunga ◽  
Pasika Sashmal Ranaweera ◽  
Indika Anuradha Mendis Balapuwaduge
Keyword(s):  
Mobile Networks ◽  
Performance Standards ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Security And Privacy ◽  
Smart Devices ◽  
Blockchain Technology ◽  
Security Practices ◽  
Opportunistic Mobile Networks ◽  
Delay Tolerant

The internet of things (IoT) is paving a path for connecting a plethora of smart devices together that emerges from the novel 5G-based applications. This evident heterogeneity invites the integration of diverse technologies such as wireless sensor networks (WSNs), software-defined networks (SDNs), cognitive radio networks (CRNs), delay tolerant networks (DTNs), and opportunistic networks (oppnets). However, the security and privacy are prominent conundrums due to featured compatibility and interoperability aspects of evolving directives. Blockchain is the most nascent paradigm instituted to resolve the issues of security and privacy while retaining performance standards. In this chapter, advances of blockchain technology in aforesaid networks are investigated and presented as means to be followed as security practices for pragmatically realizing the concepts.

Delay Tolerant Networks

2019 ◽  
pp. 448-480 ◽  
Author(s):  
Vandana Kushwaha ◽  
Ratneshwer Gupta
Keyword(s):  
Vehicular Networks ◽  
Low Cost ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Data Packets ◽  
Security Issues ◽  
Terrestrial Environments ◽  
Routing Congestion ◽  
Delay Tolerant

Opportunistic networks are one of the emerging evolutions of the network system. In opportunistic networks, nodes are able to communicate with each other even if the route between source to destination does not already exist. Opportunistic networks have to be delay tolerant in nature (i.e., able to tolerate larger delays). Delay tolerant network (DTNs) uses the concept of “store-carry-forward” of data packets. DTNs are able to transfer data or establish communication in remote area or crisis environment where there is no network established. DTNs have many applications like to provide low-cost internet provision in remote areas, in vehicular networks, noise monitoring, extreme terrestrial environments, etc. It is therefore very promising to identify aspects for integration and inculcation of opportunistic network methodologies and technologies into delay tolerant networking. In this chapter, the authors emphasize delay tolerant networks by considering its architectural, routing, congestion, and security issues.

scholarly journals A Hypergraph-Based Blockchain Model and Application in Internet of Things-Enabled Smart Homes

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2784 ◽  
Author(s):  
Chao Qu ◽  
Ming Tao ◽  
Ruifen Yuan
Keyword(s):  
Internet Of Things ◽  
Data Storage ◽  
Smart Homes ◽  
Security And Privacy ◽  
Smart Devices ◽  
Security Issues ◽  
Blockchain Technology ◽  
Security Problem ◽  
Fast Development ◽  
Privacy Issues

With the fast development and expansion of the Internet of Things (IoT), billions of smart devices are being continuously connected, and smart homes, as a typical IoT application, are providing people with various convenient applications, but face security and privacy issues. The idea of Blockchain (BC) theory has brought about a potential solution to the IoT security problem. The emergence of blockchain technology has brought about a change of decentralized management, providing an effective solution for the protection of network security and privacy. On the other hand, the smart devices in IoT are always lightweight and have less energy and memory. This makes the application of blockchain difficult. Against this background, this paper proposes a blockchain model based on hypergraphs. The aims of this model are to reduce the storage consumption and to solve the additional security issues. In the model, we use the hyperedge as the organization of storage nodes and convert the entire networked data storage into part network storage. We discuss the design of the model and security strategy in detail, introducing some use cases in a smart home network and evaluating the storage performance of the model through simulation experiments and an evaluation of the network.

scholarly journals Characterizing Pairwise Social Relationships Quantitatively: Interest-Oriented Mobility Modeling for Human Contacts in Delay Tolerant Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Jiaxu Chen ◽  
Yazhe Tang ◽  
Chengchen Hu ◽  
Guijuan Wang
Keyword(s):  
Social Relationships ◽  
Mobile Networks ◽  
Human Mobility ◽  
Synthetic Data ◽  
Delay Tolerant Networks ◽  
Mobility Model ◽  
Interaction Matrix ◽  
Mobility Modeling ◽  
The Social ◽  
Delay Tolerant

Human mobility modeling has increasingly drawn the attention of researchers working on wireless mobile networks such as delay tolerant networks (DTNs) in the last few years. So far, a number of human mobility models have been proposed to reproduce people’s social relationships, which strongly affect people’s daily life movement behaviors. However, most of them are based on the granularity of community. This paper presents interest-oriented human contacts (IHC) mobility model, which can reproduce social relationships on a pairwise granularity. As well, IHC provides two methods to generate input parameters (interest vectors) based on the social interaction matrix of target scenarios. By comparing synthetic data generated by IHC with three different real traces, we validate our model as a good approximation for human mobility. Exhaustive experiments are also conducted to show that IHC can predict well the performance of routing protocols.

scholarly journals Towards Intelligent Caching and Retrieval Mechanisms for Upcoming Proposals on Vehicular Delay-Tolerant Networks

2011 ◽  
Vol 7 (1) ◽  
pp. 1 ◽  
Author(s):  
Bruno M. C. Silva ◽  
Vasco N. G. J. Soares ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Network Performance ◽  
Ad Hoc ◽  
Storage Capacity ◽  
State Of The Art ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Network Nodes ◽  
Intermittent Connectivity ◽  
Delay Tolerant ◽  
Carry And Forward

Vehicular delay-tolerant networks (VDTNs) are opportunistic networks that enable connectivity in challenged scenarios with unstable links where end-to-end communications may not exist. VDTN architecture handles non-real timeapplications using vehicles to relay messages between network nodes. To address the problem of intermittent connectivity, network nodes store messages on their buffers, carrying them through the network while waiting for transfer opportunities. The storage capacity of the nodes affects directly the network performance. Therefore, it is important to incorporate suitable network protocols using self-contained messages to improve communication that supports store-carry-and-forward operation procedures. Clearly, such procedures motivate content cachingand retrieval. This paper surveys the state-of-the art on intelligent caching and retrieval mechanisms focusing on ad-hoc and delay tolerant networks (DTN). These approaches can offer important insights for upcoming proposals on intelligent caching and retrieval mechanisms for VDTNs.

scholarly journals Cost-efficient dynamic quota-controlled routing in multi-community delay-tolerant networks

2018 ◽  
Vol 14 (5) ◽  
pp. 155014771877622 ◽  
Author(s):  
Jiagao Wu ◽  
Yue Ma ◽  
Linfeng Liu
Keyword(s):  
Genetic Algorithm ◽  
Social Relationships ◽  
Mobile Networks ◽  
Delay Tolerant Networks ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Delivery Probability ◽  
Cost Efficient ◽  
Delay Tolerant ◽  
The Given

Delay-tolerant networks are novel wireless mobile networks, which are characterized with high latency and frequent disconnectivity. Besides, people carrying mobile devices form a lot of communities because of similar interests and social relationships. How to improve the routing efficiency in multi-community scenarios has become one of the research hot spots in delay-tolerant networks. In this article, we present a network model of the multi-community delay-tolerant networks and formulate a dynamic quota-controlled routing problem of minimizing the average number of copies of a message that satisfies the required delivery probability under the given time-to-live of the message as a nonlinear optimization problem. To solve this problem, we propose an improved genetic algorithm called genetic algorithm for delivery probability and time-to-live optimization for the dynamic quota-controlled routing scheme to reduce the routing cost further. In addition, a cost-efficient dynamic quota-controlled routing protocol based on genetic algorithm for delivery probability and time-to-live optimization is proposed, which can dynamically adjust message copies according to its assigned delivery probability and time-to-live in different communities on the shortest path. Both the numerical and simulation results show that our routing with the proposed algorithm is more cost efficient.

scholarly journals A Fuzzy-Logic-Based Double Q -Learning Routing in Delay-Tolerant Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Jiagao Wu ◽  
Fan Yuan ◽  
Yahang Guo ◽  
Hongyu Zhou ◽  
Linfeng Liu
Keyword(s):  
Fuzzy Logic ◽  
Mobile Networks ◽  
Learning Algorithm ◽  
Buffer Management ◽  
Delay Tolerant Networks ◽  
Movement Speed ◽  
Delivery Ratio ◽  
Node Activity ◽  
Intermittent Connectivity ◽  
Delay Tolerant

Delay-tolerant networks (DTNs) are wireless mobile networks, which suffer from frequent disruption, high latency, and lack of a complete path from source to destination. The intermittent connectivity in DTNs makes it difficult to efficiently deliver messages. Research results have shown that the routing protocol based on reinforcement learning can achieve a reasonable balance between routing performance and cost. However, due to the complexity, dynamics, and uncertainty of the characteristics of nodes in DTNs, providing a reliable multihop routing in DTNs is still a particular challenge. In this paper, we propose a Fuzzy-logic-based Double Q -Learning Routing (FDQLR) protocol that can learn the optimal route by combining fuzzy logic with the Double Q -Learning algorithm. In this protocol, a fuzzy dynamic reward mechanism is proposed, and it uses fuzzy logic to comprehensively evaluate the characteristics of nodes including node activity, contact interval, and movement speed. Furthermore, a hot zone drop mechanism and a drop mechanism are proposed, which can improve the efficiency of message forwarding and buffer management of the node. The simulation results show that the fuzzy logic can improve the performance of the FDQLR protocol in terms of delivery ratio, delivery delay, and overhead. In particular, compared with other related routing protocols of DTNs, the FDQLR protocol can achieve the highest delivery ratio and the lowest overhead.

scholarly journals On the Performance of Delay-Tolerant Routing Protocols in Intermittently Connected Mobile Networks

2015 ◽  
Vol 43 ◽  
pp. 29-38 ◽  
Author(s):  
Md. Sharif Hossen ◽  
Muhammad Sajjadur Rahim
Keyword(s):  
Mobile Networks ◽  
Routing Protocols ◽  
Performance Metrics ◽  
Delay Tolerant Networks ◽  
Buffer Size ◽  
Mobile Nodes ◽  
Dtn Routing ◽  
Delay Tolerant ◽  
Spray And Wait ◽  
Intermittently Connected

Delay-Tolerant Networks are used to enable communication in challenging environments where nodes are intermittently connected, and an end-to-end path does not exist all the time between source and destination, e.g., Intermittently Connected Mobile Networks (ICMNs). Therefore, network environments, where the nodes are characterized by opportunistic connectivity, are appropriately modeled as Delay-Tolerant Networks (DTNs). In this paper, we have investigated the performance of DTN routing protocols, namely Epidemic, PRoPHET, and Spray-and-Wait (Binary version) in an ICMN scenario. Their performances are analyzed in terms of delivery probability, average latency, and overhead ratio of varying message generation rates and number of mobile nodes, respectively. In addition, the impacts of varying buffer size and Time-to-Live (TTL) on their performances are investigated. For evaluating these performance metrics, we have used Opportunistic Network Environment (ONE) simulator as the simulation tool. The outcome of this work shows that for the ICMN scenario, the best DTN routing technique is Binary Spray-and-Wait, whereas Epidemic routing exhibits the worst performance in terms of all the metrics considered here.

scholarly journals Non-dominated Sorting Genetic Algorithm-II for Throwbox Deployment in Delay Tolerant Networks

2019 ◽  
Vol 8 (4) ◽  
pp. 7475-7479
Keyword(s):  
Genetic Algorithm ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Transmission Range ◽  
Message Delivery ◽  
Average Delay ◽  
Optimal Deployment ◽  
Simulation Results ◽  
Delay Tolerant ◽  
Carry And Forward

Delay-tolerant networks (DTNs) are basically opportunistic networks and uses store-carry-and-forward switching for message forwarding. Performance of DTNs can be improved by placing stationary nodes, called throwboxes which increases the contact opportunities among nodes. Throwbox is viewed as relaying node and the message delivery is enhanced by spreading as many messages as possible. Increasing the contact opportunities in throwbox based DTN model depends on the deployment of throwboxes in suitable places. The objective of this paper is to identify optimal deployment locations of the throwboxes with a pre-specified transmission range, and to maximize the coverage of all the throwboxes in order to increase average delivery and to reduce the average delay among all the nodes in the network. We use Non-Dominated Sorting Genetic Algorithm–II for optimizing the deployment of throwboxes in DTN. The simulation results are analyzed for better strategy in deploying throwboxes and to improve the performance of throwbox-augmented DTNs.

scholarly journals Performance Evaluation of Social Routing Protocols Based on the Effect of Delivery Ratio and Average Hop Count in Delay-tolerant Networks (DTN)

2019 ◽  
Vol 4 (12) ◽  
pp. 155-158
Author(s):  
Sujan Chandra Roy ◽  
Farhana Enam ◽  
Md. Ashraful Islam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Destination Node ◽  
Delivery Ratio ◽  
Hop Count ◽  
Message Transmission ◽  
Delay Tolerant

Delay-Tolerant Networks (DTNs) are part of Opportunistic networks. In the case of opportunistic networks, the joined node of a network can have zero or partial knowledge about other nodes in a network. For this reason, the evident information towards the nodes in the existing network is most difficult to collect for forwarding the message. The application of Opportunistic networks is where have a high tolerance for long delays, high error rate, etc. DTNs are also sparse dynamic Ad-hoc networks were source to destination path does not present all-time for successfully message transmission. As DTN has no end-to-end path for message transmission source to destination node so, the routing design is so sophisticated. The social-based routing protocol is developed to improve the routing mechanism by focusing on social behavior and the interaction with the nodes of a network. Consequently, the performance analysis of existing several DTN routing protocols represents a significant role in designing or developing a new routing protocol for a specific scenario. This article investigates the execution of ordinary routing protocols of DTNs such as Epidemic, Binary Spray and Wait (BSNW), including two social-based routing protocols such as Scorp and dLife using Opportunistic Network Environment (ONE) simulator. The performance of these routing protocols is measured based on delivery ratio and average hop count with inevitable simulation settings. From the simulation result, it is condensed that for higher delivery ratio, BSNW is best, and for average hop count, dLife is the best routing protocol.  

Sign in / Sign up

Export Citation Format

Share Document