Efficient search mechanisms in a context distribution system

In order to improve system´s efficiency and scalability for the provision of time-critical context-aware services, we propose a set of decentralised usage-aware search mechanisms. These mechanisms exploit the locality of reference properties exhibited by context usage patterns with efficient means provided by active networks. Simulation results show that the proposed mechanisms reduce the network traffic while they maintain the good search time of flood broadcasting methods.