Building Context Aware Network of Wireless Sensors Using a Novel Pattern Recognition Scheme Called Hierarchical Graph Neuron

The capability to support plethora of new diverse applications has placed Wireless Sensor Network (WSN) technology at threshold of an era of significant potential growth. In this regard, pattern recognition especially in real-time applications plays a paramount role in securing the network against malicious activity. In this paper, an attempt is made to introduce a novel method using a highly scalable and distributed associative memory technique, called Hierarchical Graph Neuron (HGN), while its effectiveness is analyzed from different points of view. The proposed approach not only enjoys from conserving the limited power resources of resource-constrained sensor nodes, but also can be scaled effectively to address scalability issues, which are of primary concern in wireless sensor networks. In addition, the algorithm overcomes the issue of crosstalk available in the original GN algorithm, and thus not only promises to deliver accurate results, but also can be deployed for diverse types of applications in a multidimensional domain.

[1]  Asad I. Khan,et al.  A peer-to-peer associative memory network for intelligent information systems , 2002 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  M. Isreb,et al.  A parallel distributed application of the wireless sensor network , 2004, Proceedings. Seventh International Conference on High Performance Computing and Grid in Asia Pacific Region, 2004..

[4]  Eugene M. Izhikevich,et al.  Weakly pulse-coupled oscillators, FM interactions, synchronization, and oscillatory associative memory , 1999, IEEE Trans. Neural Networks.

[5]  Asad I. Khan,et al.  A Hierarchical Graph Neuron Scheme for Real-Time Pattern Recognition , 2008, IEEE Transactions on Neural Networks.

[6]  Robert L. Goldstone,et al.  A Graph Matching Algorithm and Its Application to Conceptual System Translation , 2005, Int. J. Artif. Intell. Tools.

[7]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[8]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Terry Caelli,et al.  An eigenspace projection clustering method for inexact graph matching , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Patrik Mihailescu,et al.  Parallel pattern recognition computations within a wireless sensor network , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[12]  Horst Bunke,et al.  Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering , 2003, GbRPR.