A lower bound for radio broadcast
Journal of Computer and System Sciences
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Comparison of broadcasting techniques for mobile ad hoc 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
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Non-Uniform Information Dissemination for Sensor Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Tracking a moving object with a binary sensor network
Proceedings of the 1st international conference on Embedded networked sensor systems
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
The platforms enabling wireless sensor networks
Communications of the ACM - Wireless sensor networks
Networking support for query processing in sensor networks
Communications of the ACM - Wireless sensor networks
Random Asynchronous Wakeup Protocol for Sensor Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
A QoS-based service retrieval methodology for digital ecosystems
International Journal of Web and Grid Services
Routing efficiency in wireless sensor-actor networks considering semi-automated architecture
Journal of Mobile Multimedia
Hi-index | 0.00 |
We present QoS Geometric Broadcast Protocol (QoS-GBP), a novel broadcasting protocol for heterogeneous wireless ad hoc networks. The growing number of multimedia applications over wireless ad hoc networks require low delay from network protocols and in particular from broadcasting. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous wireless ad hoc networks networking. QoS-GBP is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. QoS-GBP enables a tradeoff among the need for neighborhood information (communication overhead) and the delay. QoS-GBP is scalable to the change in network size, node type, node density and topology. Through simulation evaluations, we show that QoS-GBP is very scalable and guarantees minimum delay.