DonNTU   Masters' portal

Meteyko Vladimir

Faculty of computer information technologies and automation (CITA)

Department of automation and telecommunications (AT)

Speciality Infocommunication technologies and communication systems

RESEARCH OF WIRELESS SENSOR NETWORKS IN THE CONDITIONS OF INDUSTRIAL INFOCOMMUNICATIONS

Scientific adviser: Ph.D., assistant professor Chervinskiy Vladimir

Resume Abstract

Content

• Introduction
• 1. Relevance of the topic
• 2. The purpose and objectives of the study, the planned results
• 3. An approach to the unification of synthesis of Moore FSM on FPGA
• 4. Tasks of developers of similar systems
• 5. Findings
• References

Introduction

Today, the problem of safe production control is very acute in industry. Control is carried out by certain sensors, which are some of the requirements. The main requirements are, first of all, security and the ability to connect all sensors to a common network. Wireless technologies in everyday life are used very widely. Via Wi-Fi, 3G and 4G, Internet access is provided, multimedia is transmitted, DECT is used in corporate networks for telephone communication, and GSM telephony is used for broad segments of the population. Avoiding wires gives a lot of advantages: speed and ease of deployment, restructuring and scalability of networks, mobility, reduction of costs for laying communication cables, general aesthetics of rooms where there are no more tangled wires.

1. Relevance of the topic

Currently, the field of telecommunications is changing at an incredible rate. Every day there are new standards, telecommunications and communication devices, new approaches and quality of service requirements for the provision of telecommunications services. Today, the concept of the Internet of Things is the "trend" of communication networks. Vector research wireless sensor networks (WSN), which are the basis of this concept, is changing every day. A couple of years ago, the main focus of WSN research was to increase the network life cycle through routing protocols, node energy efficiency and load balancing. At present, problems with the provision of requirements for the quality of service in the WSU, the development of topologies, communication technologies and the principles of self-organization have also become acute. However, when planning a network for a long period, it is impossible to be absolutely sure that its structure will not change in the future. The main reason for the loss of functionality is the loss of network connectivity. Network connectivity characterizes the ability to deliver data from the source node to the recipient. Therefore, it is necessary to develop models of the FSU, allowing to assess the connectivity of the network (or the potential of its provision).

2. The purpose and objectives of the study, the planned results

The purpose of the study is to analyze the capabilities of the wireless network of sensors, to find and, if possible, solve problems associated with the installation or operation of the network.

The main objectives of the study:

• Search and identify key issues at all stages of network deployment and operation.
• Analysis of identified problems.
• Suggestions for fixing or smoothing problems.
• Evaluation of the proposed solutions.

  3. Network devices

  A network based on Zig – Bee technology includes 3 types of devices: Coordinator (COO) – a device that organizes a network. It participates in the process of monitoring and routing traffic, and is also a trust center (trust center) at the same time. The trust center sets the security policy and sets the parameters when the device is connected to the network. Always in active mode, due to which the device must be connected to a stationary power source.

  A router (FFD) is a node that is stationary powered and therefore can constantly participate in the network. The coordinator is also a router. On nodes of this type is responsible for routing network traffic. Routers constantly maintain special routing tables, which are used for laying the optimal route and searching for a new one if any device suddenly fails. For example, routers in a ZigBee network can be smart sockets, lighting control units, humidity or temperature sensors, or any other device that has a power connection.

  The listed devices act as parent nodes for the end devices. The maximum number of child nodes at a router or coordinator can reach 32. Parent devices are responsible for receiving and storing messages for end devices that are connected to them. The end devices, in turn, communicate with the network through parents. Each time a new end device connects to the network, or when the old one reconnects, a parent is defined for it, which makes an entry in a special table of child devices. This table stores the short and long address of the child node and its type.

  A sleeping end device (SED) is a device that connects to the network through a parent node – a router or coordinator – and does not participate in traffic routing. All communication with the network for them is limited to transferring packets to the “parent” node or reading the incoming data from it. The “parent” for such devices can be any router or coordinator. The final devices most of the time are in sleep mode and send a control or informational message usually only on a specific event, for example, pressing a button, starting the machine, simply opening the door, or just with a certain frequency in time. It allows them to save energy of the built–in power supply for a long time. An example of end devices in ZigBee networks may be wireless switches that control the operation of luminaires and operate on batteries, water leakage sensors, pressure sensors, and dustiness.

  

  Figure 1 – Schematic arrangement of devices
  

  Tasks of developers of similar systems

  • When used in distributed microprocessor control systems with the collection of information from intelligent sensors, configuration of individual network nodes should be made taking into account minimization of their energy consumption and processor resources.
  • Ability to organize self-configuring networks with a complex topology, in which the message route is automatically It is determined not only by the number of devices (nodes) that are operational or on / off for the time being, but also by the quality of communication between them, which should be automatically determined at the hardware level.
  • Ensure scalability – automatic commissioning of a node or group of nodes should be provided immediately after powering up the node.
  • It should be possible to select an alternative message transfer route during outages / failures in separate nodes to ensure high network reliability

  Findings

  Thus, the task of designing a wireless network for an industrial enterprise is complex multi-criteria task, the optimal solution of which requires the use of optimization methods, including those based on intellectual information technologies.

  References

  1. Ковалев С.А. Подход к унификации процесса синтеза МПА Мура для FPGA / С.А. Ковалев, И.Я. Зеленёва, Е.Р. Татолов // Материалы Двенадцатого международного научно-практического семинара «Практика и перспективы развития партнерства в сфере высшей школы». – Донецк-Таганрог, 2011. – Том 2. – С. 45-48.
  2. Mano M. Digital design / M. Mano. – Prentice Hall, 2003. – 516 pp.
  3. Nelson V. Digital logic circuit analysis and design / V. Nelson, H. Nagle, J. Irwin, B. Carroll. – Prentice Hall, 1995. – 842 pp.
  4. Barkalov A.A. Synthesis of operational and control automata / A.A. Barkalov, L.A. Titarenko. – Donetsk: DonNTU, TechPark DonNTU UNITECH, 2009. – 256 pp.
  5. Avedillo M.J. New approach to the state reduction in incompletely specified sequential machines / M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of IEEE International Symposium on Circuits and Systems. – New Orleans, 1990. – pp. 440-443.
  6. Avedillo M.J. SMAS: a program for the concurrent state reduction and state assignment of finite state machines / M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of IEEE International Symposium on Circuits and Systems. – 1991. – vol. 3. – pp. 1781-1784.
  7. Champarnaud J.-M. Split and minimizing: Brzozowski's algorithm / J.-M. Champarnaud, A. Khorsi, T. Paranthoen // Prague Stringology Conference. – Prague, 2002. – pp. 96-104.
  8. Goren S. CHESMIN: a heuristic for state reduction in incompletely specified finite state machines / S. Goren, F. Ferguson // Proceedings of the Conference on Design, Automation and Test in Europe. – 2002. – pp. 248-254.
  9. Higuchi H. A fast state reduction algorithm for incompletely specified finite state machines / H. Higuchi, Y. Matsunaga // 33rd Annual Conference of Design Automation. – Las Vegas, 1996. – pp. 463-466.
  10. Hu H. HSM2: a new heuristic state minimization algorithm for finite state machine / H. Hu, H.-X. Xue, J.-N. Bian // Journal of Computer Science and Technology. – 2004. – № 19 (5). – pp. 729-733.
  11. Rho J.-K. Exact and heuristic algorithms for the minimization of incompletely specified state machines / J.-K. Rho, G. Hachtel, F. Somenzi, R. Jacoby // IEEE Transactions on Computer-Aided Design. – 1994. – vol. 13. – pp. 167-177.
  12. Xu Y. Describing an n log n algorithm for minimizing states in deterministic finite automaton [Электронный ресурс]. – Режим доступа: http://www.cs.sun.ac.za....
  13. Fuhrer R.M. OPTIMIST: state minimization for optimal 2-level logic implementation / R.M. Fuhrer, S.M. Nowick // Proceedings of International Conference of Computer-Aided Design. – 1997. – pp. 308-315.
  14. Pena J.M. A new algorithm for exact reduction of incompletely specified finite state machines / J.M. Pena, A.L. Oliveira // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. – 1999. – vol. 18 (11). – pp. 1619-1632.
  15. Kam T. A fully implicit algorithm for exact state minimization / T. Kam, T. Villa, R. Brayton, A. Sangiovanni-Vincentelli // Proceedings of the Design Automation Conference. – 1994. – pp. 684-690.
  16. Almeida M. On the performance of automata minimization algorithms / M. Almeida, N. Moreira, R. Reis // Technical Report Series: DCC-2007-03. – 2007. – 12 pp.
  17. Slusarczyk A. State assignment techniques – short review [Электронный ресурс]. – Режим доступа: http://web.cecs.pdx.edu....
  18. De Micheli G. KISS: a program for optimal state assignment of finite state machines / G. De Micheli, R. Brayton, A. Sangiovanni-Vincentelli // Proceedings of IEEE International Conference of Computer-Aided Design. – Santa Clara, 1984. – pp. 209-211.
  19. De Micheli G. Optimal state assignment for finite state machines / G. De Micheli, R. Brayton, A. Sangiovanni-Vincentelli // IEEE Transactions on Computer-Aided Design. – 1985. – pp. 269-285.
  20. De Micheli G. Optimal encoding of control logic / G. De Micheli // Proceedings of the International Conference on Circuits and Computer Design. – 1984. – pp. 16-22.
  21. El-Maleh A. Finite state machine state assignment for area and power minimization / A. El-Maleh, S.M. Sait, F.N. Khan // Proceedings of IEEE International Symposium on Circuits and Systems. – 2006. – pp. 5303-5306.
  22. Devadas S. MUSTANG: state assignment of finite state machines targeting multilevel logic implementations / S. Devadas, H.-K. Ma, A.R. Newton, A. Sangiovanni-Vincentelli // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. – 1998. – vol. 7 (12). – pp. 1290-1300.
  23. Du X. MUSE: a multilevel symbolic encoding algorithm for state assignment / X. Du, G. Hachtel, B. Lin, A.R. Newton // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. – 1991. – vol. 10 (1). – pp. 28-38.
  24. Kubatova H. FEL-Code: FSM internal state encoding method / H. Kubatova, M. Becvar // Proceedings of 5th International Workshop on Boolean Problems. – Freiberg, 2002. – pp. 109-114.
  25. Lin B. Synthesis of multiple level logic from symbolic high-level description languages / B. Lin, A.R. Newton // Proceedings of the International Conference on VLSI. – Munich, 1989. – pp. 187-196.
  26. Villa T. NOVA: state assignment of finite-state machines for optimal two-level logic implementation / T. Villa, A. Sangiovanni-Vincentelli // IEEE Transactions on Computer-Aided Design. – 1990. – pp. 905-924.
  27. Gupta, B.N.V.M. A state assignment scheme targeting performance and area / B.N.V.M. Gupta, H. Narayanan, M.P. Desai // Proceedings of 12th International Conference on VLSI Design. – 1999. – pp. 378-383.
  28. Martinez M. A dynamic model for the state assignment problem / M. Martinez, M.J. Avedillo, J.M. Quintana, J.L. Huertas // Proceedings of Design, Automation and Test in Europe. – Paris, 1998. – pp. 835-839.
  29. Golson S. One-hot state machine design for FPGAs / S. Golson // Proceedings of the 3rd PLD Design Conference. – Santa Clara, 1993. – pp. 1-6.
  30. Almaini A. State assignment of finite state machines using a genetic algorithm / A. Almaini, J. Miller, P. Thomson, S. Billina // IEEE Proceedings on Computer and Digital Techniques. – 1995. – pp. 279-286.
  31. Amaral J. Designing genetic algorithms for the state assignment problem / J. Amaral, K. Turner, J. Chosh // IEEE Transactions on Systems, Man, and Cybernetics. – 1995. – vol. 25. – pp. 659-694.
  32. Chyzy M. Evolutionary algorithm for state assignment of finite state machines / M. Chyzy, W. Kosinski // Artificial Intelligence Methods. – Gliwice, 2003. – pp. 51-52.
  33. Nedjah N. Evolutionary synthesis of synchronous finite state machines / N. Nedjah, L.M. Mourelle // Evolvable Machines. – Berlin, 2004. – pp. 103-128.
  34. Chattopadhyay S. Area conscious state assignment with flip-flop and output polarity selection for finite state machine synthesis – a genetic algorithm approach / S. Chattopadhyay // The Computer Journal. – 2005. – vol. 48 (4). – pp. 443-450.
  35. Hasteer G. Parallel algorithms for state assignment of finite state machines. Master's thesis. – University of Illinois, 1996. – 58 pp.
  36. Bader D.A. A parallel state assignment algorithm for finite state machines / D.A. Bader, K. Madduri // Proceedings of IEEE Conference on High-Performance Computing. – Bangalore, 2004. – pp. 297-308.
  37. Баркалов А.А. Синтез микропрограммных автоматов на заказных и программируемых СБИС / А.А. Баркалов, Л.А. Титаренко. – Донецк: ДонНТУ, Технопарк ДонНТУ УНИТЕХ, 2009. – 336 с.
  38. Уилкинсон Б. Основы проектирования цифровых схем / Б. Уилкинсон. – М.: Издательский дом Вильямс, 2004. – 320 с.
  39. XST User Guide for Virtex-4, Virtex-5, Spartan-3, and Newer CPLD Devices [Электронный ресурс]. – Режим доступа: http://www.xilinx.com....
  40. Баркалов А.А. Синтез устройств управления на программируемых логических устройствах / А.А. Баркалов. – Донецк: ДонНТУ, 2002. – 262 с.