Review on Swarm Intelligence Optimization Techniques for Obstacle-Avoidance Localization in Wireless Sensor Networks

Wireless sensor network (WSN) is an evolving research topic with potential applications. In WSN, the nodes are spatially distributed and determining the path of transmission high challenging. Localization eases the path determining process between source and destination. The article, describes the localization techniques based on wireless sensor networks. Sensor network has been made viable by the convergence of Micro Electro- Mechanical Systems technology. The mobile anchor is used for optimizing the path planning location-aware mobile node. Two optimization algorithms have been used for reviewing the performacne. They are Grey Wolf Optimizer(GWO) and Whale Optimization Algorithm(WOA). The results show that WOA outperforms in maximizing the localization accuracy

Review on Swarm Intelligence Optimization Techniques for Obstacle-Avoidance Localization in Wireless Sensor Networks

Wireless sensor network (WSN) is an evolving research topic with potential applications. In WSN, the nodes are spatially distributed and determining the path of transmission high challenging. Localization eases the path determining process between source and destination. The article, describes the localization techniques based on wireless sensor networks. Sensor network has been made viable by the convergence of Micro Electro- Mechanical Systems technology. The mobile anchor is used for optimizing the path planning location-aware mobile node. Two optimization algorithms have been used for reviewing the performacne. They are Grey Wolf Optimizer(GWO) and Whale Optimization Algorithm(WOA). The results show that WOA outperforms in maximizing the localization accuracy

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

Z-path trajectory mechanism for mobile beacon-assisted localization in wireless sensor networks

A wireless sensor network consists of many sensors that communicate wirelessly to monitor a physical region. In many applications such as warning systems or healthcare services, it is necessary to enhance the captured data with location information. Determining the coordinates of the randomly deployed sensors is known as the problem of localization. A promising solution for statically deployed sensors is to benefit from a mobile beacon-assisted localization. The main challenge is planning an optimum path for the mobile beacon to ensure the full coverage, increase the accuracy of the estimated position and decrease the required time for localization of resource-constrained sensors. So, this research aims at developing a superior trajectory mechanism for mobile beacon-assisted localization to help unknown sensors to efficiently localize themselves. To achieve this purpose; first, a novel trajectory named Z-path is proposed to guarantee fully localized deployed sensors with higher precision since the path reduces collinear beacon positions and promises shorter localization time; second, Z-path transmission power adjustment scheme named Zpower is developed to dynamically and optimally adjust the transmission power for a reliable transmission while conserving the energy consumption for localization by mobile beacon and unknown sensors; third, Z-path obstacle-handling trajectory mechanism is designed to improve the effectiveness of the proposed path toward obstacles which obstruct the path. Finally, the proposed Z-path obstacle handling mechanism is integrated with the developed power adjustment scheme to improve the energy efficiency of the designed obstacle tolerance mechanism. The performance of the proposed trajectory is evaluated by comparing the efficiency with five benchmark trajectories in terms of localization success, accuracy, energy efficiency, time and ineffective position rate, which is a newly introduced metric by this research to measure the collinearity of the trajectories. Simulation results show that Z-path has successfully localized all 250 deployed sensors with higher precision by at least 5.88% improvement than Localization with a Mobile Anchor based on Trilateration (LMAT) trajectory and 58% improvement than random way point. It also serves as a benchmark path with 93 ineffective positions per node localization as compared with LMAT as a second efficient path by 100 collinear positions and faster trajectory for localization. Furthermore, results revealed that Z-power accomplishes better performance in terms of energy consumption as an average 34% for unknown sensors and 25% for mobile beacon than Z-path. In case of obstacle tolerance mechanism, it ensures higher localization performance in terms of accuracy, time and success around 37.5%, 13% and 11% respectively, as compared to Z-path at the presence of obstacles. The handling mechanism integrated with the power control scheme has reduced energy consumption and improved ineffective position rate compared with Z-path handling trajectory by 35.7% and 54.4%, respectively

Enabling Cyber Physical Systems with Wireless Sensor Networking Technologies

[[abstract]]Over the last few years, we have witnessed a growing interest in Cyber Physical Systems (CPSs) that rely on a strong synergy between computational and physical components. CPSs are expected to have a tremendous impact on many critical sectors (such as energy, manufacturing, healthcare, transportation, aerospace, etc) of the economy. CPSs have the ability to transform the way human-to-human, human-toobject, and object-to-object interactions take place in the physical and virtual worlds. The increasing pervasiveness of Wireless Sensor Networking (WSN) technologies in many applications make them an important component of emerging CPS designs. We present some of the most important design requirements of CPS architectures. We discuss key sensor network characteristics that can be leveraged in CPS designs. In addition, we also review a few well-known CPS application domains that depend on WSNs in their design architectures and implementations. Finally, we present some of the challenges that still need to be addressed to enable seamless integration of WSN with CPS designs.[[incitationindex]]SCI[[booktype]]紙

Efficient Range-Free Monte-Carlo-Localization for Mobile Wireless Sensor Networks

Das Hauptproblem von Lokalisierungsalgorithmen für WSNs basierend auf Ankerknoten ist die Abhängigkeit von diesen. Mobilität im Netzwerk kann zu Topologien führen, in denen einzelne Knoten oder ganze Teile des Netzwerks temporär von allen Ankerknoten isoliert werden. In diesen Fällen ist keine weitere Lokalisierung möglich. Dies wirkt sich primär auf den Lokalisierungsfehler aus, der in diesen Fällen stark ansteigt. Des weiteren haben Betreiber von Sensornetzwerken Interesse daran, die Anzahl der kosten- und wartungsintensiveren Ankerknoten auf ein Minimum zu reduzieren. Dies verstärkt zusätzlich das Problem von nicht verfügbaren Ankerknoten während des Netzwerkbetriebs. In dieser Arbeit werden zunächst die Vor- und Nachteile der beiden großen Hauptkategorien von Lokalisierungsalgorithmen (range-based und range-free Verfahren) diskutiert und eine Studie eines oft für range-based Lokalisierung genutzten Distanzbestimmungsverfahren mit Hilfe des RSSI vorgestellt. Danach werden zwei neue Varianten für ein bekanntes range-free Lokalisierungsverfahren mit Namen MCL eingeführt. Beide haben zum Ziel das Problem der temporär nicht verfügbaren Ankerknoten zu lösen, bedienen sich dabei aber unterschiedlicher Mittel. SA-MCL nutzt ein dead reckoning Verfahren, um die Positionsschätzung vom letzten bekannten Standort weiter zu führen. Dies geschieht mit Hilfe von zusätzlichen Sensorinformationen, die von einem elektronischen Kompass und einem Beschleunigungsmesser zur Verfügung gestellt werden. PO-MCL hingegen nutzt das Mobilitätsverhalten von einigen Anwendungen in Sensornetzwerken aus, bei denen sich alle Knoten primär auf einer festen Anzahl von Pfaden bewegen, um den Lokalisierungsprozess zu verbessern. Beide Methoden werden durch detaillierte Netzwerksimulationen evaluiert. Im Fall von SA-MCL wird außerdem eine Implementierung auf echter Hardware vorgestellt und eine Feldstudie in einem mobilen Sensornetzwerk durchgeführt. Aus den Ergebnissen ist zu sehen, dass der Lokalisierungsfehler in Situationen mit niedriger Ankerknotendichte im Fall von SA-MCL um bis zu 60% reduziert werden kann, beziehungsweise um bis zu 50% im Fall von PO-MCL.

A centralized localization algorithm for prolonging the lifetime of wireless sensor networks using particle swarm optimization in the existence of obstacles

The evolution in micro-electro-mechanical systems technology (MEMS) has triggered the need for the development of wireless sensor network (WSN). These wireless sensor nodes has been used in many applications at many areas. One of the main issues in WSN is the energy availability, which is always a constraint. In a previous research, a relocating algorithm for mobile sensor network had been introduced and the goal was to save energy and prolong the lifetime of the sensor networks using Particle Swarm Optimization (PSO) where both of sensing radius and travelled distance had been optimized in order to save energy in long-term and shortterm. Yet, the previous research did not take into account obstacles’ existence in the field and this will cause the sensor nodes to consume more power if obstacles are exists in the sensing field. In this project, the same centralized relocating algorithm from the previous research has been used where 15 mobile sensors deployed randomly in a field of 100 meter by 100 meter where these sensors has been deployed one time in a field that obstacles does not exist (case 1) and another time in a field that obstacles existence has been taken into account (case 2), in which these obstacles has been pre-defined positions, where these two cases applied into two different algorithms, which are the original algorithm of a previous research and the modified algorithm of this thesis. Particle Swarm Optimization has been used in the proposed algorithm to minimize the fitness function. Voronoi diagram has also used in order to ensure that the mobile sensors cover the whole sensing field. In this project, the objectives will be mainly focus on the travelling distance, which is the mobility module, of the mobile sensors in the network because the distance that the sensor node travels, will consume too much power from this node and this will lead to shortening the lifetime of the sensor network. So, the travelling distance, power consumption and lifetime of the network will be calculated in both cases for original algorithm and modified algorithm, which is a modified deployment algorithm, and compared between them. Moreover, the maximum sensing range is calculated, which is 30 meter, by using the binary sensing model even though the sensing module does not consume too much power compared to the mobility module. Finally, the comparison of the results in the original method will show that this algorithm is not suitable for an environment where obstacle exist because sensors will consume too much power compared to the sensors that deployed in environment that free of obstacles. While the results of the modified algorithm of this research will be more suitable for both environments, that is environment where obstacles are not exist and environment where obstacles are exist, because sensors in this algorithm .will consume almost the same amount of power at both of these environments

SIMULATION AND ANALYSIS OF VEHICULAR AD-HOC NETWORKS IN URBAN AND RURAL AREAS

According to the American National Highway Traffic Safety Administration, in 2010, there were an estimated 5,419,000 police-reported traffic crashes, in which 32,885 people were killed and 2,239,000 people were injured in the US alone. Vehicular Ad-Hoc Network (VANET) is an emerging technology which promises to decrease car accidents by providing several safety related services such as blind spot, forward collision and sudden braking ahead warnings. Unfortunately, research of VANET is hindered by the extremely high cost and complexity of field testing. Hence it becomes important to simulate VANET protocols and applications thoroughly before attempting to implement them. This thesis studies the feasibility of common mobility and wireless channel models in VANET simulation and provides a general overview of the currently available VANET simulators and their features. Six different simulation scenarios are performed to evaluate the performance of AODV, DSDV, DSR and OLSR Ad-Hoc routing protocols with UDP and TCP packets. Simulation results indicate that reactive protocols are more robust and suitable for the highly dynamic VANET networks. Furthermore, TCP is found to be more suitable for VANET safety applications due to the high delay and packet drop of UDP packets.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format