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
Minimum energy paths for reliable communication in multi-hop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Mobility control and its applications in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The problem of efficiently disseminating data from a mobile stimulus (source) to multi-ple mobile users (sinks) in a large-scale sensor network has been challenging. We address this prob-lem by proposing a minimum-energy tree-based data dissemination scheme, Dynamic Localized Minimum-Energy Agent Tree-Based Scheme (DLATS). We exploit the fact that sensor nodes are stationary and location-aware. In DLATS, each sensor node finds its Relative Neighborhood Graph (RNG) neighbors and a RNG is generated over the whole network. Then, the source broadcasts its position information to all the other nodes using our localized minimum-energy broadcast protocol, Improved RNG Broadcast Oriented Protocol (IRBOP). A dynamic agent tree is generated between each source and multiple sinks using our Shortest Direct Parent First (SDPF) where the sinks become the agents, e.g., the leaves of the agent tree. Finally, each source uses IRBOP for multicast-ing the stimulus data to the users over the agent tree. We evaluate the performance of DLATS through simulations. Results show DLATS outperforms previously proposed protocols for data dis-semination in large-scale sensor networks.