A flat routing protocol for sensor networks

Author

Kanavalli, Anita ; Sserubiri, Dennis ; Shenoy, P. Deepa ; Venugopal, K.R. ; Patnaik, L.M.

Author_Institution

Coll. of Eng., Dept. of Comput. Sci. & Eng., Univ. Visvesvaraya, Bangalore, India

fYear

2009

fDate

14-15 Dec. 2009

Firstpage

1

Lastpage

5

Abstract

The way in which Wireless Sensor Networks (WSN) are designed requires that energy be taken as the most crucial element if WSNs are to be used in the most effective way to serve the purpose for which they have been deployed in the target region. Routing protocols are the main aids that can assist in reducing the energy consumption required by the transmission of data throughout the sensor networks. In this paper we have proposed a flat routing protocol for sensor networks. This approach is one of the simplest protocols in terms of the route determination process and the number of messages through the network. Routes from the source to the destination are determined by use of only the hop count and remaining energy of the neighbor nodes for each node. The proposed protocol is simulated and is compared with the flood routing protocol.

Keywords

routing protocols; wireless sensor networks; data transmission; energy consumption; flat routing protocol; flood routing protocol; hop count; route determination process; wireless sensor networks; Base stations; Batteries; Computer science; Energy consumption; Peer to peer computing; Power engineering and energy; Routing protocols; Sensor phenomena and characterization; Wireless application protocol; Wireless sensor networks; energy consumption; flat routing; node life time; source initiated; wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Methods and Models in Computer Science, 2009. ICM2CS 2009. Proceeding of International Conference on

Conference_Location

Delhi

Print_ISBN

978-1-4244-5051-0

Type

conf

DOI

10.1109/ICM2CS.2009.5397948

Filename

5397948