Adaptive context for generic pattern matching in ad hoc social networks

Efficient pattern matching algorithms in ad hoc networks can have significant benefits in generating real-time context and eliminate the need for a centralized arbiter. In our paper we demonstrate a generic and customizable architecture for achieving efficient pattern matching in mobile ad hoc networks. A major limitation of current ad hoc matching algorithms is that they are tailored for a specific design scenario and are unable to adapt to new scenarios. In this paper we present a novel architecture for the development of an ad hoc generic matching engine which is customizable to varying scenarios through a web service. We show how customizable semantics can play an important role in decision making, selection of a desired attribute and notifying a message in a volatile network. We also show how our system is adaptable to various scenarios, and focus on social interaction to verify our results.