7.2 THE KCLS PROTOCOL

The KCLS protocol deploys a single-level k-hop clustering structure to provide location service. It is supposed that each node has a unique node ID. The ID of the cluster head is defined as the cluster ID. A k-hop cluster Cm is defined as a set of nodes under the same cluster head hm, and any node in the cluster has a distance of equal to or less than k hops to the cluster head. As shown in Figure 7.1, each cluster consists of one cluster head, ordinary cluster members that are located inside of the cluster, and gateways that are located at the border to connect to neighboring clusters.

A multihop wireless network can be divided into many nonoverlapping clusters by either using a k-hop clustering scheme, such as max–min heuristic [5] and its variations like k-hop compound metric-based clustering (KCMBC) approach [19], or by partitioning the network into several logical groups. If the network is partitioned into several logical groups, each group corresponds to a particular user team with common characteristics and the same mobility pattern, such as tank battalion in the battle field, search team in a rescue operation, moving behavior of the same company, or students within the same class. A logical group can consist of one or several k-hop clusters.

images

Figure 7.1 An example of k-hop clusters, k = 2.

7.2.1 Overview of Location Management

A two-level logical hierarchy ...

Get Mobile Intelligence now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.