Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userReducing the Consumed Energy in the Dynamic Clustering for Wireless Sensor Networks
تخفيض الطاقة المستهلكة في العنقدة الديناميكية لشبكات الحساسات اللاسلكية
1624
1 82
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
تعد بروتوكولات التوجيه الهرمية المعتمدة على العنقدة الديناميكية إحدى الطرق المستخدمة لحفظ الطاقة و إطالة زمن حياة شبكات الحساسات اللاسلكية، إلا أن أغلب الأبحاث تقوم بإهمال الطاقة المستهلكة خلال عمليتي انتخاب الرؤوس و تشكيل العناقيد في الشبكة. قمنا في هذا البحث بدراسة طاقة الحمل الزائد الذي تتسبب به بروتوكولات التوجيه الهرمية المعتمدة على العنقدة الديناميكية كالبروتوكول LEACH، و دراسة أثره على فترة الاستقرار في شبكات الحساسات اللاسلكية. كما تم اقتراح حل للحد من استهلاك هذه الطاقة و ذلك من خلال تقليل الطاقة المستهلكة في عمليتي العنقدة و انتخاب الرؤوس. تبين لنا من خلال نتائج المحاكاة أن الطاقة المستهلكة في مرحلة الإعداد للبروتوكول LEACH تُنقِص من فترة الاستقرار و تزيد من عدد العقد الميتة في شبكات الحساسات اللاسلكية، و أن استخدام الحل المقترح قد عمل على الحد من استهلاك الطاقة أثناء عملية انتخاب الرؤوس و تشكيل العناقيد بشكل واضح مقارنةً بالطريقة العادية المتبعة في البروتوكول LEACH، مما زاد من فترة الاستقرار و عدد العقد الحية في الشبكة.
The dynamic clustering-based hierarchical routing protocols are one of the methods used to save energy and increase the lifetime of wireless sensor networks, however, that most of the researches are neglecting the energy expended in election of the heads and formation of clusters in the network. In this paper, we examine the overhead energy caused by hierarchical routing protocols based on dynamic clustering and study its impact on the stability period of the wireless sensor networks. Also, we proposed a solution to limit this energy by reducing the consumed energy in election of heads and clusters formation operations. It is shown through the simulation results that the energy consumed in LEACH setup phase decreases the stability period of these networks and increases the number of dead nodes. And the use of the proposed solution reduced the energy consumption during the election of the heads and the formation of clusters clearly compared to the normal way followed in LEACH, which has increased stability period and the number of live nodes in the network.
References used
AKYILDIZ, I.F.; SU, W.; SANK, Y.; CAYIRCI, E. Wireless sensor networks: A survey. Computer Network. 2002, 38, 393–422
Al-KARAKI, J.N.; KAMAL, A.E. Routing techniques in wireless sensor networks: A survey. IEEE Wirel. Commun. 2004, 11, 6–28
KULIK, J.; HEINZELMAN, W.R.; BALAKRISHNAN, H. Negotiation based protocols for disseminating information in wireless sensor networks. Wirel. Netw. 2002, 169–185
rate research
Read More
Image Fusion is one of the most important methods used in image processing, especially in networks with limited resources such as networks of wireless sensors supporting multimedia. It is classified into technologies operating in spatial domain and o
thers in the frequency domain. In this research, Fusion techniques in frequency domain are manipulated to benefit from its advantages. Discrete Cosine Tansform is used because it fits the characteristics of this type of networking where it is simple, easy to implement and requires low memory.
Three methods based on this transformation, DCTav, DCTma and DCTah, have been investigated and applied to three different sets of images. The evaluation of simulation results, with different parameters, showed that the DCTma was the most appropriate method to integrate the imagery taken from sensory nodes supporting multimedia.
Wireless Sensor Networks (WSN) have applications in many different areas of life, such as health care, environmental monitoring, and military and economic areas and in industrial automation and many other applications.
The development of these net
works and the improvement of their performance occupy an important place of interest in research centers and specialized scientific institutes. The interest in these structures as a way to improve the performance of these networks leads to good results in this area. The cluster structure is one of the most important structures that have received increasing attention over recent years.
This research suggested a modification of the structure of the cluster tree WSN dividing clusters into sub-groups, and each group of these sub-groups operates like a tree from a small amount of nodes. The results that have been obtained by means of simulation indicate a significant improvement in terms of reducing energy consumption and thus an increase in the lifetime of the network, as compared to traditional cluster tree WSN. But that was at the expense of slightly lower rates of transmission and delivery ratio in the nodes of these networks. This leads us to recommend using this method to build the networks used to monitor protected agriculture and other networks with low transmission rates.
The location of wireless sensor nodes located in the center is necessary for applications
where information about the site is important information such as security, protection,
object tracking and other applications.
localization algorithms are c
lassified into two types: Range-based and Range-free. The
study focused on Range-free localization algorithms because they are less expensive in
terms of hardware requirements.
The MATLAB was used to simulate the algorithms, whose performance was evaluated by
changing the number of network nodes, the number of Anchor nodes, and the contract area
of communication in order to illustrate performance differences in terms of localization
error.
The results showed the superiority of the amorphous algorithm, achieving high localization
accuracy and lower cost for the number of Anchor nodes needed to achieve a small error.
Mobile Wireless Sensor Network (MWSN) is an emerging technology for attraction of
researchers with its research advantage and various application domains. Due to limited
resources of sensor nodes such as transmission power, communication capability
and
size of memory, data aggregation algorithms are the most practical technique that reduces
large amount of transmission in this network. Security is an important criterion to be
considered because, wireless sensor nodes are deployed in a remote or hostile
environment area that is prone to attacks easily. Therefore, security are essential issue
for MWSN to protect information against attacks.
In this research, we offered an algorithm of secure data aggregation in MWSN based on
pair-wise keys technology and hash function. We studied important parameters such as
execution time, end-to-end delay and number of storied keys. Results showed that
Wireless sensor networks (WSNs) are often deployed by random bestrewing
(airplane bestrewing for example). A majority of nodes cannot obtain their coordinate
beforehand. Therefore, how to obtain the position information of unknown nodes, which is
called localization problem, has become a hot topic in WSN.
Without position information, WSN cannot work properly. Global Position System
(GPS) is the most extensive and mature position system at present. But because the nodes
usually have the shortcoming of high expenditure, large volume, high cost and require
settled basal establishment, therefore, the GPS is inapplicable for the low-cost selfconfigure
sensor networks, and also it is impossible to install GPS for each sensor node. In
this paper, we will study localization mechanisms (which is not based on GPS) used in
WSN, and will test the effectiveness of using MUSIC algorithm in determining the signal
arrival angel depending on the SDMA- technology and ESPAR antenna.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
