A Dynamic and Self-Adaptive Network Selection Method for Multimode Communications in Heterogeneous Vehicular Telematics

Tian, Daxin; Zhou, Jianshan; Wang, Yunpeng; Lu, Yingrong; Xia, Haiying; Yi, Zhenguo

doi:10.1109/tits.2015.2422144

Cited by 76 publications

(26 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the previous work [16], the authors have extended the basic attractor selection model to the high-dimension decisionmaking space. According to [16], given the probabilities that the current forwarding node i's candidate nodes are selected as next-hop node, a vector M i = [m 1 , m 2 , .…”

Section: Related Workmentioning

confidence: 99%

“…According to [16], given the probabilities that the current forwarding node i's candidate nodes are selected as next-hop node, a vector M i = [m 1 , m 2 , . .…”

Section: Related Workmentioning

confidence: 99%

“…Source node → 1 → 2 → 3 → 4 → Destination node (6) At the destination node, the activity α is calculated according to equation (16). Then destination node sends a backward data packet to update the activity of nodes 1, 2, 3, 4 along the previous path (path 1).…”

Section: Routing Proceduresmentioning

confidence: 99%

“…As a new bio-inspired model, CASM has been successfully applied in many fields. For example, the adaptive vehicular epidemic routing method [15], the network selection method for multimode communications in heterogeneous vehicular telematics [16], the adaptive signal control for traffic networks [17] etc. CASM also offers a new choice for future mobile network management [18].…”

mentioning

confidence: 99%

See 3 more Smart Citations

A Microbial Inspired Routing Protocol for VANETs

Tian

Zheng

Zhou

et al. 2018

IEEE Internet Things J.

Self Cite

View full text Add to dashboard Cite

Abstract-We present a bio-inspired unicast routing protocol for vehicular Ad Hoc Networks which uses the cellular attractor selection mechanism to select next hops. The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets. We further employ a multi-attribute decision-making strategy, the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS), to reduce the number of redundant candidates for next-hop selection, so as to enhance the performance of attractor selection mechanism. Once the routing path is found, URAS maintains the current path or finds another better path adaptively based on the performance of current path, that is, it can self-evolution until the best routing path is found. Our simulation study compares the proposed solution with the state-of-the-art schemes, and shows the robustness and effectiveness of the proposed routing protocol and the significant performance improvement, in terms of packet delivery, end-toend delay, and congestion, over the conventional method.Index Terms-Vehicular ad hoc networks, routing protocol, adaptive mechanism, biologically inspired networking, cellular attractor selection.

show abstract

Section: Related Workmentioning

confidence: 99%

“…According to [16], given the probabilities that the current forwarding node i's candidate nodes are selected as next-hop node, a vector M i = [m 1 , m 2 , . .…”

Section: Related Workmentioning

confidence: 99%

Section: Routing Proceduresmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

A Microbial Inspired Routing Protocol for VANETs

Tian

Zheng

Zhou

et al. 2018

IEEE Internet Things J.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Due to the differences of heterogeneous terminals [2], limited wireless bandwidth and energy supply [3], and other issues, a heterogeneous network [4] is difficult to effectively solve the data packet loss and diversity network delay [5].…”

Section: Introductionmentioning

confidence: 99%

Distributed crowd filtering mechanism based on heterogeneous network delay and data packet loss constraint

Xiang-jun

2016

J Embedded Systems

View full text Add to dashboard Cite

The differences among heterogeneous networks, network delay, and data packet error could decline network performance. In order to solve the above problems, we study a kind of distributed crowd-filtering mechanism. This mechanism can effectively control the heterogeneous network diversity delay by updating the coordination signal matrix, the aggregation signal matrix, and the control signal matrix. The mechanism can effectively improve network reliability based on the packet loss constraint. Considering the influence of heterogeneous network latency on the reliability of data mining results, we studied the crowd-filtering scheme for eliminating the effect of packet loss on the efficiency of data filtering. Experimental results show that, compared with the ant colony algorithm, the distributed crowd filter can accurately predict the data position, reduce the filtering error, and improve the classification accuracy and the data characteristics.

show abstract

Modeling and performance analysis of dynamic spectrum sharing between DSRC and Wi‐Fi systems

Wang

Liu

et al. 2016

Wireless Communications

View full text Add to dashboard Cite

The Notice of Proposed Rulemaking 13‐22 released by Federal Communications Commission unlocks the Dedicated Short Range Communication (DSRC) spectrum for Wi‐Fi availability, which undoubtedly brings unpredictable effects to the new‐emerging vehicular applications and services. To efficiently harmonize the spectrum operation between DSRC and Wi‐Fi networks, several dynamic spectrum‐sharing schemes are already proposed to improve the spectral efficiency over a limited bandwidth situation and as well to satisfy the ever‐increasing demand for bandwidth resource. Different from most previous literature that mainly focused on the performance analysis of cellular‐network‐centric spectrum sharing, we aim to analyze the performance of the mainstream dynamic spectrum‐sharing schemes specially designed for the coexistence of DSRC and Wi‐Fi networks against various combinations of network parameters through a hybrid network model and performance indicators. We employ the Poisson point process to model a hybrid network where DSRC vehicles and Wi‐Fi devices coexist, and introduce the performance indicators of spectrum efficiency and data rate to assess the utility of different spectrum sharing candidates. Through the presented hybrid model and performance indicators, we collect extensive numerical and simulation results to investigate four typical spectrum allocation schemes for DSRC and Wi‐Fi coexistence, that is non‐sharing scheme, original sharing scheme, and Qualcomm's and Cisco's proposals, respectively. The results show that the dynamic spectrum sharing in the 5.9‐GHz band can significantly raise the performance of Wi‐Fi network without excessively degrading the DSRC system, and especially the Cisco's proposal prefers to protect the DSRC profit while the Qualcomm's draft favors Wi‐Fi exclusively. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

A Dynamic and Self-Adaptive Network Selection Method for Multimode Communications in Heterogeneous Vehicular Telematics

Cited by 76 publications

References 27 publications

A Microbial Inspired Routing Protocol for VANETs

A Microbial Inspired Routing Protocol for VANETs

Distributed crowd filtering mechanism based on heterogeneous network delay and data packet loss constraint

Modeling and performance analysis of dynamic spectrum sharing between DSRC and Wi‐Fi systems

Contact Info

Product

Resources

About