Abstract
Mobile ad-hoc networks (MANETs) are a form of wireless networks which do not require a base station for providing network connectivity. Many MANETs’ characteristics that distinguish MANETs from other wireless networks also make routing a challenging task. Cluster based routing is a MANET routing schemes in which various clusters of mobile nodes are formed with each cluster having its own clusterhead which is responsible for routing among clusters. In this paper we propose and implement a distributed weighted clustering algorithm for MANETs. This approach is based on combined weight metric that takes into account several system parameters like the node degree, transmission range, energy and mobility of the nodes. We have evaluated the performance of the proposed scheme through simulation in various network situations. Simulation results show that improved distributed weighted clustering algorithm (DWCAIMP) outperforms the original distributed weighted clustering algorithm (DWCA).
Highlights
Mobile ad-hoc networks (MANETs) are a form of wireless networks which do not require a base station for providing network connectivity
Cluster based routing is a MANET routing schemes in which various clusters of mobile nodes are formed with each cluster having its own clusterhead which is responsible for routing among clusters
MANETs are a form of wireless networks which do not require a base station for providing network connectivity
Summary
MANETs are a form of wireless networks which do not require a base station for providing network connectivity. Cluster based routing is one of the routing schemes for MANETs in which various clusters of mobile nodes are formed with each cluster having its own clusterhead which is responsible for routing between clusters. In this paper we discuss distributed weighted clustering algorithm (DWCA) [2] This approach is based on combined weight metric that takes into account several system parameters like the ideal node degree, transmission range, energy and mobility of the nodes. On the other hand we can choose to have minimum number of clusterheads to maximize the resource utilization Various parameters and their respective weights can be determined to arrive at an efficient weighted cluster based routing scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have