نتایج جستجو برای: dynamic route finding

تعداد نتایج: 711877  

Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

2012

In MANETs, the network’s wireless topology may be unpredictable and may change rapidly. The widely varying mobility characteristics are expected to have significant impact on the performance of the routing protocol. A host may lose its energy or roam independently without informing to its cooperative nodes, causing changes in network topology, and thus, these changes cause overwhelming affect i...

Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

2013
T. Sathya M. Karnan R. Sivakumar

-This paper presents a novel approach for finding dynamic shortest path in MANET using Genetic Algorithm with Memory schemes and Immigrants and compare that solutions with the result of Radial Basis Functional Network (RBFN) for getting global optimum route. At any time the dynamic location of the node is predicted by location prediction algorithm. The node will be able to periodically record i...

2002
Soon Don Kwon Jung Shin Park Jai Yong Lee

An on-demand routing protocol for Mobile Ad hoc Network (MANET) is one that searches for and tries to discover a route to some destination node only when a sending node generates a data packet addressed to that node. In order to avoid the need for such a route discovery to be performed before each data packet is sent, such routing protocols must cache previously discovered routes. But the cache...

2004
D. R. Wichmann B. C. Wünsche

Path planning is an important problem in Artificial Intelligence and Robotics. In this paper we examine the problem of finding an optimal path for a road connecting two points in a digital approximation of a real terrain. Additional constraints, such as terrain gradients, will be introduced in order to achieve more realistic roads. A performance comparison will be made between the standard A* a...

2015
Sun Hongfeng

In allusion to the influence of traffic flow change on vehicle routing selection, the article aims at finding the method for planning the trip route under the condition of knowing traffic flow change. The method combining particle swarm algorithm and dynamic planning is used for routing optimization in order to obtain the excellent route for various vehicles influenced by traffic flow. The road...

Journal: :JCM 2014
Bingkun Xu Yanping Li

—Mobile ad hoc networks (MANETs) are selforganizing, rapidly deployable networks without any fixed infrastructure. In MANETs, mobile terminals can move freely, which cause frequent link breakage. Due to the dynamic nature of the network, finding a stable route for transmitting data is a challenging task. In order to adapt to the topological changes and provide some quality of service (QoS), th...

Journal: :Discrete & Computational Geometry 1999

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید