386 research outputs found

    A firefly-inspired scheme for energy-efficient transmission scheduling using a self-organizing method in a wireless sensor network

    Get PDF
    Various types of natural phenomena are regarded as primary sources of information for artificial occurrences that involve spontaneous synchronization. Among the artificial occurrences that mimic natural phenomena are Wireless Sensor Networks (WSNs) and the Pulse Coupled Oscillator (PCO), which utilizes firefly synchronization for attracting mating partners. However, the PCO model was not appropriate for wireless sensor networks because sensor nodes are typically not capable to collect sensor data packets during transmission (because of packet collision and deafness). To avert these limitations, this study proposed a self-organizing time synchronization algorithm that was adapted from the traditional PCO model of fireflies flashing synchronization. Energy consumption and transmission delay will be reduced by using this method. Using the proposed model, a simulation exercise was performed and a significant improvement in energy efficiency was observed, as reflected by an improved transmission scheduling and a coordinated duty cycling and data gathering ratio. Therefore, the energy-efficient data gathering is enhanced in the proposed model than in the original PCO-based wave-traveling model. The battery lifetime of the Sensor Nodes (SNs) was also extended by using the proposed model

    Self-Synchronization in Duty-cycled Internet of Things (IoT) Applications

    Full text link
    In recent years, the networks of low-power devices have gained popularity. Typically these devices are wireless and interact to form large networks such as the Machine to Machine (M2M) networks, Internet of Things (IoT), Wearable Computing, and Wireless Sensor Networks. The collaboration among these devices is a key to achieving the full potential of these networks. A major problem in this field is to guarantee robust communication between elements while keeping the whole network energy efficient. In this paper, we introduce an extended and improved emergent broadcast slot (EBS) scheme, which facilitates collaboration for robust communication and is energy efficient. In the EBS, nodes communication unit remains in sleeping mode and are awake just to communicate. The EBS scheme is fully decentralized, that is, nodes coordinate their wake-up window in partially overlapped manner within each duty-cycle to avoid message collisions. We show the theoretical convergence behavior of the scheme, which is confirmed through real test-bed experimentation.Comment: 12 Pages, 11 Figures, Journa

    Impacts of Denial-of-Service Attack on Energy Efficiency Pulse Coupled Oscillator

    Get PDF
    The Pulse Coupled Oscillator (PCO) has attracted substantial attention and widely used in wireless sensor networks (WSNs), where it utilizes firefly synchronization to attract mating partners, similar to artificial occurrences that mimic natural phenomena. However, the PCO model might not be applicable for simultaneous transmission and data reception because of energy constraints. Thus, an energy-efficient pulse coupled oscillator (EEPCO) has been proposed, which employs the self-organizing method by combining biologically and non-biologically inspired network systems and has proven to reduce the transmission delay and energy consumption of sensor nodes. However, the EEPCO method has only been experimented in attack-free networks without considering the security elements which may cause malfunctioning and cyber-attacks. This study extended the experiments by testing the method in the presence of denial-of-service (DoS) attacks to investigate the efficiency of EEPCO in attack-based networks. The result shows EEPCO has poor performance in the presence of DoS attacks in terms of data gathering and energy efficiency, which then concludes that the EEPCO is vulnerable in attack-based networks

    Fast Desynchronization For Decentralized Multichannel Medium Access Control

    Get PDF
    Distributed desynchronization algorithms are key to wireless sensor networks as they allow for medium access control in a decentralized manner. In this paper, we view desynchronization primitives as iterative methods that solve optimization problems. In particular, by formalizing a well established desynchronization algorithm as a gradient descent method, we establish novel upper bounds on the number of iterations required to reach convergence. Moreover, by using Nesterov's accelerated gradient method, we propose a novel desynchronization primitive that provides for faster convergence to the steady state. Importantly, we propose a novel algorithm that leads to decentralized time-synchronous multichannel TDMA coordination by formulating this task as an optimization problem. Our simulations and experiments on a densely-connected IEEE 802.15.4-based wireless sensor network demonstrate that our scheme provides for faster convergence to the steady state, robustness to hidden nodes, higher network throughput and comparable power dissipation with respect to the recently standardized IEEE 802.15.4e-2012 time-synchronized channel hopping (TSCH) scheme.Comment: to appear in IEEE Transactions on Communication

    Metaheuristics Techniques for Cluster Head Selection in WSN: A Survey

    Get PDF
    In recent years, Wireless sensor communication is growing expeditiously on the capability to gather information, communicate and transmit data effectively. Clustering is the main objective of improving the network lifespan in Wireless sensor network. It includes selecting the cluster head for each cluster in addition to grouping the nodes into clusters. The cluster head gathers data from the normal nodes in the cluster, and the gathered information is then transmitted to the base station. However, there are many reasons in effect opposing unsteady cluster head selection and dead nodes. The technique for selecting a cluster head takes into factors to consider including residual energy, neighbors’ nodes, and the distance between the base station to the regular nodes. In this study, we thoroughly investigated by number of methods of selecting a cluster head and constructing a cluster. Additionally, a quick performance assessment of the techniques' performance is given together with the methods' criteria, advantages, and future directions

    FFRP: Dynamic firefly mating optimization inspired energy efficient routing protocol for internet of underwater wireless sensor networks

    Get PDF
    Energy-efficient and reliable data gathering using highly stable links in underwater wireless sensor networks (UWSNs) is challenging because of time and location-dependent communication characteristics of the acoustic channel. In this paper, we propose a novel dynamic firefly mating optimization inspired routing scheme called FFRP for the internet of UWSNs-based events monitoring applications. The proposed FFRP scheme during the events data gathering employs a self-learning based dynamic firefly mating optimization intelligence to find the highly stable and reliable routing paths to route packets around connectivity voids and shadow zones in UWSNs. The proposed scheme during conveying information minimizes the high energy consumption and latency issues by balancing the data traffic load evenly in a large-scale network. In additions, the data transmission over highly stable links between acoustic nodes increases the overall packets delivery ratio and network throughput in UWSNs. Several simulation experiments are carried out to verify the effectiveness of the proposed scheme against the existing schemes through NS2 and AquaSim 2.0 in UWSNs. The experimental outcomes show the better performance of the developed protocol in terms of high packets delivery ratio (PDR) and network throughput (NT) with low latency and energy consumption (EC) compared to existing routing protocols in UWSNs

    Bio-Inspired Tools for a Distributed Wireless Sensor Network Operating System

    Get PDF
    The problem which I address in this thesis is to find a way to organise and manage a network of wireless sensor nodes using a minimal amount of communication. To find a solution I explore the use of Bio-inspired protocols to enable WSN management while maintaining a low communication overhead. Wireless Sensor Networks (WSNs) are loosely coupled distributed systems comprised of low-resource, battery powered sensor nodes. The largest problem with WSN management is that communication is the largest consumer of a sensor node’s energy. WSN management systems need to use as little communication as possible to prolong their operational lifetimes. This is the Wireless Sensor Network Management Problem. This problem is compounded because current WSN management systems glue together unrelated protocols to provide system services causing inter-protocol interference. Bio-inspired protocols provide a good solution because they enable the nodes to self-organise, use local area communication, and can combine their communication in an intelligent way with minimal increase in communication. I present a combined protocol and MAC scheduler to enable multiple service protocols to function in a WSN at the same time without causing inter-protocol interference. The scheduler is throughput optimal as long as the communication requirements of all of the protocols remain within the communication capacity of the network. I show that the scheduler improves a dissemination protocol’s performance by 35%. A bio-inspired synchronisation service is presented which enables wireless sensor nodes to self organise and provide a time service. Evaluation of the protocol shows an 80% saving in communication over similar bio-inspired synchronisation approaches. I then add an information dissemination protocol, without significantly increasing communication. This is achieved through the ability of our bio-inspired algorithms to combine their communication in an intelligent way so that they are able to offer multiple services without requiring a great deal of inter-node communication.Open Acces

    Modelling and Synchronisation of Delayed Packet-Coupled Oscillators in Industrial Wireless Sensor Networks

    Get PDF
    In this paper, a Packet-Coupled Oscillators (PkCOs) synchronisation protocol is proposed for time-sensitive Wireless Sensor Networks (WSNs) based on Pulse-Coupled Oscillators (PCO) in mathematical biology. The effects of delays on synchronisation performance are studied through mathematical modelling and analysis of packet exchange and processing delays. The delay compensation strategy (i.e., feedforward control) is utilised to cancel delays effectively. A simple scheduling function is provided with PkCOs to allocate the packet transmission event to a specified time slot, by configuring reference input of the system to a non-zero value, in order to minimise the possibility of packet collision in synchronised wireless networks. The rigorous theoretical proofs are provided to validate the convergence and stability of the proposed synchronisation scheme. Finally, the simulations and experiments examine the effectiveness of PkCOs with delay compensation and scheduling strategies. The experimental results also show that the proposed PkCOs algorithm can achieve synchronisation with the precision of 26.3μs26.3\mu s (11 tick)

    Multichannel Distributed Coordination for Wireless Sensor Networks: Convergence Delay and Energy Consumption Aspects

    Get PDF
    This thesis develops new approaches for distributed coordination of data-intensive communications between wireless sensor nodes. In particular, the topic of synchronization, and its dual primitive, desynchronization at the Medium Access Control (MAC) or the Application (APP) layer of the OSI stack, is studied in detail. In Chapters 1 and 2, the related literature on the problem of synchronization is overviewed and the main approaches for distributed (de)synchronization at the MAC or APP layers are analyzed, designed and implemented on IEEE802.15.4- enabled wireless sensor nodes. Beyond the experimental validation of distributed (de)synchronization approaches, the three main contributions of this thesis, corresponding to the related publications found below, are: • establishing for the first time the expected time for convergence to distributed time division multiple access (TDMA) operation under the two main desynchronization models proposed in the literature and validating the derived estimates via a real-world implementation (Chapter 3); • proposing the extension of the main desynchronization models towards multi-hop and multi-channel operation; the latter is achieved by extending the concept of reactive listening to multi-frequency operation (Chapter 4 and 5). • analyzing the energy consumption of the distributed TDMA approach under different transmission probability density functions (Chapter 6 and 7). Conclusions and items for future work in relation to the proposals of this thesis are described in Chapter 8
    corecore