Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th 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
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Information assurance in sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
IEEE Communications Magazine
Hi-index | 0.00 |
Query slipping may happen when a query propagating along a subscribe trajectory moves through a publish trajectory without obtaining desired information, even though two trajectories intersect geometrically. It can result in considerable time delay and in the worst, looping in the trajectory or query flooding the network causing inefficient power consumption and bandwidth utilization because it follows by resubmission of the query or initiation of another subscribe trajectory. In this paper, we consider the trajectory construction for power-efficient seamless publishing/subscribing in a multihop wireless sensor network. We address the problem by dividing each radio cell into smaller virtual grids. For the seamless trajectory development, we propose a grid-based next-hop selection algorithm. Our algorithm not only attempts to make the trajectory straight but also considers the nodal density of recipient nodes and the seamless grid-by-grid multicast. Simulation results turns out that our algorithm dissipates significantly less power, compared to the non grid-based method, as greedy forwarding.