Results 21 to 30 of about 1,125 (277)
Stateless Multicast Protocol for Ad Hoc Networks
IEEE Transactions on Mobile Computing, 2012 Multicast routing protocols typically rely on the a priori creation of a multicast tree (or mesh), which requires the individual nodes to maintain state information. In dynamic networks with bursty traffic, where long periods of silence are expected between the bursts of data, this multicast state maintenance adds a large amount of communication ...
Feng, Chen-Hsiang +3 more
openaire +3 more sources
A Multimetric, Map-Aware Routing Protocol for VANETs in Urban Areas
Sensors, 2014 In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks.
Carolina Tripp-Barba +6 more
doaj +1 more source
Improved trustworthy, speed, and energy-efficient GPSR routing algorithm in large-scale WSN
Measurement: Sensors, 2022 Geographic routing networks broadcast their readiness to modify the routing protocol using the traditional methodology in wireless sensor network (WSN). These are effectively dealt with to preserve electricity.
M.V.N.R. Pavan Kumar, R. Hariharan
doaj +1 more source
Link Failure Tolerant GPSR Protocol
International Journal of Networked and Distributed Computing (IJNDC), 2021 Link failure cause packet loss, increased delays, disconnection from the network or even the shutdown of the inter-vehicle communication system vehicle-to-vehicle. Routing protocols suffer from this situation due to the lack of fault tolerance mechanisms
Ikram Cherifi, Zoulikha Mekkakia Maaza
doaj +1 more source
Computation, 2023 In mobile ad hoc networks (MANETs), geographical routing provides a robust and scalable solution for the randomly distributed and unrestricted movement of nodes.
Raneen I. Al-Essa, Ghaida A. Al-Suhail
doaj +1 more source
A cryptographic primitive based on hidden-order groups
Journal of Mathematical Cryptology, 2009 Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known.
Saxena Amitabh, Soh Ben
doaj +1 more source
W-GPCR Routing Method for Vehicular Ad Hoc Networks
Sensors, 2020 The high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols.
Min Li +6 more
doaj +1 more source
A Novel Stateless Authentication Protocol
, 2013 The value of authentication protocols which minimise (or even eliminate) the need for stored state in addressing DoS attacks is well-established — the seminal paper of Aura and Nikander [1] is of particular importance in this context. However, although there is now a substantial literature on this topic, it would seem that many aspects of stateless ...
openaire +13 more sources
Routing optimization method based on GPCR for vehicular Ad Hoc network
Tongxin xuebao, 2020 To improve the performance in sparse networks,local optimum,and routing loop in the greedy perimeter coordinator routing (GPCR) protocol,the weighted-GPCR (W-GPCR) protocol was proposed.The relationship between vehicle node routing and other parameters ...
Zhiru GU +4 more
doaj +2 more sources
A geographic routing protocol based on trunk line in VANETs
Digital Communications and Networks, 2021 A Trunk Line Based Geographic Routing(TLBGR) protocol in Vehicular Ad-hoc Networks (VANETs) is proposed in this paper to solve the problem of data acquisition in the traditional trunk coordinated control system.
Chen Chen +5 more
doaj +1 more source