Achieving quality of service in wireless sensor networks using cellular learning automata

Number of pages: 207 File Format: word File Code: 31066
Year: 2009 University Degree: Master's degree Category: Computer Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Achieving quality of service in wireless sensor networks using cellular learning automata

    Computer-Software Master Thesis (M.Sc)

    Abstract

    The quality of service in wireless sensor networks is very different compared to traditional networks. Some of the parameters that are used in evaluating the quality of service in these networks are: network coverage, optimal number of active nodes in the network, network lifetime and energy consumption. In this thesis, three basic problems of wireless sensor networks have been raised and with the aim of improving service quality parameters, effective solutions have been presented for these problems using the intelligent method of cellular learning automata. First, the problem of environment coverage in sensor networks is solved by deactivating the unnecessary nodes and keeping the nodes optimally active, in order to save energy and increase the life of the network. Then the problem of clustering in the sensor network is addressed and by using cellular learning automata, the sensor networks are clustered in such a way that the energy is uniformly consumed in the network and the life of the network is increased. After that, using learning automata, a method of aggregating data from the sensor environment is proposed, which saves energy in the network and increases the life of the network. All presented methods have been simulated using J-Sim software. The results of the simulations show the better performance of the proposed methods compared to similar methods. Keywords: wireless sensor networks, learning automata, quality of service, coverage, clustering, data aggregation 1- Introduction Wireless sensor networks Wireless sensor networks SIM[1] are used to collect information in areas where the user cannot be present. In a sensor network, sensors individually sample (measure) local values ??and send this information to other sensors if necessary and finally to the main observer. The function of the network is to report the phenomena that are happening to the observer who does not need to know anything about the structure of the network and the sensors individually and their relationship. These networks are independent and self-governing and work without human intervention. Usually, all the nodes are identical and practically by cooperating with each other, they fulfill the overall goal of the network. The main goal in wireless sensor networks is to monitor and control atmospheric, physical or chemical conditions and changes in an environment with a certain range [1, 2]. Wireless sensor network is a special type of ad hoc networks [2].  The topic of wireless sensor networks is one of the new topics in the field of network engineering and information technology.

    Recent advances in the design and manufacture of commercial chips have made it possible to perform signal processing and sensing in a single chip, a wireless network sensor, which includes microelectromechanical systems [3] (MEMS) such as sensors, actuators [4] and RF radio components.

    Small wireless sensors have been produced that can be assembled It has the ability to collect data from a distance of several hundred meters and send data between wireless sensors to the main center, and with this technology information on temperature - fluctuations, sound, light, humidity, and magnetism can be collected. These wireless sensors can be installed in wireless sensor networks with low cost and small size. But the miniaturization of wireless sensors also has disadvantages. Semiconductor technology has led to the creation of fast processors with high memory, but powering these circuits is still a major problem, which is limited to the use of batteries. The power supply section is an important and limited section that if batteries are used in these networks, replacing the batteries in the case of a large number of network nodes will be a difficult task, and the nodes will be forced to use short-range communications in order to save and save energy. The difference between an efficient wireless sensor and an energy-inefficient wireless sensor is in their performance in hours versus weeks. Increasing the size of the WSN network causes the complexity of routing and sending information to the main center. But routing and processing still require energy. Therefore, one of the key points in the development and presentation of new routing algorithms is to reduce and save energy consumption. Different parts of wireless sensor networks should be simulated and modeled to evaluate their effectiveness.For this, wireless sensor networks are mapped to graphs in which each node corresponds to a node in the network and each edge represents a link or communication channel between two nodes in the network. If the connection between the nodes in the network is bidirectional, the mapped graph will be undirected, and if the connection between the nodes in the network is asymmetric, then the mapped graph will be directional. Of course, the communication model between nodes in the network can be one-to-one or one-to-all. Providing a practical model for sensors is a complex and difficult task, which is due to the variety of sensors both in terms of structure and in terms of the principles and basis of their work. Sensor networks have unique features, which has caused special protocols to be considered for them.

    In wireless sensor networks, there are usually only one or two base stations and a large number of sensor nodes are distributed in the environment. Due to the limited range of these sensors and battery energy, many nodes are not able to communicate directly with the base station. But by relying on nodes like itself and other sensor nodes, it communicates with the base station, which in MANET networks [5] this action is also done by normal nodes. In wireless sensor networks, a large number of nodes with communication, processing, environment sensing and They are scattered in an environment with a certain framework. The event that happened or the questions asked by the central node[6] and the mission assigned to each node cause communication between the nodes. The exchanged information can be a report of the state of the area under the control of the sensor nodes to the central node or a request from the central node to the sensor nodes. The central node, as the communication port of the sensor network with other systems and telecommunication networks, is actually the final receiver of the report from the sensor nodes and after performing a series of processes, it sends the processed information to the user (using a communication medium such as the Internet, satellite, etc.). On the other hand, user requests are also transmitted to the network by this node.

    A sensor node can assume one of the two roles of producing data or relaying data produced by other nodes. Generally, in sensor networks, most nodes play both roles together. Establishing and designing the communication structure and architecture between network nodes requires compliance with many different factors, including fault tolerance, scalability, production cost, operation environment, sensor network topology, hardware limitations, communication tools and media, energy consumption, etc. is To learn more about wireless sensor networks, refer to the first appendix. 2-1-1 Issues in wireless sensor networks Several factors are effective in the design of sensor networks, and there are many issues in this field that cannot be reviewed in this article, so we will only briefly mention some of them. 1- Routing: The main nature of sensor networks is that the tasks they perform It must be local because each node can only communicate with its neighbors and general and global information from the network is not very available (collecting this information consumes a lot of money and time). The information obtained by the nodes must be sent to the central node using routing techniques.

    2- Hardware bottlenecks: each node should have all the necessary components and should be sufficiently small, light and compact. At the same time, each node should have very low energy consumption and low cost and be compatible with environmental conditions. These are all limitations that challenge the design and construction of sensor nodes. Providing lightweight and compact hardware designs for each of the node components, especially the wireless communication and sensors, is one of the research topics that has a lot of work to do. The technological progress of manufacturing integrated circuits with high compression and low consumption has played a significant role in reducing hardware bottlenecks.

    3- Fault tolerance and reliability[7]: Each node may be damaged or destroyed by environmental events such as accidents or explosions, or fail due to the end of the energy source. Tolerability or reliability means that the failure of nodes should not affect the overall performance of the network.

  • Contents & References of Achieving quality of service in wireless sensor networks using cellular learning automata

    List:

    Abstract 9

    1- Introduction. 10

    1-1- Wireless sensor networks. 10

    1-1-1- Issues in wireless sensor networks. 13

    1-1-2- Environment coverage in wireless sensor networks. 15

    1-1-3- Clustering in wireless sensor networks. 16

    1-1-4- Aggregation of data in sensor networks. 17

    1-2- Quality of service in wireless sensor networks. 18

    1-2-1- Service quality in traditional data networks. 20

    1-2-2- Quality of service in wireless sensor networks. 26

    1-3- Learning automata. 29

    1-3-1- Learning automata. 31

    1-3-2- Behavior criteria of learning automata. 34

    1-3-3- Learning algorithms. 35

    1-3-4- Learning automata with variable actions. 39

    1-4- Cellular learning automata. 40

    1-4-1- Cellular automata. 40

    1-4-2- Cellular learning automata (CLA). 44

    1-4-3- Irregular cellular learning automata (ICLA). 47

    1-5- Objectives of the thesis and its structure. 48

    2- Environment coverage in wireless sensor networks using cellular learning automata 50

    2-1- Introduction 50

    2-1-1- Different forms of design. 51

    2-2- Classification of coverage issues in sensor networks. 52

    2-2-1- Area coverage. 53

    2-2-2- Point coverage 56

    2-2-3- Border coverage 57

    2-3- CCP coverage method. 59

    2-3-1- Assumptions of the problem. 59

    2-3-2- Description of the method 59

    2-4- Solving the covering problem (k-covering) using learning automata. 61

    2-4-1- Assumptions and problem model. 63

    2-4-2- The method of detecting the extension of the sensor node. 64

    2-4-3- Simulation 72

    2-5- Summary 79

    3- Clustering in wireless sensor networks using cellular learning automata 80

    3-1- Introduction 80

    3-2- Done. 83

    3-2-1- LEACH clustering protocol. 85

    3-2-2- HEED clustering protocol. 88

    3-3- Clustering in wireless sensor networks using cellular learning automata. 93

    3-3-1- Proposed clustering method. 94

    3-3-2- Simulation 102

    3-4- Summarization 107

    4- Aggregation of data in sensor networks using learning automata. 108

    4-1- Introduction 108

    4-2- Done works. 109

    4-3- Gathering data in sensor networks using learning automata. 112

    4-3-1- Statement of the problem and its assumptions. 113

    4-3-2- Description of the proposed method. 115

    4-4-Simulation 119

    4-4-1- The first test 122

    4-4-2- The second test 122

    4-4-3- The third test 123

    4-5- Summary 125

    5- Conclusion. 126

    6- Appendix I: wireless sensor networks. 127

    6-1- The history of sensor networks. 127

    6-2- The structure of each sensor node. 128

    6-2-1- Internal components of a sensor node. 128

    6-2-2- Hardware limitations of a sensor node. 130

    6-3- Protocol stack 131

    6-4- Advantages of wireless sensor networks. 132

    6-5- Applications of wireless sensor networks. 134

    7- Appendix II: Cellular learning automata. 138

    7-1- The history of learning automata. 138

    7-2- Behavior criteria of learning automata. 139

    7-3- Learning automata with variable actions. 141

    7-4- A posteriori learning automata. 142

    7-5- Cellular learning automata (CLA). 150

    7-6- Open cellular learning automata (OCLA). 151

    7-7- Asynchronous cellular learning automata (ACLA). 152 8- The third appendix: Description of J-Sim software and implementation of the proposed algorithms with it 155 8-1 Introduction 155 8-2 J-Sim simulator 158 8-2-1 Simulation of wireless sensor networks using J-sim. 158

    8-2-2- Installation and implementation 162

    8-3- Implementation of the proposed clustering algorithm. 163

    8-4- Implementing the proposed coverage algorithm. 185

    8-5- Implementation of the proposed aggregation algorithm. 190

    9- Glossary. 195

    References.199

     

    Source:

    [1] Akyildiz I. F., Su W., Sankarasubramaniam Y. and Cayircl E., "A survey on sensor networks", in: Proceedings of the IEEE Communication Magazine, Vol. 40, pp. 102-114, August 2002.

    [2] Ilyas M. and Mahgoub I., "Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems", in: Proceedings of the CRC Press, London, Washington, D.C., 2005.

    [3] Kahn J.M., Katz R.H. and Pister K.S.J., "Next century challenges: mobile networking for smart dust", in: Proceedings of the ACM MobiCom 99, Washington, USA, pp. 271–278,1999.

    [4] D. Chen and K. Varshney, “QoS Support in Wireless Sensor Networks: A Survey” Department of EECS, Syracuse University Syracuse, NY, U.S.A 13244, 2004

    [5] A. Ganz, Z. Ganz, and K. Wongthavarawat, Multimedia Wireless Networks: Technologies, Standards, and QoS, Prentice Hall, Upper SaddleRiver, NJ, 2004.

    [6] E. Crawley et al., “A Framework for QoS-Based Routing in the Internet,” RFC 2386, http://www.ietf.org/rfc/rfc.2386.txt, Aug. 1998. [7] Z. Demetrios, “A Glance at Quality of Services in Mobile Ad-Hoc Networks, ” http://www.cs.ucr.edu/csyiazti/cs260.html, November 2001.

    [8] D. Zeinalipour, S. Aristeidou, S. Kazeli, “IP Quality of Services (in Greek), ” http://www.cs.ucr.edu/ csyiazti/downloads/papers/ipqos/ papers/ip-qos.pdf, 1999

    [9] K. Wui, J. Harms, “QoS Support in Mobile Ad Hoc Networks,” Crossing Boundaries – an interdisciplinary Journal, Vol 1, No 1, Fall 2001.

    [10] S. Chakrabarti and A. Mishra, “QoS Issues in Ad Hoc Wireless Networks," IEEE Communications Magazine, pp. 142-148, February 2001.

    [11] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, “Coverage Problems in Wireless Ad-hoc Sensor Networks,” in proceedings of IEEE Infocom, 2001, pp. 1380-1387

    [12] S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak, "Exposure in Wireless Ad-hoc Sensor Networks," in Mobile Computing and Networking, 2001, pp. 139-150.

    [13] R. Iyer and L. Kleinrock, “QoS Control for Sensor Networks,” in ICC 2003, May 2003.

    [14] S. Tilak, N. Abu-Ghazaleh and W. Heinzelman, “A taxonomy of wireless micro-sensor network communication models,” ACM Mobile Computing and Communication Review(MC2R), June 2002. [15] Narendra K. S., Thathachar M. A. L.; "Learning automata: An introduction"; Prentice Hall, 1989.

    [16] Narendra K.S., Thathachar M. A. L. "Learning automata a survey"; IEEE Transactions on Systems, Man and Cybernetics, vol. 4, no. 4, July 1974.

    [17] Mance, E., and Stephanie, S., H., "Reinforcement learning: A tutorial," Wright Laboratory, 1996.

    [18] Sutton, R. S., and Barto, A.G.; "Reinforcement learning: Introduction"; MIT Press, 1998. [19] Lakshmivarahan S., Thathachar M. A. L.; "Absolutely expedient learning algorithms for stochastic automata"; IEEE Transactions on Systems, Man and Cybernetics, vol. 6, pp. 281-286, 1973.

    [20] Mars, P., Chen, J. R., and Nambiar, R., Learning algorithms theory and applications in signal processing, control and communications, CRC Press, 1996.

    [21] Lakshmivarahan S.; "Learning algorithms: theory and applications"; New York: Springer-Verlag, 1981. [22] Lakshmivarahan S., Thathachar M. A. L.; "Optimal non-linear reinforcement schemes for stochastic automata"; Information Science, vol. 4, pp. 121-128, 1982. [23] Lakshmivarahan S., Thathachar M. A. L.; "Absolute expediency of Q and S-model learning algorithm"; IEEE Transactions on Systems, Man and Cybernetics, vol. 6, pp. 222-226, 1976.

    [24] Viswanathan R., Narendra K. S.; "Expedient and optimal variable structure stochastic automata"; Technical report CT-31, Dunham Lab., Yale University, New Haven, Connecticut, U.S.A., April 1970.

    [25] Mason L.G.

Achieving quality of service in wireless sensor networks using cellular learning automata