Programmable switching chips are becoming more commonplace, along with new packet processing languages to configure the forwarding behavior. Our paper explores the design of a compiler for such switching chips, in particular how to map logical lookup tables to physical tables, while meeting data and control dependencies in the program. We study the interplay between Integer Linear Programming (...

In this paper, we propose a cross-layer optimized geographic node-disjoint multipath routing algorithm, that is, twophase geographic greedy forwarding plus. To optimize the system as a whole, our algorithm is designed on the basis of multiple layers’ interactions, taking into account the following. First is the physical layer, where sensor nodes are developed to scavenge the energy from environ...

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

The topology of a remote sensor system changes as a few sensors come up short on force, fall flat or Join the system; which might bring about loss of information or the velocity of exchange of information backs off. This issue is solved using Greedy Algorithm and the Hop Count Reduction (HCR) plan is used as a short-listening so as to slice procedure to decrease the steering bounces to the neig...

A wireless sensor network (WSN) consists of sensor nodes (SNs) with wireless communication capabilities for specific sensing tasks. Each SN maintains connectivity and exchanges messages between the decentralized nodes in the multi-hop manners. A source node can communicate with its destination via a certain number of relaying nodes, which consequently enlarges the wireless coverage of the sourc...

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

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

In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. In this paper, we study greedy geometric routing in R, using the standard Euclidean metric. Greedy geometric routing is not always possible in fixed-dimensional Euclidean spaces, of course, as is the ...

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

Geographic (or geometric) routing is known for routing messages in greedy manner. It means that the current node selects a neighbor node that is closest to the destination and forwards the message to it. Despite its simplicity and general efficiency, this strategy alone does not guarantee delivery of message due to the existence of local minima (or dead ends). If we want to overcome local minim...