scispace - formally typeset
Journal ArticleDOI

Performance of multihop wireless networks: shortest path is not enough

TLDR
Experimental evidence from two wireless test-beds shows that there are usually multiple minimum hop-count paths, many of which have poor throughput, and suggests that more attention be paid to link quality when choosing ad hoc routes.
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-hop-count routing often chooses routes that have significantly less capacity than the best paths that exist in the network. Much of the reason for this is that many of the radio links between nodes have loss rates low enough that the routing protocol is willing to use them, but high enough that much of the capacity is consumed by retransmissions. These observations suggest that more attention be paid to link quality when choosing ad hoc routes; the paper presents measured link characteristics likely to be useful in devising a better path quality metric.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Impact of interference on multi-hop wireless network performance

TL;DR: It is shown that the routes derived from the analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention, suggesting that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol.
Journal Article

Understanding Packet Delivery Performance In Dense Wireless Sensor Networks

TL;DR: Govindan et al. as mentioned in this paper performed a large-scale measurement of packet delivery in dense wireless sensor networks and found that packet de-livery performance is important for energy-constrained networks.
Proceedings ArticleDOI

Understanding packet delivery performance in dense wireless sensor networks

TL;DR: This paper reports on a systematic medium-scale measurement of packet delivery in three different environments: an indoor office building, a habitat with moderate foliage, and an open parking lot, which has interesting implications for the design and evaluation of routing and medium-access protocols for sensor networks.
Proceedings ArticleDOI

Comparison of routing metrics for static multi-hop wireless networks

TL;DR: A detailed, empirical evaluation of the performance of three link-quality metrics---ETX, per-hop RTT, andper-hop packet pair---and compare them against minimum hop count finds that the ETX metric has the best performance when all nodes are stationary and the hop-count metric outperforms all of the link- quality metrics in a scenario where the sender is mobile.
Journal ArticleDOI

Opportunistic routing in multi-hop wireless networks

TL;DR: Extremely Opportunistic Routing is described, a new unicast routing technique for multi-hop wireless networks that reduces the total number of transmissions by nearly a factor of two over the best possible pre-determined route.
References
More filters

Ad hoc On-Demand Distance Vector (AODV) Routing

TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Proceedings ArticleDOI

A performance comparison of multi-hop wireless ad hoc network routing protocols

TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Proceedings ArticleDOI

A scalable location service for geographic ad hoc routing

TL;DR: GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work, and compares favorably with Dynamic Source Routing.
Proceedings ArticleDOI

Capacity of Ad Hoc wireless networks

TL;DR: The question “Are large ad hoc networks feasible?” reduces to a question about the likely locality of communication in such networks, and it is shown that for total capacity to scale up with network size the average distance between source and destination nodes must remain small as the network grows.