Self-organizing sensor networks

In this paper we propose a scheme for self-organizing sensor networks; the scheme allows a sensor network to adapt to topological changes, include new batches of sensors, and disregard the sensors that have depleted their power reserves, or have been compromised. The algorithm for self-organization allows the sensor network to carry out its mission, has built-in provisions for information assurance, and extends the lifetime of the network by reducing the power consumption; it minimizes the number of collisions experienced by a sensor when it transmits and maximizes the time a sensor is either idle or dedicated to monitoring and/or internal data processing.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Ladislau Bölöni,et al.  Ad hoc grids: communication and computing in a power constrained environment , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[4]  Dan C. Marinescu,et al.  A reputation algorithm for a self-organizing system based upon resource virtualization , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[5]  Damla Turgut,et al.  Improving routing performance through m , 2008, J. Parallel Distributed Comput..

[6]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[7]  Yacine Challal,et al.  Information Security in Wireless Sensor Networks , 2009 .