Sciweavers

1571 search results - page 117 / 315
» Improved Algorithms for Latency Minimization in Wireless Net...
Sort
View
INFOCOM
2008
IEEE
14 years 3 months ago
iPack: in-Network Packet Mixing for High Throughput Wireless Mesh Networks
—A major barrier for the adoption of wireless mesh networks is severe limits on throughput. Many in-network packet mixing techniques at the network layer [1], [2], [3] as well as...
Richard Alimi, Erran L. Li, Ramachandran Ramjee, H...
CP
2007
Springer
14 years 24 days ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
WONS
2005
IEEE
14 years 2 months ago
Broadcasting in Hybrid Ad Hoc Networks
In this paper, we consider hybrid ad hoc networks, which are composed of two kinds of nodes, regular ones and nodes with additional capabilities. For example, multi-hop cellular a...
François Ingelrest, David Simplot-Ryl, Ivan...
PEWASUN
2007
ACM
13 years 10 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
MOBICOM
2003
ACM
14 years 2 months ago
A high-throughput path metric for multi-hop wireless routing
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...