Add to ORKGWe propose a distributed and deterministic routing algorithm with constant storage, communication and computation overhead, dubbed trace-routing, for strong-connected 3D wireless sensor networks. Its basic idea is to construct a virtual cutting plane that intersects boundary surface to yield a trace, along which a routing path with guaranteed delivery can be established. We prove the correctness of trace-routing under both continuous and discrete settings. We im-plement the trace-routing algorithm on Crossbow sensors and carry out extensive simulations to evaluate its routing efficiency
3-D aerial and underwater sensor networks have found various applications in nat-ural habitat monito...
We consider the problem of routing with guaranteed delivery in wireless sensor networks where physic...
In sensor networks, routing algorithms should be designed such that packet losses due to wireless l...
With both computational complexity and storage space bounded by a small constant, greedy routing is ...
Abstract—Recently, geometric routing has emerged as an efficient routing strategy on wireless networ...
Abstract—This paper focuses on greedy routing in wireless net-works deployed on 2-D and 3-D surfaces...
In this paper, we focus on an energy efficient position-based three dimensional (3D) routing algorit...
The use of geographic routing protocols in Wireless Sensor Networks (WSN) is widely considered a via...
Abstract—In this paper we address the problem of scalable and load balanced routing for wireless sen...
Numerous routing algorithms for sensor networks have been proposed and their efficiencies have been ...
Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantia...
Due to the limited lifetime of the nodes in ad hoc and sensor networks, energy efficiency needs to b...
We present a trajectory-based routing (TBR) protocol, which efficiently routes data to a mobile sink...
Abstract — Point-to-point routing is central to communication networks. In this paper, we present a ...
Abstract. In this paper, we investigate how to design energy-efficient localized routing in a large-...
3-D aerial and underwater sensor networks have found various applications in nat-ural habitat monito...
We consider the problem of routing with guaranteed delivery in wireless sensor networks where physic...
In sensor networks, routing algorithms should be designed such that packet losses due to wireless l...
With both computational complexity and storage space bounded by a small constant, greedy routing is ...
Abstract—Recently, geometric routing has emerged as an efficient routing strategy on wireless networ...
Abstract—This paper focuses on greedy routing in wireless net-works deployed on 2-D and 3-D surfaces...
In this paper, we focus on an energy efficient position-based three dimensional (3D) routing algorit...
The use of geographic routing protocols in Wireless Sensor Networks (WSN) is widely considered a via...
Abstract—In this paper we address the problem of scalable and load balanced routing for wireless sen...
Numerous routing algorithms for sensor networks have been proposed and their efficiencies have been ...
Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantia...
Due to the limited lifetime of the nodes in ad hoc and sensor networks, energy efficiency needs to b...
We present a trajectory-based routing (TBR) protocol, which efficiently routes data to a mobile sink...
Abstract — Point-to-point routing is central to communication networks. In this paper, we present a ...
Abstract. In this paper, we investigate how to design energy-efficient localized routing in a large-...
3-D aerial and underwater sensor networks have found various applications in nat-ural habitat monito...
We consider the problem of routing with guaranteed delivery in wireless sensor networks where physic...
In sensor networks, routing algorithms should be designed such that packet losses due to wireless l...