Article

A Framework for Load Sharing in Clustered Ad Hoc Networks

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

ad hoc networks, Clustering provides a hierarchical structure in which certain nodes are assigned the extra task (such as routing) of the network. Ordinary nodes do not participate in the routing instead they rely on coordinators of the clusters (clusterheads) for packet delivery. If a suitable tap is not applied on the number of nodes that join a clusterhead as its members, formation of bottleneck can takes place at the overloaded clusterheads. The performance of the network may get affected due to the bottleneck. This paper proposes a cluster formation algorithm in which, if the number of members of a clusterhead exceeds the predefined threshold value, a procedure of cluster division is executed. This relieves the clusterheads from the burden of excessive members. Simulation study of the proposed algorithm justifies the facts by observing an improvement in the performance in terms of E2E delay, PDF and throughput. Keywordsad hoc network, clustering, clusterhead, load, energy

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

... A Mobile Adhoc Network (MANET) is a decentralized network that consists of self-contained mobile nodes connected by wireless links [1]. The functions of MANET can be performed without the need for any fixed infrastructure. ...
Article
— In an Adhoc Network, every node is mobile and self-contained. As these networks lack infrastructure, highly adaptive algorithms are required to deal with frequent mobility changes by member nodes as well as Cluster Head (CH) nodes. The weighted clustering algorithms contribute significantly to cluster-based routing. In these algorithms, the selection of cluster heads is the most important task. In weighted clustering methods, the selected CH did their best to serve the network. However, the CH may become overloaded due to the arrival of nodes greater than their desired threshold value. In this case, the CH can become a bottleneck as it is unable to cope with rapidly increasing loads which ultimately degrade the network performance. In this paper, we address three network issues (i) Member Node movement (ii) Cluster head Node movement, and (iii) Overload at the Cluster head node caused due to mobility of nodes. Our proposed method Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service (CFMIQS) include various adaptive algorithms to provide solutions to deal with these network issues and improve network Quality of Service (QoS). The Simulated Results are compared with the K-means AODV algorithm, the results showed better Packet Delivery Fraction (PDF) and Throughput values. Keywords— Cluster partition, MANET, Primary Cluster head, QoS, Secondary Cluster head
Article
Clustering can be used in MANET to enhance the network performance parameters such as its throughput and delay in the case when the number of hosts are in substantial quantity and are mobile. In this work, we demonstrate a clustering strategy that reduces the delay of the network and enhances the throughput using the cost based analysis. It also runs a re-clustering algorithm periodically where a new cluster is formed and helps in managing the scalable networks. Algorithms for clustering can be accomplished at routing stage or at higher levels. Formation of dynamic clusters assists in slenderizing overhead of a data packet, convolution of a node and Power Utilzation. Cost based Scalable Clustering is basically exploited to minimize network overhead. This work dispends an efficacious algorithm to volutes a cluster and its maintenance in Mobile ad-hoc networks by implementing Cost based Scalable Clustering
Conference Paper
Full-text available
Unlike current clustering methods, the presented vote-based clustering (VC) algorithm uses not only node location and ID information, but also battery time information. In VC, each mobile host (MH) counts Hello messages from its neighbors. At the same time it calculates its own vote that is the weighted sum of the normalized number of valid neighbors and its normalized remaining battery time. The one with higher vote than its neighbors will be selected preferentially as a cluster head (CH). When the number of dominated MHs of a CH is more than a balance threshold, neither of new coming MHs will be permitted to participate in the current cluster. Analysis and simulation results show that VC method can improve cluster structure than Lowest ID (LID) algorithm and Highest Degree (HD) algorithm.
Conference Paper
Full-text available
In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The aim of CEMCA consists in appropriately choosing the cluster head to reduce routing overhead. In order to reduce traffic and energy consumption, the control messages are sent only when needed, according to the speed of the node. Each node has a quality that indicates its suitability as a cluster head. This quality takes into account the node connectivity, battery energy and mobility. These parameters are very important for the stability of the cluster. Simulation experiments are carried out to validate our algorithm in terms of stability of the clusters and their members and the quality of the connectivity. The results are compared to a previous approach called Weight Clustering Algorithm (WCA) and they show that CEMCA is performing better.
Conference Paper
Full-text available
As a newly-proposed weighing-based clustering algorithm, WCA has improved performance compared with other previous clustering algorithms. But the high mobility of nodes will lead to high frequency of reaffiliation which will increase the network overhead. To solve this problem, we propose an entropybased WCA (EWCA) which can enhance the stability of the network. Meanwhile, in order better to facilitate the optimal operation of the MAC protocol and to further stabilize the network structure, this paper applies tabu search onto EWCA to choose a near optimal dominant set. Consequently, less clusterheads are required to manage the network. Simulation study indicates that the revised algorithm (EWCA-TS) has improved performance with respect to the original WCA, especially on the number of clusters and the reaffiliation frequency.
Conference Paper
Full-text available
This paper presents a mobility-based d-hop clustering algorithm (MobDHop), which forms variable-diameter clusters based on node mobility pattern in MANETs. We introduce a new metric to measure the variation of distance between nodes over time in order to estimate the relative mobility of two nodes. We also estimate the stability of clusters based on relative mobility of cluster members. Unlike other clustering algorithms, the diameter of clusters is not restricted to two hops. Instead, the diameter of clusters is flexible and determined by the stability of clusters. Nodes which have similar moving pattern are grouped into one cluster. The simulation results show that MobDHop has stable performance in randomly generated scenarios. It forms lesser clusters than Lowest-ID and MOBIC algorithm in the same scenario. In conclusion, MobDHop can be used to provide an underlying hierarchical routing structure to address the scalability of routing protocol in large MANETs.
Conference Paper
Full-text available
Two distributed heuristic clustering schemes are proposed which will minimize the required transmission power in two-tiered mobile ad-hoc networks. Both schemes can be implemented and executed in real-time and can be adopted for periodic or event-driven cluster reconfiguration. Scheme performance is simulated and compared with optimum configurations based on the mean transmission power and the call drop rate as performance measures. Numerical results show that the proposed schemes deliver performance similar to optimum results
Conference Paper
Full-text available
We present a novel relative mobility metric for mobile ad hoc networks (MANETs). It is based on the ratio of power levels due to successive receptions at each node from its neighbors. We propose a distributed clustering algorithm, MOBIC, based on the use of this mobility metric for selection of clusterheads, and demonstrate that it leads to more stable cluster formation than the “least clusterhead change” version of the well known Lowest-ID clustering algorithm (Chiang et al., 1997). We show reduction of as much as 33% in the rate of clusterhead changes owing to the use of the proposed technique. In a MANET that uses scalable cluster-based services, network performance metrics such as throughput and delay are tightly coupled with the frequency of cluster reorganization. Therefore, we believe that using MOBIC can result in a more stable configuration, and thus yield better performance
Article
Full-text available
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in nature due to the mobility of nodes. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence a reconfiguration of the system is often unavoidable. However, it is vital to keep the topology stable as long as possible. The clusterheads,formadominant set in the network, determine the topology and its stability. The proposed weight-based distributed clustering algorithm takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes. The time required to identify the clusterheads depends on the diameter of the underlying graph. We try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control (MAC) protocol. The non-periodic procedure for clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. The clusterheads, operating in "dual" power mode, connects the clusters which help in routing messages from a node to any other node. We observe a trade-off between the uniformity of the load handled by the clusterheads and the connectivity of the network. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusterheads, reaffiliation frequency, and dominant set updates. Results show that our algorithm performs better than existing ones and is also tunable to different kinds of network conditions.
Article
Full-text available
Ad hoc networks consist of a set of identical nodes that move freely and independently and communicate with other node via wireless links. Such networks may be logically represented as a set of clusters by grouping together nodes that are in close proximity with one another. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Nodes are assumed to have non-deterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless links. Different heuristics employ different policies to elect clusterheads. Several of these policies are biased in favor of some nodes. As a result, these nodes shoulder greater responsibility and may deplete their energy faster, causing them to drop out of the network. Therefore, there is a need for load-balancing among clusterheads to allow all nodes the opportunity to serve as a clusterhead. We propose a loadbalancing heuristic to extend the life of a clusterhead to the maximum budget b...
Article
In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. We propose to combine two known approaches into a single clustering algorithm which considers connectivity as a primary criterion and lower ID as secondary criterion for selecting cluster heads. The goal is to minimize the number of clusters, which results in dominating sets of smaller sizes (this is important for applications in broadcasting and Bluetooth formation). We also describe algorithms for modifying cluster structure in the presence of topological changes. Next, we generalize the cluster definition so that a cluster contains all nodes that are at a distance of at most k hops from the cluster head. The efficiency of four clustering algorithms (k-lowestID and k-CONID, k=1 and k=2) is tested by measuring the average number of created clusters, the number of border nodes, and the cluster size in random unit graphs. The most interesting experimental result is stability of the ratio of the sum of CHs and border nodes in the set. It was constantly 60-70% for 1-lowestID and 46-56% for 1-ConID, for any value of n (number of nodes) and d (average node degree). Similar conclusions and similar number were obtained for k=2. We also proposed a unified framework for most existing and new clustering algorithms where a properly defined weight at each node is the only difference in the algorithm. Finally, we propose a framework for generating random unit graphs with obstacles.
Conference Paper
This paper proposes a new weight based adaptive clustering algorithm (WBACA) for mobile ad-hoc networks (MANETs). MANETs are multi-hop wireless packet networks in which all the nodes cooperatively maintain network connectivity without the aid of any infrastructure networks. The proposed WBACA takes into account the transmission power, transmission rate, mobility, battery power and the degree of a node for forming clusters. Unlike the lowest-ID algorithm, which finds only the local minima of IDs and the weighted clustering algorithm (WCA), which finds the global minima of weights, the proposed WBACA finds the local minima of weights for the clustering process. Through simulations, we have compared the performance of our algorithm with that of the lowest-ID and WCA algorithms in terms of the number of clusters formed, number of reaffiliations, and the time delay in starting up the clustering process. The results demonstrate the superior performance of the proposed algorithm.
Conference Paper
The clustering protocol of an ad hoc network is always with interest. In this paper, we present a novel non-overlapping clustering algorithm, 3-hop between adjacent clusterheads (3hBAC), which can decrease the number of clusters without loss of connection information. In the cluster maintenance phase, we combine 3hBAC with least cluster change (LCC) algorithm to further decrease the cluster change and to extend average clusterhead time and membership time. The performances of 3hBAC are compared with highest-connectivity clustering (HCC), random competition-based clustering (RCC) in terms of average number of clusters, average clusterhead time and average membership time. 3hBAC outperforms HCC and RCC in both the cluster formation and maintenance phase.
Conference Paper
A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. (1) The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. (2) The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the network, which satisfy the above requirements.
Conference Paper
Ad hoc networks consist of a set of identical nodes that move freely and independently and communicate with other node via wireless links. Such networks may be logically represented as a set of clusters by grouping together nodes that are in close proximity with one another. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Nodes are assumed to have non-deterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless links. Different heuristics employ different policies to elect clusterheads. Several of these policies are biased in favor of some nodes. As a result, these nodes shoulder greater responsibility and may deplete their energy faster, causing them to drop out of the network. Therefore, there is a need for load-balancing among clusterheads to allow all nodes the opportunity to serve as a clusterhead. We propose a load-balancing heuristic to extend the life of a clusterhead to the maximum budget before allowing the clusterhead to retire and give way to another node. This helps to evenly distribute the responsibility of acting as clusterheads among all nodes. Thus, the heuristic ensures fairness and stability. Simulation experiments demonstrate that the proposed heuristic does provide longer clusterhead durations than with no load-balancing
Conference Paper
An ad hoc network may be logically represented as a set of clusters. The clusterheads form a d-hop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Previous heuristics restricted themselves to 1-hop clusters. We show that the minimum d-hop dominating set problem is NP-complete. Then we present a heuristic to form d-clusters in a wireless ad hoc network. Nodes are assumed to have a non-deterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless links. When the heuristic terminates, a node either becomes a clusterhead, or is at most d wireless hops away from its clusterhead. The value of d is a parameter of the heuristic. The heuristic can be run either at regular intervals, or whenever the network configuration changes. One of the features of the heuristic is that it tends to re-elect existing clusterheads even when the network configuration changes. This helps to reduce the communication overheads during transition from old clusterheads to new clusterheads. Also, there is a tendency to evenly distribute the mobile nodes among the clusterheads, and evently distribute the responsibility of acting as clusterheads among all nodes. Thus, the heuristic is fair and stable. Simulation experiments demonstrate that the proposed heuristic is better than the two earlier heuristics, namely the LCA and degree-based solutions
Article
This paper presents a novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded. The purpose of the (α, t) cluster is to help minimize the far-reaching effects of topological changes while balancing the need to support more optimal routing. A mobility model for ad hoc networks is developed and is used to derive expressions for the probability of path availability as a function of time. It is shown how this model provides the basis for dynamically grouping nodes into clusters using an efficient distributed clustering algorithm. Since the criteria for cluster organization depends directly upon path availability, the structure of the cluster topology is adaptive with respect to node mobility. Consequently, this framework supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when mobility rates are high
Article
This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled, and are dynamically reconfigured as the nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Second, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure, and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network
Article
High capacity real-time data communications in sensor networks usually require multihop routing and ad hoc routing protocols. Unfortunately, ad hoc routing protocols usually do not scale well and cannot handle dense situations efficiently. These two issues-scalability and density-are the major limitations when we apply ad hoc routing schemes to sensor networks. Passive clustering (PC) classifies ad hoc/sensor nodes into critical and noncritical nodes without any extra transmission. By 2-b piggybacking and monitoring user traffic (e.g., data polling requests from a sink), PC deploys the clustering structure "for free". Moreover, PC makes even the first flooding as efficient as all subsequent floodings (i.e., no initialization overhead). PC introduces many benefits, including efficient flooding and density adaptation. As a result, PC reduces control overhead of ad hoc routing protocols significantly and, as a consequence, enables ad hoc routing in large, dense sensor networks. The resulting structure can be utilized in cluster-based ad hoc network/sensor networking as well as for active node selection.
Article
In a multi-hop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a flooding or broadcasting task, a source node sends the same message to all the nodes in the network. It is an important task used for paging, alarming, location updates, route discoveries or even routing in highly mobile environments. In the activity-scheduling problem, each node decides between active or passive state so that network remains connected and its lifetime is maximized. The desirable properties of a scalable flooding or activity-scheduling scheme are reliability (reaching all nodes in a collision free environment), and power and bandwidth efficiency, which can be measured by savings in rebroadcasts. Until recently, blind flooding was used as a solution: each node receiving the message for the first time will retransmit it. This solution, however, has collision, contention and redundancy problems. This chapter surveys existing methods for flooding a wireless network intelligently (using omni-directional or directional antennas, with equal or adjusted transmission radii) and for scheduling node activities.
Article
this paper, we presentamulti-cluster, multi-hop packet radio network architecture that addresses the abovechallenges and implements all required features. In a mobile, multi-channel #code#, and multi-hop environment, the topology is dynamically recon#gured to handle mobility. Routing and bandwidth assignment are designed so as to meet the various types of tra#c requirements. Node clustering, VC setup and channel access control are the underlying features which support this architecture, and will thus be the main focus of this paper. The rest of the paper is organized as follows: in Section 2, the multi-cluster network architecture is presented. Channel access scheme and VC establishment are presented in Section 3. Performance results are shown in Section 4. Section 5 will discuss the extensions of the basic algorithm. Finally, conclusions are given in Section 6. M. Gerla and J. Tsai # Multicluster, mobile, multimedia radio network 3 2# Multi-cluster network architecture and clustering algorithm Several network alternatives can be considered for WAMIS. In our case, because of the requirements of e#cient network resource control, multimedia tra#c support and suitability to CDMA, wehave selected a distributed cluster approach #4#. In fact, clustering provides a convenient framework for the development of important features such as code separation #among clusters#, channel access, routing, power control, virtual circuit support and bandwidth allocation. Following the clustering approach, the entire population of nodes is grouped into clusters. A cluster is a subset of nodes which can #two-way# communicate with a clusterhead and #possibly# with each other. In Fig. 1, nodes A, B and C are clusterheads for their coverage area respectively. Each of them serves as a regional b...
Article
this paper, we propose some heuristic routing schemes for clustered multihop, mobile wireless networks. A packet delay improvement up to fourfold has been observed in our simulations compared with shortest-pathscheme, making multimedia tra#c viable. A radio channel model has been included to investigate the impact of channel fading on our protocols. To reduce the run time, a parallel simulator has been designed. Speedups of up to tenfold have been observed on a 16 processor SP#2. 1 Introduction Wireless networks provide mobile users with ubiquitous communicating capability and information access regardless of the location. In this paper we address a particular type of wireless networks called #multihop" networks. As a di#erence from #single hop" #i.e. cellular# networks
  • M Gerla
  • J T Tsai
M. Gerla and J. T. Tsai, " Multiuser, Mobile, Multimedia RadioNetwork " Wireless Networks, 1995, vol. 1, pp. 255–65.
A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks
  • A B Madonald
  • T F Znati
A. B. MaDonald and T. F. Znati, "A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks" IEEE JSAC, 1999, vol. 17, pp. 1466-87.