Proceedings Article10.1109/MAHSS.2005.1542860
Guesswork: robust routing in an uncertain world
T. Parker,Koen Langendoen +1 more
- 12 Dec 2005
- pp 691-699
19
TL;DR: Guesswork is an adaptive, probabilistic routing algorithm for wireless ad-hoc sensor networks, using local knowledge of best guess next-hop nodes to efficiently implement source-to-sink routing.
read more
Abstract: Guesswork is an adaptive, probabilistic routing algorithm for wireless ad-hoc sensor networks, using local knowledge of best guess next-hop nodes to efficiently implement source-to-sink routing. Guesswork is partially based on the existing ETX and ExOR routing methodologies, but extends both in new ways to create a unified robust method for sink information distribution and source data transmission. It is designed to work efficiently in a wide variety of application scenarios, being able to cope with low quality links as well as both static and mobile networks
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A robust anonymous ad hoc on-demand routing
Ronggong Song,Larry Korba +1 more
- 18 Oct 2009
TL;DR: A new robust anonymous ad hoc on-demand routing protocol based on a proposed anonymous neighborhood trust model is proposed that has strong security and anonymity protection, better scalability and is more robust when compared with other protocols.
9
Proximity Aware Routing in Ad Hoc Networks
TL;DR: This work proposes a novel position- based routing protocol called Proximity Aware Routing for Ad-hoc networks (PARA), which selects the next hop of a packet based on 2-hops neighborhood information and introduces the concept of "proximity discovery".
Distributed Sensor Data Models and Their Impact on Energy Consumption of Wireless Sensor Networks
Urs Hunkeler
- 01 Jan 2013
TL;DR: Keywords: Wireless Sensor Network ; energy efficiency ; sensor data model ; distributed processing ; automatic generation of distributed code ; TinyOS ; IMPERIA ; tinyOS; and more.
4
Foxtrot: phase space data representation for correlation-aware aggregation
T. Parker,Koen Langendoen +1 more
- 18 Jun 2007
TL;DR: Foxtrot is proposed - using phase space data representation combined with novel aggregation methods to limit errors to application-specific ranges and reduces data rates without significant information loss.
References
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
- 01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Chalermek Intanagonwiwat,Ramesh Govindan,Deborah Estrin +2 more
- 01 Aug 2000
TL;DR: This paper explores and evaluates the use of directed diffusion for a simple remote-surveillance sensor network and its implications for sensing, communication and computation.
•Journal Article
An Energy-Efficient MAC Protocol for Wireless Sensor Networks
TL;DR: S-MAC as discussed by the authors is a medium access control protocol designed for wireless sensor networks, which uses three novel techniques to reduce energy consumption and support self-configuration, including virtual clusters to auto-sync on sleep schedules.
5.5K
An energy-efficient MAC protocol for wireless sensor networks
Wei Ye,John Heidemann,Deborah Estrin +2 more
- 07 Nov 2002
TL;DR: S-MAC uses three novel techniques to reduce energy consumption and support self-configuration, and applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network.