f-Sensitivity Distance Oracles and Routing Schemes

2010 ◽  
pp. 84-96 ◽  
Author(s):  
Shiri Chechik ◽  
Michael Langberg ◽  
David Peleg ◽  
Liam Roditty
Keyword(s):  
Routing Schemes ◽  
Distance Oracles

f-Sensitivity Distance Oracles and Routing Schemes

Algorithmica ◽  
2011 ◽  
Vol 63 (4) ◽  
pp. 861-882 ◽  
Author(s):  
Shiri Chechik ◽  
Michael Langberg ◽  
David Peleg ◽  
Liam Roditty
Keyword(s):  
Routing Schemes ◽  
Distance Oracles

Non-Cooperative Game Based Research on Routing Schemes for Wireless Networks

2009 ◽  
Vol 32 (1) ◽  
pp. 54-68 ◽  
Author(s):  
Yang WANG ◽  
Chuang LIN ◽  
Quan-Lin LI ◽  
Jing-Qi WANG ◽  
Xin JIANG
Keyword(s):  
Wireless Networks ◽  
Cooperative Game ◽  
Routing Schemes

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