International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 03 | Mar 2019 p-ISSN: 2395-0072 www.irjet.net ONLINE BUDGET PATH PLANNING S. Aishwarya1, S. Mahalakshmi2, P. Nirmala Deve3, R. Kapila Vani4 1&2STUDENT, DEPT OF CSE, PRINCE SHRI VENKATESHWARA PADMAVATHY ENGINEERING COLLEGE, PROFESSOR, DEPT OF CSE, PRINCE DR.K. VASUDEVAN COLLEGE OF ENGINEERING, 4ASSISTANT PROFESSOR, DEPT OF CSE, PRINCE SHRI VENKATESHWARA PADMAVATHY ENGINEERING COLLEGE ----------------------------------------------------------------------***--------------------------------------------------------------------The Existing concept is to find the path between two points ABSTRACT-In order to analyse the budget approach for 3ASSISTANT and measure the distance. And analyzing method is done manually. Existing transportation systems are not satisfying since the slowly increasing road capacity cannot sufficiently serve the rapidly increasing of cars, leading to high congestions, serious pollutions and potential health problems with large investments. We hope that transportation policies and programs can serve economic, social, and environmental goals. Several research works show that the total industrial and consumer expenditure on transportation is about 10% of GDP. Besides the large investments, many countries are suffering from social problems such as traffic congestions and fuel pollutionrelated diseases brought by transportation. The vehicle fuel pollution accounts for 31% of all pollution in Beijing , and the Beijing city government has spent $277 billion during 2011-2013 on air pollution to reduce the PM 2.5 (particulate matter with diameter of 2.5 micrometer’s or less) . To address the above problems, ride-sharing is a promising solution that is cost-effective. Public vehicle (PV) systems provide low-cost peer-to-peer ridesharing trips with ensured Quality of Service (QoS) for passengers. Some ridesharing path planning strategies are restricted to some special cases such as common origins or destinations. In particular, evolutionary algorithms to solve the one-originmulti-destination taxi-sharing problem, where the QoS metrics include the total trip cost and the time delay of passengers. selected tour, we develop an application which predicts the Pre-analysis of tour budget through the mobile computing with complete requirement’s and need in real time location. App module determines the effect of personalized information and provision through smartphone on user ability to plan for any destination trips. It helps to understand the traveller perception for each and every PV system’s by real-time. The destination of trip-planning can be accessed. Through Mobile Application for pre-analysis operation over PV system’s (like train, flight, etc..) are envisioned to be analysing the budget approach for the selected tour. The data is collected through multiple set data analysis systems and compared with the exhaustive search method under the same service quality performance. In case of emergency SOS helpline are mentioned for particular places in India. Keywords-Public Vehicle (PV), Save Our Soul (SOS) 1. INTRODUCTION The tourism sector is a coming together of various suppliers of services to offer people a complete tourist experience. Travel agents and tour operators play a vital role in the promotion of tourism. Today the travel and tourism industry is one of the biggest and most dynamic industries in the world. If you are planning to be a part of this dynamic industry then you are required to know more about the travel agency operations than just what happens within the walls of the office. The major number of people who travel around has certainly gone up several hundred thousand times. This increase in the number of people leaving their place of stay and visiting another place has resulted in the expansion of travel agencies and their linkages with the principal suppliers. The travel agency is a link between the customers, i.e., traveller or tourist and the principle suppliers, i.e., primary service providers such as tour wholesalers, hotels, airlines, etc. It is the first stop for anyone considering travel, especially to a distant place, i.e., tourist destination, in order to make travel arrangements. The primary job of a travel agency is to provide easy and trouble free travel to the traveller. It is also important for a travel agency to provide enough information to the tourist so that the tourist is not cheated during his or her travel and has a hassle free trip. © 2019, IRJET | Impact Factor value: 7.211 Present a stochastic mixed integer programming model to optimize the allocation of cars to employees (from homes to work places) while taking into account the unforeseen events of car unavailability. It only focuses on ride-sharing with common destinations in large organizations, e.g., companies, hospitals, and universities. a collective travel planning query to find the lowest cost path connecting multiple origins and a destination with limited number of meeting points. However, all the above solutions cannot be used in the multi-origin-multi-destination scenario, which is more common in the real world. Most of the current ridesharing path planning strategies in the multi-origin-multidestination scenario are exhaustive search methods, which incur high computational load at the cloud. An algorithm to reduce travel distance of vehicles with QoS constraints for passengers, e.g., detour, which needs to try each request and calculate corresponding detour constraints. Solution which selects the optimal fixed positions of pick-up points to maximize the vehicle occupancy rates while preserving the | ISO 9001:2008 Certified Journal | Page 1511 International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 03 | Mar 2019 p-ISSN: 2395-0072 www.irjet.net passenger privacy and safety, where passengers do not need to provide their precise home or work positions. To maximize the vehicle occupancy and minimize the travel time with limited detour a hybrid-simulated annealing to dynamically assign passenger requests for online/dynamic ride-sharing, which is computationally expensive especially when the number of requests is large since multiple random perturbations and a large number of iterations are needed. Less research works focus on how to reduce the computational complexity and restrict the search areas in online/dynamic ride-sharing in PV or PV-like system’s. changes, happening abruptly, and we indicate how profound learning gives exact here and now movement stream expectations. Enhanced Real Time Charging Station Recommendation System for Load Base Electric-Vehicle Taxis Electric Vehicles(EV) have less air pollution and are more environment friendly, and due to their contribution to carbon dioxide reduction, EVs are becoming increasingly popular nowadays. In the real time charging system, the waiting time can be a non-negligible portion to the total work hours, the decision will naturally affect the revenue of individual EV taxis. The proposed system provides a realtime charging station recommendation system for EV taxis via large scale GPS data mining. By combining each EV taxi’s historical recharging events and real-time GPS trajectories, the current operational state of each taxi is predicted with Load balancing. Based on this information, for an EV taxi requesting a recommendation, recommend a charging station that leads to the minimal total time before its recharging starts. To reduce the total travel distance of taxis, an efficient ridesharing path planning solution in serving dynamic queries, where “lazy shortest path” calculation is used by means of partitioning the whole road network into multiple grids, and the status vehicle should be updated according to preset intervals. This work only considers how to reduce the computational complexity based on the current distance between vehicles and origins/destinations of requests. a real-time and datadriven simulation framework to achieve the efficient analysis of taxi ride sharing by means of exploring parallelism and cache-coherent shortest path index, which also considers different stakeholders’ interests and constraints, e.g., the waiting time, the maximum number of additional stops, and the maximum number of shared trips. In summary, most online/dynamic ride-sharing solutions in PV or PV-like systems are based on computationally expensive exhaustive search. EVs can just travel a constrained separation because of the restricted limit of the batteries and an EV taxi may re-charge a few times consistently. Because of the long cycle, the awful choice on the charging station, i.e., picking one without void charging heaps, may prompt a long holding up time of over a hour in the most pessimistic scenario. In this way, picking the privilege charging station is essential to lessen the general holding up time. Understanding the status (e.g., operational examples, driver salary and charging practices) of EV cabs can give significant data to strategy creators. In view of this data, for an EV taxi asking for a suggestion, we can prescribe a charging station that prompts the negligible aggregate time before its energizing begins. Broad analyses checked that our anticipated time is generally precise and can lessen the cost time of EV taxis. Only a few solutions focus on reducing the computational complexity. However, the road network should be divided into cells and the states of vehicles should be frequently updated, making the methods complicated. The proposed solution in this paper is more efficient, easy to implement, and can be used in large cities. Moreover, the QoS level of passengers can be guaranteed, e.g., short waiting time and less detour. Optimal Demand-Aware Ride-Sharing Routing, this problem is important for unleashing economical and societal benefits of ride-sharing. Meanwhile, it is challenging due to the need of Deep Learning for Short-Term Traffic Flow Prediction profound learning model to foresee activity streams. The fundamental commitment is advancement of an engineering the consolidate’s a straight model that is fitted utilizing regularization and an arrangement of tanh layers. 1. Meeting travel delay requirements of customers, and 2. Making online decisions without knowing the exact travel demands beforehand. The test of foreseeing activity streams are the sharp nonlinearities because of advances between free stream, breakdown, recuperation and clog. We demonstrate that profound learning models can catch these nonlinear spatiofleeting impacts. The main layer recognizes spatio-transient relations among indicators and different layers show nonlinear relations. We represent our strategy on street sensor information from Interstate I-55 and anticipate activity streams amid two unique occasions; Chicago Bears football game and an extraordinary snowstorm occasion. The two cases have sharp activity stream administration © 2019, IRJET | Impact Factor value: 7.211 We present a general framework for exploring the new design space enabled by the demand-aware approach. We show that the demand-aware ride-sharing routing is fundamentally a two-stage stochastic optimization problem. We show that the problem is NP-Complete in the weak sense. We exploit the two-stage structure to design an optimal solution with pseudo-polynomial time complexity, which makes it amenable for practical implementation. We carry out extensive simulations based on real-world travel | ISO 9001:2008 Certified Journal | Page 1512 International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 03 | Mar 2019 p-ISSN: 2395-0072 www.irjet.net demand traces of Manhattan. The results show that using our demand aware solution instead of the conventional greedy-routing scheme increases the driver’s revenue by 10%. The user location as a function of time is either known or can be calculated, previous work shows the existence of lower bounds on the average cost of paging. Here these bounds are used in conjunction with a Poisson incomingcall arrival model to formulate the paging/registration optimization problem in terms oftimeout parameters, τ m ; the maximum amount of time to wait before registering given the last known location wasm. Timer-based methods, as opposed to location-based methods, do not require the user to record and process location information during the time between location updates. The results further show that as compared to the case without ride-sharing, our ridesharing solution reduces the customers’ payment by 9% and the total vehicle travel time (indicator of greenhouse gas emission) by 17%. The driver can also get 26% extra revenues per slot by participating in ride-sharing. Understanding operational and charging patterns of Electric Vehicle Taxis using GPS records. The major obstacle to the wide acceptance of Electric Vehicles (EV) is the lack of a wide spread charging infrastructure. To solve this, A mobile makes the same location prediction as the network does; it inspects its own location periodically and reports the new location when the distance between the predicted and the actual locations exceeds a threshold. To more realistically represent the various degrees of velocity correlation in time, a Gauss-Markov mobility model is used. For practical systems where the mobility pattern varies over time, we propose a dynamic Gauss-Markov parameter estimator that provides the mobility parameters to the prediction algorithm. The cost of predictive mobility management against that of the regular, nonpredictive distance-based scheme, for both the case with ideal GaussMarkov mobility pattern and the case with time-varying mobility pattern. Chinese government has promoted EVs in public transportation. The operational patterns of EV taxis should be different from Internal Combustion Engine Vehicles (ICEV) taxis: EVs can only travel a limited distance due to the limited capacity of the batteries and an EV taxi may recharge several times throughout a day. Understanding the status (e.g., operational patterns, driver income and charging behaviours) of EV taxis can provide invaluable information to policy makers. "Movement-based location update and selective paging for PCS networks" Movement-based location update is selected for its simplicity. It does not require each mobile terminal to store information about the arrangement and the distance relationship of all cells. In fact, each mobile terminal only keeps a counter of the number of cells visited. A location update is performed when this counter exceeds a predefined threshold value. This scheme allows the dynamic selection of the movement threshold on a per-user basis. This is desirable as different users may have very different mobility patterns. Selective paging reduces the cost for locating a mobile terminal in the expense of an increase in the paging delay. Analytical results are provided to demonstrate the cost-effectiveness of the proposed scheme under various parameters. Mobility management in wireless cellular networks is one of the main issues for resource optimization. It is aimed to keep track of Mobile Stations (MSs) in the different Location Areas (LAs) or Registration Areas (RAs) for an efficient call delivery. The optimization issues of these location strategies look for a minimization of the generated signaling traffic. In managing the locations of mobile users in mobile communication systems, the distance-based strategy has been proven to have better performance than other dynamic strategies, but is difficult to implement. A simple approach is introduced to implement the distance-based strategy by using the cell coordinates in calculating the physical distance traveled. This approach has the advantages of being independent of the size, shape, and distribution of cells, as well as catering for the direction of movement in addition to the speed of each mobile terminal. An enhanced distancebased location management strategy is proposed to dynamically adjust the size and shape of location area for each individual mobile terminal according to the current speed and direction of movement. It can reduce the location management signaling traffic of the distance-based strategy by half when mobile terminals have predictable directions of movement. Three types of location updating schemes are discussed, namely, Circular Location Area, Optimal Location Area, and Elliptic Location Area. Paging schemes using searching techniques such as expanding distance search based on the last reported location and based on the predicted location, and expanding direction search are also explored to further reduce paging signal traffic by partitioning location areas into paging areas. The assignment "Cost Analysis of Movement-Based Location Management in PCS Networks: An Embedded Markov Chain Approach"is an approach distinguishes itself from those developed in the literature in the following aspects. 1) It considers the location area (LA) architecture used by personal communication service (PCS) networks for location management. 2) It considers two different call handling models that determine after a call whether a location update should be performed. 3) It considers the effect of the call holding time on the call handling models. 4) It proposes to use a fluid flow model to describe the dependence between the cell and the LA residence time. We derive closed-form analytical formulas for the signaling cost, whose accuracy is manifested by a simulation. © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 1513 International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 03 | Mar 2019 p-ISSN: 2395-0072 www.irjet.net of each user depends on the topology of the network and on the position of the user. Each user can move itself from one position to another or it can “terminate” its request (thus disappearing from the set of users). Additionally, users may require, for their requests, different bandwidths corresponding to different types of services (such as video and/or audio applications or file transfers). cellular phones. Cellular communication is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network (PSTN). Location management is one of the main issues in cellular network. A service coverage area of cellular network is divided into many small small areas which are known as cells. Each cell has its own identity number of its location which is known as cell Id number. Mobile Subscribers find their location from the cell identity of their cells and from cell Id they can also calculate cellular distance. Tracking strategies for mobile users in wireless networks are studied. In order to save the cost of using the wireless links mobile users should not update their location whenever they cross boundaries of adjacent cells. The paper focuses on three natural strategies in which the mobile users make the decisions when and where to update: the timebased strategy, the number of movements-based strategy, and the distance-based strategy. The authors consider both memoryless movement patterns and movements with Markovian memory along a topology of cells arranged as a ring. In distance-based location update schemes with a predefined distance threshold d, an object reports its location to the location server, whenever it is located more than a distance of d away from the location expected of by the server. Adopting a small threshold can keep locations maintained in the location server close to exact object locations, but that incurs high location update costs. In this paper, we address the important issue of finding an optimal distance threshold. Our approach exploits a cost function that takes into account location update and query processing costs, the two key performance costs, based on which an optimal threshold that minimizes the overall cost is derived. In dynamic environments, costs may vary over time, so a threshold good at one moment could become bad at another. To determine an optimal threshold adaptively, we propose two optimization algorithms, namely, conjectural algorithm and progressive algorithm. Conjectural optimization algorithm " guesses" the current system conditions, based on which it directly determines the most probable optimal value. Progressive optimization algorithm starts with a certain threshold value and adjusts it gradually towards the optimal point. Methods of balancing call registration and paging are developed in this paper. Given that the probability distribution on the user location as a function of time is either known or can be calculated, previous work shows the existence of lower bounds on the average cost of paging. Here these bounds are used in conjunction with a Poisson incoming-call arrival model to formulate the paging/registration optimization problem in terms of timeout parameters, τ m ; the maximum amount of time to wait before registering given the last known location wasm. Timer-based methods, as opposed to location-based methods, do not require the user to record and process location information during the time between location updates. This feature might be desirable for minimizing mobile transceiver use during idle periods. Then consider uniform motion processes where a spatial translation of starting location produces an identical spatial translation of the associated time-varying probability distribution. This leads to a universal timeout parameter τ which may be readily calculated. Study τ and the minimum cost of paging/registration for a simple model of user motion and compare our results to an earlier method of location-based paging/registration cost minimization. The key idea of our approach is to pose orienteering as a combination of a Constraint Satisfaction Problem and a Traveling Salesman Problem. This formulation allows us to restrict the search space to routes that incur minimum distance to visit a set of selected nodes, and rapidly search this space using random sampling. The paper provides the analysis of asymptotic near- optimality, convergence rates for RAOr algorithms, and present strategies to improve anytime performance of the algorithm. . The mobility patterns are used to create individualized location areas for each user. The proposed scheme is flexible and can be used in network with arbitrary cell topologies. The scheme, along with other existing schemes is simulated using realistic users' mobility and call arrival patterns, and network topology. The simulated environment consists of 90 cells representing the geographical area of the San Francisco bay, and 66,550 mobile users representing the typical classes of users that are normally present in a real cellular network. Results show the proposed scheme gives lower overall signaling costs, resulting in savings on the limited radio bandwidth that may have otherwise been used for location updates and paging. Unfortunately, the problem is NP-Hard and the state of the art methods are too slow to even present an approximate solution online. Here we present Randomized Anytime Orien- teering (RAOr) algorithm that provides near optimal solutions while demonstrably converging to an efficient solution in run- times that allows the solver to be run online. Cellular communication has explosive growth in recent years. Today millions of people around the world uses © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 1514 International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 03 | Mar 2019 p-ISSN: 2395-0072 www.irjet.net 2. SYSTEM ARCHITECTURE The real time guidance of tourist place is given as detailed information about each and every place in India. The event update is generated for certain places. Tour Guides are responsible for helping people to visit unfamiliar areas. They usually make special trips with groups of tourists in order to show them important places of cities. Their work is very useful for visitors who are for the first time in some areas, because these professionals are very knowledgeable and provide valuable information to people. They may work in travel agencies or museums. Tour Guides usually perform many of the following tasks: • Describing places to people. • Providing safety devises. • Providing directions to tourists. 3. PROPOSED SYSTEM The proposed system finds the shortest path among duration and traffic analysis and even budget planning can be done. Provide more flexible and adaptive solution according to preferences of the participants and solve the social challenges. The Login page for staff contains id and password, after confirming, if it match Password to allow in the app otherwise alert an error Dialog and show a message to the user. User personal details will be created as a table in the form of a java code and those registered details are stored in database. The application predicts pre analysis of tour budget through mobile computing that are provided in cloud database with complete requirements and needs in real time location. Simplify registrations. Allow login via external accounts. Go for mobile phone instead of usernames. Facilitate password resetting. Keep users logged in allow access to a customer loyalty card or to send a personal message push to a user. It is also possible to require users to register before they can view the content of your app. A precise way the analysis to be run before examining the data pre-specifying analysis plans comes at a cost. A preanalysis plan is relatively straightforward to write if there is a single, simple hypothesis, with a single, obvious outcome variable of interest. The most rigid adherents to prespecification would discount any such results that were not rigorously specified in advance of the data. © 2019, IRJET | Impact Factor value: 7.211 • What will each part of this study cost? • What sources of funding do you anticipate? | ISO 9001:2008 Certified Journal | Page 1515 International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 03 | Mar 2019 p-ISSN: 2395-0072 www.irjet.net Nearby Places lets you discover great places near you. Search for nearby Restaurants, Foods, ATMs, Banks and a lot more. Located a short distance, areas into which the economic activity of a country is divided the plane figure enclosed within the given destined. path planning solutions aiming at solving the common last mile problem from homes or work places to subway stations or bus stops. To deal with the online/dynamic ride-sharing path planning problem for PV systems, this article proposes a solution based on a limited potential search area for each vehicle to filter out the requests that violate passenger QoS constraints such as the tour, therefore, the global search is reduced to a local search and the computational complexity is reduced. It also considers the comfort of passengers (e.g., waiting time and detour) and the total travel distance of PVs. Therefore, passengers can enjoy their peer-to-peer ride-sharing services with sacrificing a little ride comfort. Moreover, the proposed solution can be easily extended to the future globally optimal algorithm (if it will exist) to speed the computation time where all the scheduling can be changed only if the passenger has not been picked up. “Save Our Souls” the signal “SOS” came for the sake of convenience. Emergency app will also provide you the current country emergency numbers as such Police, Fire, Ambulance, women safety numbers, etc. It allows you to activate distress through your phone notification bar action button, phone Power button, and SOS button. The SOS network status indicator is only for emergency calls that can be made requests for medical assistance. 5. REFERENCES [1] I. F. Akyildiz, J. S. M. Ho, and Y.-B.Lin, "Movement-based location update and selective paging for PCS networks," IEEE/ACM Transactions on Networking, vol. 4, no.4, pp. 629– 638, Aug. 1996. [2] X. Wang, X. Lei, P. Fan, R. Q. Hu, and S. Horng, "Cost Analysis of Movement-Based Location Management in PCS Networks: An Embedded Markov Chain Approach," IEEE Transactions Vehicular Technology, vol. 63, no.4, pp. 18861902, May 2014. [3] C. Rose and R. Yates, "Minimizing the average cost of paging and registration: a timer-based method," Wireless Networks, vol. 2, no. 2, pp. 109–116, June 1996. [4] K. Li, "Analysis of cost and quality of service of timebased dynamic mobility management in wireless networks," Wireless Networks, vol. 20, no. 2, pp. 261-288, Feb. 2014. 4. CONCLUSIONS [5] A. Bar-Noy, I. Kessler and M. Sidi, "Mobile users: to update or not to update?" Wireless Networks, vol. 1, no. 2, pp. 175–185, 1995. The conclusion of this project can be analyzes the reduction Multi source-destination path using the proposed solution. The simulations based on data sets evaluate the computational efficiency of the proposed solution. The primary job of a travel agency is to provide easy and trouble free travel to the traveller. It is also important for a travel agency to provide enough information to the tourist so that the tourist is not cheated so the process are done in an application. [6] K. Li, "Analysis of Distance-Based Location Management in Wireless Communication Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 2, pp. 225238, Feb. 2013. [7] B. Liang and Z. J. Haas, "Predictive distance-based mobility management for multidimensional PCS networks," IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp.718–732, Oct. 2003. This article also analyzes the reduction ratio of computational complexity using the proposed solution. The future research work will focus on the ride-sharing path planning methods with more preferences, e.g., the maximum number of shared persons, the pick-up/drop-off point selection, and the point of interest selection. In addition, the future research work should also consider the ride-sharing © 2019, IRJET | Impact Factor value: 7.211 [8] R. Chen, S. Yuan, and J. Zhu, "A dynamic location management method of personal communication system," ETech 2004, pp. 1–9. | ISO 9001:2008 Certified Journal | Page 1516 International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 03 | Mar 2019 p-ISSN: 2395-0072 www.irjet.net [9] C. K. Ng and H. W. Chan, "Enhanced Distance-Based Location Management of Mobile Communication Systems Using a Cell Coordinates Approach," IEEE Transactions on Mobile Computing, vol. 4, no. 1, pp. 41-55, Jan./Feb. 2005. [10] Y. Zhu, and V. C. M. Leung, "Derivation of moving distance distribution to enhance sequential paging in distance-based mobility management for PCS networks," IEEE Transactions on Wireless Communications, vol. 5, no. 11, pp. 3029–3033, Nov. 2006. [11] J. Zhou, H. Leong, Q. Lu, and K. Lee, "Optimizing Update Threshold for Distance-based Location Tracking Strategies in Moving Object Environments," WOWMOM 2007, pp. 1-8. [12] Y. Zhu and V. C. M. Leung, "Optimization of DistanceBased Location Management for PCS Networks," IEEE Transactions on Wireless Communications, vol. 7, no. 9, pp. 3507-3516, Sep. 2008. [13] Q. L. Zhao, S. C. Liew and Y. Yu, "Location Update Cost of Distance-Based Scheme for PCS Networks with CTRW model," IEEE Communications Letters, vol. 13, no. 2, pp. 408 - 410, June 2009. [14] R. M. Rodríguez-Dagnino, H. Takagi, "Application of renewal theory to call handover counting and dynamic location management in cellular mobile networks," European Journal of Operational Research, vol. 204, no. 1, pp. 1-13, 2010. [15] U. Patel and B. N Gohil, "Cell Identity Assignment Techniques in Cellular Network: A Review," 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT) 2011, pp. 594-596. © 2019, IRJET | Impact Factor value: 7.211 | ISO 9001:2008 Certified Journal | Page 1517