Optimisation problems based on the maximal breach path measure for wireless sensor network coverage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4317, Issue , 2006, Pages 27-40

  Gupta, Anirvan Dutta ^a   Bishnu, Arijit ^a   Sengupta, Indranil ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; NETWORK SECURITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

GEOMETRIC OPTIMIZATION; GEOMETRIC TRANSFORMATIONS; LOCAL OPTIMAL; MAXIMAL BREACH; OPTIMISATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; SENSOR NETWORK DESIGN;

WIRELESS SENSOR NETWORKS;

EID: 49949113490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11951957_3     Document Type: Conference Paper

References (10)

1. Megerian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.; Worst and Best-Case Coverage in Sensor Networks; IEEE Transactions on Mobile Computing, vol.4, no.1, pp. 84-92, Jan.-Feb. 2005. 3
2. th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2001.
3. Xiang-Yang Li, Peng-Jun Wan, Frieder, O.; Coverage in Wireless Ad-hoc oc Sensor Networks; IEEE Transactions on Computers, vol.52, no.6, pp. 53-763, June 2003.
4. Santosh Kumar, Ten H. Lai, Anish Arora; Barrier Coverage with Wireless Sensors; August 2005; Proceedings of the 11th annual international conference on Mobile computing and networking, MobiCom 2005.
5. Chi-Fu Huang, Yu-Chee Tseng; The Coverage Problem in Wireless Sensor Networks; September 2003; Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications.
6. M. de Berg, M. Van Kreveld, M. Overmars, O. Schwarzkopf; Computational Geometry Algorithms and Applications; Springer-Verlag, 1997.
7. F. Aurenhammer; Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure; ACM Computing Surveys, Vol. 23, No. 3, September 1991.
8. K. Mehlhorn, S. Naher; The LEDA Platform of Combinatorial and Geometric Computing; Cambridge University Press, 1999.
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein; Introduction to Algorithms, 2nd Edition; MIT Press, 2001.
10. H. Melissen; Packing and Covering with Circles; Ph.D. thesis, University of Utrecht, 1997.