Search results

Major public cloud providers, such as AWS, Azure or Google, offer seamless experiences for infrastructure as a service (IaaS), platform as a service (PaaS) and software as a service (SaaS). With the emergence of the public cloud's vast usage, administrators must be able to have a reliable method to provide the seamless experience that a public cloud offers on a smaller scale, such as a private cloud. When a smaller deployment or a private cloud is needed, OpenStack can meet the goals without increasing cost or sacrificing data control.

To demonstrate these enablement goals of resiliency and elasticity in IaaS and PaaS, the authors design a private distributed system cloud platform using OpenStack and its core services of Nova, Swift, Cinder, Neutron, Keystone, Horizon and Glance on a five-node deployment.

Through the demonstration of dynamically adding an IaaS node, pushing the deployment to its physical and logical limits, and eventually crashing the deployment, this paper shows how the PackStack utility facilitates the provisioning of an elastic and resilient OpenStack-based IaaS platform that can be used in production if the deployment is kept within designated boundaries.

The authors adopt the multinode-capable PackStack utility in favor of an all-in-one OpenStack build for a true demonstration of resiliency, elasticity and scalability in a small-scale IaaS. An all-in-one deployment is generally used for proof-of-concept deployments and is not easily scaled in production across multiple nodes. The authors demonstrate that combining PackStack with the multi-node design is suitable for smaller-scale production IaaS and PaaS deployments.

Energy is the major concern in wireless sensor networks (WSNs) for most of the applications. There exist many factors for higher energy consumption in WSNs. The purpose of this work is to increase the coverage area maintaining the minimum possible nodes or sensors.

This paper has proposed multilayer (ML) nodes deployment with distributed MAC (DS-MAC) in which nodes listen time is controlled based on communication of neighbors. Game theory optimization helps in addressing path loss constraints while selecting path toward base stations (BS).

The simulation is carried out using NS-2.35, and it shows better performance in ML DS-MAC compared to random topology in DS-MAC with same number of BS. The proposed method improves performance of network in terms of energy consumption, network lifetime and better throughput.

Energy consumption is the major problem in WSNs and for which there exist many reasons, and many approaches are being proposed by researchers based on application in which WSN is used. Node mobility, topology, multitier and ML deployment and path loss constraints are some of the concerns in WSNs.

Game theory is used in different situations like countries whose army race, business firms that are competing, animals generally fighting for prey, political parties competing for vote, penalty kicks for the players in football and so on.

WSNs find applications in surveillance, monitoring, inspections for wild life, sea life, underground pipes and so on.

Game theory optimization helps in addressing path loss constraints while selecting path toward BS.

As large‐scale homogeneous networks suffer from high costs of communication, computation, and storage requirements, the heterogeneous sensor networks (HSN) are preferred because they provide better performance and security solutions for scalable applications in dynamic environments. Random key pre‐distribution schemes are vulnerable to collusion attacks. The purpose of this paper is to propose an efficient collusion resistant security mechanism for heterogeneous sensor networks.

The authors consider a heterogeneous sensor network (HSN) consists of a small number of powerful high‐end H‐sensors and a large number of ordinary low‐end L‐sensors. However, homogeneous sensor network (MSN) consists of only L‐sensors. Since the collusion attack on key pre‐distribution scheme mainly takes advantage of the globally applicable keys, which are selected from the same key pool, they update the key ring after initial deployment and generate new key rings by using one‐way hash function on nodes' IDs and initial key rings. Further, in the proposed scheme, every node is authenticated by the BS in order to join the network.

The analysis of the proposed scheme shows that even if a large number of nodes are compromised, an adversary can only exploit a small number of keys near the compromised nodes, while other keys in the network remain safe.

The proposed key management scheme described in the paper outperforms the previous random key pre‐distribution schemes by: considerably reducing the storage requirement, and providing more resiliency against node capture and collusion attacks.

This paper aims to present an approach for a bio‐inspired decentralization topology control mechanism, called force‐based genetic algorithm (FGA), where a genetic algorithm (GA) is run by each holonomic autonomous vehicle (HAV) in a mobile ad hoc network (MANET) as software agent to achieve a uniform spread of HAVs and to provide a fully connected network over an unknown geographical terrain. An HAV runs its own FGA to decide its next movement direction and speed based on local neighborhood information, such as obstacles and the number of neighbors, without a centralized control unit or global knowledge.

The objective function used in FGA is inspired by the equilibrium of the molecules in physics where each molecule tries to be in the balanced position to spend minimum energy to maintain its position. In this approach, a virtual force is assumed to be applied by the neighboring HAVs to a given HAV. At equilibrium, the aggregate virtual force applied to an HAV by its neighbors should sum up to zero. If the aggregate virtual force is not zero, it is used as a fitness value for the HAV. The value of this virtual force depends on the number of neighbors within the communication range of R_com and the distance among them. Each chromosome in our GA‐based framework is composed of speed and movement direction. The FGA is independently run by each HAV as a topology control mechanism and only utilizes information from neighbors and local terrain to make movement and speed decisions to converge towards a uniform distribution of HAVs. The authors developed an analytical model, simulation software and several testbeds to study the convergence properties of the FGA.

The paper finds that coverage‐centric, bio‐inspired, mobile node deployment algorithm ensures effective sensing coverage for each mobile node after initial deployment. The FGA is also an energy‐aware self‐organization framework since it reduces energy consumption by eliminating unnecessary excessive movements. Fault‐tolerance is another important feature of the GA‐based approach since the FGA is resilient to losses and malfunctions of HAVs. Furthermore, the analytical results show that the authors' bio‐inspired approach is effective in terms of convergence speed and area coverage uniformity. As seen from the experimental results, the FGA delivers promising results for uniform autonomous mobile node distribution over an unknown geographical terrain.

The proposed decentralized and bio‐inspired approach for autonomous mobile nodes can be used as a real‐time topology control mechanism for commercial and military applications since it adapts to local environment rapidly but does not require global network knowledge.

Security in sensor networks is more important than traditional networks as they are deployed in hostile environments and are more prone to capture. Trusted third party authentication schemes, public‐key systems are not suitable owing to their high resource requirements. Key pre‐distribution was introduced in (3) to solve this problem. Our scheme achieves identical connectivity compared to the random key pre distribution (4) using a less number of preloaded keys in each sensor node. The design of our scheme is motivated by the observation that at present most key pre‐distribution schemes employ random mechanisms which use a large number of keys and are unsuitable for sensor networks. In this paper we extend the deterministic key pre‐distribution scheme proposed by us in our earlier work (1), which is based on assigning keys to sensors by placing them on a grid. This approach has been further modified to use multiple mappings of keys to nodes. In each mapping every node gets distinct set of keys which it shares with different nodes. The key assignment is done such that, there will be keys in common between nodes in different sub‐grids. After randomly being deployed, the nodes discover common keys, authenticate and communicate securely. The analysis and simulation results show that this scheme is able to achieve better security compared to the random schemes.

Privacy preservation is a significant concern in Internet of Things (IoT)-enabled event-driven wireless sensor networks (WSNs). Low energy utilization in the event-driven system is essential if events do not happen. When events occur, IoT-enabled sensor network is required to deal with enormous traffic from the concentration of demand data delivery. This paper aims to explore an effective framework for safeguarding privacy at source in event-driven WSNs.

This paper discusses three algorithms in IoT-enabled event-driven WSNs: source location privacy for event detection (SLP_ED), chessboard alteration pattern (SLP_ED_CBA) and grid-based source location privacy (GB_SLP). Performance evaluation is done using simulation results and security analysis of the proposed scheme.

The sensors observe bound events or sensitive items within the network area in the field of interest. The open wireless channel lets an opponent search traffic designs, trace back and reach the start node or the event-detecting node. SLP_ED and SLP_ED_CBA provide better safety level results than dynamic shortest path scheme and energy-efficient source location privacy protection schemes. This paper discusses security analysis for the GB_SLP. Comparative analysis shows that the proposed scheme is more efficient on safety level than existing techniques.

The authors develop the privacy protection scheme in IoT-enabled event-driven WSNs. There are two categories of occurrences: nominal events and critical events. The choice of the route from source to sink relies on the two types of events: nominal or critical; the privacy level required for an event; and the energy consumption needed for the event. In addition, phantom node selection scheme is designed for source location privacy.

The study aims at providing a reliable system of real-time monitoring for underground mine and tunnels which detects any structural change in the network and reconfigures it for resuming the data delivery process. In high stress environments, e.g. underground mines and tunnels, real-time activity monitoring is an emerging issue. Wireless sensor networks (WSNs) play a key role in ensuring the safety of people working in underground mines and tunnels. WSN not only provide real-time monitoring of underground environment but also detects any structural change in the network itself.

In this paper, results of empirical implementation of a re-configurable WSN, capable of self-healing approach, reconfigure the network connectivity upon failure or addition of nodes in the system. An open-source radio-frequency identification standard for WSN, named as DASH7, is used for practical implementation. The proposed system is capable of determining cluster breakage by sudden disruptions caused by roof falls, explosions and node failures, sensor coverage hole, node re-addition to the network and distress priority signal generation by the miner.

The proposed platform contributes to re-attain network state for establishing a communication link with fusion center in terms of: instant and accurate detection of collapse holes, acceptable error rate, time to re-attain network state, rapid distress signal propagation and low deployment cost. This platform is deployed in four different environments of anechoic chamber, hallway, outdoor and underground mine environment, to test the aforementioned scenarios using DASH7-compatible Bitsense Sensor Motes operating at 433 MHz. The effectiveness of the proposed approach has been experimentally validated for the single and multiple adjacent and disjoint node failures in all the four environments.

The number of monitoring systems was implemented for safety assurance in high stress environments before, but the novelty of our platform is long range, cost effectiveness, quick response to any structural change in the network, rapid and accurate data delivery using WSN operated on DASH7 protocol stack.

The purpose of this paper is to present one type of the architecture for wireless sensor network and to discuss in detail the hardware design of the sink node which can be responsible for transmission data or instructions between sensor nodes and data. Finally, an experiment based on wireless sensor network has proved that the design of sink node is applicable and reliable in monitoring environmental elements such as temperature, humidity, etc.

A design for the sink node is presented which constants three parts: the power module, the storage/display module and the communication module. Zigbee, GPRS and Ethernet techniques are used on ARM7 microcontroller. The sink node is capable of bridging the user's terminal with sensor nodes for information transmission.

In this paper, a new method of the power management based on wireless sensor network is proposed to conserve energy. The antenna height is proven to be an important factor to the communicating among nodes. Finally, the paper proposes regular patterns of the deployment for sensor nodes based on the communication range and the sampling range.

The experiment for providing real‐time data on environment monitoring parameters indicates that the system is efficient. The authors believe that the idea and the design presented in the paper may help the research and application of wireless sensor network.

Wireless sensor networks (WSNs) have emerged as one of the most promising technology in our day-to-day life. Limited network lifetime and higher energy consumption are two most critical issues in WSNs. The purpose of this paper is to propose an energy-efficient load balanced cluster-based routing protocol using ant colony optimization (LB-CR-ACO) which ultimately results in enhancement of the network lifetime of WSNs.

The proposed protocol performs optimal clustering based on cluster head selection weighing function which leads to novel cluster head selection. The cluster formation uses various parameters which are remaining energy of the nodes, received signal strength indicator (RSSI), node density and number of load-balanced node connections. Priority weights are also assigned among these metrics. The cluster head with the highest probability will be selected as an optimal cluster head for a particular round. LB-CR-ACO also performs a dynamic selection of optimal cluster head periodically which conserves energy, thereby using network resources in an efficient and balanced manner. ACO is used in steady state phase for multi-hop data transfer.

It has been observed through simulation that LB-CR-ACO protocol exhibits better performance for network lifetime in sparse, medium and dense WSN deployments than its peer protocols.

The proposed paper provides a unique energy-efficient LB-CR-ACO for WSNs. LB-CR-ACO performs novel cluster head selection using optimal clustering and multi-hop routing which utilizes ACO. The proposed work results in achieving higher network lifetime than its peer protocols.

The paper aims to address wireless sensor network (WSN) security by proposing new cluster-based mobile key management scheme (CMKMS). The growing demands of WSNs in variety of real-time and mission-critical applications increase the challenges in terms of energy efficiency, security and mobility. The security is important to avoid malicious attacks and improve the energy efficiency, while mobility helps to improve the reachability of network. The CMKMS algorithm focuses on the management and maintenance of keys under cluster-based mobile WSN network.

The paper studied the related work in the area of key management and compared the different key management algorithms according to the technique used. The comparative study shows that the available key management algorithms are efficient in terms of security, but they are not scaleable enough to the changing conditions of network and do not work efficiently under node mobility. The research uses cluster-based approach for improving scalability, where cluster head (CH) acts as a key manager. The work developed by considering both static and mobile CH.

The CMKMS considers two phases, first for key maintenance which establishes the two private keys, home key for own cluster and foreign key when node moves from one cluster to another. The second phase maintains the keys when CH moves from one cluster to another. The proposed algorithm improves the efficiency of key management algorithm in terms of security, mobility, energy efficiency and scalability of network. The simulation of scheme in different realistic situation shows that proposed solution shows less computational overheads, energy consumption and delay as compared with state-of-art solution.

The research is validated using computer-based simulation, which limits the testing of research by considering external environmental conditions. Therefore, research can be further test using WSN test bed.

The research address the issues in key management, developed the scaleable, and node mobility supportable key management algorithms, for addressing the demands of growing WSN applications.

This paper accomplish the security of WSN using scaleable and mobility-supported key management algorithms.