A graph coloring based service discovery in ad hoc networks

Authors:
Mohammed Haddad;Hamamache Kheddouci
Affiliations:
University of Lyon - LIESP Laboratory, Villeurbanne, France;University of Lyon - LIESP Laboratory, Villeurbanne, France
Venue:
Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
Year:
2009

Citing 9
Cited 0

Total colourings of planar graphs with large girth

European Journal of Combinatorics
Vertex coloring with a distance restriction

Discrete Mathematics
Partial list colorings

Discrete Mathematics
Edge coloring of bipartite graphs with constraints

Theoretical Computer Science
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks

IEEE Transactions on Computers
A new kind of graph coloring

Journal of Algorithms
Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage

IEEE Transactions on Mobile Computing
A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks

NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Service discovery in mobile ad hoc networks: A field theoretic approach

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Various researches treating of the communication protocols try to define a certain organization over the network to improve its general behavior. The concept of service is frequently used as an abstraction of software and hardware resources. Service discovery offers service advertisement and location mechanisms. So, it represents a real challenge in highly dynamic networks. In this paper, we present a new service discovery protocol for ad hoc network. This protocol is based on strict strong graph coloring concept. Also, we propose the introduction of various mechanisms allowing the improvement of service discovery. In addition, we give some preliminary experiments results.