This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Random Graph Model for Optical Networks of Sensors
July-September 2003 (vol. 2 no. 3)
pp. 186-196

Abstract—The main contribution of this paper is presenting a new model for Smart Dust networks communicating through optical links and showing its applicability when the goal of the network is monitoring an area under the surveillance of a base station. We analyze the basic parameters of these networks as a new model of random graphs and propose simple distributed protocols for basic communication. These protocols are designed to minimize the energy consumption.

[1] I.F. Akyildiz et al., "Wireless Sensor Networks: A Survey," Computer Networks, Elsevier Science, vol. 38, no. 4, 2002, pp. 393-422.
[2] M.J. Appel and R.P. Russo, The Maximum Vertex Degree of a Graph on Uniform Points in$[0,1]^d$ Advances in Applied Probability, vol. 29, pp. 567-581, 1997.
[3] M.J. Appel and R.P. Russo, The Minimum Vertex Degree of a Graph on Uniform Points in$[0,1]^d$ Advances in Applied Probability, vol. 29, pp. 582-594, 1997.
[4] A. Bharathidasan and V. Anand, Sensor Networks technical report, Dept. of Computer Science, University of California at Davis, 2002.
[5] H. Breu and D.G. Kirkpatrick, Unit Disk Graph Recognition Is NP-Hard Computational Geometry. Theory and Applications, vol. 9, nos. 1-2, pp. 3-24, 1998.
[6] I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis, Smart Dust Local Detection and Propagation Protocols Proc. ACM Workshop Principles of Mobile Computing, 2002.
[7] B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165-177, 1990.
[8] J. Díaz, M.D. Penrose, J. Petit, and M. Serna, Approximating Layout Problems on Random Geometric Graphs J. Algorithms, vol. 39, pp. 78-116, 2001.
[9] J. Díaz, J. Petit, and M.J. Serna, Random Geometric Problems on$[0,1]^2$ Randomization and Approximation Techniques in Computer Science, J. Rolim, M. Luby, and M. Serna, eds., pp. 294-306, Springer-Verlag, 1998.
[10] L. Doherty, Algorithms for Positioning and Data Recovery in Wireless Sensor Networks master's thesis, Dept. of Electrical Eng. and Computer Science, University of California at Berkeley, 2000.
[11] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. Mobile Computing MOBICOM, pp. 263-270, 1999.
[12] J.M. Kahn, R.H. Katz, and K.S.J. Pister, Emerging Challenges: Mobile Networking for Smart Dust J. Comm. and Networks, vol. 2, no. 3, pp. 188-196, 2000.
[13] J.M. Kahn, R.H. Katz, and K.S.J. Pister, “Next Century Challenges: Mobile Networking for 'Smart Dust',” Proc. Conf. Mobile Computing MOBICOM, pp. 271-278, 1999.
[14] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[15] M.D. Penrose, “Onk-Connectivity for a Geometric Random Graph,” Random Structures and Algorithms. vol. 15, no. 2, pp. 145-164, 1999.
[16] K.S.J. Pister, personal communication, 2002.
[17] S.N. Simic and S. Sastry, Distributed Localization in Wireless Ad Hoc Networks manuscript, Dept. of Electrical Eng. and Computer Science, University of California at Berkeley, 2001.
[18] Smart Dust Project,http://basics.EECS.Berkeley.edusensor webs /, 2003.
[19] S. Tilak, N.B. Abu-Ghazaleh, and W. Heinzelman, A Taxonomy of Sensor Network Communication Models Mobile Computing and Comm. Rev., vol. 6, no. 2, pp. 28-36, 2002.

Index Terms:
Optical networks of sensors, random scaled sector graphs, localization algorithm, random model of network.
Citation:
Josep D?az, Jordi Petit, Maria Serna, "A Random Graph Model for Optical Networks of Sensors," IEEE Transactions on Mobile Computing, vol. 2, no. 3, pp. 186-196, July-Sept. 2003, doi:10.1109/TMC.2003.1233525
Usage of this product signifies your acceptance of the Terms of Use.