to several groups, some simple members (s) which are active in the communication
process only for their own tasks.
With this type of organizational structure, the message path between the source (a)
and the receiver (b) is ((a, r),
∗
[(r, c), (c, r)], (r, b)). If the source is a representative
agent the first term doesn’t exist. If the receiver is a representative agent the last term
doesn’t exist.
Because a representative agent is the most sollicited agent in a group, the best one
is the one having the most important level of energy and the most important number
of neighbors. We use a role allocation based self-organization mechanism involving the
election of a representative agent based on a function which estimates the adequation
between its desire to be the boss and its capacity to be: so the organization is modified
only when a problem occurs. We don’t try to maintain it if we have no communication.
The energy saving is obtained owing to the fact that the flooding is only directed to
the representative agents of the groups and to some connection agents. To give an order
of idea, a receiver path research with flooding techniques will cost, in the case of a
traditional wireless network, a number of emissions equal to the number of stations. In
the case of a clustered wireless network, the number of transmitted messages are about
twice the numbers of representative agents (all the representative agents are contacted
via one connection agent ).
However, the networks with an organizational structure must take care of the main-
tenance of their routing table. Generally, the adaptive features of these tables come from
periodical exchanges between the different nodes. In our approach we do not wish to
use this technique to ensure the maintenance of coherence. Indeed, our principle will
be ”if we do not need to communicate, it is useless to spend energy to ensure the co-
herence maintenance”. However, we will thus use eavesdropping of surrounding agent
communications. We extract knowledge from these messages exchange to update our
beliefs about our neighboors. Moreover, our self-organization mechanism will integrate
an energy management policy. These structures will thus emerge.
Our algorithm (figure 3) can be adjusted by other agents’ suggestions such as an
organization inconsistency. Moreover, an agent can give up its role because its power
level quickly fall or fall under a limit that the agent thinks dangerous for its integrity.
So it can become a sample member.
3.5 The interaction aspect
The agents will interact only with the agents in acquaintance. Agents interact by asyn-
chronous exchange of messages. Among the different protocols that we use, the choice
of an introduction protocol is essential. Indeed, this protocol allows to the agents to
be known, i.e. to bring their knowledge and their know-how to the agents’ society. An
other important protocol is the ”best representant election” protocol seen previously.
These protocols are an arrangement of some of the thirteen different types of small
messages defined in the following: WhoAreMyNeighbors is used by an agent to know
who its neighbors are. This message is transmitted when an agent is created (the first
goal of a new agent is to know its neighbors) or when an agent feels that its neighbor
table is not coherent with reality. IAmOneOfYourNeighbors makes it possible for an
agent to answer the preceding request. With this message, it thus provides its identifier,
76