Information-directed routing in ad hoc sensor networks

Liu, Juan; Zhao, Feng; Petrović, Dragan

doi:10.1145/941350.941363

Cited by 33 publications

(24 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additional data-centric power efficient architectures are Energy-Aware Data-Centric Routing (EAD) [15], information-directed routing [16], and sensor transmission control protocol [17]. …”

Section: Information Dissemination By Negotiationmentioning

confidence: 99%

Untitled

2012

IJCSES

View full text Add to dashboard Cite

show abstract

“…Additional data-centric power efficient architectures are Energy-Aware Data-Centric Routing (EAD) [15], information-directed routing [16], and sensor transmission control protocol [17]. …”

Section: Information Dissemination By Negotiationmentioning

confidence: 99%

Untitled

2012

IJCSES

View full text Add to dashboard Cite

show abstract

“…Routing of data packets in networks are typically done based on the distance to the receiver node as in Bertsekas and Gallager [1991]. Some recent work addresses how to couple data routing with the sensing task using information theoretic measures was given by Liu et al [2005].…”

Section: Proceedings Of the 17th World Congressmentioning

confidence: 99%

Estimation Over Wireless Sensor Networks: Tradeoff between Communication, Computation and Estimation Qualities

Shi

Johansson

Murray

2008

IFAC Proceedings Volumes

View full text Add to dashboard Cite

Abstract:In this paper we consider a state estimation problem over a wireless sensor network. A fusion center dynamically forms a local multi-hop tree of sensors and fuses the data into a state estimate. It is shown that the optimal estimator over a sensor tree is given by a Kalman filter of certain structure. Using estimation quality as a metric, two communication schemes are studied and compared. In scheme one, sensor nodes communicate measurement data to their parent nodes, while in scheme two, sensor nodes communicate their local state estimates to their parent nodes. We show that under perfect communication links, the two schemes produce the same estimate at the fusion center with unlimited computation at each sensor node; scheme one is always better than scheme two with limited computation. When data packet drops occur on the communication links, we show that scheme two always outperforms scheme one with unlimited computation; with limited computation, we show that there exists a critical packet arrival rate, above which, scheme one outperforms scheme two. Simulations are provided to demonstrate the two schemes under various circumstances.

show abstract

“…The problem of DCS is related also to anoter problem known as Information Directed Routing (IDR) [18]. To route a message, IDR finds a path with maximum information gain at moderate communication cost.…”

Section: Related Workmentioning

confidence: 99%

Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks

Albano¹,

Chessa²,

Nidito³

et al. 2007

2007 International Conference on Mobile Data Management

View full text Add to dashboard Cite

Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access to sensed data to multiple sink nodes. Recent approaches to data storage rely on Geographic Hash Tables for efficient data storage and retrieval. These approaches however do not support different QoS levels for different classes of data as the programmer has no control on the level of redundancy of data (and thus on data dependability). Moreover, they result in a great unbalance in the storage usage in each sensor, even when sensors are uniformly distributed. This may cause serious data losses, waste energy and shorten the overall lifetime of the sensornet. In this paper, we propose a novel protocol, Q-NiGHT, which (1) provides a direct control on the level of QoS in the data dependability, and (2) uses a strategy similar to the rejection method to build a hash function which scatters data approximately with the same distribution as sensors. The benefits of Q-NiGHT are assessed through a detailed simulation experiment, also discussed in the paper. Results show its good performance on different sensors distributions on terms of both protocol costs and load balance between sensors.

show abstract

Information-directed routing in ad hoc sensor networks

Cited by 33 publications

References 12 publications

Untitled

Untitled

Estimation Over Wireless Sensor Networks: Tradeoff between Communication, Computation and Estimation Qualities

Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks

Contact Info

Product

Resources

About