Sciweavers

    WIOPT
    2010
    IEEE
    154views Computer Networks» more  WIOPT 2010»
    Cooperative diversity routing in wireless networks
    13 years 9 months ago
    Cooperative diversity routing in wireless networks
    Download  hal.archives-ouvertes.fr
    —In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
    Mostafa Dehghan, Majid Ghaderi, Dennis Goeckel
    claim paper
    Read More »
    TWC
    2008
    80views more  TWC 2008»
    Robust connectivity-aware energy-efficient routing for wireless sensor networks
    13 years 11 months ago
    Robust connectivity-aware energy-efficient routing for wireless sensor networks
    Download  www.cspl.umd.edu
    In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
    Charles Pandana, K. J. Ray Liu
    claim paper
    Read More »
    CN
    2007
    104views more  CN 2007»
    Performance analysis of the AntNet algorithm
    13 years 11 months ago
    Performance analysis of the AntNet algorithm
    Download  www.nas.its.tudelft.nl
    A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
    S. S. Dhillon, Piet Van Mieghem
    claim paper
    Read More »
    CAL
    2007
    117views Software Engineering» more  CAL 2007»
    Logic-Based Distributed Routing for NoCs
    13 years 11 months ago
    Logic-Based Distributed Routing for NoCs
    Download  www.disca.upv.es
    —The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
    José Flich, José Duato
    claim paper
    Read More »
    CAL
    2008
    97views Software Engineering» more  CAL 2008»
    Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
    13 years 11 months ago
    Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
    Download  cwc.ucsd.edu
    Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
    Rohit Sunkam Ramanujam, Bill Lin
    claim paper
    Read More »
    PDPTA
    2003
    108views Distributed And Parallel Com...» more  PDPTA 2003»
    The Performance of Routing Algorithms under Bursty Traffic Loads
    14 years 24 days ago
    The Performance of Routing Algorithms under Bursty Traffic Loads
    Download  ceng.usc.edu
    Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
    Jeonghee Shin, Timothy Mark Pinkston
    claim paper
    Read More »
    PDCN
    2004
    116views Distributed And Parallel Com...» more  PDCN 2004»
    Consistency-based routing in overlay networks
    14 years 24 days ago
    Consistency-based routing in overlay networks
    Download  www.cs.wayne.edu
    This paper introduces GRACE
    Anne-Marie Bosneag, Monica Brockmeyer
    claim paper
    Read More »
    APPINF
    2003
    222views Information Technology» more  APPINF 2003»
    Corner-First Tree-based Region Broadcasting in Mesh Networks
    14 years 25 days ago
    Corner-First Tree-based Region Broadcasting in Mesh Networks
    Download  faculty.kfupm.edu.sa
    In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
    Hadeel Haddad, Muhammad F. Mudawwar
    claim paper
    Read More »
    APPINF
    2003
    210views Information Technology» more  APPINF 2003»
    Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
    14 years 25 days ago
    Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
    Download  people.uncw.edu
    In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
    Gur Saran Adhar
    claim paper
    Read More »
    SODA
    2008
    ACM
    96views Algorithms» more  SODA 2008»
    Greedy drawings of triangulations
    14 years 26 days ago
    Greedy drawings of triangulations
    Download  cs.nyu.edu
    Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
    Raghavan Dhandapani
    claim paper
    Read More »
    12345next ›last »
    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.