In mobile wireless networks, path breakage happens frequently due to the movement of mobile nodes, node failure, channel fading and shadowing. It is challenging to combat path breakage at the cost of minimum control overhead, while adapting to topological changes rapidly. We propose a new greedy technique EPFA (Enhanced Perimeter Forwarding Algorithm) for transmitting the mobile nodes from source to destination. The nodes will be communicated and travelled properly by the new technique without a greater loss. Moreover the paper discuss about the cluster or region head, the role of the CH and the subordinate TH node. The algorithm clearly explains about the work flow of the CH and TH. The simulation diagram discusses about the packet delivery ration, collision rate, total delay of the node in the required time and the energy consumption rate of the mobility node.

Clutster region, Control overhead, Transition head

[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensornetworks: a survey, Computer Networks 38 (4) (2002) 393–422.
[2] Yick, Jennifer, Biswanath Mukherjee, and Dipak Ghosal. "Wireless sensor network survey." Computer networks 52.12 (2008): 2292-2330.
[3] Yong Tang, Mingtian Zhou, Xin Zhang, Overview of Routing Protocols in Wireless Sensor Networks[J]. Journal of Software, March 2006,17(3): 4l0-421.
[4] Le Xuan, Hung, Young-koo Lee, and Sungyoung Lee. "Two energy-efficient routing algorithms for wireless sensor networks." Networking-ICN 2005. Springer Berlin Heidelberg, 2005. 698-705.
[5] Raicu, L., et al. "e3D: an energy-efficient routing algorithm for wireless sensor networks." Intelligent Sensors, Sensor Networks and Information Processing Conference, 2004. Proceedings of the 2004. IEEE, 2004.
[6] G. Song, Y. Zhou, F. Ding, A. Song, A mobile sensor network system for monitoring of unfriendly environments, Sensors Journal 8 (11) (2008) 7259–7274.
[7] S. Indu et al., Self deployment of mobile sensor network for optimal coverage, International Journal of Engineering Science and Technology 2 (7) (2010) 2968–2975.
[8] H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Trans. Commun., vol. 32, no. 3, 1984, pp. 246–57.
[9] I. Stojmenovic and Xu Lin, “Loop-free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks,” IEEE Trans. Parallel Dist. Sys., vol. 12, no. 10, 2001, pp. 1023–32.
[10] I. Stojmenovic and Xu Lin, “Power-Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel Dist. Sys., vol. 12, no. 11, 2001, pp. 1122–33
[11] C. Yeh, “Variable-Radius Routing Protocols for High Throughput, Low Power, and Small Latency in Ad Hoc Wireless Networks,” IEEE Int’l. Conf. WLANs and Home Nets., Dec. 2001
[12] P. Larsson, “Selection Diversity Forwarding in a Multihop Packet Radio Network with Fading Channel and Capture,” Proc. ACM MobiHoc 2001, pp. 279–82.
[13] P. Bose et al., “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” 3rd Int’l. Wksp. Discrete Algorithms Methods Mobile Comp. Commun., Seattle, WA, Aug. 20, 1999, pp. 48–55; also in ACM/Kluwer WL Nets., vol. 7, no. 6, Nov. 2001, pp. 609–16
[14] Karp B，Kung H T. “GPSR：Greedy perimeter stateless routing for wireless networks”, ACM/IEEE International Conference on Mobile Computing and Networking，Boston Massachusetts，USA，2000： 243-254
[15] T. Guoming, X. Yi, T. Daquan, and T. Jiuyang, "Divisional perimeter routing for gpsr based on left and right hand rules," in Computer Science and Network Technology (ICCSNT), 2011 International Conference on, vol. 2. IEEE, 2011, pp. 726-729.
[16] Q. Xian, Y. Long, “An Enhanced Greedy Perimeter Stateless Routing Algorithm for Wireless Sensor Network”, 2016 IEEE International Conference of Online Analysis and Computing Science (ICOACS 2016)
[17] Karp B, Kung H T. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks [C].
The 6th Ann. Int’l Conf. Mobile Computing and Networking (MobiCom 2000), ACM Press, New York, 2000.
[18] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An Application-Specific Protocol Architecture for Wireless Microsensor Networks,” IEEE Trans. Wireless Communications, vol. 1, no. 4, pp. 660-770, Oct. 2002.
[19] J. Lee and W. L. Cheng, “Fuzzy-Logic-Based Clustering Approach for Wireless Sensor Networks Using Energy Predication,” IEEE Sensors Journal, vol. 12, no. 9, pp. 2891-2897, 2012.
[20] G. Smaragdakis, I. Matta and A. Bestavros, “SEP: A stable election protocol for clustered heterogeneous wireless sensor networks,” In 2th International Workshop on Sensor and Actor Network Protocols and Applications, 2004, pp. 1-11.
[21] S.D. Muruganathan, D.C.F. Ma, R.I. Bhasin and A.O. Fapojuwo, “A Centralized Energy-Efficient Routing Protocol for Wireless Sensor Networks,” IEEE Radio Communications, vol. 43, no. 3, pp. s8-s13, Mar 2005.
[22] S. Lindsey, C. Raghavendra, and K. M. Sivalingam, “Data Gathering Algorithms in Sensor Networks using Energy Metrics,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 924-35, 2002.
[23] O. Younis, and S. Fahmy, “HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 4, pp. 366-379, 2004.
[24] Z. Huang, H. Okada, K. Kobayashi and M. Katayama, “A study on cluster lifetime in multi-hop wireless sensor networks with cooperative MISO scheme,” Journal of Communications and Networks, vol. 14, no. 4, pp. 443-450, 2012.
[25] Wonchang Choi, Miae Woo, "A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks",2006.