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
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Predictive Models to Rebroadcast in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
Flooding in wireless ad hoc networks
Computer Communications
Quasi-Hierarchical Routing Algorithm for ZigBee/IEEE 802.15.4 Networks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks
Computer Communications
Node addressing schemes for scalable and fault tolerant routing in hierarchical WSNs
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
A survey of addressing algorithms for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
IEMS: indoor environment monitoring system using ZigBee wireless sensor network
Proceedings of the 2011 International Conference on Communication, Computing & Security
Design of underground miner positioning system based on zigbee technology
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
CorLayer: a transparent link correlation layer for energy efficient broadcast
Proceedings of the 19th annual international conference on Mobile computing & networking
An innovative scheme for increasing connectivity and life of ZigBee networks
The Journal of Supercomputing
Routing approach based on rate of transmission failure in ZigBee networks with changing mobility
International Journal of Sensor Networks
Artificial Neural Network Expert System for Integrated Heart Rate Variability
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
This paper studies efficient and simple data broadcast in IEEE 802.15.4-based ad hoc networks (e.g., ZigBee). Since finding the minimum number of rebroadcast nodes in general ad hoc networks is NP-hard, current broadcast protocols either employ heuristic algorithms or assume extra knowledge such as position or two-hop neighbor table. However, the ZigBee network is characterized as low data rate and low cost. It cannot provide position or two-hop neighbor information, but it still requires an efficient broadcast algorithm that can reduce the number of rebroadcast nodes with limited computation complexity and storage space. To this end, this paper proposes self-pruning and forward node selection algorithms that exploit the hierarchical address space in ZigBee networks. Only one-hop neighbor information is needed; a partial list of two-hop neighbors is derived without exchanging messages between neighboring nodes. The ZigBee forward node selection algorithm finds the minimum rebroadcast nodes set with polynomial computation time and memory space. Using the proposed localized algorithms, it is proven that the entire network is covered. Simulations are conducted to evaluate the performance improvement in terms of the number of rebroadcast nodes, number of duplicated receivings, coverage time, and communication overhead.