Secured Two Phase Geographic Greedy Forwarding (SecuTPGF) is a geographic greedy forwarding protocol for transmitting multimedia data stream in Wireless Multimedia Sensor Networks (WMSN) in a secure and reliable manner. Cryptographic and MAC authentication mechanisms are used to implement security for both node and message authentication. In this paper, a modified version of SecuTPGF, the GSTP ...

The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair (H,φ), where H is a graph in which inter-node distances are supposed to be easy to compute or at least easy to estimate. This graph is ”augmented” by links, called long range links, which are selected according to the...

Wireless Sensor Networks (WSN) are set of energy-limited sensors, which recently have been point of interest due to their vast applications. One of the efficient ways to consume energy in these networks is to utilize optimal routing protocols. In this approach, we proposed a greedy hierarchical chain-based routing method, named, PGC (stands for Persian Greedy Chain) which route the network appl...

Wireless Sensor Networks (WSNs), which is a system of nodes connected by wireless links, is a very popular area for exploration. The nodes are free to move around and organize themselves into a network. The network topology is often changing, and for relatively smaller networks, the flat routing schemes are sufficient. However in larger networks, either geographical or hierarchical routing prot...

Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a “decentralized” routing algorithm using only local information. We develop a model of social networks based on an arbitrary metric space of points, with population density varying across the points. We consider rank-based friendships, wher...

We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate that, on average, CFR significantly outperforms the best known geometric routing algorithms in the path stretch: the speed of message delivery. Its performance approaches the shortest possible path. CFR maintains its adv...

In classical routing protocols, geographical distances/locations are typically used as the metric to select the best route, under the assumption that shorter distances exhibit lower energy consumption and nodes within the communication range of the sender can receive packets with a certain success probability. However, in underwater acoustic sensor networks (UASNs), sound propagation in the oce...

Direct routing is a special case of bufferless routing in which packets are not allowed to conflict with each other. The task is to compute the injection times of the packets so that they don’t conflict. A well known lower bound on the routing time of any algorithm is Ω(C + D), where the congestion C is the maximum number of paths that use any edge, and the dilation D is the maximum length of a...