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
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
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
An Adaptive Approach to Group Communications in Multi Hop Ad Hoc Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
IEEE Transactions on Computers
Dynamic probabilistic broadcasting in MANETs
Journal of Parallel and Distributed Computing
Discrete Applied Mathematics
Journal of Algorithms
Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage
IEEE Transactions on Mobile Computing
A graph coloring based service discovery in ad hoc networks
Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
A strict strong coloring of trees
Information Processing Letters
A Generalized Graph Strict Strong Coloring Algorithm
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |
A challenging research area in computer networks is ad hoc networks. These are defined to be spontaneous and totally autonomous networks. Many communication protocols (like routing, resources sharing, ...) use broadcasting mechanism to diffuse or gather information. A strict strong coloring of a graph G is a vertex proper coloring of G such that each vertex of G is adjacent to at least one non empty color class. In this paper, we give a novel broadcasting approach based on a distributed algorithm for strict strong coloring.