Multi-Hop Routing for Multi-Stationed Wireless Sensor Networks

被引：0

作者：

Manjula, S. H. ^{[1
]}

Prabhavathi, M. ^{[2
]}

Arjun, A., V ^{[2
]}

Shaila, K. ^{[2
]}

Nalini, L. ^{[2
]}

Venugopal, K. R. ^{[2
]}

Patnaik, L. M. ^{[3
]}

机构：

[1] Dr MGR Univ, Madras, Tamil Nadu, India

[2] Bangalore Univ, Univ Visvesvaraya Coll Engn, Dept Comp Sci & Engn, Bangalore 560001, Karnataka, India

[3] Def Inst Adv Technol, Deemed Univ, Pune, Maharashtra, India

来源：

2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3 | 2009年

关键词：

Network Lifetime; Base Station; Query; Optimal Placement; Data Aggregation;

D O I：

10.1109/IADCC.2009.4809118

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 deals with having optimal number of base stations. Analytical and simulation results show that MTC performs better than existing algorithms involving single base station.

引用

页码：806 / +

页数：2

共 9 条

[1] A survey on sensor networks [J].