Modeling of automotive sensor networks based on statistical motion models

Number of pages: 133 File Format: word File Code: 32281
Year: 2014 University Degree: Master's degree Category: Electrical Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Modeling of automotive sensor networks based on statistical motion models

    Dissertation for M.S.c degree

    Tension: System

    Abstract:

    Automotive sensor networks include mobile nodes that measure the physical and chemical parameters of the environment during movement. Sensor nodes usually have limited energy, and this lifetime limitation has caused many researches by researchers on wireless sensor networks, but the topic of lifetime in automotive sensor networks is less important than other sensor networks.

    Coverage in automotive sensor networks refers to how the space is physically observed. Therefore, dynamic coverage is coverage based on the movement model of nodes that several vehicles work together to cover the environment.

    Dynamic coverage has been studied by several researchers, most of these researchers have used the Boolean measurement model to model the dynamic coverage of the environment. Although the Shadow fading and Elfes measurement models are more realistic models for modeling the dynamic coverage of the environment by vehicle sensor networks.

    In the upcoming thesis, in addition to examining different motion models, we have chosen the Gauss Markov motion model as the main motion model for dynamic coverage modeling according to the three Boolean, Shadow fading, and Elfes measurement models. We do this according to the theoretical calculations of the positions of the nodes in each movement step and comparing it with the direct results of the Gauss Markov movement model simulation. And finally, we make a comparison between dynamic coverage with three measurement models: Boolean, Shadow fading and Elfes.

    Keyword: dynamic coverage, Gauss Markov movement model, Boolean measurement model, Shadow fading measurement model, Elfes measurement model

    Introduction:

    The wireless sensor network includes a number of static or dynamic sensor nodes that measure the environment and process the data obtained from the environment according to the defined needs of the network. This network has attracted the attention of researchers from various perspectives. One of the investigated aspects is the problem of network coverage. In this thesis, we intend to implement dynamic coverage modeling of automotive sensor networks based on statistical movement models. For this purpose, we have progressed step by step from the introduction of the network to the final goal of this project, i.e. the modeling of the dynamic coverage of automotive sensor networks based on statistical motion models. In the first chapter, we have introduced the wireless sensor network and we have introduced this network in a brief and useful way. In the second chapter, we have described the problem of coverage in wireless sensor networks and examined different types of coverage of this network. In the third chapter, we have evaluated the concepts related to energy and motion in the topic of wireless sensor network coverage. In the fourth chapter, we have examined the dynamic coverage and the advantages and challenges facing this coverage. In the fifth chapter, considering the previous four chapters and choosing the Gauss Markov movement model, we have implemented the dynamic coverage modeling of automotive sensor networks based on the Gauss Markov statistical model theoretically, as well as the simulation of theoretical calculations and the direct simulation of the Gauss Markov movement model at five different speeds using three measurement models: Boolean, Shadow fading and Elfes.

    Goal:

    The main goal This thesis is modeling the dynamic coverage of automotive sensor networks based on statistical motion models. Apart from examining different movement models, the main movement model chosen for this is Gauss Markov movement model. In order to better investigate the dynamic coverage, we use three different measurement models and compare the results of the investigations.

    In this chapter, we first introduce wireless networks, and then we introduce different types of these networks in terms of structured and unstructured, and we also examine how nodes are deployed and move in wireless networks, and we introduce the characteristics of wireless sensor networks, and then we describe the configuration of wireless sensor network nodes.

    In this chapter, we will first introduce wireless networks, and then we will introduce different types of these networks in terms of structured and unstructured, and we will also examine the deployment and movement of nodes in wireless networks, introduce the characteristics of wireless sensor networks, and then describe the configuration of wireless sensor network nodes.

    Types of wireless networks:

    Wireless networks are divided into two main types of structured and unstructured networks.     Structured wireless networks have infrastructures for setting up the network. One of the types of structured wireless networks is the GSM network [1]. Unstructured wireless networks are known as ad hoc wireless networks [2]. Contingent networks are called instant or temporary networks that are created for a specific purpose. The main difference between ad hoc networks and the usual 802.11 wireless networks is that in ad hoc networks, a set of mobile or non-mobile wireless nodes without any central infrastructure, access point or base station are connected to each other to send wireless information in a certain interval. Wireless networks can be a combination of these two mentioned items, i.e. a part of the structured network and a part of the unstructured network can be implemented.

    Information packets are sent in contingent wireless networks by route nodes that have been previously specified by one of the routing algorithms. The noteworthy point is that each node is connected only with nodes that are in its radio radius, which are called neighboring nodes.

    Routing protocols are optimally designed based on channel parameters such as attenuation, multipath propagation, interference, and also depending on the network application. During the design of these protocols, no attention was paid to guaranteeing security in ad hoc networks, but in recent years, due to the sensitive applications of this network, such as in military operations, medical emergencies, or assemblies and conferences, where the need to provide security in these networks has become more evident, researchers have put forward various proposals to ensure security in the two areas of performance and validity.

    Ad hoc wireless networks without a central core to control sending and receiving is data and the transport of information packets is carried out personally by the nodes of a specific and dedicated route. The topology of contingency networks is variable because network nodes can be mobile and change their place at any moment of time. Sensor nodes usually have limited energy and lifetime is one of the topics being studied by researchers, but the topic of energy in the vehicular sensor network is less important.

    Coverage of Vehicular Sensor Networks (VSNs) exhibits how well an area is observed in a particular physical space. Therefore, dynamic coverage is defined as coverage based on mobility models of nodes. Multiple vehicular sensors are required to collaboratively complete the scanning task. Dynamic coverage has been studied by several authors. Most authors have used the Boolean sensing model for network coverage, however, more realistic models are the Shadow fading sensing model and the Elfes sensing model.

    In this paper, we choose the Gauss Markov mobility model in order to calculate the dynamic coverage rate based on the Boolean, Shadow fading and Elfes sensing models. This is accomplished by calculating the distribution and position of nodes in each step. Finally, we compare the dynamic coverage based on those calculation results with the dynamic coverage based on the direct simulation results of Gauss Markov mobility. Moreover, we compare the dynamic coverage of Boolean, Shadow fading and Elfes.

  • Contents & References of Modeling of automotive sensor networks based on statistical motion models

    List:

    Abstract..1

    Introduction..2

    Objective..3

    Chapter One: Introduction of wireless sensor network.4

    1-1) Types of wireless networks..4

    1-2) Wireless sensor networks..6

    1-3) Types of wireless sensor networks based on deployment.6

    1-4) Wireless sensor network applications.7

    1-5) Advantages of wireless sensor networks.8

    1-6) Disadvantages of wireless sensor networks.8

    1-7) Structure of network nodes..8

    1-8) General goals of network design..9

    1-9) Important features of wireless sensor networks.10

    1-10) Conclusion The first chapter..11

    The second chapter: The problem of coverage in wireless sensor networks. 12

    1-2) What is coverage?..12

    2-2) The first division of coverage types..12

    2-3) The second division of coverage types..14

    2-4) Connected network..18

    2-4-1) Sensory radii and Telecommunication of sensor nodes. 18

    2-5) How to cover the video wireless sensor network and its difference with traditional sensor networks. 23

    6-2) Conclusion of the second chapter. Power-based strategy for the interaction between energy and coverage. 29

    3-1-2) Mesh network-based strategy for the interaction between energy and coverage. 29

    3-1-3) Strategy based on the computational geometry approach for the interaction between energy and coverage. 30

    3-2) Checking the quality of service (QoS) in the field of coverage. 33

    3-3) K-tier coverage. K-coverage). Sensors versus optimal sensor placement algorithm. 40

    3-7) types of motion models..44

    3-7-1) motion modeling with geographic restrictions. 45

    3-7-1-1) road motion model. Big.48

    3-8) Conclusion of the third chapter..49

    Chapter four: Dynamic coverage.50

    4-1) Sweep coverage..50

    4-2) MOBEYES..53

    4-2-1) MOBEYES architecture overview.55

    4-2-2) Sensor interface MOBEYES (MSI) Instructions and architecture. 58

    4-2-8) Bloom Filter and its application. 58

    4-2-9) MOBEYES performance..58

    4-2-10) MOBEYES performance evaluation. 59

    4-3) Coverage of roadside units. Transportation algorithm and simulation model. 62

    4-3-3) Triangle transportation law.. 62

    4-4) The main idea for studying the dynamic coverage of the environment. 64

    4-4-1) Work background.. 64

    4-4-2) The motivation of using car wireless sensors. Testing and application..66

    4-5) Street topology..69

    4-6) Coverage measurements..70

    4-6-1) Target detection time..70

    4-7) Dynamic coverage review..72

    4-8) Modeling..74

    4-8-1) Dynamic coverage control strategy based on Double optimization of genetic and Taboo algorithms. 74

    4-8-2) Selection of coverage of a set of nodes. 75

    4-9) Conclusion of the fourth chapter.

    5-1-1) The step before the start of movement..78

    5-1-2) The first step of movement..79

    5-1-3) The second step of movement..81

    5-1-4) The third step up to the nth step..81

    5-2) Simulation of Goss Markov movement model.82

    5-3) Comparison of theoretical calculations with the average values ??of five simulations. Gauss Markov motion model. 90

    5-4) Dynamic coverage modeling of automotive sensor networks based on Gauss Markov motion model. 91

    5-4-1) System model and measurement models. 91

    5-4-1-1) Measurement model92

    5-4-1-2) Shadow fading measurement model. 92

    5-4-1-3) Elfes measurement model. 93

    5-4-2) Network coverage. 93

    5-4-2-1) Network coverage probability in Boolean measurement model. 93

    5-4-2-2) Network coverage probability in Shadow fading measurement model. 94

    5-4-2-3) Probability of network coverage in Elfes measurement model.94

    5-4-3) Dynamic coverage with Boolean measurement model.95

    5-4-4) Dynamic coverage with Shadow fading measurement model.96

    5-4-5) Dynamic coverage with Elfes measurement model.97

    5-5) Examining the change of parameters of two Shadow fading measurement models and Elfes.98

    5-6) Conclusion of the fifth chapter.100

    Conclusion and suggestions.101

    List of references.102

     

     

    Source:

    [1] A. Mishra, S.S. Singh, S. Bhattacharya, "A novel area coverage management scheme for sensor network with mobile sensor nodes," Indian Journal of Science and Technology, Vol. 5, pp. 3122-27, August 2012.

    [2] X. Zhang, “Energy Conservation and Lifetime Prolongation Schemes for Distributed Wireless Sensor Network,” pp. 1-140, 2012.

    [3] M. Cardei, J. Wu, “Coverage in wireless sensor networks,” Handbook of Sensor Networks, pp.1-18, 2004.

    [4] C.F. Huang and Y.C. Tseng, "The coverage problem in wireless sensor networks," In International Workshop on Wireless Sensor Networks and Applications, pp. 115-121, 2003. [5] C.F. Huang, Y.C. Tseng, and H.L. Wu, "Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network," In ACM Transaction on Sensor Networks, vol. 3, no. 5, March 2007.

    [6] M. Cardei, and J. Wu, “Energy efficient coverage problem in wireless ad-hoc sensor network,” In Computer Communication, vol. 29, pp. 413-420, February 2006.

    [7] M. Ilyas, and I. Mahgoub, “Handbook of sensor networks: compact wireless and wired sensing systems,” In CRC Press Publishers, ISBN: 0-8493-1968-4, 2005.

    [8] A. Ghosh, and S.K. Das, “Coverage and connectivity issues in wireless sensor networks: A survey,” In Pervasive and Mobile Computing, vol. 4, pp. 303-334, June 2008.

    [9] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.B. Srivastava, "Coverage problems in wireless ad hoc sensor networks," In 20th Annual Joint Conference of the IEEE Computer and Communication Societies, pp. 1380-1387, 2001.

    [10] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Exposure in wireless ad-hoc sensor network,” In International Conference of Mobile Computing and Networking, pp. 139-150, 2001. [11] M. Cardei, and D.Z. Du, "Improving wireless sensor networks lifetime through power aware organization," In Wireless Networks, vol. 11, no. 3, pp. 333-340, May 2005.

    [12] A. Saipulla, C. Westphal, B. Liu, J. Wang, “Barrier coverage of line-based deployed wireless sensor networks,” INFOCOM IEEE, pp. 127-33, August 2009.

    [13] J.J. Winston, B. Paramasivan, "A Survey on Connectivity Maintenance and Preserving Coverage for Wireless Sensor Networks," International Journal of Research and Reviews in Wireless Sensor Networks (IJRRWSN), Vol. 1, No. 2, pp. 11-8, June 2011.

    [14] K.Y. Chow, K.S. Lui, E.Y. Lam, “Maximizing angle coverage in visual sensor networks,” IEEE International Conference on Communications, 2007.

    [15] N.A.A. Aziz, K.A. Aziz, W.Z.W. Ismail, "Coverage strategies for wireless sensor networks," World Academy of Science, Engineering and Technology, pp. 145-50, 2009. [16] C.H. Wu, K.C. Lee, Y.C. Chung, "A Delaunay triangulation based method for wireless sensor network deployment," Computer Communications - Elsevier, pp.2744-52, 2007.

    [17] S. Samarah, A. Boukerche, Y. Ren, "Coverage-Based Sensor Association Rules for Wireless Vehicular Ad Hoc and Sensor Networks," direction of IEEE Communications Society subject matter experts for publication in the IEEE "GLOBECOM", 2008.

    [18] R. Katsuma, Y. Murata, N. Shibata, K. Yasumoto, M.

Modeling of automotive sensor networks based on statistical motion models