Sciweavers

    388 search results - page 13 / 78
    » Reference Path Ad Hoc Routing Mechanism
    Sort
    View
    151
    Voted
    CJ
    2011
    273views Information Technology» more  CJ 2011»
    Dynamic Multipath Allocation in Ad Hoc Networks
    14 years 1 months ago
    Dynamic Multipath Allocation in Ad Hoc Networks
    Download  www.cs.technion.ac.il
    Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
    Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
    claim paper
    Read More »
    INFOCOM
    2006
    IEEE
    134views Communications» more  INFOCOM 2006»
    A Brownian Motion Model for Last Encounter Routing
    15 years 3 months ago
    A Brownian Motion Model for Last Encounter Routing
    Download  www.cs.toronto.edu
    — We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...
    Stratis Ioannidis, Peter Marbach
    claim paper
    Read More »
    128
    Voted
    JNSM
    2002
    218views more  JNSM 2002»
    An Agent-based Connection Management Protocol for Ad Hoc Wireless Networks
    14 years 9 months ago
    An Agent-based Connection Management Protocol for Ad Hoc Wireless Networks
    Download  www.iimcal.ac.in
    Realizing high volume of data transmission in real time communication in a highly dynamic architecture like Mobile Ad hoc Networks (MANET) still remains a major point of research....
    Romit Roy Choudhury, Krishna Paul, Somprakash Band...
    claim paper
    Read More »
    ADHOC
    2007
    144views more  ADHOC 2007»
    Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
    14 years 9 months ago
    Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
    Download  www.cs.fsu.edu
    Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
    Mike Burmester, Tri Van Le, Alec Yasinsac
    claim paper
    Read More »
    45
    Voted
    HIPC
    2003
    Springer
    83views Distributed And Parallel Com...» more  HIPC 2003»
    On Shortest Path Routing Schemes for Wireless Ad Hoc Networks
    15 years 2 months ago
    On Shortest Path Routing Schemes for Wireless Ad Hoc Networks
    Download  www.drake.edu
    Subhankar Dhar, Michael Q. Rieck, Sukesh Pai
    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-2025, USA.