Wireless sensors network simulator for modeling relation based communication activity

The paper presents a simulator that models routing paths and energy distribution in a WSN as a function of the algorithm executed by each node of the network. Simulator was prepared to investigate whether globally defined goals can be achieved through the decisions and actions taken locally by each node that has restricted information about the whole network. Therefore, simulator models each node independently defining three basic relations for each of them - subordination, tolerance and restriction. We have implemented several novel, non-clustered routing protocols that describe behavior of each node of the network - so that we are able to verify how decisions taken locally affect the whole network.

[1]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[2]  Jan Nikodem Designing Communication Space in Wireless Sensor Network Based on Relational Attempt , 2009, EUROCAST.

[3]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[5]  Jerzy. Jaroń,et al.  Systemic prolegomena to theoretical cybernetics , 1978 .

[6]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .