A random graph model for optical networks of sensors

IEEE Transactions on Mobile Computing

Volumn 2, Issue 3, 2003, Pages 186-196

  Díaz, Josep ^a   Petit, Jordi ^a   Serna, Maria ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Localization algorithm; Optical networks of sensors; Random model of network; Random scaled sector graphs

Indexed keywords

LOCALIZATION ALGORITHMS; OPTICAL NETWORKS OF SENSORS; RANDOM MODEL OF NETWORKS; RANDOM SCALED SECTOR GRAPHS;

ALGORITHMS; ENERGY UTILIZATION; GRAPH THEORY; INTEGER PROGRAMMING; NETWORK PROTOCOLS; OPTICAL COMMUNICATION; OPTICAL LINKS; OPTICAL SENSORS; PROJECT MANAGEMENT; WIRELESS TELECOMMUNICATION SYSTEMS;

FIBER OPTIC NETWORKS;

EID: 18844466142     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2003.1233525     Document Type: Article

References (19)

1. I.F. Akyildiz, W. Su, Y. Sankarasubramanian, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, pp. 393-422, 2002.
2. d," Advances in Applied Probability, vol. 29, pp. 567-581, 1997.
3. 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. 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. ACM/IEEE Int'l Conf. Mobile Computing and Networking, 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, "Mobile Networking for Smart Dust," Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 176-189, 1999.
14. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
15. M.D. Penrose, "On k-Connectivity for a Geometric Random Graph," Random Structures & 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.edu/sensorwebs/, 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.