The Adhoc networks becomes very popular everyone is using these networks because of which we need to maintain up-to-date positions of their immediate neighbors for making effective forwarding decisions. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a popular method used by most geographic routing protocols to maintain neighbor positions...

Well-known ‘routing hole’ problem of geographic routing is hardly avoided in wireless sensor networks because of various actual geographical environments. Existing geographic routing protocols use perimeter routing strategies to find a detour path around the boundary of holes when they encounter the localminimum during greedy forwarding. However, this solution may lead to uneven energy consumpt...

Existing theoretical and simulation studies on georouting appear detached from experimental studies in real environments. We set up our test environment by using WSN430 wireless sensor nodes. To overcome the need for significant number of wireless nodes required to perform a realistic experiment in high density network, we introduce a novel approach emulation by using relatively small number of...

To address the explosive increase in mobile data traffic in recent years, content caching at storage-enabled network nodes has been proposed. Alongside, a variety of forwarding strategies have been developed for wireless networks that exploit the broadcast nature of the wireless medium and the presence of time-varying fading channels to improve user performance. A widely popular forwarding stra...

Geographic routing protocols have attracted interest in multi-hop wireless networks due to their ability to achieve good performance in the Greedy Forwarding (GF) mode at much lower overhead than conventional routing protocols such as DSR or DSDV. However, the performance of these protocols is impacted by physical voids, where a node has no neighbors closer than itself to the destination. Voids...

This work proposes the Cultural Greedy Ant (CGrAnt) protocol to solve the problem of data delivery in opportunistic and intermittently connected networks referred to as Delay Tolerant Networks (DTNs). CGrAnt is a hybrid Swarm Intelligence-based forwarding protocol designed to address the dynamic and complex environment of DTNs. CGrAnt is based on: (1) Cultural Algorithms (CA) and Ant Colony Opt...

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

Underwater wireless sensor networks (UWSN), similar to the terrestrial sensor networks, have different challenges such as limited bandwidth, low battery power, defective underwater channels, and high variable propagation delay. A crucial problem in UWSN is finding an efficient route between a source and a destination. Consequently, great efforts have been made for designing efficient protocols ...

We consider an overlay architecture (called OMNI) where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming applications. These MSNs are organized into an overlay and act as application-layer multicast forwarding entities for a set of clients. We present a decentralized scheme that organizes the MSNs into an appropriate overlay s...

Vehicular Ad Hoc Network (VANET) is a research field attracting growing attention. Current routing protocols in VANETs usually use route discovery to forward data packets to the destination. In addition, if vehicle density is low in the network, there might not be vehicles available to deliver the packet. This paper proposes HarpiaGrid, a geography-aware grid-based routing protocol for VANETs. ...