A unifying review of linear Gaussian models
Neural Computation
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Unsupervised Learning of Finite Mixture Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
FREM: fast and robust EM clustering for large data sets
Proceedings of the eleventh international conference on Information and knowledge management
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Data Gathering in SEnsor Networks using the Energy Delay Metric
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Low-Power Wireless Sensor Networks
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Accelerating EM clustering to find high-quality solutions
Knowledge and Information Systems
Zonal Rumor Routing for Wireless Sensor Networks
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
SeRLoc: Robust localization for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
New routing framework base on rumor routing in wireless sensor networks
Computer Communications
Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed energy balanced routing for wireless sensor networks
Computers and Industrial Engineering
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy efficient and QoS based routing protocol for wireless sensor networks
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Nonparametri information fusion for motion estimation
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Distributed EM algorithms for density estimation and clustering in sensor networks
IEEE Transactions on Signal Processing
Distributed EM Algorithm for Gaussian Mixtures in Sensor Networks
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
Query-driven routing plays an important role in wireless sensor networks, especially when Sink looks for data with unknown location in the network. Rumor routing propagates event information in some select paths in the network, in effect, creating an event trace. When an agent on an event trace is crossed by a query agent, a route to event location is established. The main goal in all rumor-based algorithms is to expedite the cross over by the query-agents. This paper introduces a new class of rumor-based algorithms based on a concept called appointment, adding determinism to the cross-over point location as well as agent traversal trajectory in a randomly set-up network and event scenarios. Two flavors of the algorithm are proposed. In the first approach, query-agents and event-agents make an appointment at the edge of the network. In the second approach, the appointment is made at a central point in the network. We study the optimality conditions for such a central point as a function of the system parameters. A Gaussian mixture model is used to model the events' spatial stochastic distribution, and a dynamic Expectation-Maximization algorithm is developed to estimate its rank and parameters. A data fusion algorithm is then applied to calculate the appointment point. We formulate a trade-off among search speed, route length, and network life time. Simulation results in various scenarios are used to compare the proposed algorithms to other competing algorithms and also to the optimal solution. The results illustrate that algorithms proposed in this paper are nearly optimal and are superior compared to other query-based routing algorithms.