An ant colony optimization approach for maximizing the lifetime of heterogeneous wireless sensor networks

Maximizing the lifetime of wireless sensor networks (WSNs) is a challenging problem. Although some methods exist to address the problem in homogeneous WSNs, research on this problem in heterogeneous WSNs have progressed at a slow pace. Inspired by the promising performance of ant colony optimization (ACO) to solve combinatorial problems, this paper proposes an ACO-based approach that can maximize the lifetime of heterogeneous WSNs. The methodology is based on finding the maximum number of disjoint connected covers that satisfy both sensing coverage and network connectivity. A construction graph is designed with each vertex denoting the assignment of a device in a subset. Based on pheromone and heuristic information, the ants seek an optimal path on the construction graph to maximize the number of connected covers. The pheromone serves as a metaphor for the search experiences in building connected covers. The heuristic information is used to reflect the desirability of device assignments. A local search procedure is designed to further improve the search efficiency. The proposed approach has been applied to a variety of heterogeneous WSNs. The results show that the approach is effective and efficient in finding high-quality solutions for maximizing the lifetime of heterogeneous WSNs

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

Sufficient Authentication for Energy Consumption in Wireless Sensor Networks

Given the understanding of the prospective WSN programs and because of source restrictions, key management emerges as a complicated problem for WSNs. One of the main issues when developing a key management scheme is the system scalability. Indeed, the method should assistance a huge number of nodes to allow a large range implementation of the system. In this paper we implemented a performance trade-off research of power intake vs. Quality of Solutions obtain in stability, suitability, and security for redundancy control of clustered heterogeneous wireless indicator systems using multipath routing to response customer concerns. We urbanized a novel probability style to evaluate the best redundancy stage in terms of direction redundancy (mp ) and resource redundancy (ms), as well as the best attack identification configurations with regards to the number of voters (m) and the attack incantation interval under which the life-time of a heterogeneous wireless sensor network is optimized while fulfilling the stability, timeliness and protection specifications of question processing applications in the existence of untrustworthy wireless communication and harmful nodes. Lastly, we used our analysis outcomes to the style of powerful redundancy management criteria to recognize and implement the best design parameter configurations at playback in reaction to environment changes to extend the program life-tim

Security in Wireless Sensor Networks Employing MACGSP6

Wireless Sensor Networks (WSNs) have unique characteristics which constrain them; including small energy stores, limited computation, and short range communication capability. Most traditional security algorithms use cryptographic primitives such as Public-key cryptography and are not optimized for energy usage. Employing these algorithms for the security of WSNs is often not practical. At the same time, the need for security in WSNs is unavoidable. Applications such as military, medical care, structural monitoring, and surveillance systems require information security in the network. As current security mechanisms for WSNs are not sufficient, development of new security schemes for WSNs is necessary. New security schemes may be able to take advantage of the unique properties of WSNs, such as the large numbers of nodes typical in these networks to mitigate the need for cryptographic algorithms and key distribution and management. However, taking advantage of these properties must be done in an energy efficient manner. The research examines how the redundancy in WSNs can provide some security elements. The research shows how multiple random delivery paths (MRDPs) can provide data integrity for WSNs. Second, the research employs multiple sinks to increase the total number of duplicate packets received by sinks, allowing sink voting to mitigate the packet discard rate issue of a WSN with a single sink. Third, the research examines the effectiveness of using multiple random paths in maintaining data confidentiality in WSNs. Last, the research examines the use of a rate limit to cope with packet flooding attacks in WSNs

Addressing coverage problem in wireless sensor networks based on evolutionary algorithms

© 2017 University of Western Australia. Wireless Sensor Networks (WSNs) are the key part of Internet of Things, as they provide the physical interface between on-field information and backbone analytic engines. An important role of WSNs-when collecting vital information-is to provide a consistent and reliable coverage. To Achieve this, WSNs must implement a highly reliable and efficient coverage recovery algorithm. In this paper, we take a fresh new approach to coverage recovery based on evolutionary algorithms. We propose EMACB-SA, which introduces a new evolutionary algorithm that selects coverage sets using a fitness function that balances energy efficiency and redundancy. The proposed algorithm improves network's coverage and lifetime in areas with heterogeneous event rate in comparison to previous works and hence, it is suitable for using in disaster management

Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach

A Survey on Wireless Sensor Network Security

Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed nature of these networks and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes is also very likely in real-life deployment scenarios. Due to resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security in sensor networks is, therefore, a particularly challenging task. This paper discusses the current state of the art in security mechanisms for WSNs. Various types of attacks are discussed and their countermeasures presented. A brief discussion on the future direction of research in WSN security is also included.Comment: 24 pages, 4 figures, 2 table