To address the vulnerability of geographic routing to multiple security threats such as false routing information, selective forwarding and the Sybil attack in wireless sensor networks, this paper proposes a trust-based defending model against above-mentioned multiple attacks. Considering the characteristics of resource-constrained sensor nodes, trust values of neighboring nodes on the routing ...

Research on data routing strategies for wireless sensor networks (WSNs) has largely focused on energy efficiency. However rapid advances in WSNs require routing protocols which can accommodate new types of energy source and data of requiring short end-to-end delay. In this paper, we describe a duty-cycle-based low-latency geographic routing for asynchronous energy-harvesting WSNs. It uses an al...

Geographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery. However, it relies on a planar graph not always achievable in realistic ...

One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized hardware and/or infrastructure support for localization is costly and in many deployment scenarios infeasible. In this study, the wave mapping coordinate (WMC) system to address the localization problem is introduced for...

Geographic routing exerts geographic information to select the next-hop along the route to the destination. Greedy forwarding is a geographic routing mechanism that uses geographical location information of nodes and the distance of each node to the destination, to select next-hop node that achieve the most positive movement to the destination. Where greedy forwarding is not possible, it can be...

In order to make full use of geographic routing techniques developed for large scale networks, nodes must be localized. However, localization and virtual localization techniques in sensor networks are dependent either on expensive and sometimes unavailable hardware (e.g. GPS) or on sophisticated localization calculus (e.g. triangulation) which are both error-prone and with a costly overhead. In...

We live in a "small world," where two arbitrary people are likely connected by a short chain of intermediate friends. With scant information about a target individual, people can successively forward a message along such a chain. Experimental studies have verified this property in real social networks, and theoretical models have been advanced to explain it. However, existing theoretical models...

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

Geographic routing is well suited for large scale sensor networks, because its per node state is independent of the network size. However, due to the local minimum caused by holes/obstacles, the path stretch of geographic routing may degrade up to O(c2), where c is the path length of the optimal route. Recently, a geographic routing protocol based on the visibility graph (VIGOR) showed that a c...