A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Distributed Algorithm for Joins in Sensor Networks
2007
International Conference on Scientific and Statistical Database Management
Preserved Fulltext
We investigate the problem of processing join queries within a sensor network. Due to the limited memory at nodes, joins are typically processed in a distributed manner over a set of nodes. ...
In this context we propose and investigate DIJ, a distributed algorithm for join processing that considers the memory limitations at nodes and does not make a priori assumptions on the available memory ...
DIJ: A Distributed Join Processing Algorithm for Sensor Networks Join processing in sensor networks is a highly complex operation due to the distributed nature of the processing and the limited memory ...
doi:10.1109/ssdbm.2007.26
dblp:conf/ssdbm/ComanN07
fatcat:7avvd4owkzavvoxchtkgwd2ixe
Energy-Efficient Distributed Spatial Join Processing in Wireless Sensor Networks
2010
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an energy-efficient distributed spatial join algorithm on two heterogeneous sensor networks, which performs in-network spatial join processing. ...
Especially, spatial queries on two sensor networks need a distributed spatial join processing among the sensor networks. ...
[16] proposed an algorithm for join processing of multiple sensor readings in a sensor network. ...
doi:10.1587/transinf.e93.d.1447
fatcat:3zrswybnkvaovdl4yzopzjcldm
IJA: An Efficient Algorithm for Query Processing in Sensor Networks
2011
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. ...
Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor Networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication ...
Acknowledgements This paper was supported by Wonkwang University in 2010. ...
doi:10.3390/s110201682
pmid:22319375
pmcid:PMC3274024
fatcat:z7adykpaeveebm5sjqvwazjtbi
Parallel Processing of Sensor Network Data Using Column-oriented Databases
2013
AASRI Procedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For join processing, it is important to minimize the communication cost since it is the main consumer of battery power. In this paper, we introduce a parallel join technique for sensor networks. ...
The proposed parallel join algorithm is based on sensor data that are stored in column-oriented databases. ...
Conclusion In this paper, we proposed a distributed algorithm for processing data in sensor networks. ...
doi:10.1016/j.aasri.2013.10.051
fatcat:tliavm5qzjaf7joltp6jzzceea
Communication-Efficient Implementation of Range-Joins in Sensor Networks
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Apart from two simple approaches, we propose distributed hash-join and index-join algorithms for implementation of range-join operations in sensor networks. ...
Our experiments also reveal that although both approach scale well, the index-join algorithm performs better than the hash-join algorithm especially in large sensor networks. ...
A sensor network consists of a large number of sensors distributed randomly in a geographical region. ...
doi:10.1007/11733836_63
fatcat:ts5mbuoy2vdexg6nlfwhauabqm
Communication-Efficient Implementation of Join in Sensor Networks
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this article, we focus on designing efficient distributed implementations for the join operation in sensor networks. ...
Using path-join algorithm as the basic step, we design an optimal algorithm for a join operation that provably incurs minimum communication cost in dense sensor networks under some reasonable assumptions ...
Q S Definition 2: (Distribute-Broadcast Join Algorithms) A join algorithm to compute R S in a sensor network is a distribute-broadcast join algorithm if the join is processed by first uniformly distributing ...
doi:10.1007/11408079_40
fatcat:kskwdp4u2rcofn36nxktrr7fna
Communication-efficient implementation of join in sensor networks
2007
Ad hoc networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this article, we focus on designing efficient distributed implementations for the join operation in sensor networks. ...
Using path-join algorithm as the basic step, we design an optimal algorithm for a join operation that provably incurs minimum communication cost in dense sensor networks under some reasonable assumptions ...
Q S Definition 2: (Distribute-Broadcast Join Algorithms) A join algorithm to compute R S in a sensor network is a distribute-broadcast join algorithm if the join is processed by first uniformly distributing ...
doi:10.1016/j.adhoc.2007.02.002
fatcat:xq4xnimukzfrjhjpw4tgtkbxgy
An Efficient Processing of Join Queries for Sensor Networks Using Column-Oriented Databases
2013
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a technique for join queries in a sensor network that minimizes communication cost. ...
We compare our algorithm with existing join algorithms for sensor networks that are based on traditional roworiented databases. ...
We discuss related join processing techniques for sensor network databases in Section 2. In Section 3, we present a join algorithm for sensor network based on a columnoriented database. ...
doi:10.1155/2013/345672
fatcat:j6lmp2ffy5akvbdqnlsz6lqhji
Semijoin-Based Spatial Join Processing in Multiple Sensor Networks
2008
ETRI Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ABSTRACT⎯This paper presents an energy-efficient spatial join algorithm for multiple sensor networks employing a spatial semijoin strategy. ...
For optimization of the algorithm, we propose a GR-tree index and a grid-ID-based spatial approximation method, which are unique to sensor networks. ...
II. 2-SN Spatial Join Algorithm In this paper, a distributed spatial join query for two sensor networks is defined as follows. Definition 1: 2-SN spatial join query (q). ...
doi:10.4218/etrij.08.0208.0206
fatcat:t5phm63rf5djpnkr4ifyp3dcma
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks
2005
Very Large Data Bases Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper presents a set of algorithms for efficiently evaluating join queries over static data tables in sensor networks. ...
REED is thus suitable for a wide range of event-detection applications that traditional sensor network database and data collection systems cannot be used to implement. ...
However, these papers do not describe a distributed join algorithm for sensor networks. ...
dblp:conf/vldb/AbadiML05
fatcat:b3kzwwrx4bcvhinydipmhknhnq
Distributed Low Power Scheduling in Wireless Sensor Networks
2007
2007 2nd International Symposium on Wireless Pervasive Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a distributed low power scheduling algorithm for sensor nodes to determine its active time slots in a TDMA mechanism working on top of a slotted CSMA network. ...
The performance evaluation shows that an extremely small duty cycle is achieved by the proposed algorithm with a tradeoff in data delay in a sensor network application. ...
Even though such a big cycle may be an issue in event driven sensor network applications, it is not a problem in sensor network applications for monitoring. ...
doi:10.1109/iswpc.2007.342613
fatcat:s7vzlio3crasfiyb23v6r4td2m
Sensing Driven Clustering for Monitoring and Control Applications
2007
2007 4th IEEE Consumer Communications and Networking Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Clustering the nodes in a wireless sensor network is a fundamental step in many distributed self organization, resource management, communication, and processing algorithms. ...
Although in many system management tasks a purely network topology-based clustering may be sufficient, a more sensor-centric approach to clustering is required for many distributed sensing, control, and ...
In such a case the sensor enters the sleep state to save power for a period T s and then wakes up for another attempt to join a cluster. ...
doi:10.1109/ccnc.2007.47
dblp:conf/ccnc/LinM07
fatcat:d4tzvgaqbngolduuanfceg5c2y
An Energy-Efficient In-network Join for Event Detection in Sensor Networks
2008
International conference on information networking (ICOIN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an in-network method for efficient join of a sensor table and a condition table. ...
For energy-efficient event-detection in sensor networks, we can perform an in-network join of two relations, i.e., a sensor table and a condition table, where a condition table is a set of tuples each ...
The idea of distributed joins in traditional distributed databases [6] can be used for this kind of applications. Distributed joins in a sensor network can be performed 'in the network' as follows. ...
doi:10.1109/icoin.2008.4472777
dblp:conf/icoin/JeonK08
fatcat:v7szmxmzp5hvlgi6gn4k3ucfsu
Wireless Sensor Network Infrastructure: Construction and Evaluation
2009
2009 Fifth International Conference on Wireless and Mobile Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This paper aims to present a distributed and low-cost topology construction algorithm for wireless sensor networks, addressing the following issues: large-scale, random network deployment, energy efficiency ...
Efficient packet transmissions and virtual topologies, which structure sensor networks, are two main features for efficient energy management in wireless sensor networks. ...
In this paper, we propose a new distributed zone partitioning algorithm for sensor networks based on the number of hops. ...
doi:10.1109/icwmc.2009.53
fatcat:y6e6ym54dzbr3m5mslfiexz7ym
Heterogeneity Aware Clustered WSN using Multi-hop Communication
2014
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, a distributed, randomized Heterogeneity Aware Clustering Algorithm (HACA) to organize the sensors in a wireless sensor network into clusters has been proposed.HACA is very simple to implement ...
Results in stochastic geometry are used to derive solutions for the values of the parameters of proposed algorithm that minimize the total energy spent in the network when all sensors report data through ...
units. clustering algorithm is applied on sensor networks with 100 sensors distributed uniformly in a square area of 100sq.Units. ...
doi:10.5120/17663-8480
fatcat:2texbfnf65fw5hqt2eu3fmofvu
« Previous
Showing results 1 — 15 out of 56,326 results