The topology formed by vehicles changes quickly, which makes routing become instable. Geographic routing such as GPSR, compared with traditional routing, is more scalable and feasible. However, the commonly used greedy forwarding in geographic routing often fails, due to the urban topology in VANET is particular. Some improvements have been proposed, such as GROOV, which calculates the feasibil...

Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packets by selecting relays with the best progress towards the destination or use a recovery mode in case such solutions ...

With number of moving vehicles, vehicular Ad Hoc Network (VANET) is formed. These are provided with the wireless connections. Among various challenges in the VANET such as security and privacy of the messages, data forwarding is also considered as a major challenge. The effective communication is mainly depends on the how safely and fast the data is being forwarded among the vehicles. Data forw...

Smart scheduling can be used to reduce infrastructure-to-vehicle energy costs in delay tolerant vehicular networks (Hammad et al., 2010). In this thesis we show that by combining this with vehicle-to-vehicle (V2V) forwarding, energy efficiency can be increased beyond that possible in the single hop case. This is accomplished by having the roadside infrastructure forward packets through vehicles...

Covert communication aims to hide the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, we examine the possibility and achievable performance of covert communication in one-way relay networks. Specifically, the relay is greedy and opportunistically transmits its own information to the destination covertly on top of forwarding th...

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

Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In t...

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

Cognitive Radio (CR) promises an efficient utilization of radio spectrum resources by enabling dynamic access to overcome the scarcity problem. Sensor Networks (CRSNs) are one type Wireless (WSNs) equipped with CR capabilities. CRSN nodes need operate energy-efficiently extend network lifetime due their limited battery capacity. In this paper, for first time in literature, we formulate problem ...