Article

Managing random sensor networks by means of grid emulation

Authors:

Alfredo NavarraAuthors Info & Claims

NETWORKING'06: Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems

May 2006

Pages 856 - 867

https://doi.org/10.1007/11753810_71

Published: 15 May 2006 Publication History

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.

References

[1]

AL-KARAKI, J. N., AND KAMAL, A. E. Routing techniques in wireless sensor networks: a survey. IEEE Wireless Communications 11, 6 (2004), 6-28.

Digital Library

[2]

ALON, N., BAR-NOY, A., LINIAL, N., AND PELEG, D. A lower bound for radio broadcast. Journal on Computer and System Sciences 43, 2 (1991), 290-298.

Digital Library

[3]

BARRIERE, L., FRAIGNIAUD, P., AND 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) (2001), ACM Press, pp. 19-27.

Digital Library

[4]

BULUSU, N., HEIDEMANN, J., AND ESTRIN, D. GPS-less low-cost outdoor localization for very small devices. IEEE Personal Communications 5 (2000).

[5]

FARLEY, A. M., AND HEDETNIEM, S. T. Broadcasting in grid graphs. In Proc. of the 9th S-E Conf. combinatorics, graph theory, and computing (1978), pp. 275-288.

[6]

FARLEY, A. M., AND PROSKUROWSKI, A. Gossiping in grid graphs. Journal of Combinatorics, Information and System Science 5, 2 (1980), 161-172.

[7]

FRIEDMAN, R., AND 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) (2005), pp. 438-448.

Digital Library

[8]

KLASING, R., LOTKER, Z., NAVARRA, A., and Perennes, S. From Balls and Bins to Points and Vertices. In Proc. of the The 16th Annual Int. Symp. on Algorithms and Computation (ISAAC) (2005), vol. 3827 of Lecture Notes in Computer Science, Springer-Verlag, pp. 757-766.

Digital Library

[9]

KORTSARZ, G., AND PELEG, D. Approximation algorithms for minimum time broadcast. In Proc. of the Symp. on Theory of computing and systems (ISTCS) (1992), Springer-Verlag, pp. 67-78.

Digital Library

[10]

KOWALSKI, D. R., AND PELC, A. Deterministic broadcasting time in radio networks of unknown topology. In Proc. of the 43rd Symp. on Foundations of Computer Science (FOCS) (2002), IEEE Computer Society, pp. 63-72.

Digital Library

[11]

KOZMA, G., LOTKER, Z., SHARIR, M., AND STUPP, G. Geometrically aware communication in random wireless networks. In Proc. of the 23rd Annual ACM Symp. on Principles of distributed computing (PODC) (2004), pp. 310-319.

Digital Library

[12]

LU, H., AND 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 (1992), pp. 533-542.

[13]

MALPANI, N., WELCH, J. L., AND 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).

Digital Library

[14]

MCCANN, J. A., NAVARRA, A., AND 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) (2005), pp. 73-77.

[15]

NICULESCU, D., AND NATH, B. Ad Hoc Positioning System (APS). In Proc. of the 44th IEEE Global Telecommunications Conf. (GLOBECOM) (2001).

[16]

PALCHAUDHURI, S., SAHA, A. K., AND JOHNSON, D. B. Adaptive clock synchronization in sensor networks. In Proc. of the 3rd international Symp. on Information processing in sensor networks(IPSN) (2004), ACM Press, pp. 340-348.

Digital Library

[17]

RAPPAPORT, T. S. Wireless communications: principles and practice. Prentice-Hall, Englewood Cliffs, NY, 1996.

Digital Library

[18]

SHOR, P. W., AND YUKICH, J. E. Minimax Grid Matching and Empirical Measures. The Annals of Probability 19, 3 (1991), 1338-1348.

[19]

XU, Y. An O(n ^1.5) deterministic gossiping algorithm for radio networks. Algorithmica 36, 1 (2003), 93-96.

Cited By

Czumaj AElsässer RGąsieniec LSauerwald TWang X(2013)Fast message dissemination in random geometric networksDistributed Computing10.1007/s00446-011-0154-426:1(1-24)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s00446-011-0154-4
Bradonjić MElsässer RFriedrich TSauerwald TStauffer ACharikar M(2010)Efficient broadcast on random geometric graphsProceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms10.5555/1873601.1873715(1412-1421)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.5555/1873601.1873715
Calamoneri TClementi AMonti ARossi GSilvestri RNikoketseas SAbu-Ghazaleh NBensaou BSyrotiuk V(2008)Minimum-energy broadcast in random-grid ad-hoc networksProceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems10.1145/1454503.1454563(354-361)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1454503.1454563
Show More Cited By

Index Terms

Managing random sensor networks by means of grid emulation
1. Networks
  1. Network types
    1. Mobile networks

Index terms have been assigned to the content through auto-classification.

Recommendations

Grid emulation for managing random sensor networks

A common assumption in sensor networks is that 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 ...
Read More
A power-efficient data gathering scheme on grid sensor networks
MUSP'08: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing

Wireless sensor networks are composed of a group of geographically dispersed sensor nodes and a sink node, which can be utilized in military application and environmental observation of scientific research. Sensor nodes route the collected data to the ...
Read More
State-of-art of grid protocols clustering for wireless sensor networks
ICIST '18: Proceedings of the 8th International Conference on Information Systems and Technologies

In recent years wireless sensor networks researches have gained much attention .Where extended network lifetime, is important necessity for many sensor network applications. Clustering is a useful technique for achieving these objectives. This work ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

NETWORKING'06: Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems

May 2006

1272 pages

ISBN:3540341927

Editors:
Fernando Boavida
Departamento de Engenharia Informática, Universidade de Coimbra, Coimbra, Portugal
,
Thomas Plagemann
Department of Informatics, University of Oslo, Blindern, Oslo, Norway
,
Burkhard Stiller
Department of Informatics IFI, University of Zurich, Binzmühlestrasse 14, Zürich, Oslo, Switzerland
,
Cedric Westphal
Department of Informatics IFI, Nokia, 313 Fairchild dr., Mountain View, CA, Switzerland
,
Edmundo Monteiro
CISUC/DEI, University of Coimbra, 313 Fairchild dr., Coimbra, CA, Portugal

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 May 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Czumaj AElsässer RGąsieniec LSauerwald TWang X(2013)Fast message dissemination in random geometric networksDistributed Computing10.1007/s00446-011-0154-426:1(1-24)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s00446-011-0154-4
Bradonjić MElsässer RFriedrich TSauerwald TStauffer ACharikar M(2010)Efficient broadcast on random geometric graphsProceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms10.5555/1873601.1873715(1412-1421)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.5555/1873601.1873715
Calamoneri TClementi AMonti ARossi GSilvestri RNikoketseas SAbu-Ghazaleh NBensaou BSyrotiuk V(2008)Minimum-energy broadcast in random-grid ad-hoc networksProceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems10.1145/1454503.1454563(354-361)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1454503.1454563
Srinivasan WChua KKranakis EHou JRamanathan R(2007)Trade-offs between mobility and density for coverage in wireless sensor networksProceedings of the 13th annual ACM international conference on Mobile computing and networking10.1145/1287853.1287860(39-50)Online publication date: 9-Sep-2007
https://dl.acm.org/doi/10.1145/1287853.1287860

View Options

View options

Media

Figures

Other

Tables

View Table of Contents