Convergent activation dynamics in continuous time networks
Neural Networks
Neural network parallel computing
Neural network parallel computing
On weakly connected domination in graphs
Discrete Mathematics
Multicluster, mobile, multimedia radio network
Wireless Networks
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
International Journal of Network Management
Complexity Issues in Discrete Neurocomputing
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Cooperative Control: Models, Applications, and Algorithms
Cooperative Control: Models, Applications, and Algorithms
Issues in ad hoc wireless networks
Issues in ad hoc wireless networks
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Clustering wireless ad hoc networks with weakly connected dominating set
Journal of Parallel and Distributed Computing
Flooding in wireless ad hoc networks
Computer Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
A neural-network algorithm for a graph layout problem
IEEE Transactions on Neural Networks
An Improved Neural Network Model for the Two-Page Crossing Number Problem
IEEE Transactions on Neural Networks
Distributed EM Algorithm for Gaussian Mixtures in Sensor Networks
IEEE Transactions on Neural Networks
Resistive-type CVNS distributed neural networks with improved noise-to-signal ratio
IEEE Transactions on Circuits and Systems II: Express Briefs
| Hi-index | 0.00 |
A wireless ad hoc sensor network consists of a number of sensors spreading across a geographical area. The performance of the network suffers as the number of nodes grows, and a large sensor network quickly becomes difficult to manage. Thus, it is essential that the network be able to self-organize. Clustering is an efficient approach to simplify the network structure and to alleviate the scalability problem. One method to create clusters is to use weakly connected dominating sets (WCDSs). Finding the minimum WCDS in an arbitrary graph is an NP-complete problem. We propose a neural network model to find the minimum WCDS in a wireless sensor network. We present a directed convergence algorithm. The new algorithm outperforms the normal convergence algorithm both in efficiency and in the quality of solutions. Moreover, it is shown that the neural network is robust. We investigate the scalability of the neural network model by testing it on a range of sized graphs and on a range of transmission radii. Compared with Guha and Khuller's centralized algorithm, the proposed neural network with directed convergency achieves better results when the transmission radius is short, and equal performance when the transmission radius becomes larger. The parallel version of the neural network model takes time O(d), where d is the maximal degree in the graph corresponding to the sensor network, while the centralized algorithm takes O(n2). We also investigate the effect of the transmission radius on the size of WCDS. The results show that it is important to select a suitable transmission radius to make the network stable and to extend the lifespan of the network. The proposed model can be used on sink nodes in sensor networks, so that a sink node can inform the nodes to be a coordinator (clusterhead) in the WCDS obtained by the algorithm. Thus, the message overhead is O(M), where M is the size of the WCDS.