FINDING MINIMUL COMPUTATION TIME USING LEACH PROTOCOL BASED ON TRANSPORTATION

ABSTRACT Wireless sensor network (WSN) is a new research area in modern communications networks. Composed by many stationary or mobile sensor nodes, it constitutes a wireless network through self-organizing and multi-hop way. A sensor network system includes sensor node (end device), sink node (sink) and coordinator node (coordinator). The routing protocol of WSN is to find the optimal route between the source node and destination node. Its primary goal is to improve the quality of network service and achieve a fair and rational use of resources such as network bandwidth for various network nodes and terminals. The work focused on the typical and successful representative in the introduction of hierarchical routing protocol to data fusion technology LEACH protocol. The optimization processes in mathematics, computer science and economics are solving effectively by choosing the best element from set of available alternatives elements. The most important and successful applications in the optimization refers to transportation problem (TP), that is a special class of the linear programming (LP) in the operation research (OR). The main objective of transportation problem solution methods is to minimize the cost or the time of transportation. Most of the currently used methods for solving transportation problems are trying to reach the optimal Solution, whereby, most of these methods are considered complex and very expansive in term of the execution time. In this study we use the best solution using LEACH protocol. In which the key idea is to minimize the combinations of the solution by choosing the best solution to reach the optimal solution.