6 research outputs found

    A Mobility Aware Duty Cycling and Preambling Solution for Wireless Sensor Network with Mobile Sink Node

    Get PDF
    Utilising the mobilisation of a sink node in a wireless sensor network to combat the energy hole, or hotspot issue, is well referenced. However, another issue , that of energy spikes may remain. With the mobile sink node potentially communicating with some nodes more than others. In this study we propose the Mobility Aware Duty Cycling and Dynamic Preambling Algorithm (MADCaDPAL). This algorithm utilises an existing solution where a communication threshold is built between a mobile sink node using predictable mobility and static nodes on its path. MADCaDPAL bases decisions relating to node sleep function, moving to clear channel assessment and the subsequent sending of preambles on the relation between the threshold built by the static node and the position of the mobile sink node. MADCaDPAL achieves a reduction in average energy consumption of up to 80%, this when used in conjunction with a lightweight carrier-sense multiple access based MAC implementation. Maximum energy consumption amongst individual nodes is also brought closer to the average, reducing energy spikes and subsequently improving network lifetime. Additionally, frame delivery to the sink is improved overall

    Mobility Aware Duty Cycling Algorithm (MADCAL) A Dynamic Communication Threshold for Mobile Sink in Wireless Sensor Network

    Get PDF
    The hotspot issue in wireless sensor networks, with nodes nearest the sink node losing energy fastest and degrading network lifetime, is a well referenced problem. Mobile sink nodes have been proposed as a solution to this. This does not completely remove the hotspot problem though, with nodes the sink passes most closely still expending more energy than others. This study proposes a lightweight algorithm, located in the MAC layer of static nodes and utilising knowledge of predictable sink node mobility. This in order to create a dynamic communication threshold between static nodes and the sink, within which static nodes awaken. Lessening competition for sink communication between nodes. In utilising predictable mobility and factors already known to the static node, such as location and interference range, there is no need for energy consuming messaging. Analysis and simulation results, tested on a lightweight implementation of a carrier-sense multiple access based MAC protocol, shows a significant improvement in energy consumption in both controlled and random environments. With frame delivery improved to the point where sink speed is negated. This when compared to the existing duty cycling approach

    Efficient algorithms for MAC layer duty cycling and frame delivery in wireless sensor network

    Get PDF
    In Wireless Sensor Networks, with small, limited capacity devices now more prevalent, the issue of Neighbour Discovery has shifted. These devices utilise duty cycling methods in order to conserve battery power. Hence, the main issue is now that these devices may be awake at the same time in order to discover each other. When mobility increases complexity further. Rather than attempt to negate the issue of mobility, instead this thesis seeks to utilise a predictable sink mobility pattern in order to influence the duty cycling of static nodes. Literature demonstrates a move towards Mobility Awareness in Neighbour Discovery in mobile Wireless Sensor Networks. However, there is a gap identified with sink mobility in use. Therefore, this thesis aims to establish to what extent the mobility pattern of a Mobile Sink Node in a Wireless Sensor Network may be exploited at the MAC layer, to influence the performance of static nodes. Such that network efficiency may be improved with energy consumption reduced and balanced across nodes. This study proposes three novel lightweight algorithms, with processing which does not add to the energy consumption within sensor nodes, these being Mobility Aware Duty Cycling Algorithm (MADCAL), Mobility Aware Duty Cycling and Dynamic Preambling Algorithm (MADCaDPAL) and Dynamic Mobility and Energy Aware Algorithm (DMEAAL). These located in the MAC layer of static nodes and utilising knowledge of predictable sink node mobility. This is in order to create a dynamic communication threshold between static nodes on the sink path and the sink itself. Subsequently lessening competition for sink communication between nodes. In MADCAL this threshold is used to influence the sleep function in order that static nodes only awake and move to Clear Channel Assessment once the sink is within their threshold, improving energy consumption by up to 15%. The MADCaDPAL algorithm takes this approach further, using the threshold to directly influence Clear Channel Assessment and the sending of preambles, as such, closing off the threshold when the sink leaves it. This shows energy consumption lessening by close to 80% with a significant improvement in frame delivery to the sink. Finally, the DMEAAL algorithm utilises previous results to influence energy consumption in real-time by utilising a cross-layer approach, comparing current consumption to optimal target energy consumption and adjusting the threshold for each static node accordingly. This shows benefit in evening out results across nodes, thus improving network lifetime. All algorithms are achieved without the energy-consuming beacon messaging associated with Neighbour Discovery. Analysis and simulation results, tested on a lightweight implementation of a carrier-sense multiple-access-based MAC protocol, show a significant improvement in energy consumption and frame delivery in both controlled and random environments. In utilising a cross-layer approach to access energy consumption in static nodes, is it also shown to be possible to even out energy consumption across nodes by altering the communication threshold in real-time. As such, improving network lifetime by removing spikes in energy consumption in individual nodes

    Towards an Energy Balancing Solution for Wireless Sensor Network with Mobile Sink Node

    Get PDF
    The issue of energy holes, or hotspots, in wireless sensor networks is well referenced. As is the proposed mobilisation of the sink node in order to combat this. However, as the mobile sink node may communicate with some nodes more than others, issues remain, such as energy spikes. In this study we propose a lightweight MAC layer solution-Dynamic Mobility and Energy Aware Algorithm (DMEAAL). Building on existing solutions utilising a communication threshold between static nodes and a sink node using a predictable mobility pattern, DMEAAL takes knowledge of optimum energy consumption levels and implements a cross-layer approach, utilising current energy consumption and dynamically adjusting communication threshold size based on target energy consumption. This approach is shown to balance energy consumption across individual nodes without increasing overall energy consumption compared to previous solutions. This without detrimentally affecting frame delivery to the sink. As such, network lifetime is improved. In addition we propose Mobile Edge Computing (MEC) applications for this solution, removing certain functionality from static nodes and instead deploying this within the mobile sink at the network edge

    On reliable and secure RPL (routing protocol low-power and lossy networks) based monitoring and surveillance in oil and gas fields

    Get PDF
    Different efforts have been made to specify protocols and algorithms for the successful operation of the Internet of things Networks including, for instance, the Low Power and Lossy Networks (LLNs) and Linear Sensor Networks (LSNs). Into such efforts, IETF, the Internet Engineering Task Force, created a working group named, ROLL, to investigate the requirement of such networks and devising more efficient solutions. The effort of this group has resulted in the specification of the IPv6 Routing Protocol for LLNs (RPL), which was standardized in 2012. However, since the introduction of RPL, several studies have reported that it suffers from various limitations and weaknesses including scalability, slow convergence, unfairness of load distribution, inefficiency of bidirectional communication and security, among many others. For instance, a serious problem is RPL’s under-specification of DAO messages which may result in conflict and inefficient implementations leading to a poor performance and scalability issues. Furthermore, RPL has been found to suffer from several security issues including, for instance, the DAO flooding attack, in which the attacker floods the network with control messages aiming to exhaust network resources. Another fundamental issue is related to the scarcity of the studies that investigate RPL suitability for Linear Sensor Networks (LSN) and devising solution in the lieu of that.Motivated by these observations, the publications within this thesis aim to tackle some of the key gaps of the RPL by introducing more efficient and secure routing solutions in consideration of the specific requirements of LLNs in general and LSNs as a special case. To this end, the first publication proposes an enhanced version of RPL called Enhanced-RPL aimed at mitigating the memory overflow and the under-specification of the of DAOs messages. Enhanced-RPL has shown significant reduction in control messages overhead by up to 64% while maintaining comparable reliability to RPL. The second publication introduces a new technique to address the DAO attack of RPL which has been shown to be effective in mitigating the attack reducing the DAO overhead and latency by up to 205% and 181% respectively as well as increasing the PDR by up to 6% latency. The third and fourth publications focus on analysing the optimal placement of nodes and sink movement pattern (fixed or mobile) that RPL should adopt in LSNs. It was concluded based on the results obtained that RPL should opt for fixed sinks with 10 m distance between deployed nodes
    corecore