Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routin...

Position-based routing protocols have become increasingly popular in mobile ad-hoc networks because they can use geographical node position information to route data packets to their destinations. Each node periodically sends its geographical position information to its neighbours by using beacon packets. Data packet routing in position-based routing protocols uses the neighbours’ position info...

Geographical and Energy Aware Routing (GEAR) is an efficient routing protocol in wireless sensor networks (WSN). It behaves well in the face of routing attacks, but it is incapable of defending bogus routing information, sybil attack and selective forwarding. Aimed at this problem, this paper present a location pairwise keys bootstrap scheme based secure geographical and energy aware routing pr...

In this paper we consider hot-potato packet routing on trees. As a lower bound, for all sufficiently large n we construct a permutation routing problem on an n-node tree for which an oblivious greedy hot-potato algorithm requires at least 2n o(n) time steps. This lower bound is also valid for the minimumdistance heuristic. Applying the charging argument of Borodin et al. [8] we establish that a...

In mobile ad hoc networks (MANETs), geographical routing provides a robust and scalable solution for the randomly distributed unrestricted movement of nodes. Each node broadcasts beacon packets periodically to exchange its position with neighboring However, reliable beacons can negatively affect performance in dynamic environments, particularly when there is sudden rapid change nodes’ mobility....

The main goal of this paper is to provide routing– table-free online algorithms for wireless sensor networks (WSNs) to select cost (e.g., node residual energies) and delay efficient paths. As basic information to drive the routing process, both node costs and hop count distances are considered. Particular emphasis is given to greedy routing schemes, due to their suitability for resource constra...

This paper presents two GRASP metaheuristic algorithms for the vehicle routing problem, considering the capacity and shared demand of the customers. In this paper the solution obtained is compared with a greedy solution and two hybrid solutions (greedy and random). The results obtained show that the GRASP algorithm obtains a better quality solution for this kind of problem.