Mohammed Haddad
Lyes Dekar
ABSTRACT
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.
- S. Basagni, D. Bruschi, and I. Chlamtac. A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE Transactions on Networking, 7, 1999. Google Scholar
Digital Library
- M. Burmester, T. V. Le, and A. Yasinsac. Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks. Ad hoc Networks, 5, 2007. Google ScholarDigital Library
- C. Chen, C-K. Hsu, and H-K. Wang. A distance-aware counter-based broadcast scheme for wireless ad hoc networks. IEEE MILCOM, 2005.Google ScholarCross Ref
- J. E. Dunbara, D. J. Erwinb, T. Haynesc, S. M. Hedetniemid, and S. T. Hedetniemid. Broadcasts in graphs. Discrete Applied Mathematics, 154, 2006. Google ScholarDigital Library
- C-S. Hsu, Y-C. Tseng, and J. P Sheu. An efficient reliable broadcasting protocol for wireless mobile ad hoc networks. Ad Hoc Networks, 5, 2007. Google ScholarDigital Library
- A. Khelil, P. J. Marrón, C. Becker, and K. Rothemel. Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks. Ad Hoc Networks, 5, 2007. Google ScholarDigital Library
- J. Kim, Q. Zhang, and D. P. Agrawal. Probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks. IEEE GLOBECOM, Dallas, TX, USA, 2004.Google Scholar
- Y. Li, S. Peng, and W. Chu. An efficient algorithm for finding an almost connected dominating set of small size on wireless ad hoc networks. IEEE MASS, 2006.Google ScholarCross Ref
- O. Liang, Y. A. Sekercioglu, and N. Mani. Gateway multipoint relays, an mpr-based broadcast algorithm for ad hoc networks. IEEE ICCS, Singapore, 2006.Google ScholarCross Ref
- H. Lim and C. Kim. Multicast tree construction and flooding in wireless ad hoc networks. ACM MSWIM 2000, Boston, MA, 2000. Google ScholarDigital Library
- W. Lou and J. Wu. Towards broadcast relibaility in mobile ad hoc networks with double coverage. IEEE Transactions on Mobile Computing, 6, 2007. Google ScholarDigital Library
- S. Y. Ni, Y. C. Tseng, Y. S. Chen, and J. P. Sheu. The broadcast storm problem in a mobile ad hoc network. ACM/IEEE ICMCN, Seattle, USA, 1999. Google ScholarDigital Library
- E. Pagani and G. P. Rossi. Providing reliable and fault tolerant broadcast delevery in mobile ad hoc networks. Mobile Networks and Applications, 4, 1999. Google ScholarDigital Library
- Y. Sasson, D. Cavin, and A. Schiper. Probabilistic broadcast for flooding in wireless mobile ad hoc networks. IEEE WCNC, 2003.Google ScholarCross Ref
- M. A. Spohn and J. J. Garcia-Luna. Improving route discovery in on-demand routing protocols using two-hop connected dominating sets. Ad hoc Networks, 4, 2006.Google Scholar
- K. Viswanath and K. Obraczka. An adaptive approach to group communications in multi hop ad hoc networks. IEEE ISCC, Vienna, Austria, 2002. Google ScholarDigital Library
- K. Viswanath and K. Obraczka. An adaptive approach to group communications in multi hop ad hoc networks. IEEE ICN, Atlanta, USA, 2002.Google Scholar
- J. Wu and F. Dai. Broadcasting in ad hoc networks based on self-pruning. IEEE INFOCOM, 53, 2003.Google Scholar
- J. Wu and F. Dai. A generic distributed broadcat scheme in ad hoc wireless networks. IEEE Transactions in computers, 53, 2004. Google ScholarDigital Library
- D. Yuan. Distributed pruning algorithms based on neighborhood connectivity for broadcast communication in wireless ad hoc networks. IEEE MILCOM, 2005.Google Scholar
- Q. Zhang and D. P. Agrawal. Dynamic probabilistic broadcasting in manets. Journal of Parallel and Distributed Computing, 65, 2005. Google ScholarDigital Library
- Igor E. Zverovich. A new kind of graph coloring. Journal of Algorithms, 58, 2006. Google ScholarDigital Library
Index Terms
- A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks
Recommendations
A distributed broadcast algorithm for wireless mobile ad hoc networks
MMM'07: Proceedings of the 13th International conference on Multimedia Modeling - Volume Part IIIn Wireless mobile ad hoc networks, many unicast and multicast protocols depend on broadcast mechanism to finish control and route establishment functionality. In a straightforward broadcast by flooding, each node will retransmit a message to all it ...
Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage
The broadcast operation, as a fundamental service in mobile ad hoc networks (MANETs), is prone to the broadcast storm problem if forwarding nodes are not carefully designated. The objective of reducing broadcast redundancy while still providing high ...
Strict Strong Graph Coloring: Algorithms and Applications
ICEMIS '15: Proceedings of the The International Conference on Engineering & MIS 2015This paper addresses a recent combinatorial optimization problem called the Strict Strong graph coloring. This new coloring parameter investigates the use of dominance relation between graph vertices and color classes. This kind of coloring has been ...
Comments