This paper proposes a clustering algorithm - Balanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead. The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that it specifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
Review of Security in VANETs and MANETs: 10.4018/978-1-4666-4789-3.ch001: Mobile Ad Hoc Network (MANET) and Vehicular Ad Hoc Network (VANET) are autonomous systems connected by wireless communication on a peer-to-peer basis. They
With advances in communication technology and the Internet, grid computing has emerged as a mechanism for allowing the aggregation of network-connected computer systems to form an ever large-scale network. This paper describes the evolution of grid computing as an integration of software/hardware migration. Within grid computing, evolution can be of two distinct types: external and internal. External evolution extends the boundary of the grid, whilst internal evolution deals with the function of a single grid.
7 November 2017 in Peer-to-Peer Networking and Applications