Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Role-based hierarchical self organization for wireless ad hoc sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Proceedings of the 1st international conference on Embedded networked sensor systems
The First ACM Conference on Embedded Networked
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
DFuse: a framework for distributed data fusion
Proceedings of the 1st international conference on Embedded networked sensor systems
Error analysis of localization systems for sensor networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Algorithms for generic role assignment in wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
On Demand Role Assignment for Event-Detection in Sensor Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Scalable data aggregation for dynamic events in sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Information fusion for wireless sensor networks: Methods, models, and classifications
ACM Computing Surveys (CSUR)
Diffuse: A topology building engine for wireless sensor networks
Signal Processing
Efficient routing from multiple sources to multiple sinks in wireless sensor networks
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Adaptive and decentralized operator placement for in-network query processing
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Sensing task assignment via sensor selection for maximum target coverage in WSNs
Journal of Network and Computer Applications
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this work, we show how we can design a routing protocol for wireless sensor networks (WSNs) to support an information-fusion application. Regarding the application, we consider that WSNs apply information fusion techniques to detect events in the sensor field. Particularly, in event-driven scenarios there might be long intervals of inactivity. However, at a given instant, multiple sensor nodes might detect one or more events, resulting in high traffic. To save energy, the network should be able to remain in a latent state until an event occurs, then the network should organize itself to properly detect and notify the event. Based on the premise that we have an information-fusion application for event detection, we propose a role assignment algorithm, called Information-Fusion-based Role Assignment (InFRA), to organize the network by assigning roles to nodes only when events are detected. The InFRA algorithm is a distributed heuristic to the minimal Steiner tree, and it is suitable for networks with severe resource constraints, such as WSNs. Theoretical analysis shows that, in some cases, our algorithm has a O(1)-approximation ratio. Simulation results show that the InFRA algorithm can use only 70% of the communication resources spent by a reactive version of the Centered-at-Nearest-Source algorithm.