By Topic

Multi-Hop Path Routing for Multiple Base Stationed Sensor Network using MTC Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
S H Manjula ; Department of Computer Science and Engineering, University Visvesvaraya College of Engineering, Bangalore University, Bangalore 560 001, Dr. M G R University, Chennai, ; M. Prabhavathi ; A V Arjun ; K. Shaila
more authors

Wireless sensor networks (WSN) consists of tiny autonomous devices called sensors capable of sensing, processing and transmitting information. Energy consumption, routing and maximizing lifetime are the important challenges in the sensor network. In this paper, we propose multiple tree construction (MTC) algorithm to address the problem of finding path from each node to its nearest base stations to maximize the network lifetime. The algorithm proposed deals with having optimal number of base stations. Analytical and simulation results show that MTC performs better than existing algorithms involving single base station.

Published in:

Advanced Computing and Communications, 2008. ADCOM 2008. 16th International Conference on

Date of Conference:

14-17 Dec. 2008