Greedy Perimeter Stateless Routing (GPSR) is a Position-Based Routing Protocol for Wireless Networks that uses the Position of routers. GPSR makes greedy forwarding decision by using closest neighbor’s information of destination. In GPSR each node has the knowledge of its current physical position and also the neighbor node, this knowledge about node provides better routing. When a packet reach...

1 — Because sensor nodes operate on power limited batteries, sensor functionalities have to be designed carefully. In particular, designing energy-efficient packet forwarding is important to maximize the lifetime of the network and to minimize the power usage at each node. This paper presents a Geographic Energy-Aware Multipath Stream-based (GEAMS) routing protocol for WMSNs. GEAMS routing deci...

Delay Tolerant Network(DTN) is a wireless network in which there will be no connectivity exists between source and destination in a given time. Due to the absence of fully connected path between the source and destination, there will be a problem to route a packet from one node to another in DTN .Similarity based techniques relying on contact patterns among nodes provide routing in DTN provides...

Routing in ad-hoc sensor networks is a complicated task because of many reasons. The nodes are low powered and they cannot maintain routing tables large enough for well-known routing protocols. Because of that, greedy forwarding at intermediate nodes is desirable in ad-hoc networks. Also, for traffic engineering, multipath capabilities are important. So, it is desirable to define routes at the ...

As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but deployments of such algorithms are currently uncommon because of some practical difficulties. Thi...

We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed by the sink to make the greedy forwarding of geographic routing dependable. OVCR discovers obstacle-free paths by the powerful sink as obstacles are detected. To bypass obstacles, the information of obstacle-free pat...

This paper presents a theoretical analysis of greedy geographic routing protocols on a common class of wireless sensor networks that must provide sensing coverage over a geographic area. Contrary to well known results on random networks, we prove that the Greedy Geographic Forwarding and our new greedy protocol always succeed in any sensing covered network when the communication range is at lea...

In geographic routing, nodes to theirinstantaneous neighbors call for to maintain up-to-date positions for making successfulforwarding decisions. The geographic location coordinates of the nodes by the periodic broadcasting of beacon packetsis atrendy method used by the majority geographic routing protocols to preserve neighbor positions. We contend and display that periodicbeaconing apart from...

Location privacy protection in VANETs considers preserving two types of information: the locations and identifications of users. However, existing solutions which either replace identifications by pseudonyms or hide locations in areas cannot be directly applied to geographic routing protocols since they degrade network performance. To address this issue, we proposed a location-preserved content...

Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in implementing many networking functions when standard bootstrapping or configuration services are not available, as will be the case in sensor networks where nodes are thrown or dropped to form a one-time use network....