An information-theoretic framework for field monitoring using autonomously mobile sensors

Morcos, Hany; Atia, George K.; Bestavros, Azer; Matta, Ibrahim

doi:10.1016/j.adhoc.2010.07.016

Cited by 7 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [23] an information theoretical approach is presented to optimize the caching mechanism used by mobile devices; in this case every node is assumed to query for the information in a given point in space, assuming a certain probability distribution for the location of the queries. In [1] the problem of efficiently answering real-time geo-centric ad-hoc queries is considered.…”

Section: Related Workmentioning

confidence: 99%

Performance issues in content dissemination to metropolitan mobile users

Corrente

2020

Preprint

View full text Add to dashboard Cite

In this paper we consider a set of heterogeneous terminals in a urban area that are interested in collecting the information originated from several sources. This set includes mobile nodes (pedestrian and vehicles) and fixed terminals. In particular, each terminal aims at retrieving the data items in a limited region of interest (ROI) centered around the node position. Since data items may change over time all nodes must strive for having access to the latest version.The goal of the paper is to evaluate the amount of information each node is able to gather (coverage) resorting to simple distributed data collection and sharing through local broadcast communications.We study the diffusion of information updates in the whole area, evaluate the impact of energy saving policies in the protocol version run by pedestrian devices, and the impact of contextual awareness about location and motion of nodes in the forwarding policies.The study we present in this paper has been carried out through simulation. To this end we develop a discrete event simulator working on top of mobility and radio propagation 1 traces obtained from the UDelModels tools that allow to obtain realistic traces of mobility and radio propagation.

show abstract

Section: Related Workmentioning

confidence: 99%

Performance issues in content dissemination to metropolitan mobile users

Corrente

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…In this work, a dynamic-programming algorithm is used to determine an optimal execution order of queries. Examples of other studies that proposed coordination strategies include techniques that ensure efficient storage, caching, and exchange of spatio-temporal data [6,7] or aggregates thereof [8]. In our work, we focus on reducing overheads by adding Data De-duplication functionality to a subset of nodes at various hierarchies, without concern to resource or energy constraints.…”

Section: Related Workmentioning

confidence: 99%

Data De-Duplication Aware Clustering for Optimized Storage in Wireless Multimedia Sensor Networks

Indraneel¹,

Rao²

2014

IJSACS

View full text Add to dashboard Cite

The progressive growth in the scope and scale of wireless sensor networks have explored new dimensions of potential research in this domain. Traditionally they are viewed as resource constrained and application specific localized adhoc networks. The capabilities of the sensor node have increased many fold with the advent of new sensors, miniaturization of electronic devices and storage facilities. Now a days the sensor nodes are equipped with on chip CMOS cameras, Flash memory and considerably large storage space and power resources. Many changes in communication protocols have led to the possible integration of heterogeneous sensor networks into the existing infrastructure based networks. With all these capabilities sensor nodes are capable to transmit multimedia data such as video, audio, image etc. seamlessly over the large scale networks leading to large scale Wireless Multimedia Sensor Networks (WMSNS). For optimizing the data transmission and storage of the generated huge multimedia data we have proposed De-Duplication aware clustering in WMSNS.

show abstract

“…In that work, a dynamic-programming algorithm is used to determine an optimal execution order of queries. Examples of other studies that proposed coordination strategies include techniques that ensure efficient storage, caching, and exchange of spatio-temporal data [22,23] or aggregates thereof [21].…”

Section: Related Workmentioning

confidence: 99%

The filter-placement problem and its application to minimizing information multiplicity

et al. 2012

Self Cite

View full text Add to dashboard Cite

In many information networks, data items -such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route updates in ad-hoc networks -propagate in an uncoordinated manner: nodes often relay information they receive to neighbors, independent of whether or not these neighbors received the same information from other sources. This uncoordinated data dissemination may result in significant, yet unnecessary communication and processing overheads, ultimately reducing the utility of information networks. To alleviate the negative impacts of this information multiplicity phenomenon, we propose that a subset of nodes (selected at key positions in the network) carry out additional information filtering functionality. Thus, nodes are responsible for the removal (or significant reduction) of the redundant data items relayed through them. We refer to such nodes as filters. We formally define the Filter Placement problem as a combinatorial optimization problem, and study its computational complexity for different types of graphs. We also present polynomial-time approximation algorithms and scalable heuristics for the problem. Our experimental results, which we obtained through extensive simulations on synthetic and real-world information flow networks, suggest that in many settings a relatively small number of filters is fairly effective in removing a large fraction of redundant information.

show abstract

An information-theoretic framework for field monitoring using autonomously mobile sensors

Cited by 7 publications

References 11 publications

Performance issues in content dissemination to metropolitan mobile users

Performance issues in content dissemination to metropolitan mobile users

Data De-Duplication Aware Clustering for Optimized Storage in Wireless Multimedia Sensor Networks

The filter-placement problem and its application to minimizing information multiplicity

Contact Info

Product

Resources

About