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...

Vehicular Ad Hoc Networks (VANETs) have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing (or JBR). The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to...

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique cha...

While the problem of greedy behavior at the MAC layer has been widely explored in the context of wireless local area networks, its study for multi-hop wireless networks still almost unexplored and unexplained problem. Indeed, in a wireless local area network, an access point mostly forwards packets sent by wireless nodes over the wired link. In this case, a greedy node can easily get more bandw...

Exploring the faces of a planar graph is a prominent approach to recover from routing failures which may occur during geographic greedy forwarding heuristics. A recently studied variant of planar graph based recovery, termed geographical cluster based routing, performs face exploration along the edges of an overlay graph instead of using the network links directly. For this routing variant it h...

VANET (Vehicular Ad-hoc Network) is a special kind of MANET (Mobile Ad-hoc network) that operates based on a network of many highly mobile, wirelessly connected vehicles using multi-hop communication without access to some fixed infrastructure. VANET have unique characteristics, including high node mobility and rapidly changing network topology which differentiates it from MANET. Therefore, VAN...

Delay Tolerant Networks (DTNs) is a promising current research field that have captured a lot of attention. In DTN, an end-to-end path is not assured and packets are transmitted from a source node to a destination node by the use of store-carry-forward based routing. In case of DTN, a source node or an intermediary node accumulates the packets in its buffer and holds them at the time of moving ...

Opportunistic ad hoc networks are characterized by intermittent and infrastructure-less connectivity among mobile nodes. Because of the lack up-to-date network topology information frequent link failures, geographic routing utilizes location adopts store–carry–forward data delivery model to relay messages in a delay-tolerant manner. This paper proposes message-forwarding policy based on movemen...

In mobile ad-hoc networks (MANET), nodes are randomly distributed and move freely, hence the network may face rapid unexpected topological changes. this paper, an improved greedy perimeter stateless routing protocol, called “LDAB-GPSR”, is proposed. LDAB-GPSR mainly focuses on maximizing packet delivery ratio while minimizing control overhead. order to accomplish this, two techniques introduced...

In this thesis we study two research aspects of geographical routing: efficient geographical addressing and a new routing scheme. In the first part we offer a novel geographical routing algorithm that relies on a well known data structure called Quadtree. Quadtree is an efficient method of mapping a twodimensional area by recursively partitioning it to disjoint squares. We present a greedy, gua...