Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

EDR: efficient data routing in wireless sensor networks

EDR: efficient data routing in wireless sensor networks Routing in sensor networks is very challenging compared to contemporary communication and wireless ad–hoc networks. This is attributed to several characteristics that distinguish them from such networks. Transmitting data from every sensor node within the deployment region might result in significant and unnecessary redundancy in data and incur avoidable energy and traffic expenditure; thus, a routing protocol which is able to select a set of sensor nodes and utilise data aggregation during the relaying of data is of great importance. Furthermore, timely delivery of data is required in many applications of Wireless Sensor Networks (WSNs), such as real–time target tracking in battle environments, emergent event triggering in monitoring applications impose the need of efficient routing protocol. In this paper, we propose a data routing scheme which ensures increased network lifetime by exploiting energy efficiently, supporting reliability, fast delivery of delay–sensitive data and achieving low–cost sensor design. Simulation results demonstrate that, the proposed routing scheme outperforms related existing approaches in terms of all the evaluation metrics such as packet delivery ratio, energy efficiency and timely delivery of data. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Ad Hoc and Ubiquitous Computing Inderscience Publishers

Loading next page...
 
/lp/inderscience-publishers/edr-efficient-data-routing-in-wireless-sensor-networks-MDpY7NlFZ6

References (34)

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1743-8225
eISSN
1743-8233
DOI
10.1504/IJAHUC.2013.051390
Publisher site
See Article on Publisher Site

Abstract

Routing in sensor networks is very challenging compared to contemporary communication and wireless ad–hoc networks. This is attributed to several characteristics that distinguish them from such networks. Transmitting data from every sensor node within the deployment region might result in significant and unnecessary redundancy in data and incur avoidable energy and traffic expenditure; thus, a routing protocol which is able to select a set of sensor nodes and utilise data aggregation during the relaying of data is of great importance. Furthermore, timely delivery of data is required in many applications of Wireless Sensor Networks (WSNs), such as real–time target tracking in battle environments, emergent event triggering in monitoring applications impose the need of efficient routing protocol. In this paper, we propose a data routing scheme which ensures increased network lifetime by exploiting energy efficiently, supporting reliability, fast delivery of delay–sensitive data and achieving low–cost sensor design. Simulation results demonstrate that, the proposed routing scheme outperforms related existing approaches in terms of all the evaluation metrics such as packet delivery ratio, energy efficiency and timely delivery of data.

Journal

International Journal of Ad Hoc and Ubiquitous ComputingInderscience Publishers

Published: Jan 1, 2013

There are no references for this article.