Social-based routing scheme for fixed-line VANET

2017 ◽  
Vol 113 ◽  
pp. 230-243 ◽  
Author(s):  
Junling Shi ◽  
Xingwei Wang ◽  
Min Huang ◽  
Keqin Li ◽  
Sajal K. Das
Keyword(s):  
Routing Scheme ◽  
Fixed Line

ODBF: A P2P Weak State Routing Scheme Based on Operative Decaying Bloom Filter

2012 ◽  
Vol 35 (5) ◽  
pp. 910-917
Author(s):  
Gui-Ming ZHU ◽  
De-Ke GUO ◽  
Shi-Yao JIN
Keyword(s):  
Bloom Filter ◽  
Weak State ◽  
Routing Scheme

Minimum Total Power Spectrum Aware Routing Scheme

2015 ◽  
Vol 3 (2) ◽  
pp. 37-46
Author(s):  
Mehak Mehak ◽  
◽  
G. Poonam ◽  
C. K. Nagpal ◽  
Shailender Gupta ◽  
...  
Keyword(s):  
Power Spectrum ◽  
Total Power ◽  
Routing Scheme

ENROUTE: An Entropy Aware Routing Scheme for Information-Centric Networks (ICN)

2021 ◽  
Author(s):  
Bitan Banerjee ◽  
Sibendu Paul ◽  
Omar Alfandi ◽  
Arnab Raha ◽  
Amitava Mukherjee
Keyword(s):  
Routing Scheme

scholarly journals Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Geographic Routing ◽  
Routing Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Effective Manner

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.

Sign in / Sign up

Export Citation Format

Share Document