Routing in Wireless Networks with Position Trees

Chávez, Edgar; Mitton, Nathalie; Tejeda, Héctor

doi:10.1007/978-3-540-74823-6_3

Cited by 17 publications

(41 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several proposed embeddings based on one or multiple spanning trees of the network [8], [15]- [17]. These works are interesting in the sense that they guarantee the packet delivery using a simple structure such as a tree.…”

Section: Related Workmentioning

confidence: 99%

“…While [8] embeds a network spanning tree in the hyperbolic plane, [15] and [16] use a labeling of the nodes with the path from the tree root to each node. In [17] a different embedding compared to [15], [16] with poly-logarithmic memory complexity was proposed. In their work, the good performance in terms of stretch is achieved at the cost of higher complexity in the forwarding process and relying on multiple trees.…”

Section: Related Workmentioning

confidence: 99%

“…In [15] and [16] similar coordinates in ad hoc and sensor networks were used. However, the routing in [15] only used the tree edges and referred to as tree routing.…”

Section: Tree-based Greedy Embeddingmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design

Sahhaf

Tavernier

Colle

et al. 2016

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARYThe growth of the size of the routing tables limits the scalability of the conventional IP routing. As scalable routing schemes for large-scale networks are highly demanded, this paper proposes and evaluates an efficient geometric routing scheme and related low-cost node design applicable to large-scale networks. The approach guarantees that greedy forwarding on derived coordinates will result in successful packet delivery to every destination in the network by relying on coordinates deduced from a spanning tree of the network. The efficiency of the proposed scheme is measured in terms of routing quality (stretch) and size of the coordinates. The cost of the proposed router is quantified in terms of area complexity of the hardware design and all the evaluations involve comparison with a state-of-the-art approach with virtual coordinates in the hyperbolic plane. Extensive simulations assess the proposal in large topologies consisting of up to 100K nodes. Experiments show that the scheme has stretch properties comparable to geometric routing in the hyperbolic plane, while enabling a more efficient hardware design, and scaling considerably better in terms of storage requirements for coordinate representation. These attractive properties make the scheme promising for routing in large networks.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design

Sahhaf

Tavernier

Colle

et al. 2016

IEICE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…The LTP algorithm (Chávez et al, 2007) uses a root and a tree construction as the only coordinate system instead of anchors. Thanks to the tree, this routing algorithm guarantees delivery but the chosen routes may be long.…”

Section: Related Workmentioning

confidence: 99%

“…Other virtual coordinates solutions have been proposed, some are without guaranteed delivery (Benbadis et al, 2006), (Fang et al, 2005), (Niculescu and Nath, 2001), some other with guaranteed delivery (Chávez et al, 2007), (Liu and Abu-Ghazaleh, 2008). However, algorithms using virtual coordinates have the drawback to not support node mobility.…”

Section: Related Workmentioning

confidence: 99%

Geographic Routing with Partial Position Information

Ducrocq

Hauspie

Mitton

2014

Proceedings of the 3rd International Conference on Sensor Networks

View full text Add to dashboard Cite

Abstract:Geographic routing protocols show good properties for Wireless Sensor Networks (WSN). They are stateless, local and scalable. However they require that each node of the network is aware of its own position. While it may be possible to equip each node with GPS receiver, even if it is costly, there are some issues and receiving a usable GPS signal may be difficult in some situations. For these reasons, we propose a geographic routing algorithm, called HGA, able to take advantages of position informations of nodes when available but also able to continue the routing in a more traditional way if position information is not available. We show with simulations that our algorithm offers an alternative solution to classical routing algorithm (non-geographic) and offers better performances for network with a density above 25 and more than 5% of nodes are aware of their position.

show abstract

Optimizing robustness in geometric routing via embedding redundancy and regeneration

et al. 2015

View full text Add to dashboard Cite

Geometric routing is an alternative to traditional routing algorithms in which traffic is no longer forwarded using lookup tables, but using coordinates in an embedding of the underlying network. A major downside of current geometric routing algorithms is their inability to handle network failures in a graceful manner. Moreover, they cannot deal with dynamic graph topologies. This article presents a geometric routing scheme that uses an embedding based on a spanning forest. Allowing nodes to select the optimal spanning tree leads to both shorter paths and natural traffic redirection in case of network failures. By constructing the forest in such a way that its disconnected components have low redundancy, their coverage is maximized. Results show that this system is able to operate gracefully in severe failure scenarios, without any form of path protection or restoration. By means of an embedding regeneration procedure, the routing scheme is able to continuously adapt to an altering network topology. This geometric routing algorithm effectively combines two key objectives, namely low path stretch and high robustness.

show abstract

Routing in Wireless Networks with Position Trees

Cited by 17 publications

References 29 publications

Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design

Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design

Geographic Routing with Partial Position Information

Optimizing robustness in geometric routing via embedding redundancy and regeneration

Contact Info

Product

Resources

About