• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage StatisticsView Google Analytics Statistics

    Voronoi diagram modelling for wireless Ad-Hoc sensor network coverage

    Thumbnail
    View/Open
    200211033.pdf (769.4Kb)
    Date
    2004
    Author
    Babu, G. Srinu
    Metadata
    Show full item record
    Abstract
    This thesis aims at a basic geometrical understanding of Voronoi diagrams and Voronoi diagram modelling for Wireless Ad hoc Sensor coverage. What is known as the Fortune algorithm for constructing Voronoi diagrams is explained. Implementation of the Fortune algorithm is also shown as a part of this thesis. Several applications of Voronoi diagrams are explained with practical examples. Coverage problem in wireless ad hoc sensor networks is modelled with Voronoi diagram and its dual Delaunay triangulation. The problem of best and worst coverage for a wireless ad hoc sensor networks are discussed. Coverage paths like Best and worst paths are explained in detail. The algorithms for determining best coverage paths and worst coverage paths are described and implemented in MATLAB& C. Results for best coverage paths and worst coverage paths are shown for a given number of sensors placed in the sensor field.
    URI
    http://drsr.daiict.ac.in/handle/123456789/61
    Collections
    • M Tech Dissertations [820]

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV