Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Building efficient wireless sensor networks with low-level naming
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Recursive Position Estimation in Sensor Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
IEEE Communications Magazine
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Probability and suboptimal distance based lifetime prolong algorithms for wireless sensor networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
An novel energy-efficient redundant routing tree algorithm for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Review: A survey on cross-layer solutions for wireless sensor networks
Journal of Network and Computer Applications
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Hi-index | 0.25 |
Wireless sensor networks have unique features not shared by mobile ad-hoc networks. Taking these features into consideration, we propose a new routing protocol specifically designed for wireless sensor networks. This protocol, referred to as cell based energy density aware routing (CEDA), divides a sensor field into uniform cells, thereby reducing energy consumption caused by sensor data flooding. Energy density, a novel routing metric, is used to avoid forwarding packets to subareas whose nodes have lower residual energies. By ensuring fair energy consumption of sensor nodes, CEDA makes it possible for monitoring stations to monitor all subareas for longer periods of time. Simulations were carried out to compare the performance of CEDA with those of several existing protocols for wireless networks or sensor networks. The time required for a subarea to run out of energy, called the lifetime of that area, is measured in the simulations. The simulation results show that CEDA gives a longer lifetime than the existing routing protocols. In addition, it is proved that CEDA guarantees the maximum hop count regardless of the node density, and hence does not suffer from unpredictable delays.