—Routing is one of the difficult issues in mobile opportunistic networks, due to the lack of global knowledge and sporadic links. Related works use a greedy strategy to forward packets, i.e., they select relays with higher/bigger quality metrics. In this paper, we study the Opportunistic Routing Protocols (ORPs) from the perspective of social network analysis. Specifically, we discuss the impa...

This paper objects to extend Jon Kleinberg’s research. He introduced the structure of small-world in a grid and shows with a greedy algorithm using only local information able to find route between source and target in delivery time O(logn). His fundamental model for distributed system uses a two-dimensional grid with longrange random links added between any two node u and v with a probability ...

We consider an overlay architecture 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 structure that ...

In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we call holes. In this paper, we show that holes are important topological features that need to be studied. In routing, holes are communication voids that cause greedy forwarding to fail. Holes can also be defined to den...

In this paper we propose a new scheduling algorithm called Real Time Scheduling (RTS). This algorithm deals with all the contributing components of the end-to-end travelling delay of data packets in sensor network to achieve better power management and stable routes in case of failure. RTS delays packets at intermediate hops (not just prioritizes them) for a duration that is a function of their...

We present a table-less position based routing scheme for low power data centric wireless sensor networks. Our proposed scheme is localized, uses greedy forwarding approach, and does not rely on neighborhood information. These characteristics reduce the communication overhead (no neighborhood information exchange), make the protocol highly scalable (no routing tables are maintained and beacons ...

For the emerging wireless mesh networks with multiple radios and directional antennas, this paper first proposes a position-based deployment and routing strategy, and then gives a concrete approach under this strategy. The main idea of this strategy is to deploy the network in certain kind of geometric graph and then design a position-based routing protocol accordingly, so as to achieve efficie...

Most of the routing protocols proposed for ad-hoc networks and sensor networks are not designed with security as a goal. Hence, many routing protocols are vulnerable to an attack by an adversary who can disrupt the network or harness valuable information from the network. Routing Protocols for wireless sensor networks are classified into three types depending on their network structure as Flat ...