اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEnergy optimization and Performance Analysis of Cluster Based Routing Protocols Extended from LEACH for WSNs
101
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An energy efficient routing protocol is the major attentiveness for researcher in field of Wireless Sensor Networks (WSNs). In this paper, we present some energy efficient hierarchal routing protocols, prosper from conventional Low Energy Adaptive Clustering Hierarchy (LEACH) routing protocol. Fundamental objective of our consideration is to analyze, how these ex- tended routing protocols work in order to optimize lifetime of network nodes and how quality of routing protocols is improved for WSNs. Furthermore, this paper also emphasizes on some issues experienced by LEACH and also explains how these issues are tackled by other enhanced routing protocols from classi- cal LEACH. We analytically compare the features and performance issues of each hierarchal routing protocol. We also simulate selected clustering routing protocols for our study in order to elaborate the enhancement achieved by ameliorate routing protocols.
قيم البحث
اقرأ أيضاً
Wireless Sensors Networks (WSNs) have a big application in heterogeneous networks. In this paper, we propose and evaluate Advanced Low-Energy Adaptive Clustering Hierarchy (Ad-LEACH) which is static clustering based heterogeneous routing protocol. Th
e complete network field is first divided into static clusters and then in each cluster separate Ad-LEACH protocol is applied. Our proposed protocol is inherited from LEACH with a cluster head selection criteria of Distributed Energy-Efficient Clustering (DEEC). This enables Ad-LEACH to cope with the heterogeneous nature of nodes. Due to small static clusters, each node reduces its broadcast message power because it only has to cover a small area. We perform simulations in MATLAB to check the efficiency of Ad-LEACH. The Simulation results show that Ad-LEACH outperforms LEACH and DEEC in energy efficiency as well as throughput.
In this research work, we advise gateway based energy-efficient routing protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor nodes into four logical regions on the basis of their location in the sensing field. We install Base S
tation (BS) out of the sensing area and a gateway node at the centre of the sensing area. If the distance of a sensor node from BS or gateway is less than predefined distance threshold, the node uses direct communication. We divide the rest of nodes into two equal regions whose distance is beyond the threshold distance. We select cluster heads (CHs)in each region which are independent of the other region. These CHs are selected on the basis of a probability. We compare performance of our protocol with LEACH (Low Energy Adaptive Clustering Hierarchy). Performance analysis and compared statistic results show that our proposed protocol perform well in terms of energy consumption and network lifetime.
Reactive routing protocols are gaining popularity due to their event driven nature day by day. In this vary paper, reactive routing is studied precisely. Route request, route reply and route maintenance phases are modeled with respect to control over
head. Control overhead varies with respect to change in various parameters. Our model calculates these variations as well. Besides modeling, we chose three most favored reactive routing protocols as Ad-Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET on Demand (DYMO) for our experiments. We simulated these protocols using ns-2 for a detailed comparison and performance analysis with respect to mobility and scalability issues keeping metrics of throughput, route delay and control over head. Their performances and comparisons are extensively presented in last part of our work.
To ensure seamless communication in wireless multi-hop networks, certain classes of routing protocols are defined. This vary paper, is based upon proactive routing protocols for Wireless multihop networks. Initially, we discuss Destination Sequence D
istance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR), precisely followed by mathematical frame work of control overhead regarding proactive natured routing protocols. Finally, extensive simulations are done using NS 2 respecting above mentioned routing protocols covering mobility and scalability issues. Said protocols are compared under mobile and dense environments to conclude our performance analysis.
In this paper, a framework is presented for node distribution with respect to density, network connectivity and communication time. According to modeled framework we evaluate and compare the performance of three routing protocols; Ad-hoc On-demand Di
stance Vector (AODV), Dynamic Source Routing (DSR) and Fisheye State Routing (FSR) in MANETs and VANETs using two Mac-layer protocols; 802.11 and 802.11p. We have further modified these protocols by changing their routing information exchange intervals; MOD AODV, MOD DSR and MOD FSR. A comprehensive simulation work is performed in NS-2 for the comparison of these routing protocols for varying mobilities and scalabilities of nodes. To evaluate their efficiency; throughput, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) of these protocols are taken into account as performance parameters. After extensive simulations, we observe that AODV outperforms both with MANETs and VANETs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
