Abstract With the rapid development of tourism in economy, popular demand for also increases. Unreasonable distribution arises a series problems such as reduction tourist satisfaction and decrease income attractions. Based on consideration route planning, mathematical model which takes maximization overall all groups objective function is established by taking age preferences tourists, upper li...

In this paper, a novel algorithm for the load flow analysis problem in an islanded microgrid is proposed. The problem is modeled without any slack bus by considering the steady state frequency as one of the load flow variables. To model different control modes of DGs, such as droop, PV and PQ, in an islanded microgrid, a new formula for load flow equations is proposed. A hybrid optimization alg...

AODV protocol is an on demand reactive protocol, which exhibits congestion during high mobility and multiple data packet stream to a common destination. This may result in decaying the performance of AODV. The proposed modification is aim controlled congestion by applying efficient local route repair method. When the link failure is detected at intermediate node, a help message has broadcasts t...

The moving with fast velocity of each node in vehicular ad hoc network (VANET) results in the existence transient communication links, which degrade the performance of developed protocols. Established routes frequently become invalid, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we use cross layer approach solving these problems. First...

We investigate fast optimum route planning in large, real-world road networks for car navigation systems. We show how graph partitioning can be used to increase the speed of planning optimum routes. Creating a graph partition with future route planning in mind leads to a non-standard graph partitioning problem. In particular, the quality of a partition, indicated by the objective value, is assu...

We consider finding discrete logarithms in a group G when the help of an algorithm D that distinguishes certain subsets of G from each other is available. For a group G of prime order p, if algorithm D is polynomialtime with complexity c(log(p)), we can find discrete logarithms faster than square-root algorithms. We consider two variations on this idea and give algorithms solving the discrete l...