121 Hits in 7.4 sec

Virtual Coordinate Backtracking for Void Traversal in Geographic Routing [article]

Ke Liu, Nael Abu-Ghazaleh
2006 arXiv   pre-print
Geographical routing protocols have several desirable features for use in ad hoc and sensor networks but are susceptible to voids and localization errors.  ...  In addition, it is possible for nodes with the same coordinates to arise at different points in the network in the presence of voids. This paper identifies and analyzes these problems.  ...  The second contribution of the paper is to present a hybrid routing protocol that replaces the traditional face routing phase used for void traversal in geographic routing protocols with one based on virtual  ... 
arXiv:cs/0511059v2 fatcat:ej2m7d4k7rbb7elpd3apshjrie

Aligned Virtual Coordinates for Greedy Routing in WSNs [article]

Ke Liu, Nael Abu-Ghazaleh
2006 arXiv   pre-print
With our approach, and for the first time, we show that greedy routing on VCS out-performs that on physical coordinate systems even in the absence of localization errors.  ...  We compare AVCS against some of the most popular geographical routing protocols both on physical coordinate system and the virtual coordinate systems and show that AVCS significantly improves performance  ...  Instead of using the virtual coordinates directly for routing, they use them to estimate location for use in geographic routing.  ... 
arXiv:cs/0605089v1 fatcat:g2qdtkhqh5gqhen6myauorddza

Directional Virtual Coordinate Systems for Wireless Sensor Networks

Dulanjalie C. Dhanapala, Anura P. Jayasumana
2011 2011 IEEE International Conference on Communications (ICC)  
With these directional properties, it is possible, for the first time, to consider deterministic algorithms in the virtual domain, as illustrated with a constrained tree network example.  ...  DVCR significantly outperforms existing VCS routing schemes Convex Subspace Routing (CSR) and Logical Coordinate Routing (LCR), while achieving a performance similar to the geographical routing scheme  ...  Directional Virtual Coordinate Routing (DVCR) -Routing in directional VCS The proposed routing scheme in directional virtual space-Directional Virtual Coordinate Routing (DVCR) is compared with CSR [4  ... 
doi:10.1109/icc.2011.5963079 dblp:conf/icc/DhanapalaJ11 fatcat:6uqyjsgv4zbe3i4ax5w7edlb2u

Stateless and Delivery Guaranteed Geometric Routing on Virtual Coordinate System [article]

Ke Liu, Nael Abu-Ghazaleh
2008 arXiv   pre-print
When used in conjunction with our previously proposed aligned virtual coordinate system (AVCS), it out-performs not only all geometric routing protocols on VCS, but also geographic routing with accurate  ...  In existing VCS routing protocols, there is a lack of an effective stateless and delivery guaranteed complementary routing algorithm that can be used to traverse voids.  ...  LCR proposes a backtracking algorithm for traversing voids; however, it requires that each node remember every packet that passes through it.  ... 
arXiv:0803.4049v2 fatcat:dvv46eewfjhv7m64diadkxfxty

Minimizing Recovery State in Geographic Ad Hoc Routing

N. Arad, Y. Shavitt
2009 IEEE Transactions on Mobile Computing  
virtual positioning and routing algorithms that improve performance in ad-hoc networks containing voids.  ...  Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach fails.  ...  A packet reaching an unmapped void can either wait for the void traversing process to complete, or it may be routed in the meanwhile using the right-hand rule with high chances of success.  ... 
doi:10.1109/tmc.2008.86 fatcat:37qhraszlzhg7lail37kxm6a6q

Minimizing recovery state In geographic ad-hoc routing

Noa Arad, Yuval Shavitt
2006 Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '06  
virtual positioning and routing algorithms that improve performance in ad-hoc networks containing voids.  ...  Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach fails.  ...  A packet reaching an unmapped void can either wait for the void traversing process to complete, or it may be routed in the meanwhile using the right-hand rule with high chances of success.  ... 
doi:10.1145/1132905.1132908 dblp:conf/mobihoc/AradS06 fatcat:xjzxlxhlmbdepacjvgch7tgge4

Geo-logical routing in wireless sensor networks

Dulanjalie C. Dhanapala, Anura P. Jayasumana
2011 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks  
It uses topology domain coordinates, derived solely from virtual coordinates (VCs), as a better alternative for physical location information.  ...  With the ability to generate topological maps from virtual coordinates via a Singular Value Decomposition based technique, it is now possible to characterize a network with topological coordinates, which  ...  Topology based Cartesian coordinates so derived are more effective for geographic routing than the physical geographical coordinates.  ... 
doi:10.1109/sahcn.2011.5984912 dblp:conf/secon/DhanapalaJ11 fatcat:rkizwommlfcwdjktvffekjaftu

Adaptive algorithms to mitigate inefficiency in greedy geographical routing

Hong Huang
2006 IEEE Communications Letters  
This letter presents theoretical basis and practical algorithms for mitigating inefficiency in greedy geographical routing, which has great application potential in large scale ad hoc networks, such as  ...  The prerequisite of geographical routing is that nodes know their actual or virtual locations, which can be made available with or without using GPS [3] .  ...  Greedy geographical routing can be utterly inefficient in navigating around voids. An artificial yet illuminative example is given in Fig. 1 .  ... 
doi:10.1109/lcomm.2006.1603367 fatcat:w2tchiuvhfdgpihi7k5wb5g4qy

A position-based routing algorithm in 3D sensor networks

Alaa M. Al tahan, Mohamed K. Watfa
2010 Wireless Communications and Mobile Computing  
to route packets from sources to destinations with high path quality and reliability.  ...  We also show that location errors will still result in good performance of our algorithm while the same assumptions might yield bad performance or even complete failures in other popular geographical routing  ...  In virtual coordinates, nodes' locations are specified relative to some reference fixed nodes.  ... 
doi:10.1002/wcm.888 fatcat:iaroaxpyqzarnkpzfmhwdnnkjy

A Survey of Geographical Routing in Wireless Ad-Hoc Networks

Fraser Cadger, Kevin Curran, Jose Santos, Sandra Moffett
2013 IEEE Communications Surveys and Tutorials  
Geographic routing protocols have been designed for a variety of applications ranging from mobility prediction and management through to anonymous routing and from energy efficiency to QoS.  ...  Geographic routing offers a radical departure from previous topology-dependent routing paradigms through its use of physical location in the routing process.  ...  Virtual coordinates allow nodes that cannot perform localisation to participate in geographic routing through the use of virtual coordinates which are used in place of real coordinates.  ... 
doi:10.1109/surv.2012.062612.00109 fatcat:2fx7wianfjgodowu27oitsbhqm

Dimension Reduction of Virtual Coordinate Systems in Wireless Sensor Networks

Dulanjalie C. Dhanapala, Anura P. Jayasumana
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
Virtual Coordinate System (VCS) based routing schemes for sensor networks characterize each node by a coordinate vector of size M, consisting of distances to each of a set of M anchors.  ...  This Singular Value Decomposition (SVD) based method preserves the routability achieved in original coordinate space but with lower dimensions.  ...  Physical domain routing relies on the physical (geographic) position information for routing, e.g., as in Geometrical routing [1] .  ... 
doi:10.1109/glocom.2010.5683099 dblp:conf/globecom/DhanapalaJ10 fatcat:zppxrq6dcfdq5nshpt6odc53aa

Geo-LANMAR: a scalable routing protocol for ad hoc networks with group motion

Biao Zhou, Yeng-Zhong Lee, Mario Gerla, Floriano de Rango
2006 Wireless Communications and Mobile Computing  
Network scalability is one of the critical challenges and requirements in routing protocols for ad hoc networks. This paper presents a novel scalable routing protocol called Geo-LANMAR.  ...  In this framework, the integration between geo-coordinates and tabledriven IP addressing is introduced. There is also an integration of group management with geo-forwarding and IP group management.  ...  In the presence of a void, face routing has been proposed to route around the void, which uses the perimeter mode packet forwarding via a planar graph traversal.  ... 
doi:10.1002/wcm.433 fatcat:ci74sjy4ureszogpxhkqs2bure

VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks

M.-J. Tsai, F.-R. Wang, H.-Y. Yang, Y.-P. Cheng
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
Because the global positioning system (GPS) consumes a large amount of power and does not work indoors, many virtual-coordinate-based routing protocols are proposed for wireless sensor networks in which  ...  In this paper, we propose a method capable of augmenting virtual-coordinate-based routing protocols to guarantee packet delivery.  ...  Face algorithms [8] , [9] , [10] that route a packet from a dead-end node to a progress node in geographic routing protocols by traversing the boundaries of faces in a planar graph does not work in  ... 
doi:10.1109/infcom.2009.5062092 dblp:conf/infocom/TsaiWYC09 fatcat:i4uogshivbcllmcxi7gkqmhm3m

Routing and Traversal via Location Awareness in Ad Hoc Networks [chapter]

Evangelos Kranakis, Ladislav Stacho
2005 Handbook of Algorithms for Wireless Networking and Mobile Computing  
algorithms for efficient traversal and route discovery in ad-hoc networks.  ...  We survey some recent results that make use of location awareness of the hosts of an ad-hoc network in order to provide for efficient information dissemination.  ...  Acknowledgments Many thanks to the Morelia group (Edgar Chavez, Stefan Dobrev, Jarda Opartny, and Jorge Urrutia) for many hours of enjoyable discussions on the topics reviewed in this paper and to Danny  ... 
doi:10.1201/9781420035094.ch8 fatcat:ac62ijdzonfdvnghbvn6i46u2m

Pressure Routing for Underwater Sensor Networks

Uichin Lee, Paul Wang, Youngtae Noh, Luiz F. M. Vieira, Mario Gerla, Jun-Hong Cui
2010 2010 Proceedings IEEE INFOCOM  
The goal of this study is to design an efficient anycast routing algorithm for reliable underwater sensor event reporting to any one of the surface sonobuoys.  ...  In this paper, we address these challenges and propose HydroCast, a hydraulic pressure based anycast routing protocol that exploits the measured pressure levels to route data to surface buoys.  ...  [27] proposed a backtracking method over a virtual coordinate system where a packet is routed towards one of the anchors (used to build the virtual coordinate system), hoping that it can switch back  ... 
doi:10.1109/infcom.2010.5461986 dblp:conf/infocom/LeeWNVGC10 fatcat:yhjoed6fmneuhei7imkjuhny2e
« Previous Showing results 1 — 15 out of 121 results