Geographic routing is a well established solution for scaling in large wireless ad-hoc networks. A fundamental issue is forwarding packets around voids to reach destinations in networks with sparse topologies. All general known solutions need first to get into a dead end, at link level, to be able afterwards to apply a recovery algorithm. These techniques can lead to very inefficient forwarding...

Applications that cater to the needs of disaster incident response generate large amount of data and demand large computational resource access. Such datasets are usually collected in the real-time at the incident scenes using different Internet of Things (IoT) devices. Hierarchical clouds, i.e., core and edge clouds, can help these applications’ real-time data orchestration challenges as well ...

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

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

In this paper we present a novel combinatorial approach for geographic routing with delivery guarantees. Proposed algorithm can be seen as a variant of GFG (Greedy Face Greedy of Bose et.al) algorithm, but based on the defined combinatorial properties of the graph. We utilize a distributed planarization algorithm of a geometric graph, which is based on the Schnyder's characterization of planar ...

Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geographic routing – using a combination of greedy forwarding and face routing – has been shown to work correctly and efficiently. In this work we model and analyze the correctness of geographic routing under non-ideal realist...

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...