Multicluster, mobile, multimedia radio network
Wireless Networks
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
Message-optimal connected dominating sets in 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
Increasing Reliability in Cable-Free Radio LANs Low Level Forwarding in HIPERLAN
Wireless Personal Communications: An International Journal
A Cluster-based Approach for Routing in Ad-Hoc Networks
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
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
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Hi-index | 0.00 |
The easiest way to broadcast a message in a wireless multihop network is to let each network node retransmit the broadcast message once it has received it. That way however many unnecessary redundant transmissions take place. A large body of literature exists which copes with the problem to keep the number of retransmissions small. Solutions described so far either guarantee that all nodes in the network are reached but suffer from nodes with strict memory limitations, or can be applied on nodes with memory limitations but sacrifice delivery guarantees. In this work we look at a well known solution to reduce redundant broadcast transmissions: clustering nodes to form a connected network backbone where a broadcast limited on the backbone nodes still supplies all nodes in the network. We describe a new algorithm which guarantees that all network nodes are supplied by the cluster structure while the construction of the structure obeys strict memory limitations per node. We evaluate our solution in a log normal shadowing network simulation. Performance metrics considered are broadcast delay, delivery ratio, and flooding rate. For comparison we also consider simple flooding which requires just one storage location to memorize the currently handled broadcast task.