Data delivery of packets in broad cast using wireless medium is the main intention of this paper, this will be done through a MANETS and should achieve reliable delivery. To do this various protocols are available in the networks world with in that efficient protocol called Position based opportunistic routing protocol which hold stateless property of geographic routing. When a data packet is s...

Data delivery of packets in broad cast using wireless medium is the main intention of this paper, this will be done through a MANETS and should achieve reliable delivery. To do this various protocols are available in the networks world with in that efficient protocol called Position based opportunistic routing protocol which holds stateless property of geographic routing. When a data packet is ...

Adaptive routing is used in networks in order to achieve fault tolerance and optimize performance for all traffic patterns. Most adaptive routing schemes route each packet independently, requiring addressing and sequencing information to be transmitted and processed for each packet. Connection-based message transport, such as virtual circuits, reduces the overhead for routing packets through th...

Popular ad hoc routing protocols such as DSDV and AODV use “predecessor” based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the routing table entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward table problem, in this paper we propo...

Wireless network applications, such as, searching, routing, self stabilization and query processing can be modeled as random walks on graphs. Stateless Opportunistic routing technique is a robust distributed routing technique based on random walk approach , where nodes transfer the packets to one of their direct neighbors uniformly, until the packets reach their destinations. Simplicity in exec...

Contention resolution schemes are the key determinant of the network performance in optical packet switched networks. This paper presents a contention resolution scheme in wavelength and space dimension. By integrating deflection routing with wavelength conversion, this paper investigates their effects on packet-loss performance through simulation studies. In particular, we propose a load-sensi...

In this paper, we analyze energy-aware geographical routing protocols with different parameters in wireless sensor networks. Geographic routing is a forwarding protocol that relies on geographic-position information. It is an on-demand type of routing that uses a “greedy” forwarding approach, in which a sensor node forwards a packet to a neighbor closest to the destination node. We study, throu...

We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support greedy routing with delivery guarantee in wireless ad hoc sensor networks. The main assets of HBR are: 1) packet delivery guarantee, 2) unique virtual addressing, 3) no packet overhead in typical cases, 4) small routing tables, 5) no physical geographic coo...

The Directed Flood-Routing Framework (DFRF) for wireless sensor networks that allows the rapid development of application specific routing protocols based on directed flooding is introduced in this paper. Flood-routing protocols are probabilistic methods that make only the best effort to route data packets. The presented family of protocols can route regular sized data packets via broadcast mes...

We propose MRPC, a new power-aware routing algorithm for energy-efficient routing that increases the operational lifetime of multi-hop wireless networks. In contrast to conventional power-aware algorithms, MRPC identifies the capacity of a node not just by its residualbattery energy,but also by the expected energy spent in reliably forwarding a packet over a specific link. Such a formulation be...