Improved NOVSF-TM based Addressing and Energy Efficient Routing in ETR Protocol
Keywords:
NOVSF-TM, ETR, TR, Hop-count, Energy
Abstract
A small WSN is a collection of micro-sensors. Sensors send or receive data to a sink node, which collect and processes it. The Tree-Routing (TR) protocol was initially designed for such network. TR uses strict parent-child links for data forwarding. Hence, it saves bandwidth and energy by preventing network from flooding path search messages. For a large network TR shows large hop-count and more energy consumption. The Enhanced-Tree-Routing (ETR) protocol implemented over TR has structured node address assignment scheme. It considers other one-hop neighbor links, along with parent-child links, for packet forwarding if, it is found to be the shortest path to sink. Such decision in ETR involves minimum computation energy. Instead ETR, the emerging demand for data intensive and energy2013;efficient applications, needs new or improved routing protocols. In this paper we have proposed Non-Blocking-Orthogonal-Vector Spreading- Factor-Time-Multiplexing (NOVSF-TM) technique for sensor node addressing and Mobile Sinks placement so as to improve ETR protocol. The addressing scheme of NOVSF TM is shorter than ETR. Mobile Sinks positioning, at feasible sites, helps reducing excessive hop-count. This eliminate excessive multi-hoping and save energy. Simulation result shows that NOVSFTM technique is more energy-efficient than ETR protocol.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2012-03-15
Issue
Section
License
Copyright (c) 2012 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.