This page has only limited features, please log in for full access.
Vehicular delay tolerant network (VDTN) technology uses vehicles on the road as moving nodes to deliver data from source to destination using several intermediate nodes. Efficient data dissemination in VDTN is a difficult problem due to existing trade-offs between several metric variables such as delivery ratio, delay, and overhead ratio. Inclusion of important social network parameters (like community, social strength, trust, friendship, and selfishness) in computation of forwarding probability may help to improve the performance of a routing algorithm. However, different tuning of these parameters results in different outcomes for the metric variables. A proper balancing of these parameters may result in an optimized outcome solving the trade-off between the metric variables. Nonetheless, dependency of the variables on a number of social network parameters and their mutual trade-offs makes this a non-trivial optimization problem. In this paper, we propose a novel approach to optimize these trade-offs using multi-objective particle swarm optimization (MOPSO). The proposed approach provides a set of pareto-optimal solutions also known as non-dominating solutions. Further, based on the requirements of a target application scenario, a specific optimal solution out of the pareto-optimal solution set is delivered using artificial intelligence (AI) technique. The proposed methodology is simulated in a VDTN scenario using the opportunistic network environment (ONE) simulator and Matlab. Furthermore, based on the experimental results, an exhaustive analysis is provided about how the metric variables are affected by the involvement of the social-based parameters. The capabilities of the proposed approach are validated using a statistical comparative analysis of the results. In future, the outcome of the study may play a helpful role to decide the priorities of the network parameters while designing new data dissemination algorithms for VDTN.
Vishakha Chourasia; Sudhakar Pandey; Sanjay Kumar. Optimizing the performance of vehicular delay tolerant networks using multi-objective PSO and artificial intelligence. Computer Communications 2021, 177, 10 -23.
AMA StyleVishakha Chourasia, Sudhakar Pandey, Sanjay Kumar. Optimizing the performance of vehicular delay tolerant networks using multi-objective PSO and artificial intelligence. Computer Communications. 2021; 177 ():10-23.
Chicago/Turabian StyleVishakha Chourasia; Sudhakar Pandey; Sanjay Kumar. 2021. "Optimizing the performance of vehicular delay tolerant networks using multi-objective PSO and artificial intelligence." Computer Communications 177, no. : 10-23.
In rural areas an ambulance carrying a patient may require to connect with experts in a city. In rural areas it is not possible that network connectivity to the ambulance available all the time. In this type of situation concept of delay-tolerant networks may be utilized for the opportunistic connectivity with a person at distance. Delay-Tolerant Network (DTN) is an approach to a wireless network, which possesses an uncertainty in the connection. Due to intermittent connectivity and long delays, routing in DTN turns out to be quite challenging. In recent years, many social-based routing reflects the capabilities of social attributes for disseminating data. In this paper social attributes namely, community, similarity, betweenness, and degree centrality are being used for outlining a routing technique. Using this approach we can improve the quality of service provided by the ambulances while passing through rural areas. A comparison is made with already proposed routing technique, for example, BUBBLE Rap, Epidemic, and experiences a noteworthy improvement in delivery ratio and buffer utilization.
Sanjay Kumar; Prasoon Shukla; Sudhakar Pandey. Data Dissemination Using Social-Based Attributes in Delay-Tolerant Networks. Lecture Notes in Bioengineering 2020, 231 -243.
AMA StyleSanjay Kumar, Prasoon Shukla, Sudhakar Pandey. Data Dissemination Using Social-Based Attributes in Delay-Tolerant Networks. Lecture Notes in Bioengineering. 2020; ():231-243.
Chicago/Turabian StyleSanjay Kumar; Prasoon Shukla; Sudhakar Pandey. 2020. "Data Dissemination Using Social-Based Attributes in Delay-Tolerant Networks." Lecture Notes in Bioengineering , no. : 231-243.
The Delay Tolerant Network paradigm was proposed to address communication issues in challenged environments where no end-to-end connectivity exists. DTN is called Opportunistic Network as intermediate node always looks for the best opportunity to relay a message from source to destination. In Vehicular Delay Tolerant networks, some nodes follow a fixed path while others follow a random path. In this paper, after the study and analysis of various protocols, a new protocol has been proposed by making changes in PRoPHET Routing Algorithm to maximize and improve the delivery probability and minimize the number of messages being dropped and the overhead ratio. A comparison has been provided between the original and proposed PRoPHET Algorithm.
Sanjay Kumar; Prernamayee Tripathy; Kartikey Dwivedi; Sudhakar Pandey. Improved Prophet Routing Algorithm for Opportunistic Networks. Inventive Computation and Information Technologies 2018, 303 -312.
AMA StyleSanjay Kumar, Prernamayee Tripathy, Kartikey Dwivedi, Sudhakar Pandey. Improved Prophet Routing Algorithm for Opportunistic Networks. Inventive Computation and Information Technologies. 2018; ():303-312.
Chicago/Turabian StyleSanjay Kumar; Prernamayee Tripathy; Kartikey Dwivedi; Sudhakar Pandey. 2018. "Improved Prophet Routing Algorithm for Opportunistic Networks." Inventive Computation and Information Technologies , no. : 303-312.
Recently, chaotic dynamics-based data encryption techniques for wired and wireless networks have become a topic of active research in computer science and network security such as robotic systems, encryption, and communication. The main aim of deploying a chaos-based cryptosystem is to provide encryption with several advantages over traditional encryption algorithms such as high security, speed, and reasonable computational overheads and computational power requirements. These challenges have motivated researchers to explore novel chaos-based data encryption techniques with digital logics dealing with hiding information for fast secure communication networks. This work provides an overview of how traditional data encryption techniques are revised and improved to achieve good performance in a secure communication network environment. A comprehensive survey of existing chaos-based data encryption techniques and their application areas are presented. The comparative tables can be used as a guideline to select an encryption technique suitable for the application at hand. Based on the limitations of the existing techniques, an adaptive chaos based data encryption framework of secure communication for future research is proposed
Piyush Kumar Shukla; Ankur Khare; Murtaza Abbas Rizvi; Shalini Stalin; Sanjay Kumar. Applied Cryptography Using Chaos Function for Fast Digital Logic-Based Systems in Ubiquitous Computing. Entropy 2015, 17, 1387 -1410.
AMA StylePiyush Kumar Shukla, Ankur Khare, Murtaza Abbas Rizvi, Shalini Stalin, Sanjay Kumar. Applied Cryptography Using Chaos Function for Fast Digital Logic-Based Systems in Ubiquitous Computing. Entropy. 2015; 17 (3):1387-1410.
Chicago/Turabian StylePiyush Kumar Shukla; Ankur Khare; Murtaza Abbas Rizvi; Shalini Stalin; Sanjay Kumar. 2015. "Applied Cryptography Using Chaos Function for Fast Digital Logic-Based Systems in Ubiquitous Computing." Entropy 17, no. 3: 1387-1410.