A flat routing protocol for sensor networks

Downloads

Downloads per month over past year

Anita Kanavalli, . and Dennis Sserubiri, . and Deepa Shenoy, P. and Venugopal, K.R. and Patnaik, L.M. (2009) A flat routing protocol for sensor networks. In: Methods and Models in Computer Science, 2009. ICM2CS 2009. Proceeding of International Conference on, 14-15 Dec. 2009, Bangalore.

[img]
Preview
Text
anitha1.pdf - Published Version

Download (1MB) | Preview
Official URL: https://doi.org/10.1109/ICM2CS.2009.5397948

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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: wireless sensor networks, source initiated,energy consumption, node life time, flat routing
Subjects: Faculty of Engineering > Computer Science & Information Science Engineering
Divisions: University Visvesvarayya College of Engineering > Department of Computer Science and Information Science Engineering
Depositing User: Ms. Deepa M Kolli
Date Deposited: 22 Oct 2016 06:54
Last Modified: 22 Oct 2016 06:54
URI: http://eprints-bangaloreuniversity.in/id/eprint/6792

Actions (login required)

View Item View Item