A lower bound for radio broadcast
Journal of Computer and System Sciences
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
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
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
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
SPINS: security protocols for sensor networks
Wireless Networks
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Internal Nodes based Broadcasting in Wireless Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
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
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Performance Analysis of Broadcast Protocols in Ad Hoc Networks Based on Self-Pruning
IEEE Transactions on Parallel and Distributed Systems
Area-based beaconless reliable broadcasting in sensor networks
International Journal of Sensor Networks
Modeling and performance evaluation of ATM switches
AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
Coordination protocols for a reliable sensor, actuator, and device network (SADN)
Mobile Information Systems - Mobile Systems and Applications
Multi-root, Multi-Query Processing in Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Networked biomedical system for ubiquitous health monitoring
Mobile Information Systems - Information Assurance and Advanced Human-Computer Interfaces
Directional Flooding Scheme with Data Aggregation for Energy-Efficient Wireless Sensor Networks
Information Networking. Towards Ubiquitous Networking and Services
Dynamic multiroot, multiquery processing based on data sharing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Integrated biomedical system for ubiquitous health monitoring
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
On the connectivity of key-distribution strategies in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Adaptive channel width for MASNET routeless routing protocol
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Efficient geographic routeless routing protocols with enhanced location update mechanism
International Journal of Sensor Networks
Anonymous routing in wireless mobile ad hoc networks to prevent location disclosure attacks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A probabilistic and opportunistic flooding algorithm in wireless sensor networks
Computer Communications
Area based beaconless reliable broadcasting in sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
A 3-dimensional broadcast protocol with optimised transmission efficiency in wireless networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 14.98 |
Sensor networks usually operate under very severe energy restrictions. Therefore, sensor communications should consume the minimum possible amount of energy. 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 sensor networking. In this paper, we propose an optimized Broadcast Protocol for Sensor networks (BPS). The major novelty of BPS is its adaptive-geometric approach that enables considerable reduction of retransmissions by maximizing each hop length. BPS adapts itself and gets the best out of existing radio conditions. In BPS, nodes do not need any neighborhood information, which leads to low communication and memory overhead. We analyze the worst-case scenario for BPS and show that the number of transmissions in such a scenario is a constant multiple of those required in the ideal case. Our simulation results show that BPS is very scalable with respect to network density. BPS is also resilient to transmission errors.