Compact conformal map for greedy routing in wireless mobile sensor networks

Abstract

Motivated by mobile sensor networks as in participatory sensing applications, we are interested in developing a practical, lightweight solution for routing in a mobile network. While greedy routing is robust to mobility, location errors and link dynamics, it may get stuck in a local minimum, which then requires non-trivial recovery methods. We follow the approach taken by Sarkar et. al.[24] to find an embedding of the network such that greedy routing using the virtual coordinates guarantees delivery, thus eliminating the necessity of any recovery methods. Our new contribution is to replace the in-network computation of the embedding by a preprocessing of the domain before network deployment and encode the map of network domain to virtual coordinate space by using a small number of parameters which can be pre-loaded to all sensor nodes. As a result, the map is only dependent on the network domain and is independent of the network connectivity. Each node can directly compute or update its virtual coordinates by applying the locally stored map on its geographical coordinates. This represents the first practical solution for using virtual coordinates for greedy routing in a sensor network and could be easily extended to the case of a mobile network. Being extremely light-weight, greedy routing on the virtual coordinates is shown to be very robust to mobility, link dynamics and non-unit disk graph connectivity models.

Efficient conformal parameterization of multiply-connected surfaces using quasi-conformal theory

“…Besides the applications discussed in this work, it is natural to explore the use of the proposed conformal parameterization methods for shape analysis [60,61], greedy routing in sensor networks [62] etc. Another possible future direction is to combine the proposed methods with the optimal mass transport (OMT) [63][64][65] or the density-equaling map (DEM) [66,67] for efficiently computing area-preserving parameterizations of multiply-connected surfaces.…”

Competitive Routing in Hybrid Communication Networks

“…Unfortunately, greedy strategies like Compass routing [4] fail for graphs with radio holes, i.e., they might get stuck at a dead end. This can be avoided with the help of suitable virtual coordinates for the nodes (e.g., [14]), but computing these is quite expensive. Instead, Kuhn et al [13] proposed GOAFR, a routing strategy that uses a combination of greedy and face routing, which can find paths with quadratic competitiveness [13].…”