ο€  Proceedings of Engineering and Technology Innovation , vol. 2, 2016, pp. 26 - 27 26 OPPA-AC: Optimal Path Planning based on Ant Colony Algorithm for Temporary Isolated Node in WSN Aripriharta 1, 2 , Hendrick 1, 3,* , Thi Thuy Lieu Nguyen 1 , Gwo-Jia Jong 1 1 Department Electrical Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan. 2 State University of Malang, Indonesia. 3 State Polytechnic of Padang, Indonesia. Received 01 April 2016; received in revised form 28 April 2016; accept ed 10 May 2016 Abstract In real wireless sensor network application (WSN), several nodes may suffer fro m link fa il- ure problem. Link failure is a proble m that may exist in the presence of obstacles which blocked the wireless connection between nodes. While the link between nodes is blocked, the node will be temporary isolated from the cluster; thus, their data will not reach the destination node. The temporary node isolation problem becomes more challenging if the data should be arrived on time. The traditional clustering algorithm (LEACH) is not considered the temporary isolated node, which cause longer waiting time for data delivery in certain rounds. In order to solve this problem, we proposed the ant colony-based optimal path planning algorithm (OPPA -AC). The OPP-A C was improved the LEACH algorith m by provid- ing alternative path for temporary isolated nodes and guarantee their data arrived in the destination. Based on the experimental result, the OPP-A C surpassed the traditional algorithm in term of waiting time. Ke ywor ds : tempora ry isolated node, ant colony, OPP-AC, WSN 1. Introduction In wireless sensor network application (WSN), the nodes may suffer from link failure problem due to the environmental effects, such as: radiation, temperature rising, fog, rain and obstacle. Link failure is a problem that may exist in the presence of obstacles which blocked the wireless connection between nodes. Therefore, those nodes cannot send data through the original forwarding path for a period of time (or temporal) because their co m- munication range is decreased [2-5] or blocked. sink CH1 Temporarily isolated node Normal node CH2 CH3 Fig. 1 Temporary isolated node Since LEA CH was not considered this problem, those nodes are temporarily isolated fro m their CH. The te mporary node isolation problem beco mes more challenging if the data should be arrived on time. Moreover, the tem- porarily isolated nodes (Fig. 1) cause packet drops, increase the average delay, and increase the energy consumption; in turn, the perfo r- mance of network become degrades [3]. Recently, there has been a few re lated works in te mporarily node isolation p roble m [2-5]. However, those existing works focused on connection reestablishment. There fore, we pre - sent the ant colony-based optima l path planning algorith m (OPPA -AC) to select the forwarding path for tempora rily isolated nodes . Our objec - tive is to reduce the waiting time and congestion in WSN. 2. Method The structural synthesis of CCPGTs will be performed based on the creative design met h- odology process [7-8]. The p roposed algorith m *Corresponding aut hor. Email: hendrickpnp77@gmail.co m Proceedings of Engineering and Technology Innovation , vol. 2, 2016, pp. 26 - 27 27 Copyright Β© TAETI consists of two steps: (a) clustering process, (2) data transmission. In the first step, we adopt LEA CH fo r the CH selection [1]. The second step involves the proposed path selection mechanis m in order to reduce the end to end delay and packet drops in WSN. In order to determine the forwa rding path for temporarily isolated nodes, we used link quality as the pheromone of ants by favoring received signal strength indication (RSSI). The RSSI value is collected each time the tempora rily isolated node receive ADV message fro m nearby CHs. RSSI va lues is normalized for fu r- ther calculation by OPP-AC, and it given by: π‘…π‘†π‘†πΌπ‘›π‘œπ‘Ÿπ‘š = 𝑅𝑆𝑆𝐼𝑖 π‘…π‘†π‘†πΌπ‘šπ‘Žπ‘₯ (1) The objective function is the lin k quality (LQ) wh ich depends on RSSI va lue. Therefore , the isolated node will selects the path with better LQ. Moreover, ant colony a lgorith m select a CHs node with probability Pij k = πœπ‘–π‘— 𝛼 πœ‚π‘–π‘— 𝛽/ βˆ‘ πœπ‘–π‘  π›Όπœ‚π‘–π‘  𝛽 π‘ πœ–π‘™π‘–π‘ π‘‘π‘˜ for j∈ π‘™π‘–π‘ π‘‘π‘˜ , otherwise Pij k = 0. Moreover, πœ‚π‘–π‘— = 1/𝑑𝑖𝑗 and the pheromone (πœπ‘–π‘— = 1 π‘…π‘†π‘†πΌπ‘›π‘œπ‘Ÿπ‘š ), =0.7 and 𝛽 = 0.3. 3. Results and Discussion We validated the proposed algorith m through simu lations and comparison with the LEA CH in term o f end to end de lay. We simu - lated 35 nodes in 50x50m 2 square area, the data length ia 30 byte, ο₯elec = 50nJ/bit, EDA=0.5nJ/bit, ο₯amp=50nJ/bit/m 4 , and ο₯fs= 10pJ/bit/m 2 . Based on the e xperimental result (Fig. 2), the OPP-AC surpassed the LEA CH a lgorith m in term of end to end delay. 4. Conclusions In this paper, three new designs of the CCPGT have been generated in a systematic methodology. The feasibility of the new designs is verified by conducting kine mat ic simu lation. The result has shown that the new designs can produce a more wide range of non -uniform output motion than the existing design. There- fore, they are better alternatives for driving a variable speed input mechanism. E n d t o e n d d e la y nodes LEACH OPP-AC Fig. 2 End to End Delay Acknowledgement This work was supported by DIKTI funded by Ministry of Research and Tech nology and Higher Education, Indonesia under contract number: 124.67/E4.4/2014. References [1] M. Mehdi Afsar and Mohammad-H. Taya- rani-N, β€œClustering in sensor networks: A literature survey,” Journal of Network and Co mputer Applications, vol. 46, pp. 198-226, 2014. [2] A. Roy, P. Ka r, and S. M isra, β€œ Detection of dumb nodes in a stationary wire less sensor network,” Annual IEEE India Conference (INDICON β€˜14), 2014, pp. 1-6. [3] P. Ka r, A. Roy, S. M isra, and M. S. Obaidat, β€œEnergy- effic ient connectivity re- estab- lish ment in WSN in the presence of du mb nodes,” IEEE International Conference on Co mmunicat ion Workshop (ICCW β€˜15), 2015, pp. 1485-1490. [4] A. Roy, A. Mondal, and S. Misra, β€œ Con- nectivity re-establishment in the presence of dumb nodes in sensor-cloud infrastructure: a game theoretic approach,” IEEE 6th In- ternational Conference on Cloud Co mpu- ting Technology and Science (CloudCo m β€˜14), 2014, pp. 847-852. [5] S. Misra, P. Kar, A. Roy, and M. S. Obaidat, β€œExistence of dumb nodes in stationary wireless sensor networks,” Journal of Sys- tem and Software , vol. 91, pp. 135-146, 2014.