In this paper, a novel feature selection method based on the normalization of the well-known mutual information measurement is presented. Our method is derived from an existing approach, the max-relevance and minredundancy (mRMR) approach. We, however, propose to normalize the mutual information used in the method so that the domination of the relevance or of the redundancy can be eliminated. We borrow some commonly used recognition models including Support Vector Machine (SVM), k-Nearest-Neighbor (kNN), and Linear Discriminant Analysis (LDA) to compare our algorithm with the original (mRMR) and a recently improved version of the mRMR, the Normalized Mutual Information Feature Selection (NMIFS) algorithm. To avoid data-specific statements, we conduct our classification experiments using various datasets from the UCI machine learning repository. The results confirm that our feature selection method is more robust than the others with regard to classification accuracy.
Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.
Sensor network deployment is very challenging due to the hostile and unpredictable nature of environments. The field coverage of wireless sensor networks (WSNs) can be enhanced and consequently network lifetime can be prolonged by optimizing the sensor deployment with a finite number of mobile sensors. In this paper, we introduce a comprehensive taxonomy for WSN self-deployment in which three sensor relocation algorithms are proposed to match the mobility degree of sensor nodes, particle swarm optimization based algorithm (PSOA), relay shift based algorithm (RSBA) and energy efficient fuzzy optimization algorithm (EFOA). PSOA regards the sensors in the network as a swarm, and reorganizes the sensors by the particle swarm optimization (PSO) algorithm, in the full sensor mobility case. RSBA and EFOA assume relatively limited sensor mobility, i.e., the movement distance is bounded by a threshold, to further reduce energy consumption. In the zero mobility case, static topology control or scheduling schemes can be used such as optimal cluster formation. Simulation results show that our approaches greatly improve the network coverage as well as energy efficiency compared with related works.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.