21 research outputs found
Energy Efficient Stable Cluster Scheme for MANET
In Mobile Ad-hoc Networks, cluster based routing protocol(CBRP) is robustly used since they combine the advantages of Reactive and Proctive routing protocols. And they have less routing overhead and less end-to-end delay compared to Reactive and Proctive routing protocols respectively. Energy source for a mobile node is limited, and even difficult to recharge. The life time of the network depends on the life time of the nodes. So we propose different shemes to have energy efficient stable clusters. By using stable clustering algorithm to avoid frequent reclustering, efficient clustering scheme to minimize overlapping clusters, and allow nodes to save their energy by changing their mode to sleep mode
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly
addresses the issue of scalability in large scale Wireless Sensor Networks.
Additionally, it has been shown to improve the energy efficiency and prolong
the life of the network. The suggested protocols mostly base their clustering
criteria on some grouping attribute(s) of the nodes. One important attribute
that is largely ignored by most of the existing multi-hop clustering protocols
is the reliability of the communication links between the nodes. In this paper,
we suggest an adaptive and completely distributed multi-hop clustering protocol
that incorporates different notions of reliability of the communication links,
among other things, into a composite metric and uses it in all phases of the
clustering process. The joining criteria for the nodes, which lie at one hop
from the elected cluster heads, to a particular cluster not only consider the
reliability of their communication link with their cluster head but also other
important attributes. The nodes that lie outside the communication range of
cluster heads become cluster members transitively through existing cluster
members utilizing the end-to-end notion of link reliability, between the nodes
and the cluster heads, along with other important attributes. Similarly,
inter-cluster communication paths are selected using a set of criteria that
includes the end-to-end communication link reliability with the sink node along
with other important node and network attributes. We believe that incorporating
link reliability in all phases of clustering process results in an efficient
multi-hop communication hierarchy that has the potential of bringing down the
total communication costs in the network
Optimal Clustering in Wireless Sensor Networks for the Internet of Things Based on Memetic Algorithm: MemeWSN
In wireless sensor networks for the Internet of Things (WSN-IoT), the topology deviates very frequently because of the node mobility. The topology maintenance overhead is high in flat-based WSN-IoTs. WSN clustering is suggested to not only reduce the message overhead in WSN-IoT but also control the congestion and easy topology repairs. The partition of wireless mobile nodes (WMNs) into clusters is a multiobjective optimization problem in large-size WSN. Different evolutionary algorithms (EAs) are applied to divide the WSN-IoT into clusters but suffer from early convergence. In this paper, we propose WSN clustering based on the memetic algorithm (MemA) to decrease the probability of early convergence by utilizing local exploration techniques. Optimum clusters in WSN-IoT can be obtained using MemA to dynamically balance the load among clusters. The objective of this research is to find a cluster head set (CH-set) as early as possible once needed. The WMNs with high weight value are selected in lieu of new inhabitants in the subsequent generation. A crossover mechanism is applied to produce new-fangled chromosomes as soon as the two maternities have been nominated. The local search procedure is initiated to enhance the worth of individuals. The suggested method is matched with state-of-the-art methods like MobAC (Singh and Lohani, 2019), EPSO-C (Pathak, 2020), and PBC-CP (Vimalarani, et al. 2016). The proposed technique outperforms the state of the art clustering methods regarding control messages overhead, cluster count, reaffiliation rate, and cluster lifetime
A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs
In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing
Mobility-adaptive clustering and network-layer multicasting in mobile ad hoc networks
Ph.DDOCTOR OF PHILOSOPH
Simulation-based Performance Evaluation of MANET Backbone Formation Algorithms
As a result of the recent advances in the computation and communications industries,
wireless communications-enabled computing devices are ubiquitous nowadays.
Even though these devices are introduced to satisfy the user’s mobile computing
needs, they are still unable to provide for the full mobile computing functionality
as they confine the user mobility to be within certain regions in order to benefit
from services provided by fixed network access points.
Mobile ad hoc networks (MANETs) are introduced as the technology that potentially
will make the nowadays illusion of mobile computing a tangible reality.
MANETs are created by the mobile computing devices on an ad hoc basis, without
any support or administration provided by a fixed or pre-installed communications
infrastructure.
Along with their appealing autonomy and fast deployment properties, MANETs
exhibit some other properties that make their realization a very challenging task.
Topology dynamism and bandwidth limitations of the communication channel adversely
affect the performance of routing protocols designed for MANETs, especially
with the increase in the number of mobile hosts and/or mobility rates.
The Connected Dominating Set (CDS), a.k.a. virtual backbone or Spine, is
proposed to facilitate routing, broadcasting, and establishing a dynamic infrastructure
for distributed location databases. Minimizing the CDS produces a simpler
abstracted topology of the MANET and allows for using shorter routes between
any pair of hosts. Since it is NP-complete to find the minimum connected dominating
set, MCDS, researchers resorted to approximation algorithms and heuristics
to tackle this problem.
The literature is rich of many CDS approximation algorithms that compete in
terms of CDS size, running time, and signaling overhead. It has been reported
that localized CDS creation algorithms are the fastest and the lightest in terms of
signaling overhead among all other techniques. Examples of these localized CDS
algorithms are Wu and Li algorithm and its Stojmenovic variant, the MPR algorithm,
and Alzoubi algorithm. The designers of each of these algorithms claim
that their algorithm exhibits the highest degree of localization and hence incurs the lowest cost in the CDS creation phase. However, these claims are not supported
by any physical or at least simulation-based evidence. Moreover, the cost of maintaining
the CDS (in terms of the change in CDS size, running time, and signaling
overhead), in the presence of unpredictable and frequent topology changes, is an
important factor that has to be taken into account -a cost that is overlooked most
of the time.
A simulation-based comparative study between the performance of these algorithms
will be conducted using the ns2 network simulator. This study will focus
on the total costs incurred by these algorithms in terms of CDS size, running time,
and signaling overhead generated during the CDS creation and maintenance phases.
Moreover, the effects of mobility rates, network size, and mobility models on the
performance of each algorithm will be investigated. Conclusions regarding the pros
and cons of each algorithm will be drawn, and directions for future research work
will be recommended