Scholars Central

Research articlePublished Jun 2013

EFFICIENTLY BOOSTING IN WIRELESS SENSOR NETWORK USING ADAPTIVE SPLIT AND MERGE CLUSTERING ALGORITHM

Authors: S. Geetha Priya, A.R. Arunachalam

Journal of Global Research in Computer Sciences

Volume 4 · Issue 6 · Pages 19–24

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

This paper deals with a novel forwarding scheme for wireless sensor networks aimed at combining low computational complexity and high performance in terms of energy efficiency and reliability. This paper analyses the disadvantages of excessive clustering time because of the possible uneven cluster density. As a result, we present an ASMC algorithm. The proposed algorithm provides adaptability to mobile nodes and has no limitation to the network extensibility. An analytical model for estimating the energy efficiency of the scheme is presented, and several practical issues such as the effect of unreliable channels, topology changes, and MAC overhead are discussed.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “S. Geetha Priya”
  • BylineArticles whose byline prints “A.R. Arunachalam”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels