فهرست مقالات Sensor Networks

• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  1 - یک استراتژی شارژ چند هدفه تحت عدم قطعیت برای شبکه‌های حسگر قابل شارژ بی‌سیم از طریق بهینه¬سازی استقرار چند پهپاد به کمک الگوریتم فراابتکاری
  پیمان حبیبی گوران  حسنی فرد عبدالباقی قادرزاده آریز  نصرت پور
  در این مقاله، به ارائه یک رویکرد برنامه¬ریزی برای مسیر حرکت پهپادهای قابل شارژ و زمان¬بندی شارژ گره¬های حسگر تحت عدم قطعیت در میزان انتقال داده و مصرف انرژی در گره¬ها با کمک الگوریتم¬های شاهین¬ هریس و بهینه¬سازی مبتنی بر گرادیان پرداخته شده است. در این کار با در نظر گرف چکیده کامل

  در این مقاله، به ارائه یک رویکرد برنامه¬ریزی برای مسیر حرکت پهپادهای قابل شارژ و زمان¬بندی شارژ گره¬های حسگر تحت عدم قطعیت در میزان انتقال داده و مصرف انرژی در گره¬ها با کمک الگوریتم¬های شاهین¬ هریس و بهینه¬سازی مبتنی بر گرادیان پرداخته شده است. در این کار با در نظر گرفتن نابرابری¬ها و عدم قطعیت در محدودیت باتری و مصرف انرژی گره¬ها، استراتژی‌های زمان‌بندی جدید برای شبکه‌های حسگر قابل شارژ بی‌سیم به منظور افزایش توان عملیاتی شارژ و افزایش طول عمر شبکه ارائه شده است. در ابتدا با کمک اطلاعات موقعیت و انرژی باقیمانده گره¬ها، خوشه¬بندی گره¬ها به تعداد پهپادها توسط روش K-means ارائه شده است. سپس با توجه به تعریف تابع چندهدفه CUAV و به کمک الگوریتم¬های پیشنهادی، مسیریابی و زمان¬بندی شارژ هر یک از پهپادها از مبدا یکسان برنامه¬ریزی می¬شود. در تابع هدف تعریف شده تمام عدم قطعیت¬ها و نابرابری¬های شبکه برای تاخیر و مصرف انرژی و باتری گره¬ها لحاظ شده است. شبیه¬سازی تحت نرم¬افزار متلب انجام شد. نتایج نشان داد که روش پیشنهادی مبتنی بر روش بهینه¬سازی شاهین ¬هریس جواب¬های بهتری از لحاظ افزایش طول¬ عمر شبکه و کاهش تاخیر و بهینه¬سازی مصرف انرژی توسط پهپادها را حاصل کرده است. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  2 - An efficient solution for management of pre-distribution in wireless sensor networks
  Asghar Dolatabadi Hamid Haj Seyyed javadi
  A sensor node is composed of different parts including processing units, sensor, transmitter, receiver, and security unit. There are many nodes in a sensor unit. These networks can be used for military, industrial, medicine, environmental, house, and many other applicat چکیده کامل

  A sensor node is composed of different parts including processing units, sensor, transmitter, receiver, and security unit. There are many nodes in a sensor unit. These networks can be used for military, industrial, medicine, environmental, house, and many other applications. These nodes may be established in the lands of enemies to monitor the relations. Hence, it is important to consider conservation of communications, declaration, and key removal. The locations of nodes are not usually defined in the networks. When a secure connection is required they can be used by symmetrical or asymmetrical encodings. A node can just make secure connection, if they are in same radio range or have a common key. In dynamic wireless sensor networks compared with static networks the sensors are moveable and can be added or removed. This research makes an attempt to investigate the challenges of key management for encoding. It also tries to solve other remained problems in this field. Therefore, distribution and key management schemes supplying security and operational requirements of sensor networks are examined in fuzzy clustering and suitable protocol for key management. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  3 - Hybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
  Hamid Haj Seyyed Javadi Mohaddese Anzani
  Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish چکیده کامل

  Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ensures that either two neighboring nodes have a key in common from source to destination. Com-binatorial designs are powerful mathematical tools with comprehensive and simple structures. Recently, many researchers have used combinatorial designs as key pre-distribution scheme in wireless sensor networks. In this paper we consider a hybrid key pre-distribution scheme based on Balanced Incomplete Block Design. We consider a new approach for choosing key-rings in the hybrid symmetric design to improve the connectivity and resilience. Performance and security properties of the proposed scheme are studied both analytically and computationally. Theobtained results show that our scheme provides better resilience than symmetric design. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  4 - Coverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm
  Elaheh Radmehr HASSAN SHAKERI
  Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or con چکیده کامل

  Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.Coverage and network lifetime are major problems in WSNs so in order to address this difficulty we propose a combinational method consists of fuzzy-logic and genetic algorithms. The proposed scheme detects the coverage holes in the network and selects the most appropriate hole's neighbor to move towards the blank area and compensate the coverage loss with fuzzy-logic contribution and above node new coordinate is determined by genetic algorithm. As fuzzy-logic will be so effective if more than one factor influence on decision making and also genetic algorithms perform well in dynamic problems so our proposed solution results in fast, optimized and reliable output پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  5 - Routing Hole Handling Techniques for Wireless Sensor Networks: A Review
  Swathi B H Gururaj H L
  A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of چکیده کامل

  A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of anomalies due to some random deployment of nodes, obstruction and physical destructions. These anomalies can diminish the sensing and communication functionalities of the network. Many kinds of holes can be formed in a sensor network that creates geographically correlated areas. These holes are also responsible for creating communication voids. These voids do not let the packets to reach the destination and minimises the expected network performance. Hence it ought to be resolved. In this paper we presented different kinds of holes that infect the sensor network, their characteristics and the effects on successful communication within the sensor network .Later we presented a detailed review on different routing hole handing techniques available in literature ,their possible strengths and short comes. At last we also presented a qualitative comparison of these routing hole handing techniques. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  6 - Improving the security of wireless sensor networks using Game Theory
  Behzad Seif mohammad goodarzi
  Today, the use of wireless sensor networks has become very popular in many applications. Due to the connection in wireless sensor networks, it is done wirelessly, so they are naturally insecure and prone to various types of attacks. In the past, various solutions were o چکیده کامل

  Today, the use of wireless sensor networks has become very popular in many applications. Due to the connection in wireless sensor networks, it is done wirelessly, so they are naturally insecure and prone to various types of attacks. In the past, various solutions were offered in this regard, each of which had its problems. Therefore, in this proposed solution, an attempt was made to solve these problems. The proposed solution for securing sensor nodes uses authentication based on the ZKP protocol, which has been improved with Interlock, and game theory has also been used to more quickly identify intrusive nodes. One of the most important benefits of the proposed solution is to prevent attacks such as sleep deprivation. The proposed algorithm is able to detect quickly and is able to prevent network damage in the fastest possible time. The proposed solution was implemented and reviewed in MATLAB environment and the studies showed a very good performance of the proposed method. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  7 - A fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks
  Hamid Hassan Kashi Amir Masoud Rahamni Mehdi Hoseinzadeh Vahid Sadatpour
  In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields چکیده کامل

  In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields add to the routing packets and during routing and discovering of new routes, the lowest remained energy of nodes and route traffic based on the number of discarded packages, will store in this field as two variables. These two variables will be considered during choosing a suitable route for sending the data to that message which should be answered by sink. The efficiency of this protocol is based on the fact that, at the route request, it finds the routes with high energy and low traffic through which data are sent(information is sent).So data packets reach the destination with a higher probability and also the balance of energy consumption is considered in the network. From the energy point of view, not using weak nodes routes leads to not having off nodes at the end of the process. This fact affects balancing of energy consumption and reducing the variance of the energy remainder proportional to AODV model. Not using high traffic routes leads to reducing collision and sending fewer signaling packets; more data packets with lower delay reach the destination. In the case of high congestion, for meeting the desired reliability, which is among the main goals there may be more sending signaling packets, delay and collision. But this happens with sending more packets and a guaranteed reliability. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  8 - مروری بر تجمیع داده مبتنی بر سنجش فشرده در شبکه های حسگر بیسیم
  غلامرضا ایمانیان محمد علی پورمینا احمد صلاحی
  در این مقاله مروری، هدف ما توصیف پیشرفت های اخیر تکنیک جمع آوری داده مبتنی بر سنجش فشرده در شبکه های حسگر بی سیم شامل تلاشهای صورت گرفته در تحقیقات جاری، چالش ها و روندهای تحقیقاتی است. سیگنالهای تنک و قابل فشرده شدن در بسیاری از زمینه های کاربردی شبکه های حسگر مانند نظ چکیده کامل

  در این مقاله مروری، هدف ما توصیف پیشرفت های اخیر تکنیک جمع آوری داده مبتنی بر سنجش فشرده در شبکه های حسگر بی سیم شامل تلاشهای صورت گرفته در تحقیقات جاری، چالش ها و روندهای تحقیقاتی است. سیگنالهای تنک و قابل فشرده شدن در بسیاری از زمینه های کاربردی شبکه های حسگر مانند نظارت محیطی و مراقبت از وسایل نقلیه حضور دارند. سنجش فشرده واجد ویژگیهای فراوانی از قبیل سادگی عملیات سنجش و فشرده سازی، عمومیت در سیگنالهای جمع آوری شده و افت قابل قبول در کیفیت بازسازی سیگنال می باشد که آن را برای استفاده در شبکه های حسگر جذاب می سازد. ازدست رفتن بسته ها نیز تقریباً به اندازه پروتکل های دیگر به شبکه آسیب نمی رساند و فقط برای هر اندازه گیری که به چاهک نرسیده است باعث کمی افت در کیفیت بازسازی سیگنال خواهد شد. بحث را با مقدمه ای مختصر بر نظریه سنجش فشرده آغاز می کنیم و سپس استفاده از این تکنیک را در شبکه های حسگر بیسیم شرح می دهیم. در نهایت، مسائل و چالش های تحقیقاتی پیش رو مورد بحث قرار می گیرد تا چشم اندازی جهت تحقیقات آینده فراهم شود پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  9 - ارائه روشی ترکیبی هارمونی جهت مسیریابی پویا در شبکه‌های حسگر بیسیم
  فاطمه شبیه جلیل عظیم پور مرضیه دادور
  شبکه های حسگر بیسیم دارای تعداد زیادی گره حسگر با انرژی محدود می باشند که در یک منطقه محدود جغرافیایی پراکنده شده اند. با توجه به محدودیت منابع در شبکه های حسگر بیسیم، افزایش طول عمر این شبکه ها با کاهش مصرف انرژی همواره مورد توجه است. انرژی گره ها بیشتر برای ارسال اطلا چکیده کامل

  شبکه های حسگر بیسیم دارای تعداد زیادی گره حسگر با انرژی محدود می باشند که در یک منطقه محدود جغرافیایی پراکنده شده اند. با توجه به محدودیت منابع در شبکه های حسگر بیسیم، افزایش طول عمر این شبکه ها با کاهش مصرف انرژی همواره مورد توجه است. انرژی گره ها بیشتر برای ارسال اطلاعات به ایستگاه مرکزی مصرف می شود. در مسیریابی پی در پی بر مبنای خوشه‌بندی، این مسئولیت بر عهده سرخوشه ها است و این امر موجب افزایش مصرف انرژی در سرخوشه ها می شود. در سال‌های اخیر برای دیرتر تمام شدن انرژی سرخوشه ها، پروتکل های خوشه بندی و مسیریابی های زیادی پیشنهاد شده است. هدف این پژوهش، ترکیب خوشه‌بندی و مسیریابی در راستای افزایش طول عمر این نوع شبکه‌هاست. برای خوشه بندی از الگوریتم ژنتیک با تعداد خوشه های ثابت و برای مسیریابی از الگوریتم جستجوی هارمونی استفاده شده است. از آنجاییکه سرخوشه ها انرژی بیشتری نسبت به دیگر گره‌ها برای ارسال اطلاعات مصرف می کنند، هدف الگوریتم ژنتیک کاهش تعداد سرخوشه ها در جهت افزایش طول عمر شبکه می باشد. در سفارشی کردن الگوریتم جستجوی هارمونی برای مسیریابی، سه معیار همسایگی، کاهش مصرف انرژی و توزیع مناسب مصرف انرژی در نظر گرفته شده است. الگوریتم هارمونی پیشنهادی با برقراری توازن مناسب بین معیارهای ذکرشده باعث تولید مسیرهای بهینه‌تری خواهد شد. در نهایت تغییر سرخوشه ها در هر دور مسیریابی باعث ایجاد توازن مصرف انرژی بین گره های هر خوشه خواهد شد. نتایج حاصل شده از آزمایشات، حاکی از برتری 14/2% الگوریتم پیشنهادی در ارسال پیام و همچنین افزایش 84/24% طول عمر شبکه نسبت به پروتکل DEEC می‌باشد. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  10 - مسیریابی مبتنی بر اعتماد در شبکه های حسگر بی سیم با استفاده از منطق فازی
  حسین مومن زاده حقیقی فاطمه باوی مسعود اعتصامی
  شبکه‌های حسگر بی سیم، حوزه‌ی پرکاربردی از نسل های شبکه با پتانسیل بالا در محیط‌های غیرقابل پیش‌بینی و پویا است. با این حال، این شبکه‌ها به دلیل رسانه‌ی باز خود، توپولوژی در حال تغییر و پویا و الگوریتم‌های مسیریابی آن آسیب‌پذیر است . شبکه‌های موردی و شبکه‌های بی‌سیم ویژگ چکیده کامل

  شبکه‌های حسگر بی سیم، حوزه‌ی پرکاربردی از نسل های شبکه با پتانسیل بالا در محیط‌های غیرقابل پیش‌بینی و پویا است. با این حال، این شبکه‌ها به دلیل رسانه‌ی باز خود، توپولوژی در حال تغییر و پویا و الگوریتم‌های مسیریابی آن آسیب‌پذیر است . شبکه‌های موردی و شبکه‌های بی‌سیم ویژگی‌های مختلف مثل خود سازمان‌دهی پویا، خود پیکربندی، خود تصحیحی، نگه‌داری آسان، مقیاس‌پذیری بالا و سرویس‌های مطمئن را پشتیبانی می کند علیرغم ویژگی های بسیاری که ذکر شد، این شبکه بسیار در برابر خرابی ناشی از حملات مستعد است. عدم وجود یک سیستم کنترل مرکزی شاید مهمترین دلیل این ضعف شناخته شود. همچنین همبندی پویای شبکه امکان پیاده سازی مکانیسم های سلسله مراتبی امنیتی را از طراحان شبکه سلب می نماید..توسط راهکار های مبتنی بر اعتماد روشی را پیشنهاد می دهم که بتواند در برابر حملات تغییر ماهیت گره شبکه که به نوعی خطرناکترین حمله نیز در این حوزه محسوب می‌شود مقابله و شبکه را بازیابی کنم.از ویژگی‌های بارز این روش، سربار محاسباتی و اتلاف انرژی ناچیز از یک‌سو و مقابله و ترمیم آثار حملات صورت گرفته در شبکه است. راهکار و مکانیسم پیشنهادی با استفاده از نرم‌افزار شبیه‌ساز NS2 مورد ارزیابی قرارگرفته است. درصد خطای پایین روش پیشنهادی در تعیین میزان اعتماد یک گره در شبکه نکته بارز این مقاله است که توانسته است پس از بروز حمله گره‌های مخرب را تشخیص داده و با قرنطینه سازی آن‌ها از ادامه فعالیت آن‌ها جلوگیری کند. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  11 - صرفه‌جویی در مصرف انرژی شبکه های حسگر بی سیم با استفاده از پروتکل مسیریابی مبتنی بر خوشه بندی مسطح و الگوریتم های تکاملی
  مسعود نگهداری مرضیه دادور
  شبکه های حسگر بی سیم دارای تعداد زیادی گره های حسگر با انرژی محدود می باشند که در یک منطقه محدود پراکنده شده اند. بیشتر انرژی گره ها برای ارسال اطلاعات به ایستگاه مرکزی مصرف می شود. با توجه به محدودیت انرژی در این نوع شبکه ها، افزایش طول عمر با کاهش مصرف انرژی همواره مو چکیده کامل

  شبکه های حسگر بی سیم دارای تعداد زیادی گره های حسگر با انرژی محدود می باشند که در یک منطقه محدود پراکنده شده اند. بیشتر انرژی گره ها برای ارسال اطلاعات به ایستگاه مرکزی مصرف می شود. با توجه به محدودیت انرژی در این نوع شبکه ها، افزایش طول عمر با کاهش مصرف انرژی همواره مورد توجه بوده است. در این تحقیق، یک الگوریتم خوشه بندی سطحی مبتنی بر ژنتیک در راستای افزایش طول عمر این نوع شبکه ها ارائه شده است. در خوشه بندی سطحی پیشنهادی، ناحیه جغرافیایی با توجه به برد رادیویی به سه سطح تقسیم شده و خوشه بندی گره های هر سطح به صورت جداگانه انجام می شود. سرخوشه ها انرژی بیشتری نسبت به دیگر گره ها برای ارسال اطلاعات مصرف می کنند، لذا هدف الگوریتم پیشنهادی کاهش تعداد سرخوشه ها در جهت افزایش طول عمر شبکه است. در نهایت با تغییر سرخوشه ها در هر دور مسیریابی، توازن مصرف انرژی بیشتری بین گره ها به وجود می آید. نتایج حاصل شده از آزمایشات، حاکی از برتری الگوریتم پیشنهادی در ارسال پیام و طول عمر شبکه نسبت به سایر پروتکل های مشابه می باشد. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  12 - An Optimal Routing Protocol Using Multi-Objective Cultural Algorithm for Wireless Sensor Networks (ORPMCA)
  Seyed Reza Nabavi Mehdi Najafi
  10.52547/mjtd.10.2.79
  Wireless Sensor Networks (WSNs) is one of the most important types of networks in the world where sensors collect information within a specific area and send the data to a central point called the Base Station (BS). Many researchers have attempted to develop or improve چکیده کامل

  Wireless Sensor Networks (WSNs) is one of the most important types of networks in the world where sensors collect information within a specific area and send the data to a central point called the Base Station (BS). Many researchers have attempted to develop or improve the performance of WSNs by trying to mitigate the limitations and challenges facing WSNs. The most important challenge is to reduce energy consumption in a limited battery power supply of sensor nodes. Energy is consumed by sensor nodes in WSNs to perform three significant functions namely data sensing, transmitting and relaying. Various energy-saving routing protocols have been proposed to solve this problem to maintain the lifetime of the network for longer periods. In this paper, we propose an optimal routing protocol using multi-objective cultural algorithm for wireless sensor networks (ORPMCA). The simulation results showed that the ORPMCA protocol extends the lifetime of the WSN compared to other protocols by 15%. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  13 - Improved Cuckoo Search-based Clustering Protocol for Wireless Sensor Networks
  Hossein Sadeghian Mohammadreza Soltan Aghaei
  In most applications of intelligent networks equipped with wireless sensors, it is not possible to charge the nodes’ battery consistency and it is impossible under some conditions. Protocols designed for this type of networks should be energy efficient. The rapid consum چکیده کامل

  In most applications of intelligent networks equipped with wireless sensors, it is not possible to charge the nodes’ battery consistency and it is impossible under some conditions. Protocols designed for this type of networks should be energy efficient. The rapid consumption of battery power in wireless sensors and high power consumption in data transmission are two main challenges of this area. Nodes’ clustering is a natural way of categorizing nodes close together with the aim of using related data and removing plug-in data. However, existing clustering protocols are unbalanced in the term of energy consumption. The cluster heads are not distributed equally and overload clusters (with excess load) are much shorter than under-load clusters (low load). To solve this problem, an improved cuckoo search-based clustering algorithm (ICSCAS) has been proposed in present study. Also, performance evaluation of ICSCAS and its comparison with advanced clustering schemes in terms of total energy and residual energy consumption have been represented. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  14 - Improvement of Energy, Lifetime and Delays in Underwater Wireless Sensor Networks by Effective Deployment of Relay Nodes
  Reyhane Zehtabzadeh Reza Gholamrezayi
  ABSTRACT: According to the importance of underwater exploration, the attention of many researchers has been attracted to underwater sensor networks (UWSNs). Problems of UWSNs are large propagation delay, low bandwidth, and limited energy. Because of these reasons, in t چکیده کامل

  ABSTRACT: According to the importance of underwater exploration, the attention of many researchers has been attracted to underwater sensor networks (UWSNs). Problems of UWSNs are large propagation delay, low bandwidth, and limited energy. Because of these reasons, in this paper, we propose a new routing method in UWSNs that considers these factors and also achieves better load balancing in the network. In this method, relay nodes are used for routing. The relay nodes have a higher traffic load compared to the other nodes. They remove some burden from the overloaded nodes. The relay nodes shorten the transmission distance between source and destination. They have more energy compared to the other nodes. Our results show that the deployment of relay nodes in sensor networks helps to balance energy consumption and enhance the network lifetime. Nodes, after calculating the distance to the relay nodes and finding the nearest relay node, transmit packets to the nearest relay node for onetime immediately, so this method does not have holding time and it has less delay. The results are compared with DBR and CODBR. The results show that our method achieves more network lifetime, less delay and energy consumption compared to DBR and CODBR. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  15 - Fault Tolerance and Interference Aware Topology Control in Wireless Sensor Networks using NSGA-II
  Nahid Sarbandi Farahani Asad Vakili
  Research on topology control protocols in wireless sensor networks has often been designed with the goal of creating a dynamic topology and extensibility. The present study focuses on finding high quality paths, instead of minimizing the number of hops that can cause re چکیده کامل

  Research on topology control protocols in wireless sensor networks has often been designed with the goal of creating a dynamic topology and extensibility. The present study focuses on finding high quality paths, instead of minimizing the number of hops that can cause reduction of the received signal strength and maximizing the rate of loss. The purpose of this research is to create a topology control that focuses on reducing the fault and minimizing interference simultaneously. For this purpose, the fault rate and the degree of interference minimizing functions are modeled by using a two-objective genetic algorithm. Since the genetic algorithm is a revelation algorithm, the proposed method is compared in terms of convergence with similar algorithms. The obtained graphs show that the proposed algorithm has a good degree of convergence compared to similar models. The "runtime", "memory consumption" and "energy required to transmit the statement" are the variables used to compare with similar algorithms. By observing the obtained graphs, the proposed algorithm compared to similar methods, reduces the time needed for topology control and also it lowers the energy consumption, but is not able to reduce memory consumption for more packages. The main reason for conducting the test is the comparison of the quality of the routes created, which were executed in 20 different requests with the number of routes 5, 10 and 20. The quality of the routes produced by the proposed method has a 1% improvement over the SMG method and a 3% compared to the PSO method according to the route quality criteria. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  16 - Improving the Mean Time to Failure of the System with the New Architecture of the Main Node with the Replacement Node of Industrial Wireless Sensor Networks for Monitoring and Control using Markov Model
  Ahmadreza Zamani Mohammad Ali Pourmina Ramin Shaghaghi Kandovan
  10.30486/mjtd.2022.695924
  Industrial and physical site information is sent to the monitoring center by sensors in wireless sensor networks so that they can easily control the process of a company in order to improve the optimal performance of the system until the failure occurs to monitor and co چکیده کامل

  Industrial and physical site information is sent to the monitoring center by sensors in wireless sensor networks so that they can easily control the process of a company in order to improve the optimal performance of the system until the failure occurs to monitor and control in wireless sensor networks. Sensors are exposed to a wide range of failures, possible hardware and software problems in normal conditions, extreme weather conditions or other conditions caused by harsh physical environment in the field of sensors. Therefore, there is a possibility of unpredictable failure for all types of sensors and with Industrial process monitoring, preventive status monitoring, prevented error and fault and failures. The focus of this article is to present a new architecture in improving the correct performance of the system, the replacement rate of more damaged nodes and timely replacement, at the time of the starting point of the failure, the main sensor with spare ones or healthy sensors with faulty ones. The proposed network structure is such that the spare node is placed in parallel with the main node; this method makes it possible for the spare node to be replaced in case of failure of the main node, and the failed node can be quickly repaired and put in a standby mode. Our proposed model is analyzed in terms of the average time of correct system operation until failure known as mean time to failure. In this article is presented and studied and evaluated, a new architecture to improve network performance against failure using Markov model and state probability, and mean failure rate for node fault tolerance, before failure with timely replacement in wireless sensor network. In the proposed architecture, the results show a better improvement of the system's correct performance in order to reduce the adverse effects of errors and failures and improve fault tolerance. The simulation results show that the advantage of using this method reduces the adverse effects of errors and failures and improves the optimal performance of the system in the industrial site. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  17 - An Approach to Integrate Wireless Sensor Networks with Cloud Computing Technology in Medical Context
  Mohsen Norouzi Ali Arshaghi Mohsen Ashourian
  10.30486/mjtd.2023.1974423.1001
  Recently, with the advent of cloud computing technology and the growth of cell phone applications, the technology has been introduced as a solution for use in smart phones. Combining cloud computing and smart phones copes with such obstacles as performance including bat چکیده کامل

  Recently, with the advent of cloud computing technology and the growth of cell phone applications, the technology has been introduced as a solution for use in smart phones. Combining cloud computing and smart phones copes with such obstacles as performance including battery life time, storage capacity and bandwidth, environment as scalability and availability, and security like reliability and accessibility. Today, patient information collection processes require extensive analysis on the collected input data. In addition, this process has lots of errors, it is affordable and increases the time needed for access to the data. These conditions constrain effective monitoring and diagnostic capabilities by the hospitals. Unlike previous methods, data can be collected by devices such as Bluetooth and stored on a server in hospital. In this paper, a comprehensive research involves collecting data from patients and sending this data to a smart phone. Therefore, two algorithms were proposed for a list of physicians with the highest priority. Priority parameters are received by the hospitals server. These priorities include the initial weight, the weight indicating how busy the physician is, and the relationship between physician and patient's disease. Android application was simulated by Eclipse software. The application includes a diagnostic system that receives patient data and compared it with the reference table. If the patient's condition is not good, a short message is sent using two mentioned algorithms. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  18 - ارائه روشی جدید به منظور بهبود دادن مصرف انرژی در شبکه‌های حسگر دوربین بی‌سیم
  جواد بیات شیوا کریمی
  در چند سال اخیر، شبکه‌های حسگر بی‌سیم از زمینه¬های تحقیقاتی بسیار فعال بوده‌اند. با این حال، بیشتر حسگرهای مورد استفاده در توسعه این شبکه‌ها، حسگرهای معمولی و غیرتصویربرداری مانند صوتی، لرزه‌ای، دما، رطوبت و غیره بوده‌اند. در توسعه شبکه‌های حسگر دوربین بی‌سیم چالش‌های م چکیده کامل

  در چند سال اخیر، شبکه‌های حسگر بی‌سیم از زمینه¬های تحقیقاتی بسیار فعال بوده‌اند. با این حال، بیشتر حسگرهای مورد استفاده در توسعه این شبکه‌ها، حسگرهای معمولی و غیرتصویربرداری مانند صوتی، لرزه‌ای، دما، رطوبت و غیره بوده‌اند. در توسعه شبکه‌های حسگر دوربین بی‌سیم چالش‌های منحصر به¬فردی همانند نیاز به پهنای باند بالا، نیاز به تأخیر اندک برای پردازش، انرژی مصرفی بالا و کنترل در زمان واقعی وجود دارد. در این مقاله یک مدل پیشنهادی جدید برمبنای الگوریتم بهینه‌سازی شاهین هریس به منظور بهبود مصرف انرژی در شبکه‌های حسگر دوربین بی‌سیم پیشنهادشده¬است. الگوریتم بهینه‌سازی شاهین هریس یکی از الگوریتم‌های فراابتکاری است که در سال 2019 ابداع¬شده¬است. از الگوریتم بهینه‌سازی شاهین هریس برای تشکیل خوشه‌بندی بهینه استفاده می¬شود. هر بردار تولیدشده در الگوریتم بهینه‌سازی شاهین هریس برمبنای تابع برازندگی محاسبه¬می‌شود و بهینه‌ترین بردارها جهت خوشه‌بندی انتخاب¬می‌شوند. در مدل پیشنهادی به فاکتورهایی همانند فاصله درون¬خوشه‌ای و فاصله برون¬خوشه‌ای و انرژی مصرفی توجه¬شده¬است. ارزیابی‌ها در محیط با تعداد گره‌های مختلف نشان¬می‌دهد که مدل پیشنهادی در مقایسه با PADT و الگوریتم ژنتیک (GA) دارای کارایی بهتری بوده¬است. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  19 - ارائه یک رویکرد مدیریت اعتماد دو لایه در شبکه‌های حسگر بی‌سیم تعریف‌شده بر مبنای نرم‌افزار
  نوید محمد عبادتی اصفهانی مهرداد آشتیانی نسرین حمزه لو
  در شبکه‌های حسگر بی‌سیم نرم‌افزارمحور، امنیت و انرژی دو مسأله حیاتی هستند. ولی، پژوهش‌های کمی این دو جنبه را به طور همزمان ارائه کرده‌اند. با استقرار گسترده شبکه‌های حسگر و کاربرد این شبکه، مسائل امنیتی و مدیریت اعتماد، تبدیل به یک نگرانی اساسی می‌شود. در این تحقیق به ب چکیده کامل

  در شبکه‌های حسگر بی‌سیم نرم‌افزارمحور، امنیت و انرژی دو مسأله حیاتی هستند. ولی، پژوهش‌های کمی این دو جنبه را به طور همزمان ارائه کرده‌اند. با استقرار گسترده شبکه‌های حسگر و کاربرد این شبکه، مسائل امنیتی و مدیریت اعتماد، تبدیل به یک نگرانی اساسی می‌شود. در این تحقیق به بررسی چالش‌های امنیتی در شبکه‌های حسگر بی‌سیم مبتنی بر نرم‌افزار تعریف‌شده پرداخته شده است. در این پژوهش به حسگرهایی پرداخته‌شده که برای حفظ انرژی خود، به گره خودخواه تبدیل شده و از دریافت و یا ارسال داده‌ها خودداری می‌کنند. اعتماد به این گونه گره‌ها از طریق چهار معیار صداقت، صمیمیت، انرژی و تواضع مورد بحث قرار گرفته است. در این راستا، از ترکیب دو الگوریتم k-means و kNN، خوشه‌بندی بر اساس تعداد حسگرهای به کار گرفته‌شده توسط شبکه تعریف‌شده نرم‌افزاری، انجام و سپس مسیریابی بهینه بر اساس مصرف انرژی و با اولویت اعتماد صورت می‌پذیرد. سپس شبیه‌سازی در سه سناریو تعریف شده‌ ۵۰، ۱۰۰ و ۲۰۰ حسگر توزیع‌شده به صورت اتفاقی پیاده‌سازی شده است. همچنین برخی از روش‌های ایمن برای دستیابی به امنیت در شبکه‌های حسگر بی‌سیم توضیح داده شده و در آخر رویکرد یکپارچه پیشنهادی مبتنی بر اعتماد برای تأمین امنیت شبکه‌های حسگر ارائه گردیده است. نتایج این تحقیق نشان می‌دهد که مدل پیشنهادی با توجه به ایجاد اعتماد، توانسته مصرف انرژی بهینه‌ای نیز داشته باشد. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  20 - Increasing Lifetime Using Whale Optimization Routing Algorithm in Wireless Sensor Networks
  Hassan Nouri Esmaeil Zeinali
  Following the development of wireless sensor networks, the need to design a low-waste, scalable, and long-life network is felt more than ever. Clustering and routing are widely used to minimize energy consumption and increase network lifetime, as important issues in wir چکیده کامل

  Following the development of wireless sensor networks, the need to design a low-waste, scalable, and long-life network is felt more than ever. Clustering and routing are widely used to minimize energy consumption and increase network lifetime, as important issues in wireless sensor networks. Since, in these networks, the largest amount of energy is spent on sending and receiving the data, the clustering technique done by collecting data on cluster heads has been found to influence the overall network performance; along with this, routine and efficient routing has also found to improve the network throughput. Therefore, multi-hop routing can increase the network lifetime and reduce the energy consumption by sensor nodes. In this paper, the main approach was using the mobile sinks attached to the public transportation vehicles, such as the bus to collect data in wireless sensor networks. The proposed protocol used multi-hop routing as well as Whale Optimization Algorithm to select cluster heads based on a fitness function, in which the amount of the remaining energy of the sensor nodes and the sum of the remaining energy of the adjacent sensor nodes were taken into account. Adopting this approach created a balance in the amount of energy consumption in sensor nodes. The proposed protocol was studied to validate the results obtained for the network lifetime and energy consumption. Independent and consecutive simulation results and statistical analysis indicates the superiority of the proposed protocol compared to other protocols. Also, the network lifetime improved by averagely 20% and the energy consumption reduced about 25% during the network activity. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  21 - A Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node
  Fereydoon Abdi Abolfazl Toroghi Haghighat
  Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In t چکیده کامل

  Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator technique, which reduces average localization errors and execution time. Satisfactory simulation results and also comparison of localization errors and execution time between our scheme and similar previous schemes depicts the efficiency of proposed method against previous schemes. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  22 - A Novel Ensemble Approach for Anomaly Detection in Wireless Sensor Networks Using Time-overlapped Sliding Windows
  Zahra Malmir Mohammad Hossein Rezvani
  One of the most important issues concerning the sensor data in the Wireless Sensor Networks (WSNs) is the unexpected data which are acquired from the sensors. Today, there are numerous approaches for detecting anomalies in the WSNs, most of which are based on machine le چکیده کامل

  One of the most important issues concerning the sensor data in the Wireless Sensor Networks (WSNs) is the unexpected data which are acquired from the sensors. Today, there are numerous approaches for detecting anomalies in the WSNs, most of which are based on machine learning methods. In this research, we present a heuristic method based on the concept of “ensemble of classifiers” of data mining. Our proposed algorithm, at first applies a fuzzy clustering approach using the well-known C-means clustering method to create the clusters. In the classification step, we created some base classifiers, each of which utilizes the data of overlapping windows to utilize the correlation among data over time by creating time-overlapped batches of data. By aggregating these batches, the classifier proceeds to find an appropriate label for future incoming instance. The concept of “Ensemble of Classifiers” with majority voting scheme has been used in order to combine the judgment of all classifiers. The results of our implementation with MATLAB toolboxes shows that the proposed majority-based ensemble learning method attains more efficiency compared to the case of the single classifier method. Our proposed method enhances the performance of the system in terms of major criteria such as False Positive Rate, True Positive Rate, False Negative Rate, True Negative Rate, Sensitivity, Specificity and also the ROC curve. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  23 - Cluster-head Election in Wireless Sensor Networks Using Fuzzy Logic
  Hamid Reza Bakhshi Maryam Benabbas
  A wireless sensor network consists of many inexpensive sensor nodes that can be used toconfidently extract data from the environment .Nodes are organized into clusters and in each cluster all non-cluster nodes transmit their data only to the cluster-head .The cluster-he چکیده کامل

  A wireless sensor network consists of many inexpensive sensor nodes that can be used toconfidently extract data from the environment .Nodes are organized into clusters and in each cluster all non-cluster nodes transmit their data only to the cluster-head .The cluster-head transmits all received data to the base station .Because of energy limitation in sensor nodes and energy reduction in each data transmission, appropriate cluster-head election can significantly reduce energy consumption and enhance the life time of the network .In the proposed algorithm, a modified fuzzy logic approach is presented in order to improve the cluster-head election based on four descriptors energy, concentration, centrality and distance to base station .Cluster-head is elected by the base station in each round by calculating the chance each node has to elect as a cluster-head by considering descriptors .Network life time is evaluated based on first node dies metric, so energy depletion of one node causes the network to die .Simulation shows that theproposed algorithm can effectively increase the network life time .Sensor network is also simulated when sensor nodes move with random velocity in random direction in each round .Simulation shows that network life time is increased by considering this assumption in the proposed algorithm and can develop a better performance. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  24 - Improving Energy-Efficient Target Coverage in Visual Sensor Networks
  Behrooz Shahrokhzadeh Mehdi Dehghan MohammadReza Shahrokhzadeh
  Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) prob چکیده کامل

  Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) algorithm that divides the sensors’ Field-of-View (FoV) to a number of cover sets and then applies a sleep-wake schedule for cover sets. We also identify the best possible FoV of sensors according to the targets’ location using rotating cameras, to reduce the solution space and approaching to a near-optimal solution. Our proposed energy and neighbor generating functions of the SA result in a balanced distribution of energy consumption as well as escaping from local optima. We conduct some simulation experiments to evaluate the performance of our proposed method by comparing with some well-known solutions in the literature. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  25 - A Genetic-based Algorithm to Solve Priority-based ‎Target Coverage Problem in Directional Sensor ‎Networks
  Leila Ajam Ali Nodehi Hosein Mohamadi
  The Directional Sensor Networks (DSNs) have recently drawn considerable attention with respect to their extensive applications in various situations. In this regard, covering a set of targets in a specific region while maximizing network lifetime is considered as a majo چکیده کامل

  The Directional Sensor Networks (DSNs) have recently drawn considerable attention with respect to their extensive applications in various situations. In this regard, covering a set of targets in a specific region while maximizing network lifetime is considered as a major problem related to the DSN, which is resulted from limitation in sensing angle and battery power of directional sensors. The problem gets more challenging when the targets have different coverage quality requirements. In the present study, this problem is referred to as Priority-based Target Coverage (PTC) that has been proved to be an NP-complete problem. In this regard, a genetic-based algorithm along with a repair operator is developed, which is able to select a proper subset of directional sensors for providing the coverage quality requirements for all targets. In order to evaluate the performance of the proposed algorithm, several experiments were performed and the results were compared to those of another algorithms already introduced to literature. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  26 - A Cutting-edge Metaheuristic Approach Based on ‎The Manifold Distance for Energy-efficient Clustering ‎in WSN
  Faraein Aeini
  This paper presents the development of a new algorithm called F-MPSO, which aims to enhance energy efficiency and extend the lifetime of wireless sensor networks. The F-MPSO algorithm aims to optimize the selection of cluster heads, which is a problem that falls under t چکیده کامل

  This paper presents the development of a new algorithm called F-MPSO, which aims to enhance energy efficiency and extend the lifetime of wireless sensor networks. The F-MPSO algorithm aims to optimize the selection of cluster heads, which is a problem that falls under the category of Non-Deterministic Polynomial (NP)-hard problems. To address this challenge, a hybrid metaheuristic approach has been implemented using manifold distance to cluster the sensor nodes. We recommend using a combination of the Firefly approach for local updates and the PSO approach for global updates to create a reliable cluster. Our strategy aims to improve the overall lifespan of the network. We use a metric that takes into account the different routes available and gives preference to paths that go through intermediate sensors with high residual energy, rather than simply selecting the shortest distance between a regular node and cluster heads with low residual energy. Based on the analysis conducted using Matlab, it has been determined that the F-MPSO algorithm proposed is highly efficient regarding energy consumption. Additionally, it has been deemed successful in extending the network lifetime. Results from round 1600 indicate that the proposed method had approximately 78 still operational nodes. On the other hand, Leach's algorithm had no live nodes, while enhanced-LEACH and ESO_LEACH had 25 and 53 live nodes, respectively. Furthermore, the author has compared the results with previous algorithms, and the outcome shows excellent promise. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  27 - مسیریابی شبکه های حسگر بی سیم با استفاده از خوشه بندی مبتنی بر الگوریتم بهینه سازی ازدحام ذرات چندهدفه
  سید رضا نبوی نفیسه اوسطی عراقی جواد اکبری ترکستانی
  در سال های اخیر، با گسترش کاربردهای شبکه های حسگر بی سیم، بهره‌برداری از این نوع شبکه ها به منظور رسیدگی بر محیط و تحلیل داده های جمع آوری شده از محیط های خاص و متنوع بسیار رواج یافته است. شبکه های حسگر بی سیم با توجه به سهولت پیکربندی و عدم نیاز به تجهیزات گران چکیده کامل

  در سال های اخیر، با گسترش کاربردهای شبکه های حسگر بی سیم، بهره‌برداری از این نوع شبکه ها به منظور رسیدگی بر محیط و تحلیل داده های جمع آوری شده از محیط های خاص و متنوع بسیار رواج یافته است. شبکه های حسگر بی سیم با توجه به سهولت پیکربندی و عدم نیاز به تجهیزات گران قیمت، یکی از بهترین گزینه ها برای جمع آوری داده ها از محیط هستند. انرژی گره های حسگر در شبکه های حسگر بی سیم محدود است که با توجه به عدم وجود منبع شارژ ثابت یکی از چالش های اساسی است که با آن مواجه می‌شویم. از آن جایی که بیشترین مقدار انرژی گره ها در طی انتقال داده ها اتلاف می شود، گره ای که بیشتر از بقیه به انتقال داده ها بپردازد و یا بسته های داده ای را در فواصل طولانی انتقال دهد، انرژی آن زودتر از بقیه به اتمام می رسد. با اتمام انرژی یک حسگر در شبکه ممکن است در روند کار شبکه اختلال ایجاد شود. بنابراین، با توجه به توپولوژی پویا و طبیعت توزیع‌شده شبکه‌های حسگر بی‌سیم، طراحی پروتکل‌های انرژی کارآمد برای مسیریابی یکی از چالش‌های اصلی است. ازاین‌رو در این مقاله پروتکل مسیریابی آگاه از انرژی براساس الگوریتم بهینه سازی ازدحام ذرات چندهدفه ارائه شده است. در رویکرد پیشنهادی تابع شایستگی الگوریتم بهینه سازی ازدحام ذرات برای انتخاب گره سرخوشه بهینه براساس هدف های کیفیت خدمات شامل انرژی باقیمانده، کیفیت پیوند، تأخیر انتها به انتها و نرخ تحویل استفاده شده است. نتایج شبیه سازی نشان می دهد روش پیشنهادی با توجه به ایجاد توازن در اهداف معیارهای کیفیت خدمات، نسبت به سایر روش های موجود اتلاف انرژی کمتر و طول عمر بیشتری دارد. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  28 - یک روش مسیریابی جهت ردیابی هدف متحرک با رویکرد کاهش انرژی مصرفی
  مریم حسن حسینی فرهاد مصری نژاد همایون مهدوی نسب
  امروزه شبکه حسگر بی سیم در زمینه های فراوان و متنوعی کاربرد دارد. از جمله این کاربردها استفاده از این مدل شبکه با تعداد زیادی از گره‌‌های حسگر در زمینه ردیابی هدف مانند ردیابی دشمنان در جنگ و نظارت بر زیستگاه های حیات وحش است. ایده اصلی در بحث ردیابی هدف این است که اطل چکیده کامل

  امروزه شبکه حسگر بی سیم در زمینه های فراوان و متنوعی کاربرد دارد. از جمله این کاربردها استفاده از این مدل شبکه با تعداد زیادی از گره‌‌های حسگر در زمینه ردیابی هدف مانند ردیابی دشمنان در جنگ و نظارت بر زیستگاه های حیات وحش است. ایده اصلی در بحث ردیابی هدف این است که اطلاعاتی مانند مکان، سرعت و جهت حرکت هدف در هر لحظه در دسترس باشد. از آنجایی که گره‌‌های حسگر در این مدل شبکه دارای محدودیت شدید مصرف انرژی بوده و قابلیت شارژ مجدد را ندارند، در این مقاله یک الگوریتم کارآمد ردیابی به منظور کاهش مصرف انرژی ضمن حفظ کیفیت ردیابی هدف، به نام EAASA، ارائه شده است. نتایج حاصل از شبیه سازی این الگوریتم در شبیه ساز NS2 با روش ردیابی هدف مبتنی بر خوشه بندی AASA (الگوریتم فعال سازی حسگر تطبیقی مبتنی بر حراج) مقایسه شده و نشان می دهد که الگوریتم پیشنهادی می تواند با حفظ کیفیت ردیابی به صورت چشم گیری مصرف انرژی را کاهش دهد. این امر باعث افزایش طول عمر شبکه و کاهش نرخ از دست رفتن هدف شده است. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  29 - A High Performance and Secure Way to Time Synchronization in Wireless Sensor Network
  Mehdi Bagherizadeh Rezvan Kazemi
  Time synchronization protocols, because of having many applications in WSN have been highly regarded. Thesynchronization protocols which act in a distributed way and globally have been more considered. In addition, these algorithms are improving toward becoming secure a چکیده کامل

  Time synchronization protocols, because of having many applications in WSN have been highly regarded. Thesynchronization protocols which act in a distributed way and globally have been more considered. In addition, these algorithms are improving toward becoming secure and having a high applicability. This article presents the proposed algorithm with respect malicious nodes to provide a secure distributed and global time synchronization protocol. Methods of encryption, authentication and hashing don’t have a high performance because of high overhead for the synchronization. In this proposed algorithm the previously used methods, like authentication and encryption are not used, but instead the algorithm by applying mechanisms within itself takes into account the corrupted and malicious nodes and does the time synchronization in a distributed way and globally. Finally, the gained results of the simulation in terms of the deviation average of the standard criterion, the time and computational and memory overheads are considered and the applicability of the proposed algorithm will be realized. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  30 - An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
  Meisam Kamarei Ghasem Kamarei Zohreh Shahsavari
  This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition af چکیده کامل

  This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor nodes. However, packet broadcasting leads to increase in the network congestion as well as the network energy consumption. In this regard, this paper proposes an efficient routing algorithm to control number of packets broadcasting. The proposed algorithm declares the mobile data collector new location to sensor nodes within a special area. Special area has been considered around of the mobile data collector. Therefore, the proposed routing algorithm does not permit packets reaching to this special area. Indeed, the proposed algorithm directs data toward the mobile data collector by boundary sensor nodes. In fact, the proposed algorithm considers sensor nodes within special area have more traffic and energy consumption than other sensor nodes. Simulation results that have been implemented in ns-2 show the proposed algorithm increases the network lifetime as well as the sensor nodes energy consumption balancing. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  31 - Improve range-free localization accuracy in wireless sensor network using DV-hop and zoning
  Fahimeh Doagoey
  In recent years, wireless sensor networks have drawn great attention. This type of network is composed of a large number of sensor nodes which are able to sense, process and communicate. Besides, they are used in various fields such as emergency relief in disasters, mon چکیده کامل

  In recent years, wireless sensor networks have drawn great attention. This type of network is composed of a large number of sensor nodes which are able to sense, process and communicate. Besides, they are used in various fields such as emergency relief in disasters, monitoring the environment, military affairs and etc. Sensor nodes collect environmental data by using their sensors and send them to the base station. Localization in the sensor nodes is an important operation of wireless sensor networks. Thus, data generated by the sensor nodes should also show the position of the node. Hence, a reliable localization algorithm is always necessary. Regarding the localization methods, range-based methods are fairly accurate to estimate the nodes and they estimate the node location. To ensure the accuracy of the obtained range, a range-free method namely distance vector routing has been investigated in this study. Some nodes which benefit from conscious coordinates and help other nodes to estimate their coordinates are called anchor nodes. The present study have used zoning and estimated coordinates of the nodes in each zone to improve localization and it tried to upgrade the accuracy of vector routing localization. The proposed method consists of two steps which in the first step, localization of each node are calculated by DV-hop. In the next step, the estimated coordinates is reformed using zoning method. Simulation results will show that the proposed algorithm is efficient and robust.The proposed method increases the localization accuracy. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  32 - Representing a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors
  Nasrin Elyasi Omid Pourgalehdari
  Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send چکیده کامل

  Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance in terms of increasing longevity and preservation network coverage as compared to other routine methods. Their main purpose is to control the danger area and transfer data to a sink. Therefore, connecting to sensor networks and coverage rate of controlled area is one of the most important concerns to achieve these goals. In this paper, to cluster wireless sensor networks, a method using the Imperialistcompetitive evolutionary algorithm is purposed that divides wireless sensor nodes into balanced clusters, in addition to, several mobile robots has been used for improving power dissipation of network, to assist in the transmission of sensor networks and improve network connectivity and coverage rate of the controlled area. In this research, the sensor network is based on an islets-based topology that has been used robots to detect and enhance connectivity and cover cavities that are largely around the sensors. The simulation results show that our new model can greatly improve the network coverage connectivity criteria. The simulation results show its successful performance in increasing longevity of the wireless sensor network. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  33 - Localization of Underwater Wireless Sensor Network Nodes Using Cuckoo Optimization Algorithm
  Leila Falahatpisheh
  Underwater Wireless Sensor Networks (UWSNs) are considered as wireless sensor networks whose main task is to sense underwater events and send information to the sink. This information becomes valuable when the exact location of the occurrence is known. Generally, underw چکیده کامل

  Underwater Wireless Sensor Networks (UWSNs) are considered as wireless sensor networks whose main task is to sense underwater events and send information to the sink. This information becomes valuable when the exact location of the occurrence is known. Generally, underwater sensor nodes are not equipped with devices such as the Global Position System (GPS) with the purpose of reducing network costs. Therefore, finding the location of the nodes should be done using another exact method. In this paper, we intend to find the location of the underwater sensor nodes by introducing a new method based on the Cuckoo Optimization Algorithm (COA).We will compare the proposed method with the related methods in terms of the localization error rate and the number of nodes discovered. The results of the comparisons show that the proposed method can greatly reduce the error rate of the localization of the sensor nodes. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  34 - A New Greedy Geographical Routing in Wireless Sensor Networks
  Majid Hatamian Hamid Barati Ali Movaghar
  Wireless sensor network includes a large number of nodes which are distributed in a geographical location. The essential fact about WSN is that energy of nodes is limited. Therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of چکیده کامل

  Wireless sensor network includes a large number of nodes which are distributed in a geographical location. The essential fact about WSN is that energy of nodes is limited. Therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. In this paper we propose a method which performs routing in WSNs using greedy approach. It is able to choose optimum rout based on energy level and distance. Since our method tries to equally utilize energy of different nodes, it will eventually result in lifetime increase. In addition to modifying energy consumption, simulation results show that proposed algorithm achieves considerable improvement in reduction of end-to-end delay and increase in packet delivery rate. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  35 - An Efficient Protocol for Data Aggregation In Wireless Sensor Networks
  Mohammad Karim Sohrabi Elahe Khorramian
  Sensor networks generally consist of a very great number of sensor nodes which will be spread into a vast environment and aggregate data out of it. The sensor nodes are afflicted with some limitations as follows memory, reception, communication as well as calculation ca چکیده کامل

  Sensor networks generally consist of a very great number of sensor nodes which will be spread into a vast environment and aggregate data out of it. The sensor nodes are afflicted with some limitations as follows memory, reception, communication as well as calculation capability, and battery power. The transmission of a great amount of extra data increases data transmission and proportionally increases the amount of energy and bandwidth for the data transmission. One solution for this issue is data aggregation. The results of aggregated data influence the accuracy and precision of the final result already gleaned from the base station. The main challenge in such networks is how to further elongate the network lifetime and among the factors doing so is the energy consumption or energy optimization. The clustering is one apt method in place for furthering the network life span. Respectively the clustering protocols have come up with a suitable method for the so called challenge or more simply put increasing the lifetime. In this paper the researchers attempt to bring forth yet another efficient protocol for data aggregation hinging around clustering which uses maximum residual energy and minimum distance for selecting the cluster-head to reduce the consumption of energy. The experimental results point to this very fact that Energy-Efficient Clustering Algorithm through Residual Energy and Average Distance (EECA-READ) attains very good performance. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  36 - Proposing a Novel Algorithm for Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
  Hamid Barati Mohsen Sedighi Ali Movaghar Iman Attarzadeh
  Wireless sensor networks are composed of hundreds or thousands of small nodes called sensor that work together and are associated with a specific task or tasks to do. Each of these nodes includes sensor, processor, communication components, a small memory and a source o چکیده کامل

  Wireless sensor networks are composed of hundreds or thousands of small nodes called sensor that work together and are associated with a specific task or tasks to do. Each of these nodes includes sensor, processor, communication components, a small memory and a source of energy.It is expected that wireless sensor networks will be used widely in many applications in near future. Scalability and lifetime extension in wireless sensor networks are critical issues in designing and implementing a wireless Sensor Network (WSN).Relay Nodes (RNs) in WSN are nodes with higher useful power and radius, which considered as head of network. RNs are able to disseminate data in a higher level, network clusters, and network regions. In this paper, a novel algorithm is proposed to cover all sensor nodes with the least possible RNs. The number of RNs can be calculated through a proposed mathematical function which has the maximum rate of detection. The proposed approach shows high capability for fault tolerance in WSN when compared to other algorithms. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  37 - Time Slot Allocation Algorithm Based On TDMA Protocol In Wireless Sensor Networks
  Somayeh Rahmani Ahmad Khademzadeh Amir Masoud Eftekhari Moghadam
  In recent years, many researchers have been done in the area of wireless sensor networks that has led to the variety of algorithms and methods for the collection and transmission of environment information; but still many challenges faced by wireless sensor networks usi چکیده کامل

  In recent years, many researchers have been done in the area of wireless sensor networks that has led to the variety of algorithms and methods for the collection and transmission of environment information; but still many challenges faced by wireless sensor networks using methodologies are applied in various fields. Such as Media Access Control that due to the media being shared on these networks, there is a possibility of collision and data loss. Since the retransmission increases network latency and consequently reduces network energy, therefore various solutions have been proposed for media access control that their main purpose is media access control and prevention of collisions. Hence media access control protocols requirement, more and more felt. In this study, a free collision algorithm with the acceptable ability to media access channel is presented in which we have tried to reduce the number of time slots and increase the network throughput as much as possible. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  38 - MAC Protocols in Underwater Wireless Sensor Networks: Issues and Simulations
  Reza Mohammadi Seyyed Yahya Nabavi Reza Javidan
  Underwater Acoustic Wireless Sensor Network (UAWSN) use acoustic signals to transmit data. Acoustic signals in underwater environment have high bit error rate, long propagation delay and limited bandwidth. Another constraint in UWASN is energy. Due to these constraints, چکیده کامل

  Underwater Acoustic Wireless Sensor Network (UAWSN) use acoustic signals to transmit data. Acoustic signals in underwater environment have high bit error rate, long propagation delay and limited bandwidth. Another constraint in UWASN is energy. Due to these constraints, design of energy and bandwidth efficient and propagation delay aware MAC protocol is a great challenge in UWASN. Underwater sensor nodes have to share medium. The main role of the MAC layer protocol is to decide when a node accesses a shared medium and to resolve any conflicts between nodes. In this paper, we evaluate the performance of three famous underwater MAC protocols UWAN-MAC[1], R-MAC[2] and Slotted FAMA[3] in terms of packet drop rate, throughput and energy consumption. We have used Aquasim simulator to evaluate MAC protocols. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  39 - Coverage Improvement Using GLA (Genetic Learning Automata) Algorithm in Wireless Sensor Networks
  Shirin Khezri Amjad Osmani Behdis Eslamnour
  Coverage improvement is one of the main problems in wireless sensor networks. Given a finite number of sensors, improvement of the sensor deployment will provide sufficient sensor coverage and save cost of sensors for locating in grid points. For achieving good coverage چکیده کامل

  Coverage improvement is one of the main problems in wireless sensor networks. Given a finite number of sensors, improvement of the sensor deployment will provide sufficient sensor coverage and save cost of sensors for locating in grid points. For achieving good coverage, the sensors should be placed in adequate places. This paper uses the genetic and learning automata as intelligent methods for solving the blanket sensor placement. In this paper an NP-complete problem for arbitrary sensor fields is described which is one of the most important issues in the research fields, so the proposed algorithm is going to solve this problem by considering two factors: first, the complete coverage and second, the minimum used sensors. The proposed method is examined in different areas using MATLAB. The results confirm the successes of using this new method in sensor placement; also they show that the new method is more efficient than other methods like FAPBIL and MDPSO in large areas پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  40 - A Routing Algorithm based on Fuzzy Clustering and Minimum Cost Tree (FCMCT) in Wireless Sensor Network
  Maryam Javaherian Abolfazl T.Haghighat
  Nowadays, wireless sensor network has been of interest to investigators and the greatest challenge in this part is the limited energy of sensors. Sensors usually are in the harsh environments and transit in these environments is hard and impossible and moreover the node چکیده کامل

  Nowadays, wireless sensor network has been of interest to investigators and the greatest challenge in this part is the limited energy of sensors. Sensors usually are in the harsh environments and transit in these environments is hard and impossible and moreover the nodes use non- replaceable batteries. Because of this, saving energy is very important. In this paper we tried to decrease hard and complex computing with using soft computing such as fuzzy logic and we used it in cluster head selection part. Hard and complex computing can waist energy, because of this, we used some techniques to solve this problem. Minimum cost tree (MCT) helps to find minimum path, so we used this technique for intra cluster routing and again more over we used distributed source coding (DSC) technique for aggregating data. Finally all of methods could reduce energy consumption and increased network lifetime. Proposed algorithm is called FCMCT and simulation and results show improvement. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  41 - Optimization of Mobile Base Station Placement to Reduce Energy Consumption in Multi-hop Wireless Sensor Network
  Gholamreza Farahani Ameneh Farahani
  Nowadays, wireless sensor networks (WSNs) are widely used in different sectors. The problem in these networks is the non-rechargeable batteries of these sensors, which limit the lifetime of the network. Therefore, the optimal energy consumption of sensors is an open res چکیده کامل

  Nowadays, wireless sensor networks (WSNs) are widely used in different sectors. The problem in these networks is the non-rechargeable batteries of these sensors, which limit the lifetime of the network. Therefore, the optimal energy consumption of sensors is an open research topic. In this paper, a new algorithm with the Development of Genetic Algorithm with the Floyd Warshall (DGAFW) has been proposed. Using the proposed DGAFW algorithm, the number of clusters and nodes assigned to each cluster is first determined with the Floyd Warshall algorithm and then the Cluster Head (CH) is selected using fuzzy logic. Finally, the optimal placement of the base station is specified by the combination of the Genetic Algorithm and the Floyd Warshall. The DGAFW algorithm is based on minimizing the distance of sending multi-hop messages. The simulation is carried out in MATLAB 2023a online software. The simulation results obtained from the DGAFW algorithm have been compared based on the distance, the amount of remaining energy in each round, and the number of rounds of network activity in the case where the location of the base station is fixed or randomly determined in each round. The results obtained show that the DGAFW algorithm compared to the case of random base station and fixed station respectively, has 12.7% and 14.3% shorter average message-sending distance in each round, 14.7% and 19.1% more residual energy and also 36% and 48% more rounds of network activity. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  42 - An Energy-Efficient Fuzzy Logic-based Fault-Tolerant Routing Protocol for Wireless Sensor Networks
  Alireza Allahverdi Mamaghani Shayesteh Tabatabaei Mohammad Reza Ebrahimi Dishabi
  Routing with energy consideration has paid enormous attention in the field of wireless sensor networks (WSNs). Aiming at maximizing network lifetime in WSNs, most studies focus on min-imizing energy consumption. Energy is consumed by sensor nodes to perform three import چکیده کامل

  Routing with energy consideration has paid enormous attention in the field of wireless sensor networks (WSNs). Aiming at maximizing network lifetime in WSNs, most studies focus on min-imizing energy consumption. Energy is consumed by sensor nodes to perform three important functions such as data sensing, transmitting, and relaying. Also, event-driven WSN applications require minimum end-to-end delay and medium access delay. This paper proposes an energy-efficient fuzzy logic-based fault-tolerant routing protocol (EEFRP) for routing in WSN and min-imizing the energy consumption to a large extent. EEFRP takes two important parameters “resid-ual energy” and “hop-count” into consideration. Simulation results demonstrated that the pro-posed algorithm could achieve better performance in comparison with IEEE 802.15.4 original protocol in terms of end-to-end delay, medium access delay, and fault tolerance, particularly in node failure cases.Routing with energy consideration has paid enormous attention in the field of wireless sensor networks (WSNs). Aiming at maximizing network lifetime in WSNs, most studies focus on min-imizing energy consumption. Energy is consumed by sensor nodes to perform three important functions such as data sensing, transmitting, and relaying. Also, event-driven WSN applications require minimum end-to-end delay and medium access delay. This paper proposes an energy-efficient fuzzy logic-based fault-tolerant routing protocol (EEFRP) for routing in WSN and min-imizing the energy consumption to a large extent. EEFRP takes two important parameters “resid-ual energy” and “hop-count” into consideration. Simulation results demonstrated that the pro-posed algorithm could achieve better performance in comparison with IEEE 802.15.4 original protocol in terms of end-to-end delay, medium access delay, and fault tolerance, particularly in node failure cases. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  43 - A Novel Secure Routing Method based on Hybrid Encryption in Heterogeneous Wireless Sensor Networks
  Milad Jafari Mohsen Chekin Amin Mehranzadeh
  10.30495/ijsee.2022.1954181.1178
  Routing in a wireless sensor network is a very challenging task that allows nodes to be routed to transmit information from source to destination. As a result, optimal energy consumption is an important goal for designing a routing algorithm. In addition, due to the wir چکیده کامل

  Routing in a wireless sensor network is a very challenging task that allows nodes to be routed to transmit information from source to destination. As a result, optimal energy consumption is an important goal for designing a routing algorithm. In addition, due to the wireless communications and adverse environments, it is very important to ensure the security of communication links. In this research, a secure routing method for clustered and heterogeneous wireless sensor networks is presented. The proposed secure routing method consists of three phases: startup phase, inter-node routing phase and communication security phase. In the startup phase, the base station loads the system parameters and encryption functions into the memory of the sensor nodes. In the routing phase between cluster head nodes, the cluster head nodes calculate their score for rerouting the path request packet (RREQ) based on the information in the packet. If their score exceeds a threshold, they will redistribute the RREQ package. It should be noted that the score of cluster head nodes is calculated based on four parameters: the distance of the current cluster head node to the destination, the residual energy of the nodes, the quality of the communication link and the number of steps. The proposed secure routing method is implemented using NS2 emulator. Then, the results are compared with SMEER and LEACH-C routing methods. Experimental results indicate that the proposed routing method improves end-to-end delays, efficiency, energy consumption, packet delivery rate (PDR) and packet loss rate (PLR). پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  44 - An Optimal Routing Protocol Using Multi-Objective Whale Optimization Algorithm for Wireless Sensor Networks
  Seyed Reza Nabavi
  10.30495/ijsee.2021.683683
  Recently, wireless sensor networks (WSNs) have been used increasingly in military and civilian fields, especially for target tracking and environmental monitoring purposes. The main obstacle in the way of broader use of WSNs is the limited charge of sensors used in thes چکیده کامل

  Recently, wireless sensor networks (WSNs) have been used increasingly in military and civilian fields, especially for target tracking and environmental monitoring purposes. The main obstacle in the way of broader use of WSNs is the limited charge of sensors used in these networks. Research has shown that the power consumption of these sensors can be reduced through the sensible use of routing protocols and multi-hop communications. While cluster-based multi-hop protocols have shown to be very effective in reducing power consumption of sensors, they tend to suffer from power balance and data conflict problems. This paper applied the multi-objective whale optimization algorithm to develop a cluster-based routing protocol for WSNs. For improving the time division multiple access cycle, a bottom-up continuous time slot allocation scheme was used with the purpose of preventing data collision in multi-hop communications, as well as maximizing the sleep period of all idle nodes, including the cluster heads. Simulations performed in MATLAB demonstrated the ability of the developed protocol in prolonging the network lifespan by almost 100% by balancing the power consumption of its sensors. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  45 - Optimum Cluster Head Selection with a Combination of Multi-Objective Grasshopper Optimization Algorithm and Harmony Search in Wireless Sensor Networks
  Seyed Reza Nabavi Mehdi Najafi
  10.30495/ijsee.2022.1949145.1164
  Wireless sensor networks have become extensively applied in various fields with their advance. They may be formed freely and simply in many areas with no infrastructure. Also, they gather information about environmental phenomena for decent efficiency and event analysis چکیده کامل

  Wireless sensor networks have become extensively applied in various fields with their advance. They may be formed freely and simply in many areas with no infrastructure. Also, they gather information about environmental phenomena for decent efficiency and event analysis and send it to base stations. The absence of infrastructure in such networks, on the other hand, limits the sources; therefore, the nodes are powered by a battery with inadequate energy. As a result, preserving energy in such networks is a critical task. Clustering the nodes and picking the cluster head based on the available transmission factors is an intriguing way for reducing energy consumption in these networks, as the average energy consumption of the nodes is lowered and the network lifespan is increased. By combining the multi-objective grasshopper optimization algorithm and the harmony search, this study provides a novel optimization strategy for wireless sensor network clustering. The cluster head is chosen using the multi-objective grasshopper optimization algorithm, and information is communicated between the cluster head's nodes and the sink node using nearly optimum routing based on the harmony search. The simulation outcomes indicate that when the functionality of the multi-objective grasshopper optimization algorithm and the harmony search are taken into account, the suggested technique outperforms the previous methods in terms of data delivery rate, energy consumption, efficiency, and information packet transmission. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  46 - An Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
  Mohsen Jahanshahi Shaban Rahmani Shaghayegh Ghaderi
  An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, numbe چکیده کامل

  An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The algorithm not only balances the energy load of all nodes, but also provides a reliable selection of a new cluster head and optimality routing for the whole networks. Simulation results demonstrate that the proposed algorithm effectively increases the accuracy to select a cluster head and prolongs the network lifetime پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  47 - Intrusion Detection in Wireless Sensor Networks using Genetic Algorithm
  Elham Yazdankhah Fardad Farokhi Reza Sabbaghi-Nadooshan
  Wireless sensor networks, due to the characteristics of sensors such as wireless communication channels, the lack of infrastructure and targeted threats, are very vulnerable to the various attacks. Routing attacks on the networks, where a malicious node from sending dat چکیده کامل

  Wireless sensor networks, due to the characteristics of sensors such as wireless communication channels, the lack of infrastructure and targeted threats, are very vulnerable to the various attacks. Routing attacks on the networks, where a malicious node from sending data to the base station is perceived. In this article, a method that can be used to transfer the data securely to prevent attacks is suggested. The selection based on optimal path by routing using genetic algorithm uses. The proposed optimal paths to transmit data perceived to have chosen and ensures reliable data transmission. پرونده مقاله
• دسترسی آزاد مقاله
  • صفحه چکیده
  • متن کامل
  
  48 - ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
  M. Jahanshahi M. Maddah N. Najafizadegan
  Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor چکیده کامل

  Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have been recently proposed that pursue node relocation in order to restore connectivity.DCR is a distributed partitioning detection and connectivity restoration algorithm to tolerate the failure of sensors. DCR proactively identifies sensors that are critical to the network connectivity based on local topological information, and designates appropriate, preferably non-critical, backup nodes. Upon failure detection, the backup sensor initiates a recovery process that may involve coordinated relocation of multiple sensors.Here we proposed Energy aware distributed partitioning detection and connectivity restoration algorithmthat is an improvement of DCR algorithm. Therefore reducing the message exchange overhead, lower energy consumption, and thus will increase the network lifetime. پرونده مقاله