اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAdvanced LEACH: A Static Clustering-based Heteroneous Routing Protocol for WSNs
186
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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. The 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.
قيم البحث
اقرأ أيضاً
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 Cl
ustering 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.
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.
Increased use of Wireless sensor Networks (WSNs) in variety of applications has enabled the designers to create autonomous sensors, which can be deployed randomly, without human supervision, for the purpose of sensing and communicating valuable data.
Many energy-efficient routing protocols are designed for WSNs based on clustering structure. In this paper, we have proposed iMODLEACH protocol which is an extension to the MODLEACH protocol. Simulation results indicate that iMODLEACH outperforms MODLEACH in terms of network life-time and packets transferred to base station. The mathematical analysis helps to select such values of these parameters which can suit a particular wireless sensor network application.
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of t
he above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of the multicast structure and by providing robustness to mobility by performing broadcasts in densely clustered local regions, the proposed protocol achieves packet delivery statistics that are comparable to that with a pure multicast protocol but with significantly lower overheads. By our simulation results, we show that our proposed protocol achieves increased Packet Delivery Fraction (PDF) with reduced overhead and routing load.
Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise an
d verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
