Routing of single-source and multiple-source queries in static sensor networks

In this paper, we introduce new geometric ad-hoc routing algorithms to route queries in static sensor networks. For single-source-queries routing, we utilise a centralised mechanism to accomplish a query using an asymptotically optimal number of transmissions O(c), where c is the length of the shortest path between the source and the destination. For multiple-source-queries routing, the number of transmissions for each query is bounded by O(clogn), where n is the number of nodes in the network. For both single-source and multiple-source queries, the routing stage is preceded by preprocessing stages requiring O(nD) and O(n^2D) transmissions, respectively, where D is the diameter of the network. Our algorithm improves the complexity of the currently best known algorithms in terms of the number of transmissions for each query. The preprocessing is worthwhile if it is followed by frequent queries. We could also imagine that there is an extra initial power (say, batteries) available during the preprocessing stage or alternatively the positions of the sensors are known in advance and the preprocessing can be done before the sensors are deployed in the field. It is also worth mentioning that a lower bound of @W(c^2) transmissions has been proved if preprocessing is not allowed [F. Kuhn, R. Wattenhofer, A. Zollinger, Asymptotically optimal geometric mobile ad-hoc routing, in: Proceedings of the Sixth International Workshop on Discrete Algorithm and Methods for Mobility, Atlanta, GA, September 2002, pp. 24-33].

[1]  Andrzej Pelc,et al.  Deterministic M2M Multicast in Radio Networks: (Extended Abstract) , 2004, ICALP.

[2]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[3]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[4]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[5]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[6]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[7]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[8]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[9]  Yishay Mansour,et al.  Centralized broadcast in multihop radio networks , 2003, J. Algorithms.

[10]  B. Hofmann-Wellenhof,et al.  Global Positioning System , 1992 .

[11]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[12]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[13]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[14]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[15]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[17]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[18]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[19]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[20]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[21]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[22]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[23]  Jorge Urrutia,et al.  Route Discovery with Constant Memory in Oriented Planar Geometric Networks , 2004, ALGOSENSORS.

[24]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[25]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[26]  Donggang Liu,et al.  Location-based pairwise key establishments for static sensor networks , 2003, SASN '03.