Sciweavers

    IPCCC
    2007
    IEEE
    149views Communications» more  IPCCC 2007»
    O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
    14 years 6 months ago
    O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
    Download  www.cs.gsu.edu
    In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
    My T. Thai, Yingshu Li, Feng Wang 0002
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.