Kamanashis Biswas

Learn More
—In this paper we present a self-organizing, singlehop clustering scheme, which is based on partitioning sensor networks into several disjoint cliques. Clustering sensor nodes into small groups is an effective method to achieve scalability, fault tolerance, load balancing, routing etc. Here, we develop and analyze maximal clique based cluster-first(More)
– At present, the mostly used and developed mechanism is hardware virtualization which provides a common platform to run multiple operating systems and applications in independent partitions. More precisely, it is all about resource virtualization as the term 'hardware virtualization' is emphasized. In this paper, the aim is to find out the advantages and(More)
—In this paper we propose an energy efficient clique based routing scheme for wireless sensor networks. One of the major issues in wireless sensor networks is developing an energy efficient routing protocol. Since the sensor nodes are small-sized battery operated devices, energy conservation is considered a critical issue to maximize network lifetime. Our(More)
— A web log or blog in short is a trendy way to share personal entries with others through website. A typical blog may consist of texts, images, audios and videos etc. Most of the blogs work as personal online diaries, while others may focus on specific interest such as photographs (photoblog), art (artblog), travel (tourblog), IT (techblog) etc. Another(More)
– Generally, a graph G, an independent set is a subset S of vertices in G such that no two vertices in S are adjacent (connected by an edge) and a vertex cover is a subset S of vertices such that each edge of G has at least one of its endpoints in S. Again, the minimum vertex cover problem is to find a vertex cover with the smallest number of vertices.(More)
  • 1