Sciweavers

    68 search results - page 1 / 14
    » Lower Bounds for Noisy Wireless Networks using Sampling Algo...
    Sort
    View
    FOCS
    2008
    IEEE
    110views Theoretical Computer Science» more  FOCS 2008»
    Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
    13 years 11 months ago
    Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
    Download  www.tcs.tifr.res.in
    We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
    Chinmoy Dutta, Jaikumar Radhakrishnan
    claim paper
    Read More »
    TMC
    2011
    131views more  TMC 2011»
    In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
    12 years 11 months ago
    In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
    Download  ece.iisc.ernet.in
    —We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
    Srikanth K. Iyer, D. Manjunath, R. Sundaresan
    claim paper
    Read More »
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    A tight lower bound for parity in noisy communication networks
    13 years 6 months ago
    A tight lower bound for parity in noisy communication networks
    Download  www.tcs.tifr.res.in
    We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
    Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
    claim paper
    Read More »
    DIALM
    2005
    ACM
    130views Algorithms» more  DIALM 2005»
    On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
    13 years 6 months ago
    On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
    Download  disco.informatik.uni-kl.de
    Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
    Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
    claim paper
    Read More »
    MOBIHOC
    2006
    ACM
    138views Computer Networks» more  MOBIHOC 2006»
    Distributed localization using noisy distance and angle information
    14 years 4 months ago
    Distributed localization using noisy distance and angle information
    Download  www.ams.sunysb.edu
    Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
    Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
    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.