To fulfill two integral aims of abating cellular traffic and enhancing efficiency of cellular network, D2D is
considered as a novel channel of communication. This form of communication has introduced for 4th cellular
communication and enacts a significant role in the 5th generation. Four D2D communication scenarios
defined in the references, includes direct D2D and relaying D2D communication both with and without
cellular infrastructure. One of the major challenges addressing D2D protocols contributes to the fact that
they have one single secure protocol that can adapt to the four scenarios. In the current study, we propose a
secure D2D protocol based on ARIADNE. To authenticate and key agreement between Source and
Destination, we employ LTE-A AKA protocol, further for broadcast authentication between relaying nodes
TESLA was applied. In Contrary to the recent protocols, our proposed protocol has inconsiderable
computation overhead and trivial communication overhead than SODE and preserve many security
properties such as Authentication, Authorization, Confidentiality, Integrity, Secure Key Agreement, and
Secure Routing Transmission. We check Authentication, Confidentiality, Reachability, and Secure Key
Agreement of the proposed protocol with ProVerif verification tools.
The document proposes an enhanced anonymous position-based security aware routing protocol called E-APSAR for mobile ad hoc networks (MANETs). It aims to address security issues like black hole attacks in dynamic source routing (DSR) protocol. E-APSAR divides the network area into zones and implements encryption to securely transmit data between neighboring zones. Simulation results show that E-APSAR has lower routing overhead and higher throughput and packet delivery ratio compared to DSR, especially at certain mobility levels. The protocol performance is analyzed against different node densities and mobility to evaluate its effectiveness against black hole attacks in MANETs.
A Cluster based Technique for Securing Routing Protocol AODV against Black-ho...ijdpsjournal
The document proposes a cluster-based technique to detect and prevent black hole attacks in mobile ad hoc networks (MANETs). [1] It divides nodes into clusters with a cluster head. When a route request is broadcast, intermediate nodes check with the cluster head if the previous node is trusted before forwarding. This helps identify compromised nodes acting as black holes. The technique modifies the AODV routing protocol to incorporate cluster-based intrusion detection using threshold cryptography and proactive secret sharing to securely distribute keys.
DEVICE-TO-DEVICE (D2D) COMMUNICATION UNDER LTE-ADVANCED NETWORKSijwmn
Device-to-Device (D2D) communication is a new technology that offer many advantages for the LTEadvanced
network such us wireless peer-to-peer services and higher spectral efficiency. It is also
considered as one of promising techniques for the 5G wireless communications system and used in so
many different fields such as network traffic offloading, public safety, social services and applications such
as gaming and military applications . The goal of this paper is to present advances on the current 3GPP
LTE-advanced system related to Device-to-Device (D2D). In this paper, we provide an overview of the
D2D types based on the communication spectrum of D2D transmission, namely Inband D2D
communication and Outband D2D communication. Then we present the advantages and disadvantages of
each D2D mode. Moreover, architecture and protocol enhancements for D2D communications under
LTE-A network are described.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
The document proposes modifications to the AODV routing protocol to prevent denial of service attacks in mobile ad hoc networks. It describes how a malicious node can currently overload the network by flooding route requests. The proposed scheme limits the number of route requests a node can accept or forward to prevent this attack. It also blacklists nodes that exceed the route request limit to isolate misbehaving nodes. Simulations show the proposed approach reduces packet loss compared to the standard AODV protocol when under a denial of service attack.
Intelligent Device TO Device Communication Using IoTIJCERT
Internet is becoming the most intrinsic part of the human life. There are many users of the internet but the devices will be the main users in the Internet of Things (IoT). These devices communicate with each other efficiently and gather the information to transfer the data to particular device. The quality of this information depends on how smart the devices are. IoT coverage is very wide and consists of the things or devices connected in network like camera, android phones, sensors etc. Once all these devices are connected with each other, they are capable of processing smartly and satisfying basic needs of environment. Thus the communication between the devices is achieved using various technologies and devices.
DESIGN OF A SCHEME FOR SECURE ROUTING IN MOBILE AD HOC NETWORKScscpconf
Security has become a primary concern in order to provide protected communication between
mobile nodes in a hostile environment. Unlike the wireline networks, the unique characteristics
of mobile ad hoc networks pose a number of nontrivial challenges to security design, such as
open peer-to-peer network architecture, shared wireless medium, stringent resource constraints,
and highly dynamic network topology. These challenges clearly make a case for building
multifence security solutions that achieve both broad protection and desirable network
performance. So,we focus on the fundamental security problem of protecting the multihop
network connectivity between mobile nodes in a MANET. We identify the security issues related
to this problem, discuss the challenges to security design, and review the state of-the-art security
proposals that protect the MANET link- and network-layer operations of delivering packets over the multihop wireless channel.
An Ad hoc network in a wireless system consist of an autonomous system, without centralization which results forming of mobile nodes. In MANET, each node works in a dual form that consists of a router as well as hosts. These nodes configure dynamically and communicate using hop to hop. Due to its simplicity it is used in mobile conferencing, military communication. In MANET nodes can join and leave the network so MANET becomes vulnerable. Certain factors like dynamic network configures, distribution cooperation, open medium terrorized in routing which give rise to security issues. Once such protocol AODV has been a victim of security. In existing, MANET faces a severe problem known as the Black Hole problem. This Black hole problem is mostly found in reactive routing protocol called AODV.The black hole conducts its malicious node during route discovery process. Black hole node is a severe threat in AODV protocol that easily employed and becomes vulnerable in MANET. In this paper various techniques are discussed to overcome the Black hole attack.
The document proposes an enhanced anonymous position-based security aware routing protocol called E-APSAR for mobile ad hoc networks (MANETs). It aims to address security issues like black hole attacks in dynamic source routing (DSR) protocol. E-APSAR divides the network area into zones and implements encryption to securely transmit data between neighboring zones. Simulation results show that E-APSAR has lower routing overhead and higher throughput and packet delivery ratio compared to DSR, especially at certain mobility levels. The protocol performance is analyzed against different node densities and mobility to evaluate its effectiveness against black hole attacks in MANETs.
A Cluster based Technique for Securing Routing Protocol AODV against Black-ho...ijdpsjournal
The document proposes a cluster-based technique to detect and prevent black hole attacks in mobile ad hoc networks (MANETs). [1] It divides nodes into clusters with a cluster head. When a route request is broadcast, intermediate nodes check with the cluster head if the previous node is trusted before forwarding. This helps identify compromised nodes acting as black holes. The technique modifies the AODV routing protocol to incorporate cluster-based intrusion detection using threshold cryptography and proactive secret sharing to securely distribute keys.
DEVICE-TO-DEVICE (D2D) COMMUNICATION UNDER LTE-ADVANCED NETWORKSijwmn
Device-to-Device (D2D) communication is a new technology that offer many advantages for the LTEadvanced
network such us wireless peer-to-peer services and higher spectral efficiency. It is also
considered as one of promising techniques for the 5G wireless communications system and used in so
many different fields such as network traffic offloading, public safety, social services and applications such
as gaming and military applications . The goal of this paper is to present advances on the current 3GPP
LTE-advanced system related to Device-to-Device (D2D). In this paper, we provide an overview of the
D2D types based on the communication spectrum of D2D transmission, namely Inband D2D
communication and Outband D2D communication. Then we present the advantages and disadvantages of
each D2D mode. Moreover, architecture and protocol enhancements for D2D communications under
LTE-A network are described.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
The document proposes modifications to the AODV routing protocol to prevent denial of service attacks in mobile ad hoc networks. It describes how a malicious node can currently overload the network by flooding route requests. The proposed scheme limits the number of route requests a node can accept or forward to prevent this attack. It also blacklists nodes that exceed the route request limit to isolate misbehaving nodes. Simulations show the proposed approach reduces packet loss compared to the standard AODV protocol when under a denial of service attack.
Intelligent Device TO Device Communication Using IoTIJCERT
Internet is becoming the most intrinsic part of the human life. There are many users of the internet but the devices will be the main users in the Internet of Things (IoT). These devices communicate with each other efficiently and gather the information to transfer the data to particular device. The quality of this information depends on how smart the devices are. IoT coverage is very wide and consists of the things or devices connected in network like camera, android phones, sensors etc. Once all these devices are connected with each other, they are capable of processing smartly and satisfying basic needs of environment. Thus the communication between the devices is achieved using various technologies and devices.
DESIGN OF A SCHEME FOR SECURE ROUTING IN MOBILE AD HOC NETWORKScscpconf
Security has become a primary concern in order to provide protected communication between
mobile nodes in a hostile environment. Unlike the wireline networks, the unique characteristics
of mobile ad hoc networks pose a number of nontrivial challenges to security design, such as
open peer-to-peer network architecture, shared wireless medium, stringent resource constraints,
and highly dynamic network topology. These challenges clearly make a case for building
multifence security solutions that achieve both broad protection and desirable network
performance. So,we focus on the fundamental security problem of protecting the multihop
network connectivity between mobile nodes in a MANET. We identify the security issues related
to this problem, discuss the challenges to security design, and review the state of-the-art security
proposals that protect the MANET link- and network-layer operations of delivering packets over the multihop wireless channel.
An Ad hoc network in a wireless system consist of an autonomous system, without centralization which results forming of mobile nodes. In MANET, each node works in a dual form that consists of a router as well as hosts. These nodes configure dynamically and communicate using hop to hop. Due to its simplicity it is used in mobile conferencing, military communication. In MANET nodes can join and leave the network so MANET becomes vulnerable. Certain factors like dynamic network configures, distribution cooperation, open medium terrorized in routing which give rise to security issues. Once such protocol AODV has been a victim of security. In existing, MANET faces a severe problem known as the Black Hole problem. This Black hole problem is mostly found in reactive routing protocol called AODV.The black hole conducts its malicious node during route discovery process. Black hole node is a severe threat in AODV protocol that easily employed and becomes vulnerable in MANET. In this paper various techniques are discussed to overcome the Black hole attack.
The document discusses techniques for secure neighbor discovery and position verification in mobile ad hoc networks (MANETs). It proposes a distributed protocol called Neighbor Position Verification (NPV) that allows nodes to verify the positions of neighboring nodes without relying on trusted third parties. The NPV protocol uses a 4-step message exchange and distance calculations to classify neighbor nodes as verified, faulty, or unverifiable. It aims to minimize false positives and negatives while being robust against adversarial attacks. The document also discusses extending NPV to dynamic source routing to allow for verification of mobile nodes rather than static node positions. This improves security and network performance for MANETs.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
An overview of contemporary security problems in wireless mesh networksiosrjce
Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional
wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an
alternative, hosts rely on each other to keep the network connected. Wireless Internet service
providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and
inexpensive network use. One major challenge in design of these networks is their vulnerability to
security attacks. In this paper, principal contemporary security issues for wireless mesh networks
have been investigated. Identification of the threats a Wireless mesh network faces and the security
goals to be realized are described. The new challenges and opportunities posed by this new
networking environment are dealt with and explored approaches to secure its communication.
Serial Communication Interface with Error Detectioniosrjce
UART is used for serial data communication. UART is a piece of computer hardware that translates
between parallel bits of data and serial bits. UART is usually an integrated circuit used for serial
communications over a computer or peripheral device serial port. Bits have to be moved from one place to
another using wires or some other medium. Over many miles, the expense of the wires becomes large. To reduce
the expense of long communication links carrying several bits in parallel, data bits are sent sequentially. Errors
may occur either internally or externally while we transmit information from source to destination. The errors
generated during the transmission would affect the performance of the overall system. In order to reduce the
errors we should incorporate any error detecting schemes like hamming decoder, check parity systems etc.
Different serial communication devices are available.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
This document summarizes a research paper that studied secured text message transmission in a wireless communication system using the Vigenere cipher and RSA cryptographic algorithms. The system used CRC channel coding, BPSK modulation over an AWGN channel. A text message was encrypted with Vigenere cipher and RSA before transmission. At the receiver, the encrypted message was decrypted and compared at different SNR levels. The original text message was successfully retrieved at SNRs of 9dB or higher, showing the system performance degraded as SNR decreased. The study concluded the Vigenere cipher and RSA algorithms can securely transmit text messages over wireless channels.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
Providing The Security Against The DDOS Attack In Mobile Ad Hoc NetworksIOSR Journals
This document discusses providing security against distributed denial of service (DDOS) attacks in mobile ad hoc networks. It begins by introducing mobile ad hoc networks and some of their security vulnerabilities. It then discusses different types of attacks against MANETs, including black hole attacks, wormhole attacks, denial of service attacks, and distributed denial of service attacks. It proposes using an intrusion detection system to detect attacks and block attacking nodes. Simulation results are discussed to analyze the effectiveness of detection and mitigation techniques against DDOS attacks in terms of network performance metrics. The conclusion is that implementing queue management algorithms in network routers can help protect users during DDOS attacks by guaranteeing a certain level of bandwidth.
The document summarizes research on black hole and grey hole attacks in wireless mesh networks. It provides background on these attacks and how they work. The key points are:
1. Black hole attacks involve a malicious node accepting all packets by sending fake route replies, appearing to have the shortest path, then dropping all packets. Grey hole attacks involve selectively dropping packets.
2. The document reviews previous research on detecting and preventing these attacks. It then discusses using the OPNET simulator to analyze delay in networks under black hole and grey hole attacks.
3. Simulation results show increased network delay when nodes launch black hole and grey hole attacks compared to no attacks. Applying the OLSR routing protocol with a secure path scheme
This document proposes a Tiered Authentication scheme called TAM for multicast traffic in ad-hoc networks. TAM exploits network clustering to reduce overhead and ensure scalability. Within a cluster, one-way hash chains authenticate message sources by appending an authentication code to messages. Between clusters, messages include multiple authentication codes based on different keys from the source to authenticate it. TAM aims to securely deliver multicast traffic while addressing challenges like resource constraints and packet loss in ad-hoc networks.
This document provides an overview of the AODV routing protocol for ad hoc networks and security issues associated with it. It first introduces ad hoc networks and discusses the basic differences between infrastructure and ad hoc networks. It then summarizes several popular routing protocols for ad hoc networks, including DSDV, DSR, TORA, and AODV. The document focuses on explaining the route discovery and maintenance processes of AODV. It also discusses common security attacks against AODV like black hole attacks and wormhole attacks. Finally, it mentions some approaches to secure AODV like using digital signatures, authentication, and intrusion detection systems.
Study and analysis vurnerability of aodv protocolMehedi
This document discusses security issues in the Ad Hoc On-Demand Distance Vector (AODV) routing protocol for mobile ad hoc networks. It describes various attacks against AODV like wormhole attacks, colluding misrelay attacks, replay attacks, and false route error messages. It also explains black hole attacks and distributed denial of service (DDoS) attacks. The document analyzes why AODV is vulnerable to such attacks due to its characteristics. It concludes that attacks like black hole attacks highly impact AODV's performance and proposes future work to simulate black hole attacks on AODV using a network simulator.
Data Security via Public-Key Cryptography in Wireless Sensor NetworkIJCI JOURNAL
This document discusses using public-key cryptography for data security in wireless sensor networks. It begins with an abstract that introduces public-key infrastructure for sensor networks to allow services like digital signatures. It then provides background on wireless sensor networks and discusses their limitations, including limited resources and vulnerability of nodes. It reviews different techniques for distributing public keys, including public announcement, publicly available directories, using a public-key authority, and public-key certificates. It analyzes whether a public-key infrastructure is feasible for sensor networks given their constraints. The document concludes by discussing potential public-key schemes that could work for wireless sensor networks.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
RTOS BASED SECURE SHORTEST PATH ROUTING ALGORITHM IN MOBILE AD- HOC NETWORKSIJNSA Journal
Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS) is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.
This document discusses preventing and isolating black hole attacks in mobile ad hoc networks (MANETs) using alarm packets. It begins with background on MANETs and security attacks they face such as black hole attacks. Then, it reviews existing literature on detecting and preventing black hole attacks. Next, it describes how black hole attacks work in MANETs by having malicious nodes advertise short paths to destinations and drop packets. The proposed solution will use alarm packets to isolate and prevent black hole attacks in MANETs.
A Survey on IPv6 Secure Link Local Communication Models, Techniques and ToolsIJARIDEA Journal
This document discusses IPv6 secure link local communication models, techniques and tools. It summarizes the Neighbor Discovery Protocol (NDP) used in IPv6 networks and its vulnerabilities. The Secure Neighbor Discovery (SEND) protocol is presented as a technique to secure NDP by adding address ownership proof, message protection and router authorization. The document also examines threats to IPv6 link local communication like spoofing, denial of service and replay attacks. It evaluates using IPsec Authentication Header to authenticate NDP messages as a potential solution, but notes issues with automatic key exchange in IPv6 environments.
Performance analysis of aodv protocol on blackhole attackMehedi
This document discusses the AODV routing protocol, black hole attacks against AODV, and analyzing AODV's performance under black hole attacks. It introduces AODV, explains why it is used, and outlines security issues. It then defines distributed denial of service (DDoS) and black hole attacks, describing how black holes work at the routing level to drop packets. The document concludes it will use a network simulator to analyze how black hole attacks affect AODV performance metrics.
This document summarizes a research paper that proposes using the Rivest Cipher version 6 (RC6) algorithm to provide message authentication and source privacy in wireless sensor networks. It discusses challenges with existing symmetric and public key approaches to message authentication in wireless sensor networks due to their high computational overhead and lack of scalability. The proposed approach aims to achieve efficient hop-by-hop message authentication, identity privacy, and location privacy using RC6 encryption. It evaluates RC6 in terms of computational overhead, energy consumption, message delay, and memory consumption compared to other techniques.
A Survey of Source Authentication Schemes for Multicast transfer in Adhoc Net...ijsrd.com
An adhoc network is a collection of autonomous nodes with dynamically changing infrastructure. Multicast is a good mechanism for group communication. It can be used in the group oriented applications like video/audio conference, interactive group games, video on demand etc. The security problems obstruct the large deployment of the multicast communication model. Multicast data origin authentication is the main component in the security architecture. The authentication schemes should scalable and efficient against packet loss. In this article we discuss varies authentication scheme for multicast data origin with their advantage and disadvantage
This document discusses device-to-device (D2D) communication in LTE networks. It describes how D2D allows direct communication between user equipments by bypassing the base station, addressing issues like network coverage, congestion control, and public safety. The document outlines the D2D communication process, including synchronization, discovery, and communication modes. It also describes the ProSe D2D network architecture and direct discovery procedure. D2D communication in LTE aims to improve network coverage, offer last mile connectivity, control congestion, and enable public safety communication during emergencies or disasters.
Analysis Of D2D Communication In 5G NetworkNicole Heredia
This document analyzes device-to-device (D2D) communication in 5G networks. D2D communication is seen as promising for providing low-latency, high-data rate services between devices in 5G networks. However, mobility poses challenges as latency could increase when control nodes exchange D2D information. The document proposes two mobility management solutions to minimize signaling overhead and latency in network-assisted D2D communications. It also discusses simulation assumptions considering dense deployment of small cells and D2D groups. The results show the proposed solutions can reduce signaling and improve latency by maximizing the time D2D users are under the same small cell control.
This document discusses device-to-device (D2D) communication in 5G networks. It covers several applications of D2D communication such as vehicular communication, public safety, disaster relief, millimeter wave communication, handover and mobility issues, unmanned aerial vehicles, internet of things, and its potential role in 6G networks. Some key points include: D2D can improve capacity and latency in 5G; it supports applications like vehicular communication, proximity services and public safety; challenges include interference management and handover procedures for mobile D2D pairs.
The document discusses techniques for secure neighbor discovery and position verification in mobile ad hoc networks (MANETs). It proposes a distributed protocol called Neighbor Position Verification (NPV) that allows nodes to verify the positions of neighboring nodes without relying on trusted third parties. The NPV protocol uses a 4-step message exchange and distance calculations to classify neighbor nodes as verified, faulty, or unverifiable. It aims to minimize false positives and negatives while being robust against adversarial attacks. The document also discusses extending NPV to dynamic source routing to allow for verification of mobile nodes rather than static node positions. This improves security and network performance for MANETs.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
An overview of contemporary security problems in wireless mesh networksiosrjce
Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional
wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an
alternative, hosts rely on each other to keep the network connected. Wireless Internet service
providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and
inexpensive network use. One major challenge in design of these networks is their vulnerability to
security attacks. In this paper, principal contemporary security issues for wireless mesh networks
have been investigated. Identification of the threats a Wireless mesh network faces and the security
goals to be realized are described. The new challenges and opportunities posed by this new
networking environment are dealt with and explored approaches to secure its communication.
Serial Communication Interface with Error Detectioniosrjce
UART is used for serial data communication. UART is a piece of computer hardware that translates
between parallel bits of data and serial bits. UART is usually an integrated circuit used for serial
communications over a computer or peripheral device serial port. Bits have to be moved from one place to
another using wires or some other medium. Over many miles, the expense of the wires becomes large. To reduce
the expense of long communication links carrying several bits in parallel, data bits are sent sequentially. Errors
may occur either internally or externally while we transmit information from source to destination. The errors
generated during the transmission would affect the performance of the overall system. In order to reduce the
errors we should incorporate any error detecting schemes like hamming decoder, check parity systems etc.
Different serial communication devices are available.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
This document summarizes a research paper that studied secured text message transmission in a wireless communication system using the Vigenere cipher and RSA cryptographic algorithms. The system used CRC channel coding, BPSK modulation over an AWGN channel. A text message was encrypted with Vigenere cipher and RSA before transmission. At the receiver, the encrypted message was decrypted and compared at different SNR levels. The original text message was successfully retrieved at SNRs of 9dB or higher, showing the system performance degraded as SNR decreased. The study concluded the Vigenere cipher and RSA algorithms can securely transmit text messages over wireless channels.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
Providing The Security Against The DDOS Attack In Mobile Ad Hoc NetworksIOSR Journals
This document discusses providing security against distributed denial of service (DDOS) attacks in mobile ad hoc networks. It begins by introducing mobile ad hoc networks and some of their security vulnerabilities. It then discusses different types of attacks against MANETs, including black hole attacks, wormhole attacks, denial of service attacks, and distributed denial of service attacks. It proposes using an intrusion detection system to detect attacks and block attacking nodes. Simulation results are discussed to analyze the effectiveness of detection and mitigation techniques against DDOS attacks in terms of network performance metrics. The conclusion is that implementing queue management algorithms in network routers can help protect users during DDOS attacks by guaranteeing a certain level of bandwidth.
The document summarizes research on black hole and grey hole attacks in wireless mesh networks. It provides background on these attacks and how they work. The key points are:
1. Black hole attacks involve a malicious node accepting all packets by sending fake route replies, appearing to have the shortest path, then dropping all packets. Grey hole attacks involve selectively dropping packets.
2. The document reviews previous research on detecting and preventing these attacks. It then discusses using the OPNET simulator to analyze delay in networks under black hole and grey hole attacks.
3. Simulation results show increased network delay when nodes launch black hole and grey hole attacks compared to no attacks. Applying the OLSR routing protocol with a secure path scheme
This document proposes a Tiered Authentication scheme called TAM for multicast traffic in ad-hoc networks. TAM exploits network clustering to reduce overhead and ensure scalability. Within a cluster, one-way hash chains authenticate message sources by appending an authentication code to messages. Between clusters, messages include multiple authentication codes based on different keys from the source to authenticate it. TAM aims to securely deliver multicast traffic while addressing challenges like resource constraints and packet loss in ad-hoc networks.
This document provides an overview of the AODV routing protocol for ad hoc networks and security issues associated with it. It first introduces ad hoc networks and discusses the basic differences between infrastructure and ad hoc networks. It then summarizes several popular routing protocols for ad hoc networks, including DSDV, DSR, TORA, and AODV. The document focuses on explaining the route discovery and maintenance processes of AODV. It also discusses common security attacks against AODV like black hole attacks and wormhole attacks. Finally, it mentions some approaches to secure AODV like using digital signatures, authentication, and intrusion detection systems.
Study and analysis vurnerability of aodv protocolMehedi
This document discusses security issues in the Ad Hoc On-Demand Distance Vector (AODV) routing protocol for mobile ad hoc networks. It describes various attacks against AODV like wormhole attacks, colluding misrelay attacks, replay attacks, and false route error messages. It also explains black hole attacks and distributed denial of service (DDoS) attacks. The document analyzes why AODV is vulnerable to such attacks due to its characteristics. It concludes that attacks like black hole attacks highly impact AODV's performance and proposes future work to simulate black hole attacks on AODV using a network simulator.
Data Security via Public-Key Cryptography in Wireless Sensor NetworkIJCI JOURNAL
This document discusses using public-key cryptography for data security in wireless sensor networks. It begins with an abstract that introduces public-key infrastructure for sensor networks to allow services like digital signatures. It then provides background on wireless sensor networks and discusses their limitations, including limited resources and vulnerability of nodes. It reviews different techniques for distributing public keys, including public announcement, publicly available directories, using a public-key authority, and public-key certificates. It analyzes whether a public-key infrastructure is feasible for sensor networks given their constraints. The document concludes by discussing potential public-key schemes that could work for wireless sensor networks.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
RTOS BASED SECURE SHORTEST PATH ROUTING ALGORITHM IN MOBILE AD- HOC NETWORKSIJNSA Journal
Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS) is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.
This document discusses preventing and isolating black hole attacks in mobile ad hoc networks (MANETs) using alarm packets. It begins with background on MANETs and security attacks they face such as black hole attacks. Then, it reviews existing literature on detecting and preventing black hole attacks. Next, it describes how black hole attacks work in MANETs by having malicious nodes advertise short paths to destinations and drop packets. The proposed solution will use alarm packets to isolate and prevent black hole attacks in MANETs.
A Survey on IPv6 Secure Link Local Communication Models, Techniques and ToolsIJARIDEA Journal
This document discusses IPv6 secure link local communication models, techniques and tools. It summarizes the Neighbor Discovery Protocol (NDP) used in IPv6 networks and its vulnerabilities. The Secure Neighbor Discovery (SEND) protocol is presented as a technique to secure NDP by adding address ownership proof, message protection and router authorization. The document also examines threats to IPv6 link local communication like spoofing, denial of service and replay attacks. It evaluates using IPsec Authentication Header to authenticate NDP messages as a potential solution, but notes issues with automatic key exchange in IPv6 environments.
Performance analysis of aodv protocol on blackhole attackMehedi
This document discusses the AODV routing protocol, black hole attacks against AODV, and analyzing AODV's performance under black hole attacks. It introduces AODV, explains why it is used, and outlines security issues. It then defines distributed denial of service (DDoS) and black hole attacks, describing how black holes work at the routing level to drop packets. The document concludes it will use a network simulator to analyze how black hole attacks affect AODV performance metrics.
This document summarizes a research paper that proposes using the Rivest Cipher version 6 (RC6) algorithm to provide message authentication and source privacy in wireless sensor networks. It discusses challenges with existing symmetric and public key approaches to message authentication in wireless sensor networks due to their high computational overhead and lack of scalability. The proposed approach aims to achieve efficient hop-by-hop message authentication, identity privacy, and location privacy using RC6 encryption. It evaluates RC6 in terms of computational overhead, energy consumption, message delay, and memory consumption compared to other techniques.
A Survey of Source Authentication Schemes for Multicast transfer in Adhoc Net...ijsrd.com
An adhoc network is a collection of autonomous nodes with dynamically changing infrastructure. Multicast is a good mechanism for group communication. It can be used in the group oriented applications like video/audio conference, interactive group games, video on demand etc. The security problems obstruct the large deployment of the multicast communication model. Multicast data origin authentication is the main component in the security architecture. The authentication schemes should scalable and efficient against packet loss. In this article we discuss varies authentication scheme for multicast data origin with their advantage and disadvantage
This document discusses device-to-device (D2D) communication in LTE networks. It describes how D2D allows direct communication between user equipments by bypassing the base station, addressing issues like network coverage, congestion control, and public safety. The document outlines the D2D communication process, including synchronization, discovery, and communication modes. It also describes the ProSe D2D network architecture and direct discovery procedure. D2D communication in LTE aims to improve network coverage, offer last mile connectivity, control congestion, and enable public safety communication during emergencies or disasters.
Analysis Of D2D Communication In 5G NetworkNicole Heredia
This document analyzes device-to-device (D2D) communication in 5G networks. D2D communication is seen as promising for providing low-latency, high-data rate services between devices in 5G networks. However, mobility poses challenges as latency could increase when control nodes exchange D2D information. The document proposes two mobility management solutions to minimize signaling overhead and latency in network-assisted D2D communications. It also discusses simulation assumptions considering dense deployment of small cells and D2D groups. The results show the proposed solutions can reduce signaling and improve latency by maximizing the time D2D users are under the same small cell control.
This document discusses device-to-device (D2D) communication in 5G networks. It covers several applications of D2D communication such as vehicular communication, public safety, disaster relief, millimeter wave communication, handover and mobility issues, unmanned aerial vehicles, internet of things, and its potential role in 6G networks. Some key points include: D2D can improve capacity and latency in 5G; it supports applications like vehicular communication, proximity services and public safety; challenges include interference management and handover procedures for mobile D2D pairs.
Device-to-device (D2D) communications underlaying a cellular infrastructure has been proposed as a means of taking advantage of the physical proximity of communicating devices, increasing resource utilization, and improving cellular coverage. Relative to the traditional cellular methods, there is a need to design new peer discovery methods, physical layer procedures, and radio resource management algorithms that help realize the potential article we use the 3GPP Long Term Evolution system as a baseline for D2D design, review some of the key design challenges, and propose solution approaches that allow cellular devices and D2D pairs to share spectrum resources and thereby increase the spectrum and energy efficiency of traditional cellular networks. Sim- ulation results illustrate the viability of the proposed design.
An overview about the new feature proposed for LTE Release 12 and beyond: Proximity Services (ProSe) / D2D.
It covers the D2D features: Discovery, Communication, Security and also shows some use-cases.
A bipartite graph based proportional fair scheduling strategy to improve thr...IJECEIAES
The fifth-generation wireless communication is expected to provide a huge amount of capacity to cater to the need of an increasing number of mobile consumers, which can be satisfied by device-to-device (D2D) communication. Reusing the cellular user’s resources in an efficient manner helps to increase the spectrum efficiency of the network but it leads to severe interference. The important point in reusing cellular user resources is that D2D communication should not affect the cellular user’s efficiency. After achieving this requirement, the focus is now turned toward the allocation of resources to D2D communication. This resource allocation strategy is to be designed in such a way that it will not affect communication among the cellular user (CU). This scheme improves various performance objectives. This paper aims at designing a proportional fair resource allocation algorithm based on the bipartite graph which maintains the quality of service (QoS) of CUs while providing D2D communication. This algorithm can be merged with any other scheme of resource allocation for improving QoS and adopting changing channels. In this scheme, a D2D pair can be allocated with one or more than one resource blocks. The MATLAB simulations analyze the performance of the proposed scheme.
PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS IN MANET UNDER MALICIOUS ATTACKSIJNSA Journal
MANETs routing protocols are vulnerable to various types of security attacks such as selfish nodes, grey-hole and black-hole attacks. These routing protocols are unprotected and subsequently result in various kinds of malicious mobile nodes being injected into the networks. In this paper, three types of attacks such as selfish, grey-hole and black-hole attacks have been applied to two important MANET routing protocols; Ad-hoc On demand Distance Vector (OADV) and Dynamic Source Routing (DSR) in order to analyse and compare the impact of these attacks on the network performance based on throughput, average delay, packet loss and consumption of energy.
PERFORMANCE ANALYSIS OF ROUTING ROTOCOLS IN MANET UNDER MALICIOUS ATTACKSIJNSA Journal
This document analyzes the performance of two routing protocols (AODV and DSR) in mobile ad hoc networks under different types of malicious attacks. It first provides background on MANETs and discusses security goals and common routing protocols. It then describes three types of attacks tested (selfish nodes, grey holes, and black holes) and how they can disrupt routing. The methodology section indicates that the performance will be evaluated based on throughput, delay, packet loss, and energy consumption under these attacks. In summary, the document aims to compare the impact of different routing attacks on the network performance of two important MANET routing protocols.
EFFICIENTLY SECURE BROADCASTING IN 5G WIRELESS FOG-BASED-FRONTHAUL NETWORKSijwmn
Enhanced Diversity and Network Coding (eDC-NC), the synergistic combination of Diversity and modified Triangular Network Coding, was introduced recently to provide efficient and ultra-reliable networking with near-instantaneous fault recovery. In this paper it is shown that eDC-NC technology can efficiently and securely broadcast messages in 5G wireless fog-computing-based Radio Access Networks (F-RAN). In particular, this work is directed towards demonstrating the ability of eDC-NC technology to more efficiently provide secure messages broadcasting than standardized methods such as Secure Multicasting using Secret (Shared) Key Cryptography, such that the adversary has no ability to acquire information
even if they wiretap the entire F-RAN network (except of course the source and destination nodes). Our results show that using secure eDC-NC technology in F-RAN fronthaul network will enhance secure broadcasting and provide ultra-reliability networking, near-instantaneous fault recovery, and retain the
throughput benefits of Network Coding
EFFICIENTLY SECURE BROADCASTING IN 5G WIRELESS FOG-BASED-FRONTHAUL NETWORKSijwmn
Enhanced Diversity and Network Coding (eDC-NC), the synergistic combination of Diversity and modified Triangular Network Coding, was introduced recently to provide efficient and ultra-reliable networking with near-instantaneous fault recovery. In this paper it is shown that eDC-NC technology can efficiently and securely broadcast messages in 5G wireless fog-computing-based Radio Access Networks (F-RAN). In particular, this work is directed towards demonstrating the ability of eDC-NC technology to more efficiently provide secure messages broadcasting than standardized methods such as Secure Multicasting
using Secret (Shared) Key Cryptography, such that the adversary has no ability to acquire information even if they wiretap the entire F-RAN network (except of course the source and destination nodes). Our results show that using secure eDC-NC technology in F-RAN fronthaul network will enhance secure broadcasting and provide ultra-reliability networking, near-instantaneous fault recovery, and retain the throughput benefits of Network Coding.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets
loss
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable to several malicious attacks. The secure routing is essential to transmit packets from source to the destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets loss.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
PACKET DROP ATTACK DETECTION TECHNIQUES IN WIRELESS AD HOC NETWORKS: A REVIEWIJNSA Journal
Wireless ad hoc networks have gained lots of attention due to their ease and low cost of deployment. This
has made ad hoc networks of great importance in numerous military and civilian applications. But, the lack
of centralized management of these networks makes them vulnerable to a number of security attacks. One
of the attacks is packet drop attack, where a compromised node drops packets maliciously. Several
techniques have been proposed to detect the packet drop attack in wireless ad hoc networks. Therefore, in
this paper we review some of the packet drop attack detection techniques and comparatively analyze them
basing on; their ability to detect the attack under different attack strategies (partial and or cooperate
attacks), environments and the computational and communication overheads caused in the process of
detection.
PACKET DROP ATTACK DETECTION TECHNIQUES IN WIRELESS AD HOC NETWORKS: A REVIEWIJNSA Journal
Wireless ad hoc networks have gained lots of attention due to their ease and low cost of deployment. This has made ad hoc networks of great importance in numerous military and civilian applications. But, the lack of centralized management of these networks makes them vulnerable to a number of security attacks. One of the attacks is packet drop attack, where a compromised node drops packets maliciously. Several techniques have been proposed to detect the packet drop attack in wireless ad hoc networks. Therefore, in this paper we review some of the packet drop attack detection techniques and comparatively analyze them basing on; their ability to detect the attack under different attack strategies (partial and or cooperate attacks), environments and the computational and communication overheads caused in the process of detection.
A Cooperative Approach to Extend Cellular Coverage via D2D Architecture based...IJCNCJournal
The access part of all cellular network’s generation suffers from common concerns related to dead spots (zones that are not covered by the network) and hot spots (zones where the number of users is higher compared to network resources). During the last decade, lots of research proposals have tried to overcome cellular problems through multi-hop D2D architecture, which is a new paradigm allowing the direct communication between devices in cellular network to enhance network performances and improve user QoS. In this paper, we propose a multi-hop D2D architecture based on the OLSR protocol to extend cellular coverage. Cell-OLSR, which is the proposed adaptation of OLSR for our architecture, allows the exchange of cellular parameters between nodes to choose the best proxy device to forward data to the cellular base station (BS).
SURVEY OF TRUST BASED BLUETOOTH AUTHENTICATION FOR MOBILE DEVICEEditor IJMTER
Practical requirements for securely demonstrating identities between two handheld
devices are an important concern. The adversary can inject a Man-In- The-Middle (MITM) attack to
intrude the protocol. Protocols that employ secret keys require the devices to share private
information in advance, in which it is not feasible in the above scenario. Apart from insecurely
typing passwords into handheld devices or comparing long hexadecimal keys displayed on the
devices’ screen, many other human-verifiable protocols have been proposed in the literature to solve
the problem. Unfortunately, most of these schemes are unsalable to more users. Even when there are
only three entities attempt to agree a session key, these protocols need to be rerun for three times.
So, in the existing method a bipartite and a tripartite authentication protocol is presented using a
temporary confidential channel. Besides, further extend the system into a transitive authentication
protocol that allows multiple handheld devices to establish a conference key securely and efficiently.
But this method detects only the outsider attacks. Method does not consider the insider attacks. So,
in the proposed method trust score based method is introduced which computes the trust values for
the nodes and provide the security. The trust score is computed has a positive influence on the
confidence with which an entity conducts transactions with that node. Network the behavior of the
node will be monitored periodically and its trust value is also updated .So depending on the behavior
of the node in the network trust relation will be established between two nodes.
Mobile network connectivity analysis for device to device communication in 5...IJECEIAES
Since long term evolved release 14 (LTE R14), the device to device (D2D) communications have become a promising technology for in-band or outband mobile communication networks. In addition, D2D communications constitute an essential component of the fifth-generation mobile network (5G). For example, to improve capability communication, reduce the power dissipation, reduce latency within the networks and implement new applications and services. However, reducing the congestion in D2D communications and improving the mobile network connectivity are the essential problems to propose these new applications or services. This paper presents new solutions to reduce the congestion of devices around a base station and improve the performance of the D2D network; in terms of the number of connected devices or user equipment (UE). The simulation results show that our proposed solution can improve the network capacity by doubling the number of connected devices (or UE) and reducing the congestion. For this reason, our proposition makes it possible to reduce the financial cost by reducing the cost of deploying equipment. For example, instead of using two base stations, we can use only one station to connect the same number of devices.
PSIM: A TOOL FOR ANALYSIS OF DEVICE PAIRING METHODSIJNSA Journal
Wireless networks are a common place nowadays and almost all of the modern devices support wireless communication in some form. These networks differ from more traditional computing systems due to the ad-hoc and spontaneous nature of interactions among devices. These systems are prone to security risks, such as eavesdropping and require different techniques as compared to traditional security mechanisms. Recently, secure device pairing in wireless environments has got substantial attention from many researchers. As a result, a significant set of techniques and protocols have been proposed to deal with this issue. Some of these techniques consider devices equipped with infrared, laser, ultrasound transceivers or 802.11 network interface cards; while others require embedded accelerometers, cameras and/or LEDs, displays, microphones and/or speakers. However, many of the proposed techniques or protocols have not been implemented at all; while others are implemented and evaluated in a stand-alone manner without being compared with other related work [1]. We believe that it is because of the lack of specialized tools that provide a common platform to test the pairing methods. As a consequence, we designed such a tool. In this paper, we are presenting design and development of the Pairing Simulator (PSim) that can be used to perform the analysis of device pairing methods.
Similar to A COMPREHENSIVE SECURE PROTOCOL FOR ALL D2D SCENARIOS (20)
HijackLoader Evolution: Interactive Process HollowingDonato Onofri
CrowdStrike researchers have identified a HijackLoader (aka IDAT Loader) sample that employs sophisticated evasion techniques to enhance the complexity of the threat. HijackLoader, an increasingly popular tool among adversaries for deploying additional payloads and tooling, continues to evolve as its developers experiment and enhance its capabilities.
In their analysis of a recent HijackLoader sample, CrowdStrike researchers discovered new techniques designed to increase the defense evasion capabilities of the loader. The malware developer used a standard process hollowing technique coupled with an additional trigger that was activated by the parent process writing to a pipe. This new approach, called "Interactive Process Hollowing", has the potential to make defense evasion stealthier.
Discover the benefits of outsourcing SEO to Indiadavidjhones387
"Discover the benefits of outsourcing SEO to India! From cost-effective services and expert professionals to round-the-clock work advantages, learn how your business can achieve digital success with Indian SEO solutions.
Ready to Unlock the Power of Blockchain!Toptal Tech
Imagine a world where data flows freely, yet remains secure. A world where trust is built into the fabric of every transaction. This is the promise of blockchain, a revolutionary technology poised to reshape our digital landscape.
Toptal Tech is at the forefront of this innovation, connecting you with the brightest minds in blockchain development. Together, we can unlock the potential of this transformative technology, building a future of transparency, security, and endless possibilities.
A COMPREHENSIVE SECURE PROTOCOL FOR ALL D2D SCENARIOS
1. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
DOI:10.5121/ijwmn.2021.13401 1
A COMPREHENSIVE SECURE PROTOCOL FOR ALL
D2D SCENARIOS
Hoda Nematy
Malek-Ashtar University of Technology, Shabanlou, Babaee Hwy, Lavizan,Tehran.
ABSTRACT
To fulfill two integral aims of abating cellular traffic and enhancing efficiency of cellular network, D2D is
considered as a novel channel of communication. This form of communication has introduced for 4th cellular
communication and enacts a significant role in the 5th generation. Four D2D communication scenarios
defined in the references, includes direct D2D and relaying D2D communication both with and without
cellular infrastructure. One of the major challenges addressing D2D protocols contributes to the fact that
they have one single secure protocol that can adapt to the four scenarios. In the current study, we propose a
secure D2D protocol based on ARIADNE. To authenticate and key agreement between Source and
Destination, we employ LTE-A AKA protocol, further for broadcast authentication between relaying nodes
TESLA was applied. In Contrary to the recent protocols, our proposed protocol has inconsiderable
computation overhead and trivial communication overhead than SODE and preserve many security
properties such as Authentication, Authorization, Confidentiality, Integrity, Secure Key Agreement, and
Secure Routing Transmission. We check Authentication, Confidentiality, Reachability, and Secure Key
Agreement of the proposed protocol with ProVerif verification tools.
KEYWORDS
5th generation, Four D2D scenarios, LTE-A AKA protocol, secure D2D protocol, ProVerif
1. INTRODUCTION
Traditional cellular infrastructure does not allow cellular devices communicate with each other
directly even in the close proximity. Such a strategy leads massive traffic to the cellular network
and perchance, D2D communication has been introduced to overcome cellular traffic which enjoys
high potential in providing more bandwidth and higher rates to the cellular network (1). Being more
specific, D2D communication is considered as a peculiar approach in setting direct transmission
between a Source and a Destination, though it provides scant interactions between cellular phones
and the central nodes (i.e. eNodeB). It has been argued that D2D communication is used for close
distances and cellular communication only for far enough distances (2). D2D first used in (3) for
data transmissions between nodes and cellular communication. Some other researches (2–4) use
D2D for cellular communication. Based on recent research, security has been remained as a
continuing issue in the domain of D2D communication (5).Casting much light on this matter on
hand, several security challenges including Authentication, Authorization, confidentiality,
integrity… and a secure protocol have addressed all of them. The list of security solutions proposed
by the recent references is presented in Table 1. It is apparent that non of the protocols preserves
all security properties. The problem situation in (6) is based on a scenario that a user which covered
by a healthy deactivated eNodeB intends to connect the cellular network and helps for
communication and sharing secret keys. Having the connection processed in this protocol, two
cryptic fields for each user have to be sent from eNodeBs to their eNodeBs neighbourhood; further,
due to lack of information about which user may request communication and which user would
respond to this request, multitude of communication overheads existed. Prior occurrence of the
2. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
2
incident, every eNodeBs should send these fields to their users. Moreover, a user of healthy
eNodeB may fall in the DOS attack by receiving too many requests from a malicious user.
Sparkling much light, T. Ballan et al (7) use a Physically Unclonable Functions (PUF) to generate
the secret key for each device. This circuit generates a unique value based on the idiosyncratic
character of each D2D devices, afterwards uses this unique value with the public key of another
device and Elliptic Curve Cryptography to generate a shared secret key which is used as an input
value of the Salsa20 / 20 stream cryptographic function and creates a final message with the XOR
operation of Salsa20/20 output and initial message as well. Besides the potential applicability, this
method suffers few limitations, first, it is prone to man-in-the-middle attacks when the attacker is
placed between the receiver and the transmitter and sends his public key to the parties. Second, it
requires a PUF circuit in both devices. Looking at this matter on hand from another perspective, L.
Wang et al (8) present a distributed group key sharing scenario based on computational Diffie-
Hellman (CDH) key sharing protocol in the absence of cellular infrastructure. One line of
shortcoming of this protocol is attributed to the fact that, it does not provide a security solution
based on the presence of an attacker within the network. Each time a user adds or eliminates the
group, a new session key should be created. A step higher. P. Gope protocol (9) verifies the identity
of D2D devices inside the network coverage by a middle layer called the fog layer. This middle
layer connects to the core network and can authenticate a device and share a secret key;
furthermore, the device can also verify the received information by the fog layer without disclosing
its identity information to this layer. It has been maintained that this method reduces the latency
and enhances the mobility of end-users and also extends its utilization horizons even when a user
is out of network coverage. A secure key exchange method between two D2D devices without
network interference proposed in (10), that requires physical proximity of two devices prior
communication. In the case of reusing a key, the security of communication will be severely
compromised. It is also possible to reveal the key if one of the devices is infected with malware. In
(11) a secure protocol for secure communication between eNodeB and GW was proposed. A
summary of the security solutions of references shows in table 1. Our proposed protocol uses
ARIADNE with TESLA (12) and LTE-A key distribution system and the coverage encompasses
all four communication scenarios including D2D direct and indirect with and without cellular
coverage (See Figure. 1). Concerning the mobile nature of D2D devices, as the encrypted message
to the routing packet is added, a message would be transmitted opportunistically in the network.
To be much concise, when users are mobile in D2D communication, they may change their location
after each routing process and no longer participate in sending and receiving messages, therefore
the routing procedure needs to be iterated. However, in our proposed protocol, redoing the routine
operation is not required since through adding the encrypted message field to the routing package
users have to participate in D2D as long as sending and receiving one packet process time.
Figure 1. Four D2D Scenarios
3. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
3
As the cellular networks may become inaccessible in natural disasters, terrorist attacks, and other
situations, in this scenario (out of coverage) the proposed protocol can override the network key
agreement mode and use pre-shared keys. Applying the PUF circuit on D2D devices or the Diffie-
Hellman key agreement protocol are the other two possible approaches for key agreement
procedure. It should be pinpointed that such a key agreement is only restricted for the two factors
of Source and destination, and relays do not require a pre-sharing secret key. Although using each
pre-shared key method or a PUF circuit or key agreement protocols may reduce the security of our
proposed protocol, we assume that in emergency situations, setting communication is of much great
importance than abating communication security. Four D2D scenarios including, direct D2D with
cellular infrastructure, direct D2D without cellular infrastructure, relaying D2D with cellular
infrastructure and relaying D2D without cellular infrastructure are illustrated in Figure. 1. The rest
of the paper devotes itself to peruse the subject in various sections. Section two will look through
the four D2D secure protocols and schematic including direct D2D Secure Protocol (DD2D),
Relaying D2D Secure Protocol (RD2D), direct D2D Secure Protocol without Cellular
Infrastructure (DD2DW), and Relaying D2D Secure Protocol without Cellular Infrastructure
(RD2DW). In section 3 the secure protocols will be analysed from three viewpoints of Computation
overhead, communication overhead, and security properties. Ultimately, the security properties of
secure protocols and Confidentiality, Reliability, one-way and two-way Authentication, and Secure
Key Agreement in two phases will proof with the ProVerif formal verification tool will be
discussed.
Table 1. Security solutions in D2D communication
Authenticati
on
Authorizati
on
Confidential
ity
Integri
ty
Secure
routing
transmissi
on
Secure
key
agreeme
nt
Non-
repudia
tion
SOD
(6)
- - + - + + -
LAAP
(9)
+ + - - - + +
Sec-
D2D
(10)
+ - + + - + -
SDR
(7)
- - + - - + -
CRA(
8)
- - + + + + -
2. FOUR SECURE PROTOCOLS
We have four different protocol though they share a similar basis. Initially, a source incepts a D2D
communication to the Destination. In scenarios 1 and 3, the Source and Destination are in each
others’ vicinity and could receive information directly. But, in scenarios 2 and 4, the Source and
Destination are not in each others neighbourhood and need the cooperation of other devices to
transmit and receive information. In scenarios 1 and 2, we use the cellular advantage to distribute
keys between the Source and the Destination since, all the devices including Source and Destination
are in the cellular coverage. Nevertheless, in line with dwindling cellular signalling traffic, the
TESLA broadcast authentication protocol is employed for the intermediate nodes (i.e. relays). In
scenarios 1 and 2, having fulfilled the establishment of a D2D communication to a specified
destination the Source sends a D2D request message including Source and Destination identity in
a secure cellular channel to the MME. The MME monitors the validity of the message and
4. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
4
authenticates the Source and Destination, and also checks if the destination is in the proximity of
the Source or not. If all the above situations would be satisfied, MME builds a D2D session key
and sends it to the Source in a secure cellular channel and accordingly, the Source begins D2D
communication towards Destination.
In the current protocol has its basis on ARIADNE, the packaging field includes S, D, id, and t
for Source, Destination, the ID of the message and time respectively. Gaining a much
comprehensive picture, a part of the encrypted message along with the nonce is annexed.
Furthermore, in line with fulfilling the evaluation of MACs, a distinct key is exerted instead of two
key, since in ARIADNE the Source and destination have each others key and one key is sufficed.
We use the key chain TESLA protocol for intermediate users and assume that there is a system in
the network where the initial values of the user's TESLA key chain are broadcasted to the entire
network, and it can be implied that every cellular device can authenticate received TESLA key. In
the presence and absence of cellular network coverage, two binary scenarios would be resulted.
When users are in the coverage scope of the cellular network, this can be done by cellular network
control messages. Whereas, in the absence of cellular network coverage, we assume that users use
the previous initial values when the cellular network was available. The following section is
devoted to provide an in depth illustration with regard to the four scenarios.
2.1. Direct D2D Secure Protocol(DD2D)
In the current protocol, two D2D devices are in each others’ vicinity and Source initiates a D2D
communication by requesting the core network to establish a D2D. The protocol procedure,
parameters and fields are presented in Figure 2 and Table 2. The following nine phases thoroughly
delineate the procedure.
1. First, in establishing a D2D communication to a specified receiver, the Source sends a D2D
request message including Source and the Destination identity, in a Secure cellular channel
to the MME.
2. In the second phase, MME enacts two major roles of checking the validity of the message
and authenticates the Source and the Destination, and also monitoring the accuracy proximity
of the Source to the destination. In meeting the aforementioned provisos, MME builds a D2D
session key and sends it to the Source through a secure cellular channel.
3. The Source builds a K' key based on the key K received from the MME with a self-created
nonce, afterwards the message with the key ‘K' is encrypted. Furthermore, to fulfill the aim
of integrity property, the Source builds a message authentication key (MAC) with the key K
from the message field including the D2D request, Source id, Destination id, nonce, package
id, and time.
4. In the fourth phase, the Source broadcasts all the existing data in the input of the MAC
function with the result of it and h_0, to the receiver.
5. Succeeding, after receiving the message, to avoid repetition, the Destination first checks the
package id, and then checks the value of time which should not be so far in the past. If all
the situations agreed, a D2D request including Destination identity and Source identity is
sent to the MME.
6. If there was an earlier D2D request to Destination from the specified transmitter, MME
authorized the Destination and Source. Following the authorization, MME accepts the
request and sends the key K to the Destination in a secure cellular channel in the step of 7.
8. Destination after getting the key K from MME, starts to decrypt the MAC function. If all the
values are equal to the values in the request, the validity of the message will be accepted by
the Destination and then starts to decrypt the package by evaluation of the key K' with the
key K and nonce which was in the request fields.
5. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
5
9. Ultimately, after successful decryption and evaluation, the Destination builds a message and
sends it to the transmitter. Putting the value of D2D reply, Destination identity and Source
identity in a MAC leads to structure integrity.
Table 2: Parameter description
Parameter Description
K secure session key between Source and Destination
MAC_K(M) message authentication code of the message (M) with the key (K)
H() Hash function
Enk_k() symmetric Encryption with key k
Dek_K() symmetric Decryption with key k
Figure 2. DD2D Protocol
2.2. Relaying D2D Secure Protocol(RD2D)
This protocol starts like DD2D by requesting a core network (i.e. MME). But in this scenario, the
Source and the Destination are not in each others’ vicinity and relaying nodes should participate to
transfer information. The four phases of the protocol are the same as direct D2D protocol has been
discussed in section 2.1. In line with gaining a thorough picture with regard to DD2D and protocol
schematic, the following phases are presented (See Figure 3).
5. Device A after receiving the package from the transmitter checks the id for non-repudiation
property and then checks the t value, this value should not be too far in the time. If all the
values are true, it accepts the package and then evaluates the h_1 value based on h_0 and its
identity. Then for integrity property calculates the MAC function on all the values on the
6. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
6
previously received message plus its identity and h_1 with the key KAt which is the key to
its TESLA key chain.
6. Then forwards all these values plus MA (MAC with the key KAt) towards Destination.
7. Device B also repeats all the processes above to the received message and makes MAC
function based on KBt which is the key to its TESLA key chain.
8. Then forwards the package.
9. Device C repeats all the processes above and uses the key KCt for evaluation of MC. Then
forwards the package in step 10.
Steps 11 and 12 are the same as steps 6 and 7 in DD2D which described in section 2.1.
13. Immediately after getting the key K from MME, Destination starts to evaluate the hash
function chain including the MAC function with the key K has just been received. If the final
chain is equal to the one in the request, the validity of the message is accepted by the receiver;
and consequently the package decryption will be initiated and evaluated the key K' via the K
key and nonce in the request fields.
14. After successful decryption and evaluation. The Destination builds a message reply and
sends it to the transmitter. In achieving integrity properties, the destination puts the value of
D2D reply, Destination identity, Source identity into a MAC function and encrypt it with the
key K and sends it towards the transmitter.
15. In the penultimate phase, Device C receives a reply package and adds its TESLA key to the
end of the package and moves it forwards.
In ultimate steps (16 and 17), B and A do the same proceeds as C and the package moves the
transmitter forward.
Figure 3: RD2D Protocol
2.3. Direct D2D Secure Protocol without Cellular Infrastructure (DD2DW)
Although this protocol is similar to the DD2D Protocol, steps 1,2, 6,7 do not exist because of
lacking cellular infrastructure. To preserve confidentiality property, both Source and Destination
have to use a key that set prior starting this form of communication. We suppose each device
already exchanged secure key in a way such as key agreement procedures in (7,8). In the disaster
situation, we suppose losing confidentiality is less important than losing vital communication at
that time. So, we suppose each device has the potential to utilize its TESLA key if no other pre-
distribution keys exist and could use no other procedures. The protocol description is illustrated in
Figure 4 and the brass tacks explication is as follows.
7. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
7
1. Source starts to encrypt the message with the key K and then for integrity property puts the
request D2D fields, encrypted file (c), nonce, source id, Destination id, package id, and t to
the MAC function with its own TESLA key.
2. In the second phase, the Source sends the MAC function inputs with the result of MAC
function (h_0) towards the Destination.
3. It should be pinpointed that prior receiving the TESLA key of the source, validation of the
h_0 value is not feasible, though in the existence of the mutual key, it can decrypt the message
[hence, in the case of emergency situation its better to decrypt the package and if the TESLA
key which arrived from source failed to validate then the Destination withdraws the packet].
After package validation, Destination builds the reply package with the values of D2D reply,
Destination id, source id, t, and the MAC value of these fields with the key KDt which is
Destination TESLA key.
4. Hereafter, the MAC inputs with the MAC itself is sent towards the Source.
Figure 4: DD2Dw Protocol
2.4. Relaying D2D Secure Protocol without Cellular Infrastructure (RD2DW)
The structure of the current protocol is a combination of RD2D and DD2DW. As there should be
no approximation between the Source and Destination, relaying nodes enact a vital role. It is
pinpointed that since the cellular infrastructure is not available in this scenario, we presume that
each device has already been exchanged secure keys. The rest of the protocol description is as
follows (See Figure 5).
1. In the seedling stage, the Source begins D2D communication and encrypts the message with
the key K. Then for integrity property puts the request D2D, encrypted file (c), nonce, Source
id, Destination id, package id, and t to the MAC function with its own TESLA key.
2. In the next stage, the Source sends the MAC function inputs with the results of it (h_0)
towards the Destination.
8. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
8
3. After receiving the package, device A checks the id for non-repudiation property and then
checks the t value. Note that this value should not be too far in the past. If all the values were
true, it accepts the package and then evaluates the h_1 based on h_0 and its identity. Then
for integrity property, the Device calculates the MAC function on all the values on the
previously received packet plus its identity and h_1 with the key KAt which is the key of its
TESLA key chain.
4. In the fourth stage, all these values plus MA (MAC with the key KAt) are moved towards
the Destination.
5. Device B also repeats all the above processes to the received packet and makes MAC
function based on KBt, the key from its TESLA key chain, and accordingly creates MB.
6. Then it forwards the package received from A to the network, plus its id, B, and MB.
7. Device C repeats all the processes above and uses the key KCt for evaluation of MC.
8. Then forwards the package received from B to the network, plus its id, C, and MC.
9. In the existence of the mutual key, the Destination could validate the h_0 value before
receiving the TESLA keys and decrypt the message as well. So, in the case of emergency
situation its better to decrypt the package and if the TESLA keys arrived and the package
failed to validate, then the Destination withdraws the package and informs all the network
from the intruder. After validation of the package, the Destination builds the reply package
with the values of D2D Reply, the Destination id, source id, and t, and the MAC value made
of these fields with the key KDt which is Destination TESLA key.
10. The MAC inputs with the MAC itself is sent towards the source into the network.
11. After receiving a reply package, device C adds its TESLA key to the end of the package and
moves it forward...
In steps 12 and 13, B and A do the same procedure as C and forward the package to the Source.
Figure 5: RD2DW protocol
9. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
9
3. ANALYSIS OF THE PROPOSED PROTOCOLS
As can be seen in Table 3, the role and the packet size of each node are considered as the
determining factor in assessing the level of operations. In this Table, Enc and Dec are implemented
for encryption and decryption; further, H is for hash value, Ks is for key size, and n is for the
number of nodes including Source and Destination. We assume symmetric encryption with the
output of 256 bits and also a hash function with the size of 256 bits, 4 bits for request, ti, I, and N
and also 8 bits has its applicability for Source and Destination identities. Considering the number
of nodes participating in D2D, the replay packet will have a different size. If we assume the
maximum number of nodes is 20, the maximum packet size of Destination in the replay packet is
629 bytes and also the maximum packet size of intermediate nodes in request and replay packet
respectively are 662 bytes and 629ks bytes.
Table 3: Operations and packet size in proposed protocols
Device operations Packet size
The source in direct D2D Enc+H 544 bit
The source in relaying D2D 2Enc+H 544 bit
Destination in direct D2D Dec+H 286 bit
Destination in relaying D2D Enc+Dec+nH 28+(n-2)8+(n-1)256 bit
Intermediate node in the request
packet
2H 28+(n-1)8+n256 bit
Intermediate node in the reply
packet
- 12+8n+(n-1)256+(n-2)Ks
3.1. Computation overhead
In the proposed protocols, we use a symmetric function for encryption and decryption of the
message and one for key and also a cryptographic hash function for each transmission. Therefore,
there are two symmetric encryptions/decryptions and one cryptographic hash function evaluation
for source and destination, and one cryptographic hash function evaluation for each relaying device.
The computation cost of the proposed protocol is presented in Table 4. In line with a much more
perception, Enc and Dec are for Encryption and Decryption, n is for the number of devices, H is a
hash function, Mul is for multiplication, EO is for exponential operation, PA is for pairing, Div is
for division and PO is for point multiplication.
Table 4: Computation cost of Secure protocols
Secure protocol Computation cost
SDGA (13) 3(2𝑛 − 1)𝑃𝐴 + 5𝑛𝐸𝑂 + (4𝑛 − 1)𝐻 + 2(2𝑛 − 1)𝑀𝑢𝑙
PPAKA (14) 2(2𝑛 − 1)𝐸𝑂 + (𝑛2
+ 3𝑛 − 4)𝐻 + (2𝑛2
− 3𝑛 + 1)𝑀𝑢𝑙
GRAAD (15)
2𝑛𝑃𝐴 + 7(3𝑛 − 2)𝐻 + 𝑛𝐸𝑛𝑐 + 𝑛𝐷𝑒𝑐 + 3(𝑛 − 1)𝑃𝑂 + 8(𝑛 − 1)𝐸𝑂 + 2(𝑛
− 1)𝑀𝑢𝑙
LRSA (16) 6𝑛𝑃𝑂 + (13𝑛 − 7)𝐻 + (3𝑛 − 1)𝑀𝑢𝑙 + 2𝐷𝑖𝑣
SeDS (17) 2𝑃𝐴 + (5𝑛 − 2)𝐸𝑂 + 𝐷𝑒𝑐 + (2𝑛 + 1)𝐻 + 4(𝑛 − 1) 𝑃𝑂 + 2(𝑛 − 1)𝐸𝑛𝑐
DD2D 3𝐸𝑛𝑐 + 3𝐻 + 𝐷𝑒𝑐
RD2D 3𝐸𝑛𝑐 + (2𝑛 + 1)𝐻 + 𝐷𝑒𝑐
DD2DW 𝐸𝑛𝑐 + 3𝐻 + 𝐷𝑒𝑐
RD2DW 𝐸𝑛𝑐 + (2𝑛 − 1)𝐻 + 𝐷𝑒𝑐
10. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
10
3.2. Communication overhead
In RD2D and RD2DW, the protocol has 2n packet transmission for each relay device (one for
Request and one for Reply). Considering the feature, we can explicitly assert that the
communication overhead of the proposed protocol is as equation 1.
(1)
𝐶𝑜𝑚𝑚𝑢𝑛𝑖𝑐𝑎𝑡𝑖𝑜𝑛 𝑂𝑣𝑒𝑟ℎ𝑒𝑎𝑑 =
𝑇′
× 𝑀 × (2𝑛 + 2)
𝑇
Sparkling much light in this matter on hand, 𝑇′ is the number of timeslots for the occurrence of
D2D requests, the second core value is 𝑀, which is the number of D2D requests at each timeslot,
and the number of applied devices is known as . Since RD2D has the biggest communication
overhead among three other proposed protocols, we compare the communication cost of RD2D
with SODE (6). In SODE, two cryptic fields for each device has to be sent from each eNodeBs to
each eNodeB neighbours. Also, two cryptic fields for each neighbours have to be sent to all the
devices belongs to eNodeB. Another communication parts in SODE are from D2D request and
D2D reply. These two communications are for key agreement between two devices in the network.
Communication overhead of RD2D and SODE based on increasing the number of time slots when
the number of eNodeBs are 2 and when are 7 in figure 6 and 7 respectively. It can be seen that the
communication overhead increases as the number of nodes (n) increased. When the number of
eNodeBs increased from 2 to 7, the communication overhead of SODE increases for about 3 times,
but in RD2D the number of eNodeBs has no effect on the communication overhead. In another
comparison, we check the change of the number of T' to communication overhead when M=1 and
M=5 in figures 8 and 9 respectively. Concerning the quantification curve, as T' increases, the
communication overhead increases and thus both protocols have more communication overhead if
M increases to 5. It can be inferred that as the number of D2D requests increase the communication
overhead increases as well. As illustrated in Figure 8 and 9, RD2D suffers less communication
overhead than SODE. More to say, communication overhead in the slob of SODE is much more
than RD2D.
Table 5. Parameters used in communication overhead simulation
Parameter value
n 10
T 20
T' 10
M 1 & 5
Figure 6. The Communication Overhead Vs the Number of Nodes when B=2
11. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
11
Figure 7. The Communication Overhead Vs the Number of Nodes when B=7
Figure 8. The Communication Overhead Vs the Number of Timeslots when M=1
Figure 9. The Communication Overhead Vs the Number of Timeslots when M=5
12. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
12
3.3. Security properties of the protocol
In this section, the security properties of our protocols is demonstrate. Our proposed protocols
consist of the integral components namely Authentication, Authorization, Confidentiality,
Integrity, Non-repudiation, Secure routing transmission, Secure key agreement, and reachability.
Making a bridge with other protocols, we will show two other security properties known as Secure
key agreement and reachability in the ProVerif Section
1. Authentication and Authorization: This property is based on the cellular authentication and
authorization process in cellular coverage scenarios (DD2D and RD2D). In the two other
scenarios (DD2DW and RD2DW), authentication and authorization have their basis on the
privacy of secret keys on each side. In meeting the two previous of decrypting the packet and
evaluate the message, both sides (Source and Destination), are authorized. For this
assumption, we suppose that no one reveals the key and the key saved in both devices
securely.
2. Confidentiality: This property is gained by the encryption and decryption of the message
based on the secret key, received from the MME. The MME is the trusted server which would
not reveal the key K to anybody but authorized Source and Destination on each D2D
communication. In DD2DW and RD2DW, the confidentiality of the message is based on the
secrecy of the keys and key distribution system they used in the absence of cellular
infrastructure.
3. Integrity: This feature is extracted by the hash values. If the destination evaluates the hash
chain values and they are different from what was inside the packet, the integrity of the packet
will be lost and the received packet should be waived. This property could be checked by the
Source.
4. Non-repudiation: This property can be set by the packet id value in the request message
which should be fresh. Also, the t value should not be too far in the past.
5. Secure routing transmission: Use of this property is restricted for RD2D and RD2DW, since
these two protocols have routing part. As our proposed protocols are based on ARIADNE
protocol, it prevents tampering with the attackers or comprised nodes and resists multitude
Denial-of-Service attacks as well.
3.4. Proverif verification of RD2D protocol
It has been stated that ProVerif is considered as a formal tool to verify cryptographic protocols
(18) and we check confidentiality, reachability and secure key agreement of RD2D by it. Input
language of ProVerif supports channels with the "Dolev-Yao" ability attacker. This attacker model
is very strong and has full control over the channel. Table 6 illustrates the security properties that
we used for security validation of our proposed protocol.
13. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
13
Table 6. Security properties of the protocol used in ProVerif
Security Property ProVerif
Confidentiality query attacker(m).
Reachability
query event(mmeReachable()).
query event(hssReachable()).
query event(SourceReachable()).
query event(DestinationReachable()).
Authentication
One-way
authentication
event acceptsServerClientA(bitstring,key).
event acceptsServerClientB(bitstring,key).
event acceptsServerClientC(bitstring,key).
event acceptsServerDestination(bitstring,key).
One-to-one
authentication*
event termDestination(bitstring,key).
Secure Key
agreement
Running key
event SourceRunning(key).
event mmeRunning(key).
event DestinationRunning(key).
event ClientARunning(bitstring,key).
event ClientBRunning(bitstring,key).
event ClientCRunning(bitstring,key).
Key agreement
event SourceCommit(key).
event mmeCommit(key).
event DestinationCommit(key).
A unidirectional authentication is used to check authenticity (i.e. Source authenticates relaying
devices and Destination). However, in one-to-one authentication, two sides of communication
should authenticate each other (i.e. Source and Destination). It can be implied that, we use one-to-
one authentication for Source and Destination and one-way authentication for relaying devices. We
assume that MME is part of the core network and is trusted section and there is no need to be
authenticated. We monitor the Secure key agreement procedure in two phases, running key and
key agreement. In the phase of running key, a device uses a key and in the phase of key agreement,
the other device agrees on the key used. As can be seen in Figure 10, ProVerif verifies all the
security properties of RD2D.
Figure 10: ProVerif Verification of RD2D Protocol
14. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
14
4. CONCLUSION
In the context of the present study, we proposed four D2D secure protocols for four different
scenarios (DD2D, RD2D, DD2DW, and RD2DW). To the best knowledge of the author, this is the
first time a protocol has the capability to adapt four scenarios which are essential to D2D networks.
The adopted framework was based on ARIADNE with TESLA. To fulfill the aim of Authentication
and key agreement for the Source and Destination in RD2D and DD2D, we used LTE-A AKA
protocol. Furthermore, TESLA and broadcast authentication protocol was implemented for key
utilization in intermediate nodes. Enumerating the métiers, the protocol does not need pre-shared
keys for these nodes. Relying on the results, in contrary to the recent literature, our proposed
protocols have less computation overhead; moreover, RD2D suffers less communication
perplexity in comparison to SODE protocol and it has more communication overhead among three
other proposed protocols; thus, the others have less communication overhead than SODE as well
.In a nutshell, we indicated that our protocol security features and proofs Confidentiality,
Reachability, Authentication, Secure Key agreement with ProVerif formal verification tools.
Casting much light on the fortes, our proposed protocols enjoys Authentication and Authorization,
Confidentiality, Integrity, Non-repudiation, Secure routing transmission, Reachability, and Secure
Key agreement with low communication and computation perplexity.
REFERENCES
[1] H. H. Hussein, H. A. Elsayed, and S. M. A. El-kader, “Intensive Benchmarking of D2D communication
over 5G cellular networks: prototype, integrated features, challenges, and main applications,” Wirel.
Networks, pp. 1–20, 2019.
[2] N. Kato, “On device-to-device (D2D) communication [Editor’s note],” IEEE Netw., vol. 30, no. 3, p.
2, 2016.
[3] Y.-D. Lin and Y.-C. Hsu, “Multihop cellular: A new architecture for wireless communications,” in
INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications
Societies. Proceedings. IEEE, 2000, vol. 3, pp. 1273–1282.
[4] D. Wu, L. Zhou, Y. Cai, R. Q. Hu, and Y. Qian, “The role of mobility for D2D communications in
LTE-Advanced networks: energy vs. bandwidth efficiency,” IEEE Wirel. Commun., vol. 21, no. 2, pp.
66–71, 2014.
[5] N. Panwar, S. Sharma, and A. K. Singh, “A survey on 5G: The next generation of mobile
communication,” Phys. Commun., vol. 18, pp. 64–84, 2016.
[6] S. K. Tetarave and S. Tripathy, “Secure Opportunistic Data Exchange Using Smart Devices in 5G/LTE-
A Networks,” in International Conference on Security & Privacy, 2019, pp. 3–16.
[7] T. Balan, A. Balan, and F. Sandu, “SDR Implementation of a D2D Security Cryptographic
Mechanism,” IEEE Access, vol. 7, pp. 38847–38855, 2019.
[8] L. Wang, Y. Tian, D. Zhang, and Y. Lu, “Constant-round authenticated and dynamic group key
agreement protocol for D2D group communications,” Inf. Sci. (Ny)., vol. 503, pp. 61–71, 2019.
[9] P. Gope, “LAAP: Lightweight Anonymous Authentication Protocol for D2D-Aided Fog Computing
Paradigm,” Comput. Secur., 2019.
[10] M. Cao et al., “Sec-D2D: A Secure and Lightweight D2D Communication System With Multiple
Sensors,” IEEE Access, vol. 7, pp. 33759–33770, 2019.
[11] P. P. Tayade and P. Vijayakumar, “Enhancement of Security and Confidentiality for D2D
Communication in LTE-Advanced Network Using Optimised Protocol,” in Wireless Communication
Networks and Internet of Things, Springer, 2019, pp. 131–139.
[12] Y.-C. Hu, A. Perrig, and D. B. Johnson, “Ariadne: A secure on-demand routing protocol for ad hoc
networks,” Wirel. networks, vol. 11, no. 1–2, pp. 21–38, 2005.
[13] H. Tan, Y. Song, S. Xuan, S. Pan, and I. Chung, “Secure D2D group authentication employing
smartphone sensor behavior analysis,” Symmetry (Basel)., vol. 11, no. 8, p. 969, 2019.
[14] M. Wang and Z. Yan, “Privacy-preserving authentication and key agreement protocols for D2D group
communications,” IEEE Trans. Ind. Informatics, vol. 14, no. 8, pp. 3637–3647, 2017.
15. International Journal of Wireless & Mobile Networks (IJWMN), Vol.13, No.3/4, August 2021
15
[15] R.-H. Hsu, J. Lee, T. Q. S. Quek, and J.-C. Chen, “GRAAD: Group anonymous and accountable D2D
communication in mobile networks,” IEEE Trans. Inf. Forensics Secur., vol. 13, no. 2, pp. 449–464,
2017.
[16] A. Zhang, L. Wang, X. Ye, and X. Lin, “Light-weight and robust security-aware D2D-assist data
transmission protocol for mobile-health systems,” IEEE Trans. Inf. Forensics Secur., vol. 12, no. 3, pp.
662–675, 2016.
[17] A. Zhang, J. Chen, R. Q. Hu, and Y. Qian, “SeDS: Secure data sharing strategy for D2D communication
in LTE-Advanced networks,” IEEE Trans. Veh. Technol., vol. 65, no. 4, pp. 2659–2672, 2015.
[18] B. Blanchet, B. Smyth, V. Cheval, and M. Sylvestre, “ProVerif 2.00: Automatic Cryptographic
Protocol Verifier, User Manual and Tutorial,” Version from, pp. 5–16, 2018.
AUTHORS
Hoda Nematy graduated with a master degree in Cryptography and Secure
Communication from Malek Ashtar university of technology, Tehran, Iran.
Currently, she is working as the R&D team manager in Pars Pooya Control Binalood
Company.