Discrete Mathematics - Topics on domination
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
Next century challenges: scalable coordination in sensor networks
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
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
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
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile 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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Flooding in wireless ad hoc networks
Computer Communications
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
An ad hoc wireless network is a special type of wireless multi-hop network without infrastructure or centralized administration. As a result of the mobility of their nodes, ad hoe wireless networks are characterized by dynamically changing topologies. A localized algorithm is a special distributed algorithm where each node performs an exceedingly simple task based on local information, with no information sequentially propagated globally in tile network. The importance of localized algorithms is their scalability in mobile environments. Decisions made based on localized algorithms are adjustable to tile change (such as a topological one) due to the mobile node. We discuss a generic framework that can capture many existing localized broadcast algorithms in ad hoc wireless networks. Tile framework can easily integrate other objectives such as energy-efficient design and reliability that ensures broadcast coverage. In addition, tile framework is extensible to cover other collective communication, which includes One-to-many (multicasting), all-to-one (reduction or arregation), and all-to-all (gossiping).