GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
GPER: Geographic Power Efficient Routing in Sensor Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Efficient geographic routing in multihop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Design considerations for solar energy harvesting wireless embedded systems
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Power management in energy harvesting sensor networks
ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Energetic sustainability of routing algorithms for energy-harvesting wireless sensor networks
Computer Communications
EEGR: Energy-Efficient Geographic Routing inWireless Sensor Networks
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Routing and relay node placement in wireless sensor networks powered by ambient energy harvesting
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Evaluation and design exploration of solar harvested-energy prediction algorithm
Proceedings of the Conference on Design, Automation and Test in Europe
Opportunistic routing in wireless sensor networks powered by ambient energy harvesting
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient geographic routing in environmentally powered wireless sensor networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Energy-efficient and high-accuracy secure data aggregation in wireless sensor networks
Computer Communications
Energy Efficiency Routing with Node Compromised Resistance in Wireless Sensor Networks
Mobile Networks and Applications
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Reliable and Energy-Efficient Multipath Communications in Underwater Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Tree-Based Multipath Power Control for Underwater Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Preface of special issue: advanced topics on wireless sensor networks
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
We propose a routing scheme called energy-efficient beaconless geographic routing with energy supply (EBGRES) for wireless sensor networks. EBGRES provides loop-free, fully stateless, energy-efficient source-to-sink routing with minimal communication overhead without the help of prior neighborhood knowledge. It locally determines the duty-cycle of each node, based on an estimated energy budget for each period, which includes the currently available energy, the predicted energy consumption and the energy expected from the harvesting device. In EBGRES, each node sends out the data packet first rather than a control message. By sending a data packet first, EBGRES performs the neighbor selection only among those neighbors that successfully received the data packet. EBGRES uses a three-way (DATA/ACK/SELECT) handshake and a timer-assignment function, the Discrete Dynamic Forwarding Delay (DDFD). We investigate the lower and upper bounds on hop count and the upper bound on energy consumption under EBGRES for source-to-sink routing. We further demonstrate the expected total energy consumption along a route toward the sink with the proposed EBGRES approach including a lower bound on energy consumption when the node density increases. Copyright © 2012 John Wiley & Sons, Ltd.