We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.

Abstract-The paper presents an ad-hoc architecture for wireless sensor networks and other wireless systems similar to them. In this class of wireless system the physical resource at premium is energy. Bandwidth available to the system is in excess of system requirements. The approach to solve the problem of ad-hoc network formation here is to use available bandwidth in order to save energy. The method introduced solves the problem of connecting an adhoc network. This algorithm gives procedures for the joint formation of a time schedule (similar to a TDMA schedule) and activation of links therein for random network topologies.This self-organization method is energy-sensitive, distributed, scalable, and able to form a connected network rapidly.

No abstract

No abstract

No abstract