Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPerformance Evaluation of Hierarchical Routing Protocols in Homogeneous and Heterogeneous Wireless Sensor Networks
تقييم أداء بروتوكولات التوجيه الهرمية في شبكات الحساسات اللاسلكية المتجانسة و المتباينة
3010
2 183
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
أدت كل من التكلفة المنخفضة و سهولة نشر شبكات الحساسات اللاسلكية إلى جعلها خياراً جذاباً للعديد من التطبيقات مثل تطبيقات مراقبة البيئة و التعقب في الزمن الحقيقي و الأمن و غيرها. و لكن في الواقع تتغذى عقد هذه الشبكات من البطاريات و تملك قيودا على الذاكرة , و عرض الحزمة المتاح , و القدرة على المعالجة, مما جعلها توصف بأنها شبكات ذات طبيعة مقيدة للموارد و هذا ما فرض مجموعة من التحديات على تصميم و أداء هذه الشبكات . إن سعة البطارية المحدودة في عقد الحساسات جعل موضوع استهلاك الطاقة بفعالية و كفاءة تحدٍ رئيسي في هذه الشبكات. لذا توجب على بروتوكولات التوجيه أن تستخدم الطاقة بفعالية بهدف إطالة عمر الشبكة . قمنا في هذه البحث بإجراء محاكاة لمجموعة من بروتوكولات التوجيه الهرمية و هي LEACH,SEP,DEEC,TEEN و تقييم أدائها مقارنة ببروتوكول النقل المباشر DT و ذلك في شبكات WSN المتجانسة و المتباينة باستخدام الماتلاب.
The low cost, ease of deployment has exposed WSNs an attractive choice for numerous applications,like environmental monitoring applications , security applications, real time tracking, and so on. But in reality, these networks are operated on battery with limitations in their computation capabilities, memory, bandwidth ,so they called networks with resource constrained nature, and this impels various challenges in its design and its performance. Limited battery capacity of sensor nodes makes energy efficiency a major and challenge problem in wireless sensor networks. Thus, the routing protocols for wireless sensor networks must be energy efficient in order to maximize the network lifetime. In this paper we simulated LEACH,SEP,DEEC,TEEN routing protocols and evaluated their performance by comparing with DT routing protocol in Homogeneous and Heterogeneous Wireless Sensor Networks on MATLAB.
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
Heinzelman,W. B.; Chandrakasan A. P.; Balakrishnan H. An applicationspecific protocol architecture for wireless microsensor networks . IEEE Trans on Wireless Communications, Vol. 1, No. 4, 2002, 660-670
rate research
Read More
In this PAPER, we perform a study and extensive comparative between
the well-known link quality estimators and CTP, a tree-based routing
protocol provided by TinyOS for different network topology and simulate
it using TOSSIM simulator to evaluate
the performance of these
estimators.
In this research we study some of the most Bio-inspired MAC
protocols widely used in WSNs. we select the protocols which
depends on ant colony optimization behavior (ACO), bee colony
optimization behavior (BCO) and particle swarm optimization.
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.
Routing protocols play an essential role in meeting the quality of service
requirements in the network, but achieving these requirements may require frequent send
and receive operations to build and maintain routing tables, which consume sensors
r
esource If we take into consideration the limitations of wireless sensor networks in terms
of the amount of available energy and storage capacity.
In this research a performance comparison of the on-demand Distance Vector
Routing protocol AODV and Hierarchical Routing protocolHR was carried out in terms of
the packet delivery and loose rate, delay and jitter, and the amount of expended energy in
the Wireless sensor network operates according to IEEE802.15.4 standard in cases where
some of sensors get out of work for limited periods of time.
The results showed that the hierarchical routing protocols perform better in terms of
delay time and transfer rate and the amount of consumed energy than on-demand Distance
Vector Routing protocol routing protocol, but suffer larger packet loss due to routing path
corruption as a result of sensors crashes.
Mobile wireless networks consist of a set of cooperative and
mobile nodes, each node can move randomly at a specific speed
in all directions without any control of a central manager. This type
of networks has become a hot research topic due to its
military
application and suitability for emergencies and natural disasters.
Due to the lack of fixed infrastructure, the routing process
becomes the major problem in this type of networks, where the
responsibility of routing is transferred to each node. Over the last
few years, a number of traditional routing protocols has been
proposed, but these protocols do not support quality of service in
different environments.
Some studies have improved some of these protocols to support
quality of service for specific environments. This research
identifies and analysis some of these improved protocols.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
