ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Conference Paper
Publisher : 2007 2nd International Conference on Pervasive Computing and Applications
Source : 2007 2nd International Conference on Pervasive Computing and Applications (2007)
Keywords : Ad hoc networks, ad hoc wireless networking, ad hoc wireless sensor network, adaptive communication model, Algorithm design and analysis, Clustering algorithms, Communication model, computational modeling, Earth, large wireless sensor networks, Network servers, node distribution, Payloads, Pervasive computing, Scalability, Sensor networks, Wireless sensor networks
Campus : Coimbatore
School : School of Engineering
Department : Computer Science
Year : 2007
Abstract : 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.
Cite this Research Publication : Dr. Rajathilagam B. and Prakash, K. S. S., “An Adaptive Communication Model for Large Wireless Sensor Networks”, in 2007 2nd International Conference on Pervasive Computing and Applications, 2007.