scholarly journals A Geographic Unicast Routing Algorithm Using no Location Service

2010 ◽  
Author(s):  
Daniel Silvestre ◽  
Teresa Vazao
Keyword(s):  
Routing Algorithm ◽  
Location Service ◽  
Unicast Routing

A novel unicast routing algorithm for LEO satellite networks

2005 ◽  
Author(s):  
Xuegui Song ◽  
Kai Liu ◽  
Jun Zhang ◽  
Lianzhen Cheng
Keyword(s):  
Routing Algorithm ◽  
Satellite Networks ◽  
Unicast Routing ◽  
Leo Satellite Networks ◽  
Leo Satellite

A Novel Particle Swarm Algorithm to Optimize QoS Unicast Routing

2011 ◽  
Vol 230-232 ◽  
pp. 377-383 ◽  
Author(s):  
An Xin Ye ◽  
Jian Bin Wu
Keyword(s):  
Particle Swarm Optimization Algorithm ◽  
Routing Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
The Novel ◽  
Routing Problem ◽  
Unicast Routing ◽  
Np Complete ◽  
Chaotic Particle Swarm Optimization ◽  
Searching Ability

Unicast routing service is becoming a important requirement of computer networks supporting multimedia applications. And unicast routing problem has been demonstrated technically as a NP-complete. This paper proposes a novel QoS-based unicast routing algorithm using the Chaotic Particle Swarm Optimization algorithm (CPSO).The algorithm enhance the global searching ability when some particles have trapped in local minimums by chaotic series .The novel algorithm makes use of the ergodicity of chaotic search to improve the capability of precise search and keep the balance between the global search and the local search. The result of QoS shows that the CPSO algorithm has the advantage over the conventional algorithms in efficiency.

Reactive Location-Based Routing Algorithm with Cluster-Based Flooding

2012 ◽  
pp. 149-161
Author(s):  
Raul Aquino Santos
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Location Information ◽  
Location Services ◽  
Location Service ◽  
Wireless Routing ◽  
Predictive Algorithm ◽  
Local Decision ◽  
Hoc Networks

Location-Based Routing Algorithm with Cluster-Based Flooding (LORA-CBF) employs two location services: Simple and Reactive. A Simple Location Service has been implemented for neighbors nodes, and for faraway nodes, a Reactive Location Service is employed. In LORA-CBF, the source node includes the location of its destination in each packet. The packet moves hop by hop through the network, forwarded along via cooperating intermediates nodes. At each node, a purely local decision is made to forward the packet to the neighbor that is geographically closest to the destination. However, location information by itself does not guarantee the transmission between neighboring nodes in vehicular ad-hoc networks. Mobility and contention of wireless media may cause loss of packets being transferred, and this is very important aspect to consider in the development of wireless routing algorithms. Here, the authors have addressed this problem by including a predictive algorithm in LORA-CBF.

Sign in / Sign up

Export Citation Format

Share Document