Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
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
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless integrated network sensors
Communications of the ACM
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
On the impact of alternate path routing for load balancing in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Distributed Energy-conserving Routing Protocols
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
MobiCom poster: top five myths about the energy consumption of wireless communication
ACM SIGMOBILE Mobile Computing and Communications Review
Performance Study of a Multipath Routing Method for Wireless Mobile Ad Hoc Networks
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
IEEE Transactions on Mobile Computing
Flexible power scheduling for sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
GPER: Geographic Power Efficient Routing in Sensor Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Wireless Communications & Mobile Computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Transmission power control in wireless ad hoc networks: challenges, solutions and open issues
IEEE Network: The Magazine of Global Internetworking
Demand-scalable geographic multicasting in wireless sensor networks
Computer Communications
Alternating multiple tributaries + deltas
Proceedings of the 5th workshop on Data management for sensor networks
Power-aware recovery for geographic routing
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A cost matrix agent for shortest path routing in ad hoc networks
Journal of Network and Computer Applications
Energy-efficient query management scheme for a wireless sensor database system
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
An Adaptive Energy-aware Multi-path Routing Protocol with Load Balance for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Energy model of SARA and its performance analysis
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Hi-index | 0.00 |
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30% to network lifetime.