← Back to VOLUME 2, ISSUE 10, OCTOBER 2013
This work is licensed under a Creative Commons Attribution 4.0 International License.
Adaptive Buffer size routing for Wireless Sensor Networks
KALYANI UPPUTHOOLA, NARASIMHA RAO SIRIVELLA Associate Professor, School of Elect. Engineering and Information Technology, PAU, Ludhiana Associate Professor, School of Elect. Engineering and Information Technology, PAU, Ludhiana
Downloads: Download PDF
π 41 viewsπ₯ 0 downloads
Abstract: Peer to Peer System enables the sharing of globally distributed resources by pooling them effectively. To achieve this goal, numerous resource discovery approaches have been proposed. The current approaches consume a large amount of bandwidth which in turn increases communication link cost. This paper presents an architecture for resource discovery to find the nearest neighbouring resource node. DHT based hashing algorithm which is mapped to structured p2p is exploited to find the resource node which is having close proximity. The performance analyses of the proposed system on various vector parameters are studied using the simulation software. The simulation studies show a significant reduction in the communication cost as the number of nodes increases.
Keywords: Peer to Peer, DHT, Kademlia, Oversim.
Keywords: Peer to Peer, DHT, Kademlia, Oversim.
How to Cite:
[1] KALYANI UPPUTHOOLA, NARASIMHA RAO SIRIVELLA Associate Professor, School of Elect. Engineering and Information Technology, PAU, Ludhiana Associate Professor, School of Elect. Engineering and Information Technology, PAU, Ludhiana, βAdaptive Buffer size routing for Wireless Sensor Networks,β International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)
