Abstract
The deployment of wireless sensor networks for healthcare applications has been motivated and driven by the increasing demand for real-time monitoring of patients in hospital and large disaster response environments. A major challenge in developing such sensor networks is the need for coordinating a large number of randomly deployed sensor nodes. In this study, we propose a multi-parametric clustering scheme designed to aid in the coordination of sensor nodes within cognitive wireless sensor networks. In the proposed scheme, sensor nodes are clustered together based on similar network behaviour across multiple network parameters, such as channel availability, interference characteristics, and topological characteristics, followed by mechanisms for forming, joining and switching clusters. Extensive performance evaluation is conducted to study the impact on important factors such as clustering overhead, cluster joining estimation error, interference probability, as well as probability of reclustering. Results show that the proposed clustering scheme can be an excellent candidate for use in large scale cognitive wireless sensor network deployments with high dynamics.
Introduction
Wireless Sensor Networks (WSNs) are increasingly vital for modern healthcare, enabling real-time monitoring of patients via EEG or ECG without the physical constraints of wired systems. However, in large-scale deployments—such as busy hospitals or chaotic disaster response sites—coordinating hundreds of randomly deployed nodes presents a significant challenge.
Traditional WSNs often struggle with spectrum scarcity. Cognitive Wireless Sensor Networks (CWSNs) address this by "borrowing" unused spectrum (white spaces) from primary users. The challenge is that these white spaces are highly dynamic; if a primary user begins broadcasting, sensor nodes must vacate the channel immediately. Existing clustering methods typically rely on a single parameter, such as battery life, and often fail to handle the rapid dynamics of spectrum availability and interference in these environments.
Methods
The proposed multi-parametric clustering scheme utilizes a four-stage framework to manage node coordination: Clustering Estimation, Formation, Joining, and Switching.
Weighted Fuzzy C-means (FCM)
Central to the estimation phase is a weighted Fuzzy C-means algorithm. Unlike standard "hard" clustering where a node belongs to exactly one group, FCM is probabilistic, allowing each node to maintain a degree of membership in multiple clusters. The "weighted" component incorporates a reliability factor, where nodes prioritize recent, stable channel data over stale information.
Multi-Parametric Approach
Instead of relying solely on spatial distance, the algorithm considers three primary vectors:
- Spatial coordinates (topological characteristics).
- Available channels (spectrum opportunity).
- Interference characteristics (channel quality).
By identifying "logical" centers based on these parameters, the network limits the number of nodes competing to become clusterheads. This reduces administrative signaling and enables a "fast-switching" mechanism: if a primary user occupies a node's current channel, the node can instantly transition to a backup cluster based on its next-highest fuzzy membership value.
Experimental Setup
The study utilized extensive numerical simulations to evaluate the framework. A 500m x 500m network area was modeled with node densities ranging from 100 to 1,000 cognitive sensor nodes. The spectrum environment consisted of 20 channels modeled using an M/G/1 queueing system to simulate the stochastic arrival and departure of primary users. The proposed scheme was benchmarked against two established methods: a voting-based clustering algorithm and a Spectrum Opportunity-Based Clustering (SOBC) scheme.
Key Results and Discussion
The multi-parametric approach demonstrated superior performance across several critical metrics, particularly in high-density scenarios.
Reduced Clustering Overhead
A primary advantage of the proposed scheme is the significant reduction in clusterhead selection overhead. By using FCM to identify logical centers before competition begins, the system avoids the massive signaling spikes seen in voting-based methods as node density increases.
Stability and Scalability
- Interference Awareness: By integrating interference probability into the clustering criteria, the network naturally organizes nodes away from "noisy" areas, improving overall Quality of Service (QoS).
- Fast Switching: The probabilistic membership values act as a safety net. The probability of needing a full network-wide reclustering was significantly reduced because local "fast-switching" handled most primary user arrivals.
- Joining Accuracy: The "joining estimation error" remained low even in environments with limited channel availability, where competition for resources is most intense.
Conclusion
The proposed multi-parametric clustering scheme offers a robust solution for the coordination of large-scale CWSNs in dynamic environments. While the computational complexity of Fuzzy C-means may pose challenges for ultra-low-power microprocessors, the gains in stability and overhead reduction are substantial. Future work will focus on hardware implementation to measure real-world battery drain and adapting the model for heterogeneous networks with varying node capabilities.
Summary updated