Given a set $\xi=\{H_1,H_2,\cdots\}$ of connected non acyclic graphs, a $\xi$-free graph is one which does not contain any member of $% \xi$ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertice...

Document(s)

Title

Given a set $\xi=\{H_1,H_2,\cdots\}$ of connected non acyclic graphs, a $\xi$-free graph is one which does not contain any member of $% \xi$ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertice...

Our ongoing work aims at defining an ontology-centered approach for building expertise models for the CommonKADS methodology. This approach (which we have named "OntoKADS") is founded on a core problem-solving ontology which distinguishes between two...

http://www710.univ-lyon1.fr/~csolnon

In this paper, we consider hybrid ad hoc networks, which are composed of two kinds of nodes, regular ones and nodes with additional capabilities. For example, multi-hop cellular and wireless Internet networks consist of static or mobile nodes, and fi...

We give an extended review of existing energy efficient broadcasting protocols for ad hoc networks.

In ad hoc and sensor networks, the simplest and most widely used approach to broadcast is blind flooding, which lets every node in the network to rebroadcast a receiving packet to all its neighbors. This causes redundancy of broadcast packets and res...

In this chapter, we provide a review of existing energy efficient broadcasting protocols and propose some modifications to adapt them to hybrid ad hoc networks.

We investigate minimum energy broadcasting problem where mobile nodes have the capability to adjust their transmission range. Two formulas are generally used when considering this problem. The first, E = r^alpha, depends only on the transmitting rang...

Several localized broadcasting protocols for ad hoc and sensor networks were proposed recently, with the goal of minimizing the energy consumption, while still guaranteeing a total coverage of the network. Also, several activity scheduling protocols ...