TMED: A Spider-Web-Like Transmission Mechanism for Emergency Data in Vehicular Ad Hoc Networks

Qiu, Tie; Wang, Xin; Chen, Chen; Atiquzzaman, Mohammed; Liu, Lei

doi:10.1109/tvt.2018.2841348

Cited by 101 publications

(50 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…δ k,j is noise standard deviation of detailed sub-bands D k,j , and N denotes the number of elements in the noise-related sub-bands. E k,j = d k,j (x,y)∈D k,j d 2 k,j (x, y), and d k,j (x, y) is the original noiserelated NSST coefficients in high-pass sub-bands D k,j .…”

Section: Seismic Random Noise Attenuation Using Pcc Classificationmentioning

confidence: 99%

Seismic Random Noise Attenuation Based on PCC Classification in Transform Domain

et al. 2020

View full text Add to dashboard Cite

Random noise attenuation of seismic data is an essential step in the processing of seismic signals. However, as the exploration environment is becoming more and more complicated, the energy of valid signals is weaker and the signal to noise (SNR) is much lower, which brings great difficulty to seismic data processing and interpretation. To this end, we propose an unconventional and effective seismic random noise attenuation method based on proximal classifier with consistency (PCC) in transform domain. Firstly, we analyze various transforms for seismic data from traditional wavelet transform and curvelet transform to emerging non-subsampled shearlet transform (NSST) and non-subsampled contourlet transform (NSCT). And, we select the excellent NSST to decompose the noisy seismic data into different sub-bands of frequency and orientation responses. Secondly, unlike traditional sparse transform based seismic denoising methods that often directly use a thresholding operator and corresponding inverse transform to denoise seismic data, our proposed method employs a superior performance PCC to classify the NSST coefficients of seismic data before thresholding operator. The added step can effectively divide the NSST coefficients into reflected useful signal coefficients and noise-related coefficients, which can preserve the edge of reflected signals and keep the information of events intact as much as possible. In addition, we also introduce an adaptive threshold computing method and a soft-thresholding method to achieve seismic data denoising better. Finally, the experimental results on the typical synthetic example and real seismic data show the superior performance of the proposed method. INDEX TERMS Seismic data, random noise, attenuation, proximal classifier with consistency (PCC), non-subsampled shearlet transform (NSST).

show abstract

Section: Seismic Random Noise Attenuation Using Pcc Classificationmentioning

confidence: 99%

Seismic Random Noise Attenuation Based on PCC Classification in Transform Domain

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Mobile services in IoTs are widely used for a variety of smart scenarios, such as the smart city [9], the smart campus [10], the internet of vehicle [11], and so on. To support the mobile service, lots of technologies, such as efficient routing [12], mobile cloud [13], sensor cloud [14], emergency internet of things [15], are adopted for the data transmission and management.…”

Section: Related Workmentioning

confidence: 99%

Lightweight Anonymous Geometric Routing for Internet of Things

Sun¹,

Wang²,

Li³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Mobile service computing relies on efficient and secure data transfer. Geometric routing, which guarantees scalability, efficiency, and mobility, is a promising routing scheme for mobile services in the resource-constrained Internet of Things (IoT). However, the private data transmitted by geometric routing may be eavesdropped by the malicious node and the privacy-preserving becomes one of the important issues for the mobile service in IoTs. Due to the resource constrains, approaches using encryption or hashing are not suitable for geometric routing. In this paper, we propose a lightweight anonymous geometric routing (LAGER) to protect the node-related private data. Instead of using the encryption or hashing approach, LAGER adopts a coordinate confusion mechanism which provides each node an anonymous coordinate of virtual node, such that the private data is decoupled from the node coordinate. The malicious node cannot determine which node the data belongs to even if it obtains the private data. To support the data transmission with anonymous coordinates, LAGER adopts a hybrid routing scheme by combining the greedy routing and a source routing. The experiment results show that LAGER provides effective anonymity with acceptable costs of scalability and efficiency.

show abstract

“…Due to the movement of nodes, the exhaustion of node energy, and the existence of obstacles, routing holes exist. Energy holes refer to nodes in a space that are not closer to the destination node [20]- [22]. Based on GPSR, we propose a new routing method for mobile ad hoc network based on greedy forwarding improvement strategy.…”

Section: Introductionmentioning

confidence: 99%

A New Method of Mobile Ad Hoc Network Routing Based on Greed Forwarding Improvement Strategy

et al. 2019

View full text Add to dashboard Cite

In resource-constrained mobile ad hoc network, geographical routing algorithms are relatively attractive routing algorithms. Due to the movement of nodes, energy exhaustion and the presence of obstacles, routing holes may occur. The existing routing algorithm only considers bypassing routing void through right-hand or left-hand criteria, and forwards data at the boundary of the hole. However, such a routing algorithm may lead to the expansion of the routing hole and even cause the paralysis of the network. This paper proposes a new greedy forwarding improvement routing method for mobile ad hoc network. In the greedy forwarding phase, the reliable communication area is calculated, and then the quality of the link is evaluated according to the relative displacement between the nodes and the maintenance time of the link. Then, according to the quality of the link, the distance between the candidate node and the destination node, and the number of the neighbor nodes, the metric value is obtained, and the node with the large metric value is selected as the next hop. When a routing hole occurs, the waiting forwarding mode is used for a period of time. After a period of time, when the current node is still a routing hole node, we can use the right-hand rule and the left-hand criteria, and the bypass mode is performed simultaneously. By considering three factors of the deflection angle and the maintenance time of the link and the remaining energy of the node, the forwarding node as the next hop with the highest priority value is selected in each direction. The experimental results show that compared with the existing GPSR,EMGR and EDGR, the proposed algorithm reduces the energy consumption of the network, improves the delivery rate of data packets, reduces the network delay and prolongs the network lifetime. INDEX TERMS Mobile ad hoc network, greedy forwarding, bypass mode, link quality, energy consumption.

show abstract

TMED: A Spider-Web-Like Transmission Mechanism for Emergency Data in Vehicular Ad Hoc Networks

Cited by 101 publications

References 27 publications

Seismic Random Noise Attenuation Based on PCC Classification in Transform Domain

Seismic Random Noise Attenuation Based on PCC Classification in Transform Domain

Lightweight Anonymous Geometric Routing for Internet of Things

A New Method of Mobile Ad Hoc Network Routing Based on Greed Forwarding Improvement Strategy

Contact Info

Product

Resources

About