Data networks
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Random Asynchronous Wakeup Protocol for Sensor Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
On the hop count statistics for randomly deployed wireless sensor networks
International Journal of Sensor Networks
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Optimal joint probing and transmission strategy for maximizing throughput in wireless systems
IEEE Journal on Selected Areas in Communications
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Delay-SRLG constrained, backup-shared path protection in WDM networks with sleep scheduling
Computer Communications
| Hi-index | 0.03 |
We consider a wireless sensor network whose main function is to detect certain infrequent alarm events, and to forward alarm packets to a base station, using geographical forwarding. The nodes know their locations, and they sleepwake cycle, waking up periodically but not synchronously. In this situation, when a node has a packet to forward to the sink, there is a trade-off between how long this node waits for a suitable neighbor to wake up and the progress the packet makes towards the sink once it is forwarded to this neighbor. Hence, in choosing a relay node, we consider the problem of minimizing average delay subject to a constraint on the average progress. By constraint relaxation, we formulate this next hop relay selection problem as a Markov decision process (MDP). The exact optimal solution (BF (Best Forward)) can be found, but is computationally intensive. Next, we consider a mathematically simplified model for which the optimal policy (SF (Simplified Forward)) turns out to be a simple one-step-look-ahead rule. Simulations show that SF is very close in performance to BF, even for reasonably small node density. We then study the end-to-end performance of SF in comparison with two extremal policies: Max Forward (MF) and First Forward (FF), and an end-to-end delay minimising policy proposed by Kim et al. [1]. We find that, with appropriate choice of one hop average progress constraint, SF can be tuned to provide a favorable trade-off between end-to-end packet delay and the number of hops in the forwarding path.