• Login
    View Item 
    •   Home
    • Theses and Dissertations
    • Theses
    • View Item
    •   Home
    • Theses and Dissertations
    • Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Optimal Node Placement in Underwater Acoustic Sensor Network

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Mohammad FelembanThesis-.pdf
    Size:
    1.004Mb
    Format:
    PDF
    Description:
    PDF file
    Download
    Type
    Thesis
    Authors
    Felemban, Muhamad
    Advisors
    Shihada, Basem cc
    Committee members
    Alouini, Mohamed-Slim cc
    Moshkov, Mikhail cc
    Program
    Computer Science
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2011-10
    Permanent link to this record
    http://hdl.handle.net/10754/209373
    
    Metadata
    Show full item record
    Abstract
    Almost 70% of planet Earth is covered by water. A large percentage of underwater environment is unexplored. In the past two decades, there has been an increase in the interest of exploring and monitoring underwater life among scientists and in industry. Underwater operations are extremely difficult due to the lack of cheap and efficient means. Recently, Wireless Sensor Networks have been introduced in underwater environment applications. However, underwater communication via acoustic waves is subject to several performance limitations, which makes the relevant research issues very different from those on land. In this thesis, we investigate node placement for building an initial Underwater Wireless Sensor Network infrastructure. Firstly, we formulated the problem into a nonlinear mathematic program with objectives of minimizing the total transmission loss under a given number of sensor nodes and targeted volume. We conducted experiments to verify the proposed formulation, which is solved using Matlab optimization tool. We represented each node with a truncated octahedron to fill out the 3D space. The truncated octahedrons are tiled in the 3D space with each node in the center where locations of the nodes are given using 3D coordinates. Results are supported using ns-3 simulator. Results from simulation are consistent with the obtained results from mathematical model with less than 10% error.
    Citation
    Felemban, M. (2011). Optimal Node Placement in Underwater Acoustic Sensor Network. KAUST Research Repository. https://doi.org/10.25781/KAUST-N12PY
    DOI
    10.25781/KAUST-N12PY
    ae974a485f413a2113503eed53cd6c53
    10.25781/KAUST-N12PY
    Scopus Count
    Collections
    Theses; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.