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

Tsai, Ming‐Jer; Wang, F.-R.; Yang, Hsiu-Ming; Cheng, Yu-Chun

doi:10.1109/infcom.2009.5062092

Cited by 12 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach has been further extended to completely switch to virtual coordinates on the overlay by performing some coordinate transformation [23]. Similarly, a transformation of geographical coordinates into virtual positions that prevent concave holes in the network allows optimized greedy routing relying on GHT-like services [4], [22].…”

Section: Related Workmentioning

confidence: 99%

“…T HE use of virtual coordinates is currently being investigated for efficient routing in Wireless Sensor Networks (WSNs) [1], [2], [3], [4], [5]. In general, WSNs provide an interesting research domain because they represent a class of massively distributed systems in which nodes are required to work in a cooperative and self-organized fashion to overcome scalability problems [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

“…Also, hierarchical approaches using a mixture of geographical coordinates and a virtual overlay have been considered [23]. Comprehensive surveys of such virtual coordinate-based solutions can be found in [4], [5].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks

Awad

German

Dressler

2011

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

We present the Virtual Cord Protocol (VCP), which exploits virtual coordinates to provide efficient and failure tolerant routing and data management in sensor networks. VCP maintains a virtual cord interconnecting all the nodes in the network and which, operating similar to a Distributed Hash Table (DHT), provides means for inserting data fragments into sensor nodes and retrieving them. Furthermore, it supports service discovery using indirections. VCP uses two mechanisms for finding paths to nodes and associated data items: First, it relies on the virtual cord that always provides a path toward the destination. Second, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the shortest path (achieving a stretch ratio of less than 125 percent) with very low overhead. We also extended VCP with data replication mechanisms to improve failure handling. The routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g., Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. The presented results outline the capabilities of VCP to handle such cases more efficiently compared to other protocols. We also compared the capabilities to reliably store and retrieve data in the network to Geographic Hash Tables (GHTs). VCP, in the worst case, performs similar to GHTs, but outperforms this protocol in most cases, especially when complex routing is involved.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks

Awad

German

Dressler

2011

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…Recently, many routing protocols, such as greedy perimeter stateless routing (GPSR) , greedy‐face‐greedy (GFG) , greedy other adaptive face routing plus (GOAFR+) , gradient landmark‐based distributed routing (GLIDER) , virtual coordinate assignment protocol (VCap) , medial axis‐based naming and routing protocol (MAP) , greedy landmark descent routing (GLDR) , PAG:CFace(3) , greedy‐random‐greedy (GRG) , small‐world iterative navigation greedy (SWING) , greedy‐hull‐greedy (GHG) , axis‐based VCap (ABVCap) , ABVCap in 3D wireless sensor networks (ABVCap _3D) , VirtualFace , ProgressFace , directional virtual coordinate routing (DVCR) , and geological routing (GLR) , have been proposed. However, each has at least one of the following problems: A VCap is needed .…”

Section: Introductionmentioning

confidence: 99%

Efficient delivery‐guaranteed geographic routing in 3D wireless sensor networks with holes

Liu

Cheng

Wen

2014

Wireless Communications

View full text Add to dashboard Cite

In many applications, sensor nodes are deployed in a 3D environment with obstacles, in which case a great deal of holes exist in 3D wireless sensor networks constructed. Recently, several geographic routing protocols are proposed for 3D wireless sensor networks. Each of them, however, cannot guarantee packet delivery or demands a long routing path to turn around a hole. In this paper, we first introduce a method of constructing a guide to the navigation on the surface of a hole. Subsequently, a geographic routing protocol termed the Greedy‐Guide_Navigation‐Greedy protocol (GGNG) that can always route a packet to turn around a hole with the help of the guide is proposed. GGNG guarantees packet delivery and can be extended toward a mobile sensor network in a limited 3D space. Simulations show that the path stretch of each routing protocol to GGNG in approximately 90 % of the cases is between 1.02 and 189.24. In addition, the number of messages transmitted by a node surrounding a hole in the guide construction is approximately three. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

“…Protocols like Virtual Cord Protocol (VCP) [4] and Virtual Ring Routing (VRR) [5] build their own coordinate system, which is completely independent of the geographic node positions. Current work on virtual coordinate based approaches focuses on two aspects: The provided quality of service, which is mainly an issue of optimizing the delivery ratio or even providing guarantees [6], [7], and the reliability of the system as a whole, using data replication and other redundancy increasing techniques [8]. Many of these approaches exploit the availability of the virtual ordering (numbering) of the nodes on an overlay that allows the use of Distributed Hash Table (DHT) like operations for data management.…”

Section: Introductionmentioning

confidence: 99%

Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks

Dressler

Awad

Gerla

2010

2010 IEEE International Conference on Communications

View full text Add to dashboard Cite

In recent work it has been shown that the use of virtual coordinates or identifiers for efficient routing and data management has several advantages compared to the use of predefined addresses or geographical coordinates. However, these advantages only hold for single domain networks with limited mobility. In this paper, we discuss the challenges arising from using virtual coordinates for routing (to a particular sensor ID or to indexed data or resources) in ad hoc and sensor networks in multi-domain network scenarios. We show the feasibility of inter-domain routing by exploiting a concept that is central to most virtual coordinate approaches: the availability of data management operation using a DHT like mechanism. Based on the Virtual Cord Protocol (VCP), we show how inter-domain routing can be realized using appropriate indirections. Furthermore, we investigate the possibility of replicating data among different networks, or DHTs, to provide seamless data access in multidomain environments. Our simulation results clearly show that both functions can be realized with only marginal overhead.978-1-4244-6404-3/10/$26.00 ©2010 IEEE This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2010 proceedings

show abstract

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

Cited by 12 publications

References 14 publications

Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks

Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks

Efficient delivery‐guaranteed geographic routing in 3D wireless sensor networks with holes

Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks

Contact Info

Product

Resources

About