scholarly journals Modified Device Key Generation Algorithm and A* Algorithm to Optimize the Security Measures Based on Trust Value in Device-to-Device Communications

2021 ◽  
Author(s):  
Gayathri VM ◽  
Supraja p ◽  
Razia Sulthana A ◽  
Mukunthan P
Keyword(s):  
Communication Networks ◽  
Secure Communication ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Key Generation ◽  
Security Measures ◽  
Neighboring Node ◽  
Generation Algorithm ◽  
Trust Value ◽  
Qos Parameters

Abstract Security plays a vital role in communication networks. Since the nodes are mobile in Mobile Ad-hoc Networks (MANET), they are vulnerable to different types of attacks. Because of its mobility nature any node can enter the network at any time based on the coverage of the network. No centralized mechanism is found to verify or authenticate the nodes that are arriving/leaving the network. An algorithm is proposed for secure communication between source and destination based on the QoS parameters is called Modified Device Key Generation Algorithm (MDKGA). This algorithm elects an agent node based on the QoS parameters. Agent node is responsible for secure key generation and distribution of keys among the nodes. The neighboring node selection is based on trust value which acts as a heuristic function to select the node using A* algorithm.Various performance metrics are also analyzed. Comparison study has been carried out between the protocols of MANET.

Security, Privacy, and Trust for Pervasive Computing Applications

2016 ◽  
pp. 327-342
Author(s):  
Sheikh I. Ahamed ◽  
Mohammad Zulkernine ◽  
Munirul M. Haque
Keyword(s):  
Communication Networks ◽  
Pervasive Computing ◽  
Ad Hoc ◽  
Low Cost ◽  
Wireless Communication Networks ◽  
Security Measures ◽  
Embedded Devices ◽  
Trust Models ◽  
Networks Structure ◽  
Privacy Issues

Pervasive computing has progressed significantly during this decade due to the developments and advances in portable, low-cost, and light-weight devices along with the emergence of short range and low-power wireless communication networks. Pervasive computing focuses on combining computing and communications with the surrounding physical environment to make computing and communication transparent to the users in day-to-day activities. In pervasive computing, numerous, casually accessible, often invisible, frequently mobile or embedded devices form an ad-hoc network that occasionally connects to fixed networks structure too. These pervasive computing devices often collect information about the surrounding environment using various sensors. Pervasive computing has the inherent disadvantages of slow, expensive connections, frequent line disconnections, limited host bandwidth, location dependent data, and so forth. These challenges make pervasive computing applications more vulnerable to various security-related threats. However, traditional security measures do not fit well in pervasive computing applications. Since location and context are key attributes of pervasive computing applications, privacy issues need to be handled in a sophisticated manner. The devices in a pervasive computing network leave and join in an ad-hoc manner. This device behavior creates a need for new trust models for pervasive computing applications. In this chapter, we address the challenges and requirements of security, privacy, and trust for pervasive applications. We also discuss the state-of-the-art of pervasive security, privacy, and trust along with some open issues.

scholarly journals Simulation of the Performance Metrics for Securing DSDV Routing Protocol Based on Trusted Environments

2021 ◽  
Vol 2068 (1) ◽  
pp. 012047
Author(s):  
Chiang Ling Feng
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Secure Communication ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Optimal Performance ◽  
Security Mechanism ◽  
Expected Performance ◽  
Distance Vector ◽  
Simulation Results

Abstract To organize the network in an efficient way to minimize the risk of illegal node and to safeguard protected information, a security mechanism is required to secure communication. In addition, a security mechanism is also required to ensure that received information have not been tampered with. In this paper, a more efficient mechanism for Securing the Destination Sequenced Distance Vector Routing Protocol (SDSDV) is proposed. This paper comprehensively investigates the performance impacts by varying the number of maximum connections and mobility on securing the ad hoc network with Destination Sequenced Distance Vector Routing Protocol (DSDV) Routing Protocol. From simulation results, we explore the causes for performance degradation. Based on the investigation, we indicate that we have to impose restrictions on the maximum connections to acquire an expected performance. These results also reveal that the performance decreases with the increment of the mobility and maximum connections that is unequal to 60. If we want to obtain the optimal performance, the number of nodes in a network should be constrained to be 60 if the maximum connections are 60.

QoS and Performance Evaluation for SIP-Based VoIP Over DMO

2017 ◽  
pp. 80-114
Author(s):  
Mazin I. Alshamrani ◽  
Ashraf A. Ali
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Performance Metrics ◽  
Setup Time ◽  
Qos Parameters ◽  
Manet Routing ◽  
Voice Packets ◽  
And Performance ◽  
Voice Data ◽  
Termination Time

In this chapter, analyses for the performance metrics that define the quality of service (QoS) of SIP-based VoIP will be introduced. SIP-based VoIP applications over Direct Mode of Operation (DMO), which behaves in a way similar to Mobile Ad-hoc Network (MANET) systems, have three main performance categories related to the QoS. These categories are the SIP signaling, voice data transmission, and MANET routing. The SIP signaling controls the VoIP calls initiation, termination, and modifications. The major QoS parameters of VoIP that are managed by SIP signaling are the registration intervals, call setup time, and call termination time. These QoS parameters are increased in MANET due to the nodes' mobility that affects the routing calculations and the connectivity status. These necessitate mechanisms to reduce the delays in the MANET environment. The voice packets are transferred over the Real Time Protocol (RTP) which is encapsulated in the unreliable transport protocol using the User Datagram Protocol (UDP).

A Groundwork Based Novel Routing Protocol for Vehicular Ad hoc Networks

2017 ◽  
Vol 7 (11) ◽  
pp. 121
Author(s):  
Amolkirat Singh ◽  
Guneet Saini
Keyword(s):  
Routing Protocol ◽  
Packet Loss ◽  
Secure Communication ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Road Traffic ◽  
Traditional Approach ◽  
Unexpected Events ◽  
The Road ◽  
On The Road

Many people lose their life and/or are injured due to accidents or unexpected events taking place on road networks. Besides traffic jams, these accidents generate a tremendous waste of time and fuel. Undoubtedly, if the vehicles are provided with timely and dynamic information related to road traffic conditions, any unexpected events or accidents, the safety and efficiency of the transportation system with respect to time, distance, fuel consumption and environmentally destructive emissions can be improved. In the field of computer and information science, Vehicular Ad hoc Network (VANET) have recently emerged as an effective tool for improving road safety through propagation of warning messages among the vehicles in the network about potential obstacles on the road ahead. VANET is a research area which is in more demand among the researchers, the automobile industries and scientists to discover about the loopholes and advantages of the vehicular networks so that efficient routing algorithms can be developed which can provide reliable and secure communication among the mobile nodes.In this paper, we propose a Groundwork Based Ad hoc On Demand Distance Vector Routing Protocol (GAODV) focus on how the Road Side Units (RSU’s) utilized in the architecture plays an important role for making the communication reliable. In the interval of finding the suitable path from source to destination the packet loss may occur and the delay also is counted if the required packet does not reach the specified destination on time. So to overcome delay, packet loss and to increase throughput GAODV approach is followed. The performance parameters in the GAODV comes out to be much better than computed in the traditional approach.

scholarly journals An Integrated Credit-Based Incentive Protocol for Symbol-Level Network-Coded Cooperative Content Distribution among Vehicular Nodes

2018 ◽  
Vol 8 (11) ◽  
pp. 2035 ◽  
Author(s):  
Ing-Chau Chang ◽  
Chin-En Yen ◽  
Jacky Lo
Keyword(s):  
Ad Hoc ◽  
High Efficiency ◽  
Performance Metrics ◽  
Content Distribution ◽  
Long Latency ◽  
Distribution Process ◽  
Distribution Operations ◽  
The Difference ◽  
Different Content ◽  
Content Information

In traditional symbol-level network coding (SLNC)-based cooperative content distribution approaches, they ignore nodes in the vehicular ad hoc network (VANET) having various network-coded content pieces and distinct levels of interests and selfishness for different kinds of content data, which further prevents these vehicular nodes from forwarding their content information to other nodes. With these approaches, these nodes suffer from the low ratio and the long latency to receive all content information. In this paper, based on distinct levels of node interests and selfishness on different content information, we first categorize vehicular nodes into four classes, that is, the destination, intermediate, irrelevant and overhearing ones and then designate their associated credit-based incentive approaches. Second, we modify the flow of traditional SLNC-based cooperative content distribution operations and propose the content bitmap to realize the difference of network-coded content pieces among vehicular nodes. Further, we rigidly combine the proposed credit-based incentive approach with the modified SLNC-based cooperative content distribution operations in SocialCode to encourage all classes of vehicular nodes to rise their incentives for sharing content data in the cooperative content distribution process. Finally, we perform NS-2 simulations on a street map of downtown Taipei, Taiwan to exhibit the high efficiency of SocialCode over related credit-based incentive approaches by analyzing the following performance metrics, that is, average decoding percentage, file downloading delay and credits, with respect to different file sizes and total numbers of vehicular nodes. As the best knowledge we have, SocialCode is one of the first few researches that works on the integration between the credit-based incentive protocol and the SLNC-based cooperative content distribution.

Sign in / Sign up

Export Citation Format

Share Document