Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40(8), 102–114 (2002)
Aydin, I., Shen, C.-C.: Facilitating match-making service in ad hoc and sensor networks using pseudo quorum. In: Proc. ICCCN 2002, pp. 14–19 (2002)
Braginsky, D., Estrin, D.: Rumor routing algorithm for sensor networks. In: Proc. WSNA 2002, pp. 22–31 (2002)
Camp, T.: Location information services in mobile ad hoc networks. TR MCS-03-15, The Colorado School of Mines (2003)
Deb, B., Bhatnagar, S., Nath, B.: Information assurance in sensor networks. In: Proc. WSNA 2003, pp. 160–168 (2003)
Giordano, S., Stojmenovic, I., Blazevic, L.: Position based routing algorithms for ad hoc networks: a taxonomy. In: Ad Hoc Wireless Networking. Kluwer, Amsterdam (2003)
Hass, Z.J., Liang, B.: Ad hoc mobility management with uniform quorum systems. IEEE/ACM Transactions on Networking 7(2), 228–240 (1999)
Hou, T.-C., Li, V.: Transmission range control in multihop packet radio networks. IEEE Transactions on Communications 34(1), 38–44 (1986)
Intanagonwiwat, C., Govindran, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proc. MobiCom 2000, pp. 56–67 (2000)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Mobile networking for smart dust. In: Proc. MobiCom 1999, pp. 271–278 (1999)
Karp, B., Kung, H.T.: Greedy perimeter stateless forwarding for wireless networks. In: Proc. MobiCom 2000, pp. 243–254 (2000)
Krishanamachari, B., Estrin, D., Wicker, S.: Modelling data-centric routing in wireless sensor networks. USC Computer Engineering Technical Report CENG 02-14 (2002)
Niculescu, D., Nath, B.: Trajectory based forwarding and its applications. In: Proc. MobiCom 2003, pp. 260–272 (2003)
Stojmenovic, I.: A scalable quorum based location update scheme for routing in ad hoc wireless networks. SITE TR-99-09, University of Ottawa (1999)
Tchakarov, J.B., Vaidya, N.H.: Efficient content location in wireless ad hoc networks. In: Proc. MDM 2004 (2004)
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad-hoc routing. In: Proc. MobiCom 2001, pp. 70–84 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, J., Tscha, Y., Lee, KH. (2005). Power-Efficient Seamless Publishing and Subscribing in Wireless Sensor Networks. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_12
Download citation
DOI: https://doi.org/10.1007/11569596_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29414-6
Online ISBN: 978-3-540-32085-2
eBook Packages: Computer ScienceComputer Science (R0)