scispace - formally typeset
Search or ask a question

Showing papers by "International Institute of Information Technology, Hyderabad published in 2004"


Proceedings ArticleDOI
21 Nov 2004
TL;DR: Simulations show that using dual-membership clusters greatly decreases the message overhead for route discovery and helps in increasing the network lifetime.
Abstract: Efficient use of energy resources and prolonged lifetime of a network are very important issues to be considered for effective routing in sensor networks. In this paper a new algorithm is proposed which promises to deliver solutions to both the problems mentioned above, by using dual-membership clusters. Conventional clustering protocols propose single-membership clustering, where each non-cluster head owes membership to a single cluster head. The new algorithm proposes dual-membership clustering, which is very useful to minimize the use of epidemic algorithms of any sort, thereby saving a lot of resources and also making route discovery more deterministic. Simulations show that using dual-membership clusters greatly decreases the message overhead for route discovery and helps in increasing the network lifetime.

7 citations


Proceedings ArticleDOI
11 Dec 2004
TL;DR: This paper examines the scalability issues pertinent to CADV protocol and provides some valuable data, which can cater to the operational concerns about CADV, but also to the needs of efficient, reliable and economical deployment, functioning and maintenance of the systems using it.
Abstract: Mobile networking has established itself as the operational backbone of day-to-day human activities. Wireless devices are now more prevalent than ever before, and the existing systems are being inevitably subjected to scaling. But the existing routing protocols suffer scalability problems to varying extents. This paper examines the scalability issues pertinent to CADV protocol. The performance of the protocol is measured against select parameters. The behaviour of CADV is analyzed in a thickly populated network through detailed simulations. Based on the observations, conclusions are drawn on the scalability of CADV. The results provide us some valuable data, which can cater, not only to the operational concerns about CADV, but also to the needs of efficient, reliable and economical deployment, functioning and maintenance of the systems using it.

1 citations