×

High level communication functionalities for wireless sensor networks. (English) Zbl 1242.68007

Summary: We show how to establish a reliable and efficient high level communication system in a randomly deployed network of sensors equipped with directional antennas. This high level communication system enables the programming of the sensor network using high level communication functionalities without the burden of taking care of their physical capacities (low range, unidirectional links, single frequency, presence of collisions, etc.). The high level communication functionalities we offer include point-to-point communication, point-to-area communication, and one-to-all communication. The basic idea to implement this system is to simulate a virtual network that emerges from the ad-hoc network using self-organization, self-discovery and collaborative methods. We also analyse the efficiency, scalability and robustness of the proposed protocols.

MSC:

68M10 Network design and communication in computer systems
68T05 Learning and adaptive systems in artificial intelligence

References:

[1] Akyildiz, I. F.; Su, W.; Sankarasubramanian, Y.; Cayirci, E., Wireless sensor networks: A survey, Computer Networks, 38, 393-422 (2002)
[2] Aspnes, J.; Goldengerg, D.; Yang, Y. R., On the computational complexity of sensor network localization, (Proceedings of the First International Workshop on Algorithmic Aspects of Wireless Sensor Networks. Proceedings of the First International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Lecture Notes in Computer Science, vol. 3121 (2004), Springer), 32-44 · Zbl 1104.68305
[3] Lichung Bao, J.J. Garcia-Luna, Transmission scheduling in ad hoc networks with directional antennas, in: ACM Int. Conference on Mobile Computing and Networking, Atlanta, 2002, pp. 48-58; Lichung Bao, J.J. Garcia-Luna, Transmission scheduling in ad hoc networks with directional antennas, in: ACM Int. Conference on Mobile Computing and Networking, Atlanta, 2002, pp. 48-58
[4] A. Bharathidasas, V. Anand, Sensor networks: An overview, Technical Report, Dept. of Computer Science, University of California at Davis, 2002; A. Bharathidasas, V. Anand, Sensor networks: An overview, Technical Report, Dept. of Computer Science, University of California at Davis, 2002
[5] I. Chatzigiannakis, S. Nikoletseas, P. Spirakis, Smart dust local detection and propagation protocols, in: Proceedings of the Second ACM International Workshop on Principles of Mobile Computing, 2002, pp. 9-16; I. Chatzigiannakis, S. Nikoletseas, P. Spirakis, Smart dust local detection and propagation protocols, in: Proceedings of the Second ACM International Workshop on Principles of Mobile Computing, 2002, pp. 9-16
[6] Díaz, J.; Petit, J.; Serna, M., A random graph model for optical smart dust networks, IEEE Transactions on Mobile Computing, 2, 3, 186-196 (2003)
[7] Enachescu, M.; Goel, A.; Govindan, R.; Motwani, R., Scale free aggregation in sensor networks, (Proceedings of the First International Workshop on Algorithmic Aspects of Wireless Sensor Networks. Proceedings of the First International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Lecture Notes in Computer Science, vol. 3121 (2004), Springer), 71-84 · Zbl 1104.68315
[8] D. Estrin, R. Govindan, J. Heidemann, S. Kumar, Next century challenges: Scalable coordination in sensor networks, in: ACM/IEEE Int. Conf. on Mobile Computing and Networking, Seattle, 1999, pp. 263-270; D. Estrin, R. Govindan, J. Heidemann, S. Kumar, Next century challenges: Scalable coordination in sensor networks, in: ACM/IEEE Int. Conf. on Mobile Computing and Networking, Seattle, 1999, pp. 263-270
[9] Kahn, J. M.; Katz, R. H.; Pister, K. S.J., Emerging challenges: Mobile networking for smart dust, Journal of Communications and Networks, 2, 3, 188-196 (2000)
[10] Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1993), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA
[11] A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, J. Anderson, Wireless sensor networks for habitat monitoring, in: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2002, 2002, pp. 88-89; A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, J. Anderson, Wireless sensor networks for habitat monitoring, in: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2002, 2002, pp. 88-89
[12] McDiarmid, C., Random channel assignment in the plane, Random Structures and Algorithms, 22, 187-212 (2003) · Zbl 1137.94304
[13] Ramanathan, R., On the performance of ad hoc networks with beamforming antennas, (Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2001, October 4-5, 2001, Long Beach, CA, USA (2001), ACM), 95-105
[14] Razavilar, J.; Rashisd-Farrokhi, F.; Liu, K. J.R., Software radio architecture with smarts antennas: A tutorial on algorithms and complexity, IEEE Journal on Selected Areas in Communications, 6, April, 662-676 (1999)
[15] Saunders, S. R., Antennas and Propagation for Wireless Communication (1999), Wiley
[16] Tilak, S.; Abu-Ghazaleh, N. B.; Heinzelman, W., A taxonomy of sensor network communication models, Mobile Computing and Communication Review, 6, 28-36 (2002)
[17] Winters, J. H., Smart antennas for wireless systems, IEEE Personal Communications, 5, 23-27 (1998)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.