Discrete Mathematics - Topics on domination
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Ad hoc Networking
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Secure Distributed Cluster Formation in Wireless Sensor Networks
ACSAC '06 Proceedings of the 22nd Annual Computer Security Applications Conference
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
On the reliability of backbone-assisted end-to-end transmissions in WSNs
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
A reliable topology for wireless sensor networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2
Localized and integrated topology maintenance for wireless sensor networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Analytical modeling of wireless ad hoc networks: degree distribution and maximum clique size
Proceedings of the 1st ACM workshop on High performance mobile opportunistic systems
| Hi-index | 0.24 |
We present the definition and performance evaluation of a protocol for building and maintaining a connected backbone among the nodes of a wireless sensor networks (WSN). Building backbones first, and then coping with network dynamics is typical of protocols for backbone formation. Rules for building the backbone, however, do not take into account the following network dynamics explicitly. This makes maintaining a connected backbone quite costly, especially in terms of reorganization time, overhead and energy consumption. Our protocol includes in the backbone forming operations a fail-safe mechanism for dealing with the addition and the removal of nodes, which are typical events in a WSN. More specifically, the network is kept partitioned into clusters that are cliques, i.e., nodes in each cluster are directly connected to each others. Therefore, removing a node does not disrupt a cluster, and adding one requires simple operations for checking node admission to the cluster. The protocol, termed CC (''double C'', for clique clustering), comprises three phases, each designed to render the operations of the others swift and efficient. The first phase partitions the network into clusters that are cliques. Clusters are then joined to form a backbone that is provably connected. Finally, the third, more on-line phase, maintains the backbone connected in face of node additions and removals. We compare the performance of CC with that of DMAC, a protocol that has been previously proposed for building and maintaining clusters and backbones in presence of network dynamics. Our comparison concerns metrics that are central to WSN research, such as time for clustering and backbone reorganization, corresponding overhead, extent of the reorganization (i.e., number of nodes involved in it), and properties of the resulting backbone, such as its size, backbone route length, number of gateways and nodes per cluster. Our ns2-based simulation results show that the design criteria chosen for CC are effective in producing backbones that can be reconfigured quickly and with remarkably lower overhead.