Clustering for networks of moving objects

Rakocevic, V. (2014). Clustering for networks of moving objects. Lecture Notes in Computer Science, 8611, pp. 70-87. doi: 10.1007/978-3-319-10834-6_5

[img]
Preview
Text - Accepted Version
Download (301kB) | Preview

Abstract

This chapter presents the problem of clustering of moving objects in ad hoc wireless networks. The networks of moving objects include networks of flying objects, networks of cars and other vehicles, networks of people moving in the cities, and networks of robots sensing the environment or performing coordinated actions. Clustering of such objects increases the scalability of the network and improves efficiency, enabling the objects to simplify the communication with their peers. Clustering of static network objects has been analysed in great detail in the literature. While most of the clustering algorithms and protocols are applicable in the networks of moving objects, there are specific challenges produced by the mobility. This document will present a rich body of currently available scholarly work on clustering for moving objects, focusing on the case when all network nodes (both clusterheads and cluster members) are moving. Most of the research works presented in this Chapter aim to predict the movement of the networked nodes, or to measure the relative mobility between the nodes, in order to optimise the processes of clusterhead election and cluster maintenance.

Item Type: Article
Additional Information: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-10834-6_5
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > TA Engineering (General). Civil engineering (General)
Divisions: School of Engineering & Mathematical Sciences > Engineering
URI: http://openaccess.city.ac.uk/id/eprint/8669

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics