Search
Skip to Search Results- 10Zaiane, Osmar
- 5Nascimento, Mario
- 4Nascimento, Mario A.
- 3Oliveira, Stanley
- 2Antonie, Maria-Luiza
- 2El-Hajj, Mohammad
-
2012
Kazemeyni, Fatemah, Owe, Olaf, Johnsen, Einar Broch, Balasingham, Ilangko, Nascimento, Mario A.
Technical report TR12-01. Limited energy supply is a chief concern when dealing with wireless sensor networks (WSNs). Thus, among other issues, routing protocols for WSNs should be designed with the goal of being energy efficient in the first place. For static networks this is already a...
-
2011
Nascimento, Mario A, Ammar, Khaled
Technical report TR11-03. Wireless Sensor Networks (WSNs) are typically used to collect values of some phenomena in a monitored area. In many applications, users are interested in summaries of the observed data, e.g., a histogram reflecting the distribution of the collected values. However,...
-
2010
Niedermayer, Johannes, Nascimento, Mario A., Kroeger, Peer, Kriegel, Hans-Peter, Renz, Matthias
Technical report TR10-03. Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-to-nodes and nodes-to-root messages and on maintaining filters at the nodes, aiming at suppressing unnecessary messages, hence saving energy and furthering...
-
2010
Renz, Matthias, Kriegel, Hans-Peter, Nascimento, Mario A., Follmann, Anna, Kroeger, Peer, Zuefle, Andreas
Technical report TR10-09. Count queries in wireless sensor networks report the number of sensor nodes for which the measured values satisfy a given query predicate. However, measurements in wireless sensor networks are typically imprecise due to limited accuracy of the sensor hardware or...
-
2009
Malhotra, Baljeet, Nikolaidis, Ioanis, Nascimento, Mario
Technical report TR09-14. We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommodates transmission dependencies that allow in-network aggregation to be performed. We formulate the...
-
2009
Nikolaidis, Ioanis, Nascimento, Mario A., Malhotra, Baljeet
Technical report TR09-01. Finding the top-k values is an important type of aggregation query in wireless sensor networks. Previous proposals relied on a given underlying logical tree topology for data aggregation/forwarding, but did not pay due attention to the role of such topology. In this...
-
On the Trade-Off Between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks
Download2009
Harms, Janelle, Vogt, Ryan, Nascimento, Mario
Technical report TR09-07. By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. Relying on the principle of k-anonymity, we propose an effective...
-
2009
Goebel, Randy, Chen, Jiyang, Yu, Philip S., Zaiane, Osmar R.
Technical report TR09-02. The significant increase in open access digital information has created incredible opportunities for modern database research, especially in exploiting significant computational resources to determine complex relationships within those data. In this paper, we consider...
-
2009
Alencar, Romulo, Nascimento, Mario, Brayner, Angelo
Technical report TR09-05. It is a well known fact that minimizing energy consumption in Wireless Sensor Networks (WSNs) is crucial for its usability; and minimizing the flow of data is one way to achieve that. Most WSN models assume the existence of a base station where query results could in...
-
2004
Antonie, Maria-Luiza, Zaiane, Osmar
Technical report TR04-07. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative...