One of the most challenging aspects of ad hoc wireless networking is its scalability. Traditionally, using clusters has been an immediate solution. These algorithms do not promise that a network can scale well beyond 10,000 nodes. In this paper, we analyze different algorithms for various scenarios of an ad hoc wireless sensor network in terms of node distribution and propose an adaptive communication model. Using simulations, we study performance of the model in terms of density, size of network, payload and end-to-end delay. Our simulation results show that the proposed model can expand a sensor network up to 1,00,000 nodes.
N. Nithya LakshmiT. SatyaKishanK. RajaSekharamM. Hanmandlu
Adam DunkelsFredrik ÖsterlindZhitao He
Klaas ThoelenSam MichielsWouter Joosen