New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks

Zhang, Degan; Ge, Hua; Zhang, Ting; Cui, Yu-ya; Liu, Xiaohuan; Mao, Guoqiang

doi:10.1109/tits.2018.2853165

Cited by 315 publications

(148 citation statements)

References 28 publications

Supporting

Mentioning

147

Contrasting

Order By: Relevance

“…And D, Attack interval, respectively. As shown in the figure, ASDA-RSA increases the residual energy by more than 11,14,15,16,20, and 23% those of current approaches, respectively. Figure 12 and 13, shows the comparison of the ASDA-RSA proposed scheme, CrossLayer, ASDA-BlowFish, ASDA-AES, GA-DoSLD, ASDA-3DES, and ASDA-DES models in term of Lifetime.…”

Section: Simulation Resultsmentioning

confidence: 85%

“…In normal operating conditions, energy consumption ratio in sensors drains their battery in months, whereas denial of sleep attack drains them in a few days by keeping the radio transmitter system on the sensor nodes on. 1,[12][13][14][15] In this paper, we proposed a multistage method called ASDA-RSA, as follows: 1) dividing the network into clusters. This stage is carried out using an energy (and distance) based approach for selecting the appropriate cluster head, to improve the network and optimize energy consumption.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Securing Wireless Sensor Networks Against Denial‐of‐Sleep Attacks Using RSA Cryptography Algorithm and Interlock Protocol

Fotohi

Bari

Yusefi

2019

Int J Communication

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have been vastly employed in the collection and transmission of data via wireless networks. This type of network is nowadays used in many applications for surveillance activities in various environments due to its low cost and easy communications. In these networks, the sensors use a limited power source which after its depletion, since it is nonrenewable, network lifetime ends. Due to the weaknesses in sensor nodes, they are vulnerable to many threats. One notable attack threating WSN is Denial of Sleep (DoS). DoS attacks denotes the loss of energy in these sensors by keeping the nodes from going into sleep and energy-saving mode. In this paper, the Abnormal Sensor Detection Accuracy (ASDA-RSA) method is utilized to counteract DoS attacks to reducing the amount of energy consumed. The ASDA-RSA schema in this paper consists of two phases to enhancement security in the WSNs. In the first phase, a clustering approach based on energy and distance is used to select the proper cluster head and in the second phase, the RSA cryptography algorithm and interlock protocol are used here along with an authentication method, to prevent DoS attacks. Moreover, ASDA-RSA method is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the WSN network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), network lifetime, detection ratio, and average residual energy. KEYWORDSASDA-RSA, denial of sleep attack, network lifetime, RSA cryptography, WSNs | INTRODUCTIONNetworks constructed with multiple sensors enables novel applications covering a wide range of areas. However, it is well-known that networks forming from a range of sensors are prone to factors threatening their security. [1][2][3][4] Security is a main research topic in wireless sensor networks (WSNs). The widespread application of WSNs in security sensitive environment, such as military environment, made security considerations a basic requirement. Since nodes are the routing medium in the network, attacking the nodes eradicate the network. As routing is a trust-based operation among the nodes, there exists a good opportunity for attackers to disorder the routing process. These networks are usually formed without pre-planning and are utilized for a short period; hence, security investigations in

show abstract

Section: Simulation Resultsmentioning

confidence: 85%

mentioning

confidence: 99%

Securing Wireless Sensor Networks Against Denial‐of‐Sleep Attacks Using RSA Cryptography Algorithm and Interlock Protocol

Fotohi

Bari

Yusefi

2019

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The spine routing structure [8] selects a stable spine node as a virtual backbone for ad hoc networks so that network routes are discovered and maintained via a way of connecting two adjacent spine-based sub-networks. Particularly for dynamic mobile networks, some distributed weighted cluster-based algorithms [10,16,17] choose some crucial cluster heads by calculating a weight measure based on a node's state information and its link status with the surrounding neighbor nodes. However, these approaches focus only on network construction, lacking the computation resource aspect.…”

Section: Related Workmentioning

confidence: 99%

On-Demand Computation Offloading Architecture in Fog Networks

Jin

Lee

2019

Electronics

View full text Add to dashboard Cite

With the advent of the Internet-of-Things (IoT), end-devices have been served as sensors, gateways, or local storage equipment. Due to their scarce resource capability, cloud-based computing is currently a necessary companion. However, raw data collected at devices should be uploaded to a cloud server, taking a significantly large amount of network bandwidth. In this paper, we propose an on-demand computation offloading architecture in fog networks, by soliciting available resources from nearby edge devices and distributing a suitable amount of computation tasks to them. The proposed architecture aims to finish a necessary computation job within a distinct deadline with a reduced network overhead. Our work consists of three elements: (1) resource provider network formation by classifying nodes into stem or leaf depending on network stability, (2) task allocation based on each node’s resource availability and soliciting status, and (3) task redistribution in preparation for possible network and computation losses. Simulation-driven validation in the iFogSim simulator demonstrates that our work achieves a high task completion rate within a designated deadline, while drastically reducing unnecessary network overhead, by selecting only some effective edge devices as computation delegates via locally networked computation.

show abstract

“…For the processing of missing data, scholars at home and abroad usually choose the most typical two methods: One is to delete some of the missing data in the data set directly and only use the existing whole data collected for the application of traffic flow prediction; another method is to use algorithms to complete incomplete data into complete data 34–37 . The above two methods have their own advantages and disadvantages.…”

Section: Introductionmentioning

confidence: 99%

A novel approach of tensor‐based data missing estimation for Internet of Vehicles

Zhang

Gao

et al. 2020

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary In the face of the current huge amount of intelligent traffic data, collecting and statistical processing is a necessary and important process. But the inevitable data missing problem is the current research focus. In this paper, a novel approach of tensor‐based data missing estimation for Internet of Vehicles is proposed for the problem of missing the Internet of Vehicles data: Integrated Bayesian tensor decomposition (IBTD). In the data model construction stage, the random sampling principle is used to randomly extract the missing data to generate a subset of data. And the optimized Bayesian tensor decomposition algorithm is used for interpolation. Introduce the integration idea, analyze, and sort the error results after multiple interpolations, consider the space‐time complexity, and choose the optimal average to get the best result. The performance of the proposed model was evaluated by mean absolute percentage error (MAPE) and root mean square error (RMSE). The experimental results show that the proposed method can effectively interpolate the traffic data sets with different missing quantities and get good interpolation results.

show abstract

New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks

Cited by 315 publications

References 28 publications

Securing Wireless Sensor Networks Against Denial‐of‐Sleep Attacks Using RSA Cryptography Algorithm and Interlock Protocol

Securing Wireless Sensor Networks Against Denial‐of‐Sleep Attacks Using RSA Cryptography Algorithm and Interlock Protocol

On-Demand Computation Offloading Architecture in Fog Networks

A novel approach of tensor‐based data missing estimation for Internet of Vehicles

Contact Info

Product

Resources

About