Abstract
Co-operative computations in a network of sensor nodes rely on an established, interference free and repetitive communication between adjacent sensors. This paper analyzes a simple randomized and distributed protocol to establish a periodic communication schedule S where each sensor broadcasts once to communicate to all of its neighbors during each period of S. The result obtained holds for any bounded degree network. The existence of such a randomized protocol for a basic interference model is not new but it fails for a generalized interference model considered in this paper. In addition, for a network with n sensor nodes, our protocol reduces the number of random bits and the number of transmissions per sensor from Θ(log2 n) to O(logn). These reductions conserve power which is a critical resource. Both protocols assume upper bound on the number of nodes n and the maximum number of neighbors \({\mathcal{B}}\). For a small multiplicative (i.e., a factor ω(1)) increase in the resources, our algorithm can operate without an upper bound on \({\mathcal{B}}\).
There is a major advantage in establishing a periodic schedule. Any traditional distributed protocol on regular (non-wireless) network can be applied in conjunction with a periodic schedule to derive an interference free protocol for a wireless network. The penalty is proportional to the length of the period of the periodic schedule.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alan, M., Joseph, P., Robert, S., David, C.: Wireless sensor networks for habitat monitoring. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pp. 88–97 (2002)
Bonnet, P., Gehrke, J., Seshadri, P.: Querying the physical world. IEEE Pers. Commun. Mag., 10–15 (2000)
Daniel, J.A., Samuel, M., Reed, L.W.: Robust, efficient filtering and event detection in sensor networks. In: VLDB, pp. 769–780 (2005)
Gandhi, R., Parthasarathy, S.: Distributed algorithms for connected domination in wireless networks. J. Parallel Distrib. Comput. 67(7), 848–862 (2007)
He, T., Krishnamurthy, S., Stankovic, J.A., Abdelzaher, T.F., Luo, L., Stoleru, R., Yan, T., Gu, L., Hui, J., Krogh, B.: Energy-efficient surveillance system using wireless sensor networks. In: ACM MobiSys, June, pp. 270–283 (2004)
Jeongyeup, P., Chintalapudi, K., Govindan, R., Caffrey, J., Masri, S.: A wireless Sensor for structural health monitoring: performance and experience. In: The Second IEEE Workshop on Embedded Networked Sensors, EmNetS-II, May, pp. 1–10 (2005)
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.S., Rubenstein, D.: Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. SIGOPS Oper. Syst. Rev. 36(5), 96–107 (2002)
Kalyanasundaram, B., Velauthapillai, M.: Communication complexity of continuous pattern detection. Unpublished manuscript, January (2009)
Kalyanasundaram, B., Velauthapillai, M.: Analysis of a simple randomized protocol to establish communication in bounded degree sensor networks. In: ICDCN, pp. 269–280 (2011)
Kalyanasundaram, B., Velauthapillai, M.: Establishing communication between adjacent sensors distributed randomly on a line. In: Kcess; Second Kuwait Conference on e-Services and e-Systems, April (2011)
Karl, H., Willig, A.: Protocols and Architectures for Wireless Sensor Networks. Wiley, New York (2005)
Kim, S., Pakzad, S., Culler, D., Demmel, J., Fenves, G., Glaser, S., Turon, M.: Wireless sensor networks for structural health monitoring. In: SenSys’06: Proceedings of the 4th International Conference on Embedded Networked Sensor Systems, New York, NY, USA, pp. 427–428 (2006)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing newly deployed ad hoc and sensor networks. In: Proceedings of 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), pp. 260–274 (2004)
Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, SODA’04, Philadelphia, PA, USA, pp. 1021–1030. Society for Industrial and Applied Mathematics, Philadelphia (2004)
Lin, S., Zhang, J., Zhou, G., Gu, L., He, T., Stankovic, J.A.: Atpc: adaptive transmission power control for wireless sensor networks. In: Proceedings of the Fourth International Conference on Embedded Networked Sensor Systems (2006)
Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. Distrib. Comput. 21, 271–284 (2008)
Ramanathan, R., Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: IEEE INFOCOM, vol. 2, pp. 404–413, March (2000)
Son, D., Heidemann, J., Krishnamurthy, S.: Experimental study of the effects of transmission power control and blacklisting in wireless sensor networks. In: IEEE SECON, pp. 289–298, October (2004)
Werner-Allen, G., Lorincz, K., Ruiz, M.C., Marcillo, O., Johnson, J.B., Lees, J.M., Welsh, M.: Deploying a wireless sensor network on an active volcano. IEEE Internet Comput. 10, 18–25 (2006). Special Issue on Data-Driven Applications in Sensor Networks
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by Craves Family Professorship, McBride Chair and a grant from NSF CCF-1151375. This material was based on first author’s work supported by the National Science Foundation, while working at the Foundation. Any opinion, finding, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation.
Rights and permissions
About this article
Cite this article
Kalyanasundaram, B., Velauthapillai, M. A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network. Theory Comput Syst 51, 474–491 (2012). https://doi.org/10.1007/s00224-012-9404-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-012-9404-5