Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,193
Determining intra-flow contention along multihop paths in wireless networks
- In Proceedings of Broadnets Wireless Networking Symposium
, 2004
"... Admission control of flows is essential for providing quality of service in multihop wireless networks. In order to make an admission decision for a new flow, the expected bandwidth consumption of the flow must be correctly determined. Due to the shared nature of the wireless medium, nodes along a m ..."
Abstract
-
Cited by 31 (2 self)
- Add to MetaCart
multihop path contend among themselves for access to the medium. This leads to intra-flow contention; contention between packets of the same flow being forwarded at different hops along a multihop path, causing the actual bandwidth consumption of the flow to become a multiple of its single hop bandwidth
A High-Throughput Path Metric for Multi-Hop Wireless Routing
, 2003
"... 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 packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract
-
Cited by 1108 (5 self)
- Add to MetaCart
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 packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination
The Probe Gap Model can Underestimate the Available Bandwidth of Multihop Paths
"... The Probe Gap Model (PGM) was proposed as a lightweight and fast available bandwidth estimation method. Measurement tools such as Delphi and Spruce are based on PGM. Compared to estimation methods that require multiple iterations with different probing rates, PGM uses a single probing rate and it in ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
that, even though PGM is accurate in the case of a single queue, it cannot estimate the available bandwidth of multi-hop paths, even if there is a single bottleneck in the path. Whether PGM is accurate or not depends on the routing of cross traffic relative to the measurement traffic. PGM is accurate
Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
, 2008
"... A distinct difference configuration is a set of points in Z 2 with the property that the vectors (difference vectors) connecting any two of the points are all distinct. Many specific examples of these configurations have been previously studied: the class of distinct difference configurations incl ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
or fewer difference vectors. This is an important parameter when distinct difference configurations are used in the wireless sensor application, as this parameter describes the density of nodes that can be reached by a short secure path in the network. We provide upper and lower bounds for the k
1Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
"... Abstract—A distinct difference configuration is a set of points in Z2 with the property that the vectors (difference vectors) connecting any two of the points are all distinct. Many specific examples of these configurations have been previously studied: the class of distinct difference configuration ..."
Abstract
- Add to MetaCart
as the sum of k or fewer difference vectors. This is an important parameter when distinct difference configurations are used in the wireless sensor application, as this parameter describes the density of nodes that can be reached by a short secure path in the network. We provide upper and lower bounds
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract
-
Cited by 534 (8 self)
- Add to MetaCart
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance
The dynamic behavior of a data dissemination protocol for network programming at scale
- In Proceedings of the Second International Conferences on Embedded Network Sensor Systems (SenSys
"... To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over a multihop, wireless sensor network. Deluge builds from prior work in density-aware, epidemic maintenance protocols. Usi ..."
Abstract
-
Cited by 492 (24 self)
- Add to MetaCart
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over a multihop, wireless sensor network. Deluge builds from prior work in density-aware, epidemic maintenance protocols
Comparison of routing metrics for static multi-hop wireless networks
- In ACM SIGCOMM
, 2004
"... Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links into ..."
Abstract
-
Cited by 331 (3 self)
- Add to MetaCart
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links
Performance of multihop wireless networks: Shortest path is not enough.
- Proc. of the First Workshop on Hot Topics in Networks (HotNets-I),
, 2002
"... Abstract Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-h ..."
Abstract
-
Cited by 170 (0 self)
- Add to MetaCart
Abstract Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum
Results 1 - 10
of
1,193
