Analysis system Optimization of the Acid Catalyst Concentration for Synthesis of Anti‐Cancer Agent Gamavuton‐0 by Using Mathematical and Statistical Software

22 measurement equal to . 8 Km, the values in Table are given marks in red are the nodes arriving at the transmitter coverage. Then to design the mesh network nodes red marked all its value is replaced with a value of , while the node that is not marked with red all grades replaced with a value of . Where the purpose of giving a value of is not connected node, while the node value of is mutual connected. Table . Mesh network connectivity table Node X1 X7 X18 X19 Y4 Y7 Y9 X1 X7 X18 X19 Y4 Y7 Y9 Where the nodes are interconnected by Table is a table of the mesh network connectivity. Node node X is only connected to X and Y , but the X node connected to all nodes except the node Y . This happens because the node X are almost in the center of the entire node. Figure 6 Mesh Network 4.2. Testing of djikstra algorithm The mesh network is a network topology that form a link between devices where each device is connected directly to others devices in the network. n a mesh network design first thing to know is the value of the coverage of the transmitter. t is used to determine which nodes are located within the coverage which is then connected to the transmitter node Link state routing protocol uses the shortest path problem shortest path to determine the best path from sender to destination. The problem is one of optimization problems and graphs used in the search of the shortest path is a weighted graph. To solve these problems the algorithm can be used dijkstra. Tables with red color indicates that the node outside of coverage, so it can be converted into infinity symbol ∞ and become the new table Table 5. Distance value between node Node X1 X7 X18 X19 Y4 Y7 Y9 23 X1 . ∞ ∞ . 8 ∞ ∞ X7 . . ∞ . .8 . X18 ∞ . . . . . X19 ∞ ∞ . ∞ . . 8 8 Y4 . 8 . . ∞ . 8 . Y7 ∞ .8 . . . 8 . Y9 ∞ . . . 8 8 . . Value on kilometer Then by using dijkstra algorithm, can be used with the following steps : Table 6. Djikstra algorithm test table Node Destination Route Input Output X 1 X 7 X 1 8 X 1 9 Y 4 Y 7 Y 9 X 1 X7 X18 X19 Y4 Y7 Y9 ‐ ‐ ∞ ∞ ∞ ∞ ∞ ∞ ∞ X X ∞ . X ,X ∞ ∞ . 8 X ,Y ∞ ∞ X X ,X ∞ . X ,X . X ,X ,X 8 ∞ . 8 X ,Y . X , X ,Y . 8 X ,X ,Y Y X ,X , Y ∞ . X ,X . X ,X ,X 8 8. X ,X ,Y , X . 8 X ,Y . X , X ,Y . 8 X ,X ,Y X 8 X ,X , X 8 ∞ . X ,X . X ,X ,X 8 8. X ,X ,Y , X . 8 X ,Y . X , X ,Y . 8 X ,X ,Y Y X ,Y ∞ . X ,X . X ,Y ,X 8 8. X ,X ,Y , X . 8 X ,Y . X , Y ,Y . X ,Y ,Y Y X ,Y , Y ∞ . X ,X . X ,Y ,X 8 8. X ,X ,Y , X . 8 X ,Y . X , Y ,Y . X ,Y ,Y X X ,Y , X ∞ . X ,X . X ,Y ,X 8 8. X ,X ,Y , X . 8 X ,Y . X , Y ,Y . X ,Y ,Y From table Djikstra algorithm testing for connectivity to the mesh network, can be tested when the node X that want to communicate with nodes Y the nearest path based algorithm Djikstra is through node X  Y  Y with the total distance is . Km. and if the node X want to communicate with nodes on meal x based algorithm Djikstra nearest route that must be passed is passed X  X  Y  x node with a total distance is 8. Km. So the nodes X , X , X 8, x , Y , Y and Y can communicate more efficiently with shorter distance.

5. Conclusions

n designing the mesh network maritime There are several steps that need to be done is to analyze the characteristics of signal propagation above sea level beforehand, it aims to determine the losses in the transmission of signals above sea level, losses, it makes one parameter n exponet is worth . ‐ . where the value is only valid on the territorial waters of a Tanjung Perak surabaya into Karang Jamuang sland area, because it uses high parameter waves in the region. Then the n exponent is one of the parameters used in calculating 24 the value of path loss based on factors territory. And then the path loss value obtained is used to calculate the value of received power level at each distance. So we get the value of the coverage area of . Km. The value of coverage referenced in the design of maritime mesh network. Where the scenarios that have been choosing then the nodes will be interconnected if the node in the coverage area. But for nodes that are not connected to the other node because it is not included in the coverage, then used the algorithm determines Djikstra glittering mesh network connectivity with the nearby track consideration. example in the scenario node node X want to deal with Y , the route chosen by the algorithm Djikstra is passed node X  Y Y with the total distance is , Kilometer. Acknowledgements This work was supported in The authors would like to thank their Telecommunication members in Electronic Engginering Polytecnic nstitute of Surabaya EEPS for producing some of the results presented in the article. References Direktur Jenderal SDPP. .”Paparan Narasumber Rakornas Kominfo” . http:web.kominfo.go.id . Accesed on th July . TU‐R M. . . Maritime Broadband Wireless Mesh Networks. https:www.itu.int. Accesed on th July . TU, Attenuation by atmospheric gases,” TU Recommendation P. ‐ , TU, Geneva, Switzerland, . J. D. Parsons, The Mobile Radio Propagation Channel, Wiley, New York, NY, USA, nd edition, . Timmins, .J.; O’Young, S. Marine communication channel codeling using the Finite‐Difference time domain method. EEE Trans. Veh. Technol. , 8, – . Lee. Y, and Meng. Y,. . Key Considerations in the Modeling of Tropical Maritime Microwave Attenuations Journal nternasional . Singapore: Nanyang Technological Univesity. Lee. Y.. dkk. . Near Sea‐Surface Mobile Radiowave Propagation at 5 GHz: Measurements an Modeling . Singapore: Nanyang Technological University. Bai. Y, dkk. . Over‐the‐Sea Radio Propagation and Integrated Wireless Networking for Ocean Fishery Vessels, pp 8 ‐ . China: ainan University. Capkun, S. dkk. . GPS‐free Positioning in Mobile ad Hoc Networks. Swiss: Institute for Computer Communication and Applications.