On a practical approach to low-cost ad hoc wireless networking

• Autorzy: Gburzyński P. , Olesiński W.
• Języki publikacji: EN

Abstrakty

EN

Although simple wireless communication involving nodes built of microcontrollers and radio devices from the low end of the price spectrum is quite popular these days, one seldom hears about serious wireless networks built from such devices. Most of the commercially available nodes for ad hoc networking (somewhat inappropriately called "motes") are in fact quite serious computers with megabytes of RAM and rather extravagant resource demands. We show how one can build practical ad hoc networks using the smallest and cheapest devices vailable today. In our networks, such devices are capable of sustaining swarm-intelligent sophisticated routing while offering enough processing power to cater to complex applications involving distributed sensing and monitoring.

Słowa kluczowe

EN

ad hoc wireless networks; sensor networks; operating systems; reactive systems; specification; simulation

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2008
• Tom: nr 1
• Strony: 29--42
• Opis fizyczny: Bibliogr. 39 poz., rys.

Twórcy

autor

Gburzyński P.

autor

Olesiński W.

• Department of Computing Science, University of Alberta, Edmonton, Alberta, T6G 2E8 Canada,

Bibliografia

• [1] K. Altisen, F. Maraninchi, and D. Stauch, “Aspect-oriented programming for reactive systems: a proposal in the synchronous framework”, Res. Rep. no. tr-2005-18, Verimag CNRS, Nov. 2005.
• [2] F. Balarin et al., “Scheduling for embedded real-time systems”, IEEE Des. Test of Comput., vol. 15, no. 1, pp. 71–82, 1998.
• [3] M. Berard, P. Gburzyński, and P. Rudnicki, “Developing MAC protocols with global observers”, in Proc. Comput. Netw.’91, Krakow, Poland, 1991, pp. 261–270.
• [4] G. M. Birthwistle, O. J. Dahl, B. Myhrhaug, and K. Nygaard, Simula Begin. Oslo: Studentlitteratur, 1973.
• [5] D. R. Boggs, J. C. Mogul, and C. A. Kent, “Measured capacity of an Ethernet: myths and reality”, WRL Res. Rep. 88/4, Digital Equipment Corporation, Western Research Laboratory, 100 Hamilton Avenua, Palo Alto, California, 1988.
• [6] T.-W. Chen and M. Gerla, “Global state routing: a new routing scheme for ad-hoc wireless networks”, in Proc. ICC’98, Atlanta, USA, 1998.
• [7] O. J. Dahl and K. Nygaard, Simula: A Language for Programming and Description of Discrete Event Systems. Introduction and User’s Manual, 5th ed. Oslo: Norwegian Computing Center, 1967.
• [8] W. Dobosiewicz and P. Gburzyński, “Improving fairness In CSMA/CD networks”, in Proc. IEEE SICON’89, Singapore, 1989.
• [9] W. Dobosiewicz and P. Gburzyński, “Performance of piggyback Ethernet”, in Proc. IEEE IPCCC, Scottsdale, USA, 1990, pp. 516–522.
• [10] W. Dobosiewicz and P. Gburzyński, “On the apparent unfairness of a capacity-1 protocol for very fast local area networks”, in Proc. Third IEE Conf. Telecommun., Edinburgh, Scotland, 1991.
• [11] W. Dobosiewicz and P. Gburzyński, “An alternative to FDDI: DPMA and the pretzel ring”, IEEE Trans. Commun., vol. 42, pp. 1076–1083, 1994.
• [12] W. Dobosiewicz and P. Gburzyński, “On two modified Ethernets”, Comput. Netw. ISDN Syst., pp. 1545–1564, 1995.
• [13] W. Dobosiewicz and P. Gburzynski, “Protocol design in SMURPH”, in State of the Art in Performance Modeling and Simulation, J. Walrand and K. Bagchi, Eds. Gordon and Breach, 1997, pp. 255–274.
• [14] W. Dobosiewicz and P. Gburzyński, “The spiral ring”, Comput. Commun., vol. 20, no. 6, pp. 449–461, 1997.
• [15] W. Dobosiewicz, P. Gburzyński, and V. Maciejewski, “A classification of fairness measures for local and metropolitan area networks”, Comput. Commun., vol. 15, pp. 295–304, 1992.
• [16] W. Dobosiewicz, P. Gburzyński, and P. Rudnicki, “On two collision protocols for high-speed bus LANs”, Comput. Netw. ISDN Syst., vol. 25, no. 11, pp. 1205–1225, 1993.
• [17] D. Drusinsky, M. Shing, and K. Demir, “Creation and validation of embedded assertions statecharts”, in Proc. 17th IEEE Int. Worksh. Rap. Syst. Protot., Chania, Greece, 2006, pp. 17–23.
• [18] D. Dubhashi et al., “Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks”, Wirel. Netw., vol. 13, no. 1, pp. 107–125, 2007.
• [19] P. Gburzyński, Protocol Design for Local and Metropolitan Area Networks. Upper Saddle River: Prentice-Hall, 1996.
• [20] P. Gburzyński and J. Maitan, “Simulation and control of reactive systems”, in Proc. Wint. Simul. Conf. WSC’97, Atlanta, USA, 1997, pp. 413–420.
• [21] P. Gburzyński, J. Maitan, and L. Hillyer, “Virtual prototyping of reactive systems in SIDE”, in Proc. 5th Eur. Concur. Eng. Conf. ECEC’98, Erlangen-Nuremberg, Germany, 1998, pp. 75–79.
• [22] M. Gunes, U. Sorges, and I. Bouazizi, “ARA – the ant-colony based routing algorithm for manets”, in Proc. Int. Worksh. on Ad Hoc Netw. IWAHN, Vancouver, Canada, 2002.
• [23] D. Harel, “On visiual formalisms”, Commun. ACM, vol. 31, no. 5, pp. 514–530, 1988.
• [24] J. Hui, “TinyOS network programming (version 1.0)”, TinyOS 1.1.8 Documentation, 2004.
• [25] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks”, in Mobile Computing, T. Imielinski and H. Korth, Eds. Norwell: Kluwer, 1996, vol. 353.
• [26] P. Levis et al., “TinyOS: an operating system for sensor networks”, in Ambient Intelligence, W. Weber, J. M. Rabaey, and E. Aarts, Eds. Springer, 2005, pp. 115–148.
• [27] J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, “A scalable location service for geographic ad hoc routing”, in Proc. ACM/IEEE Int. Conf. Mob. Comput. Netw. MOBICOM’00, Boston, USA, 2000, pp. 120–130.
• [28] X. Ling et al., “Performance analysis of IEEE 802.11 DCF with heterogeneous traffic”, in Proc. Consum. Commun. Netw. Conf., Las Vegas, USA, 2007, pp. 49–53.
• [29] J. Liu and E. A. Lee, “Timed multitasking for real-time embedded software”, IEEE Contr. Syst. Mag., vol. 23, no. 1, pp. 65–75, 2003.
• [30] D. Mahrenholz and S. Ivanov, “Real-time network emulation with ns-2”, in Proc. Eighth IEEE Int. Symp. Distrib. Simul. Real-Time Appl., Budapest, Hungary, 2004, pp. 29–36.
• [31] V. D. Park and M. S. Cors, “A performance comparison of TORA and ideal link state routing”, in Proc. IEEE Symp. Comput. Commun.’98, Athens, Greece, 1998.
• [32] C. Perkins, E. Belding Royer, and S. Das, “Ad-hoc on-demand dis- tance vector routing (AODV)”, Febr. 2003, Internet Draft: draft-ietf-manet-aodv-13.txt.
• [33] C. E. Perkins and P. Bhagwat, “Highly dynamic destinationsequenced distance vector routing (DSDV) for mobile computers”, in Proc. SIGCOMM’94, London, UK, 1993, pp. 234–244.
• [34] C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing (AODV)”, in Proc. IEEE Worksh. Mob. Comp. Syst. Appl. WMCSA, New Orleans, USA, 1999, pp. 90–100.
• [35] A. Rahman and P. Gburzynski, “Hidden problems with the hidden node problem”, in Proc. 23rd Bienn. Symp. Commun., Kingston, Canada, 2006, pp. 270–273.
• [36] T. K. Sarkar, Z. Ji, K. Kim, A. Medouri, and M. Salazar-Palma, “A survey of various propagation models for mobile communication”, IEEE Anten. Propag. Mag., vol. 45, no. 3, pp. 51–82, 2003.
• [37] K. Schwan and H. Zhou, “Dynamic scheduling of hard real-time tasks and real-time threads”, IEEE Trans. Softw. Eng., vol. 18, no. 8, pp. 736–748, 1992.
• [38] C.-K. Toh, “A novel distributed routing protocol to support ad-hoc mobile computing”, in Proc. IEEE 15th Ann. Int. Phoenix Conf. Comp. Commun., Phoenix, USA, 1996, pp. 480–486.
• [39] B. Yartsev, G. Korneev, A. Shalyto, and V. Ktov, “Automata-based programming of the reactive multi-agent control systems”, in Int. Conf. Integr. Knowl. Intens. Multi-Agent Syst., Waltham, USA, 2005, pp. 449–453.