Providing an Algorithm to Improve Routing and Control of Interference inWireless Sensor Network using the Genetic Algorithm and Defining twoObjective Functions

Publish Year: 1397
نوع سند: مقاله کنفرانسی
زبان: English
View: 385

This Paper With 10 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

TECCONF04_056

تاریخ نمایه سازی: 30 شهریور 1398

Abstract:

The wireless sensors have significant advantages over conventional wired sensors. Wireless sensors not only reduce cost and delay in the layout, but also apply to any environment, especially environments where the use of conventional sensor networks is impossible. In congested-network wireless networks, network congestion occurs when the barter current is greater than the capacity at any point in the network. Congestion control is defined as one of the most important challenges in wireless sensor networks. Limitations and problems that cause this first of all, there is the essence of sensor networks, and secondly, the transmission of multimedia information and applications that use this information are causing congestion. For this purpose, it is necessary to analyze the layers of this network properly and introduce the appropriate mechanisms for transmitting multimedia information in the sensor network for each layer. One of these layers is the transfer layer. Shift detection is essential to efficiently utilize network resources to balance traffic loads. In this research, a method for routing with knowledge of congestion control and interference in wireless sensor networks has been presented. In the proposed method, the congestion control scheme using the genetic algorithm and the definition of the two target functions reduced the latency of packet forwarding and the expected transfer number for reaching the destination. The simulation results indicate that the algorithm s response the suggestion can be close to the optimal answer.

Authors

arefeh haydari

Department of Computer, Faculty of Engineering, Islamic Azad University, Damavand Branch,Damavand, Iran

JAVAD HOSSEINKHANI

Department of Computer, Faculty of Engineering, Islamic Azad University, Zahedan Branch, Zahedan,Iran