[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

Structural health monitoring (SHM) using wireless sensor networks (WSNs) has gained research interest due to its ability to reduce the costs associated with the installation and maintenance of SHM systems. SHM systems have been used to monitor critical infrastructure such as bridges, high-rise buildings, and stadiums and has the potential to improve structure lifespan and improve public safety. The high data collection rate of WSNs for SHM pose unique network design challenges. This paper presents a comprehensive survey of SHM using WSNs outlining the algorithms used in damage detection and localization, outlining network design challenges, and future research directions. Solutions to network design problems such as scalability, time synchronization, sensor placement, and data processing are compared and discussed. This survey also provides an overview of testbeds and real-world deployments of WSNs for SH.

Structural Health Monitoring Using Wireless Sensor Networks: A Comprehensive Survey

The importance of wireless sensor networks in structural health monitoring is unceasingly growing, because of the increasing demand for both safety and security in the cities. The speedy growth of ...

/pdf/wireless-sensor-network-for-structural-health-monitoring-a-26wwba5x79.pdf

Wireless sensor network for structural health monitoring: A contemporary review of technologies, challenges, and future direction:

The distinctive features of mobile ad hoc net- works (MANETs), including dynamic topology and open wireless medium, may lead to MANETs suffering from many security vul- nerabilities. In this paper, using recent advances in uncertain rea- soning that originated from the artificial intelligence community, we propose a unified trust management scheme that enhances the security in MANETs. In the proposed trust management scheme, the trust model has two components: trust from direct observa- tion and trust from indirect observation. With direct observation from an observer node, the trust value is derived using Bayesian inference, which is a type of uncertain reasoning when the full probability model can be defined. On the other hand, with indirect observation, which is also called secondhand information that is obtained from neighbor nodes of the observer node, the trust value is derived using the Dempster-Shafer theory (DST), which is another type of uncertain reasoning when the proposition of interest can be derived by an indirect method. By combining these two components in the trust model, we can obtain more accurate trust values of the observed nodes in MANETs. We then evaluate our scheme under the scenario of MANET routing. Extensive simulation results show the effectiveness of the proposed scheme. Specifically, throughput and packet delivery ratio (PDR) can be improved significantly with slightly increased average end-to-end delay and overhead of messages.

Security Enhancements for Mobile Ad Hoc Networks With Trust Management Using Uncertain Reasoning

IEEE 802.11 wireless LAN : Capacity analysis and protocol enhancement

Mobile ad hoc networks (MANETs) were originally designed for a cooperative environment. To use them in hostile environments, trust-based routing can be used, where instead of establishing the shortest routes as done in traditional routing protocols, most trusted routes are established. In this study, the authors present a light-weight trust-based routing protocol. It is light-weight in the sense that the intrusion detection system (IDS) used for estimating the trust that one node has for another, consumes limited computational resource. Moreover, it uses only local information thereby ensuring scalability. Our light-weight IDS takes care of two kinds of attacks, namely, the blackhole attack and the grey hole attack. Whereas our proposed approach can be incorporated in any routing protocol, the authors have used AODV as the base routing protocol to evaluate our proposed approach and give a performance analysis.

Light-weight trust-based routing protocol for mobile ad hoc networks

In this paper, we present two intrusion detection techniques for mobile ad-hoc networks, which use collaborative efforts of nodes in a neighborhood to detect a malicious node in that neighborhood. The first technique is designed for detection of malicious nodes in a neighborhood of nodes in which each pair of nodes in the neighborhood are within radio range of each other. Such a neighborhood of nodes is known as a clique[12]. The second technique is designed for detection of malicious nodes in a neighborhood of nodes, in which each pair of nodes may not be in radio range of each other but where there is a node among them which has all the other nodes in its one-hop vicinity. This neighborhood is identical to a cluster as mentioned in [12]. Both techniques use message passing between the nodes. A node called the monitor node initiates the detection process. Based on the messages that it receives during the detection process, each node determines the nodes it suspects to be malicious and send votes to the monitor node. The monitor node upon inspecting the votes determines the malicious nodes from among the suspected nodes. Our intrusion detection system is independent of any routing protocol. We give the proof of correctness of the first algorithm, which shows that it correctly detects the malicious nodes always when there is no message loss. We also show with the help of simulations that both the algorithms give good performance even when there are message losses arising due to unreliable channel.

Collaborative techniques for intrusion detection in mobile ad-hoc networks

Secure dynamic IP addressing is a prime requirement for unicast communication between authorized hosts in mobile ad hoc networks (MANETs). Recently, several approaches have been proposed for dynamic addressing scheme. However, most of the approaches rely on broadcasting for address solicitation and/or duplicate address detection. As a result, several types of security threats in dynamic IP configuration can be observed. In this paper, we present an ID based dynamic IP configuration scheme that can securely allocate IP addresses to the authorized hosts for a mobile ad hoc network without broadcasting over the entire network. Each host in the MANET can generate an unique IP address from its own IP address for a new host. The proposed scheme provides authentication for address configuration without the help of a trusted third party while taking care of the security-threats associated with dynamic IP configuration. Performance analysis shows that even with added security mechanisms our proposed addressing scheme has fairly good addressing latency and control overhead compared to the similar existing schemes. Moreover, the proposed scheme is able to solve the problem of network partitions and mergers along with the arrival and departure of a host efficiently and securely.

A secure dynamic IP configuration scheme for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are self-configuring infrastructureless dynamic wireless networks in which the nodes are resource constrained. Intrusion detection systems (IDSs) are used in MANETs to monitor activities to detect any intrusion in the otherwise vulnerable network. In this paper, we present efficient schemes for analyzing and optimizing the time duration for which the IDSs need to remain active in a MANET. A probabilistic model is proposed, which makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Typically, an IDS has to run all the time on every node to oversee network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, in this work, our aim is to reduce the duration of active time of the IDSs without compromising their effectiveness. To validate our proposed approach, we model the interactions between IDSs as a multiplayer cooperative game in which the players have partially cooperative and partially conflicting goals. We theoretically analyze this game and support it with simulation results.

A Novel Approach for Efficient Usage of Intrusion Detection System in Mobile Ad Hoc Networks

A wireless mobile ad hoc network (MANET) is an autonomous system of mobile nodes connected by wireless links. MANET is infrastructureless and dynamic in nature. As the nodes have limited battery power and communicate through shared wireless channel, it is hard to design a secure and energy efficient routing protocol in a MANET. In this paper11This paper has been presented in part at IEEE 20th NCC'14, Kanpur, India, February 2014., we propose a secure and energy-efficient stochastic multipath routing protocol based on a Markov chain for mobile ad-hoc networks (MANETs). The proposed routing protocol computes multiple paths between source- destination pairs and selects an energy-efficient path stochastically from those paths to forward the data packets. In addition, this protocol also secures data flow in the network as the packets are forwarded through random paths from the source node to the destination node. The random data flow paths make it difficult to jam, intercept, and hijack data packets as this will require the attacker to listen to all possible paths from the source to the destination. The performance analysis and numerical results show that our proposed protocol achieves significant performance gains in terms of energy consumption, delay, throughput, and security of routing protocols.

Raja Datta

Papers

Light-weight trust-based routing protocol for mobile ad hoc networks

Collaborative techniques for intrusion detection in mobile ad-hoc networks

A secure dynamic IP configuration scheme for mobile ad hoc networks

A Novel Approach for Efficient Usage of Intrusion Detection System in Mobile Ad Hoc Networks

A secure and energy-efficient stochastic multipath routing for self-organized mobile ad hoc networks