Home / WSN Networking

WSN Networking Algorithms

  • A Biologically-Inspired Clustering Protocol for Wireless Sensor Networks
    T-Ant Simulator Screenshot Lately, wireless sensor networks are garnering a lot of interests, as it is feasible to deploy them in many ad hoc scenarios such as for earthquake monitoring, tsunami monitoring and battlefield surveillance. As sensor nodes may be deployed in hostile areas, these battery-powered nodes are mostly expected to operate for a relatively long period. Clustering is an approach actively pursued by many groups in realizing more scalable data gathering and routing. However, it is rather challenging to form an appropriate number of clusters with well-balanced memberships. This project proposes an application of swarm intelligence to guide the formation of these clusters. In order to counter the usual problems of such meta-heuristics, we propose a novel atypical application that allows our protocol to converge fast with very limited overhead.
    Software
    T-ANT Simulator (Linux version) - Readme
    T-ANT Simulator (Windows)

  • T-Fit: A Localised Edge Detection Algorithm with Error Resilience for Wireless Sensor Networks
    Many wireless sensor network-based monitoring applications are becoming feasible as fundamental data collection and network protocols are becoming efficient in handling simple sense-and-send function. As the computation and storage capacity of sensor nodes expands, these nodes are capable of performing more complicated functions. T-Fit Example Moreover, the need to realize the complete loop of sense-control-actuate similar to the wired sensing facility demands for more in-network processing to enable any meaningful in-network actuation. One such useful primitive function for many applications is edge or boundary detection of a phenomenon. This project proposes a localized edge detection algorithm using basic geometry rules and only relies on one-hop neighbourhood information. This algorithm is accordingly benchmarked against one of the best localized edge detection scheme available in the public domain. It is found that the proposed algorithm readily outperformed its counterpart in dealing with both convex as well as non-convex regions while being efficient in time and overhead. The algorithm is also demonstrated to be more robust against unrelated sensor errors.

  • Event Processing Middleware for Wireless Sensor Networks
    Middleware Overview As data collection protocols mature, wireless sensor networks are finding way into many monitoring domains. With the growth in the computation capacity of sensor nodes, they are increasingly equipped to handle more complex functions. Moreover, the need to realize the complete loop of sense-control-actuate as the wired sensing facility, demands for more in-network processing. To this end, some primitives related to event data processing can be made available for event-driven applications. In this project, a middleware is designed and developed to provide efficient basic and higher-level event processing services through collaborative processing. As concrete service task instances, we propose an integrated algorithm that performs both event center localization and area estimation.

  • Data Gathering with Quality of Service for Clustered Wireless Sensor Networks
    There are numerous quality of service schemes in use as well as in the literature for both wired and wireless networks. However, due to the unique wireless sensor application needs, most of them are not directly applicable. DTAnt Example Recently, there are several sensor network specific proposals that aim to support delay-constrained transmissions for real-time communications both at the link and network levels. In most considered application scenarios, all sensor readings are treated equally. In many applications however, the semantic significance of sensor readings also differs even if their modality is the same. In this project, we propose and develop a new quality of service scheme aimed for wireless sensor networks. It uses an overlay structure to deliver high priority readings within certain application delay bound. Contrary to typical approaches, it will adopt on the fly reservation to facilitate data transmission with minimal delay.

    We develop a new quality of service scheme aimed for wireless sensor networks. It uses an overlay structure to deliver high priority readings within certain application delay bound. Contrary to typical approaches, it will adopt on the fly reservation to facilitate data transmission with minimal delay.