Please use this identifier to cite or link to this item:
http://dspace.aiub.edu:8080/jspui/handle/123456789/1872
Title: | Computational Geometry Based Remote Networking |
Authors: | Mahmud, Sharifa Rania Sultana, Marzia Majadi, Nazia Ansari, Lazima |
Issue Date: | 1-Jan-2014 |
Publisher: | Association of Computer Electronics and Electrical Engineers (ACEEE) |
Abstract: | In recent years wireless sensor networks (WSNs) have become one of the most active research areas due to the bright and interesting future promised to the world of information technology. It is an emerging field which is accomplishing much importance because of its vast contribution in varieties of applications. Coverage is one of the important aspects of WSNs and many approaches are introduced to maximize it. It is the key research issue in WSN as it can be considered as the measure of the Quality of Service (QoS) of sensing function for a sensor network. The goal of coverage is to have each location in the physical space of interest within the sensing range of at least one sensor. By combining computational geometry and graph theoretic techniques, specifically the Voronoi Diagram (VD), Delaunay Triangulation (DT) and Graph Search algorithms, can solve the problem. This paper defines some recent research approaches on coverage of WSNs using VD and DT. Also shows how they are being utilized in various research works. |
URI: | http://dspace.aiub.edu:8080/jspui/handle/123456789/1872 |
ISSN: | Print ISSN: 2158-5555, Online ISSN: 21585563 |
Appears in Collections: | Publications: Journals |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Computational Geometry Based Remote Networking.docx | 4.66 MB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.