Abstract
A common assumption in sensor networks is that the sensors are located according to a uniform random distribution. In this paper we show that uniform random points on the two dimensional unit square are almost a “grid”. In particular, for a synchronous geographic sensor network we show how to emulate any grid protocol on random sensor networks, with high probability.
This suggests the following framework. In order to solve a problem on a random sensor network we solve the same problem on the grid. Then we use our emulation to make the obtained solution suitable for random sensor network. We analyze the cost of the emulation in terms of consumed energy and time. Finally we provide three examples that illustrate our method.
The research was partially funded by the European projects COST Action 293, “Graphs and Algorithms in Communication Networks” (GRAAL) and COST Action 295, “Dynamic Communication Networks” (DYNAMO).
Chapter PDF
Similar content being viewed by others
References
Al-Karaki, J.N., Kamal, A.E.: Routing techniques in wireless sensor networks: a survey. IEEE Wireless Communications 11(6), 6–28 (2004)
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal on Computer and System Sciences 43(2), 290–298 (1991)
Barriere, L., Fraigniaud, P., Narayanan, L.: Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In: Proc. of the 5th Int. Workshop on Discrete algorithms and methods for mobile computing and communications (DIALM), pp. 19–27. ACM Press, New York (2001)
Bulusu, N., Heidemann, J., Estrin, D.: GPS-less low-cost outdoor localization for very small devices. IEEE Personal Communications 5 (2000)
Farley, A.M., Hedetniem, S.T.: Broadcasting in grid graphs. In: Proc. of the 9th S-E Conf. combinatorics, graph theory, and computing, pp. 275–288 (1978)
Farley, A.M., Proskurowski, A.: Gossiping in grid graphs. Journal of Combinatorics, Information and System Science 5(2), 161–172 (1980)
Friedman, R., Korland, G.: Timed grid routing (tigr) bites off energy. In: Proc. of the 16th ACM Int. Symp. on Mobile ad hoc networking and computing (MobiHoc), pp. 438–448 (2005)
Klasing, R., Lotker, Z., Navarra, A., Perennes, S.: From balls and bins to points and vertices. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 757–766. Springer, Heidelberg (2005)
Kortsarz, G., Peleg, D.: Approximation algorithms for minimum time broadcast. In: Proc. of the Symp. on Theory of computing and systems (ISTCS), pp. 67–78. Springer, Heidelberg (1992)
Kowalski, D.R., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proc. of the 43rd Symp. on Foundations of Computer Science (FOCS), pp. 63–72. IEEE Computer Society, Los Alamitos (2002)
Kozma, G., Lotker, Z., Sharir, M., Stupp, G.: Geometrically aware communication in random wireless networks. In: Proc. of the 23rd Annual ACM Symp. on Principles of distributed computing (PODC), pp. 310–319 (2004)
Lu, H., Ravi, R.: The power of local optimization: Approximation algorithms for maximum-leaf spanning tree. In: Proc. of the 30th Annual Allerton Conf. on Communication, Control and Computing, pp. 533–542 (1992)
Malpani, N., Welch, J.L., Vaidya, N.H.: Leader election algorithms for mobile ad hoc networks. In: Proc. of ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC) (2000)
McCann, J.A., Navarra, A., Papadopoulos, A.A.: Connectionless Probabilistic (CoP) routing: an efficient protocol for Mobile Wireless Ad-Hoc Sensor Networks. In: Proc. of the 24th Int. Performance Computing and Communications Conf. (IPCCC), pp. 73–77 (2005)
Niculescu, D., Nath, B.: Ad Hoc Positioning System (APS). In: Proc. of the 44th IEEE Global Telecommunications Conf., GLOBECOM (2001)
PalChaudhuri, S., Saha, A.K., Johnson, D.B.: Adaptive clock synchronization in sensor networks. In: Proc. of the 3rd international Symp. on Information processing in sensor networks(IPSN), pp. 340–348. ACM Press, New York (2004)
Rappaport, T.S.: Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs (1996)
Shor, P.W., Yukich, J.E.: Minimax Grid Matching and Empirical Measures. The Annals of Probability 19(3), 1338–1348 (1991)
Xu, Y.: An O(n 1.5) deterministic gossiping algorithm for radio networks. Algorithmica 36(1), 93–96 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lotker, Z., Navarra, A. (2006). Managing Random Sensor Networks by means of Grid Emulation. In: Boavida, F., Plagemann, T., Stiller, B., Westphal, C., Monteiro, E. (eds) NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2006. Lecture Notes in Computer Science, vol 3976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753810_71
Download citation
DOI: https://doi.org/10.1007/11753810_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34192-5
Online ISBN: 978-3-540-34193-2
eBook Packages: Computer ScienceComputer Science (R0)