35581387
Cluster-based Location Discovery in Ad Hoc Sensor Networks
206892687
Recycled path routing in mobile ad hoc networks
In mobile ad hoc networks, many routing algorithms rely on some form of flooding to accomplish the route discovery process. Flooding, however, consumes many valuable network resources such as time, bandwidth, and power. Most current routing schemes expire valid routes after a time period to account for nodal movement. This paper proposes a new route discovery method, called recycled path routing (RPR), which directs broadcasts toward the destination node even in the absence of location information. The recycled path routing scheme reduces the search space for the destination node by implementing an expired route cache that is utilized by each node in the network. Routes are added to the expired route cache as they expire from the active route cache and remain there until some time interval has passed or a new route has been discovered. Since these expired routes can provide valuable insight into finding new routes, RPR uses them to direct broadcasts toward the destination node. RPR can save a significant quantity of valuable network resources because only nodes near the optimal path will rebroadcast route requests.
38077943
Position-Based Topology-Independent Scheduling Algorithms for Mobile Ad Hoc Networks
42767167
Location Discovery in Ad Hoc Sensor Networks
46184949
Adaptive Deadlock-Free Wormhole Routing in Faulty Hypercubes
34087964
Wormhole Routing in Faulty Mesh Networks
1849566
Facility Location and the Geometric Minimum-Diameter Spanning Tree
Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono- or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1, respectively. The more difficult dipolar case can so far only be solved in slightly subcubic time.This paper has two aims. First, we present a solution to a new data structure for facility location, the minimum-sum dipolar spanning tree (MSST), that mediates between the minimum-diameter dipolar spanning tree and the discrete two-center problem (2CP) in the following sense: find two centers p and q in P that minimize the sum of their distance plus the distance of any other point (client) to the closer center. This is of interest if the two centers do not only serve their customers (as in the case of the 2CP), but frequently have to exchange goods or personnel between themselves. We show that this problem can be solved in O(n2 log n) time and that it yields a factor-4/3 approximation of the MDST.Second, we give two fast approximation schemes for the MDST. One uses a grid and takes O*(E6-1/3 + n) time, where E = 1/? and the O*-notation hides terms of type O(logO(1) E). The other uses the well-separated pair decomposition and takes O(nE3+En log n) time. A combination of the two approaches runs in O*(E5 + n) time. Both schemes can also be applied to MSST and 2CP.
6873960
A scalable approach for reliable downstream data delivery in wireless sensor networks
There exist several applications of sensor networks wherere liability of data delivery can be critical. While the redundancy inherent in a sensor network might increase the degree of reliability, it by no means can provide any guaranteed reliability semantics. In this paper, we consider the problem of reliable sink-to-sensors data delivery. We first identify several fundamental challenges that need to be addressed, and are unique to a wireless sensor network environment. We then propose a scalable framework for reliable downstream data delivery that is specifically designed to both address and leverage the characteristics of a wireless sensor network, while achieving the reliability in an efficient manner. Through ns2 based simulations, we evaluate the proposed framework.
13915681
Capturing and animating skin deformation in human motion
During dynamic activities, the surface of the human body moves in many subtle but visually significant ways: bending, bulging, jiggling, and stretching. We present a technique for capturing and animating those motions using a commercial motion capture system and approximately 350 markers. Although the number of markers is significantly larger than that used in conventional motion capture, it is only a sparse representation of the true shape of the body. We supplement this sparse sample with a detailed, actor-specific surface model. The motion of the skin can then be computed by segmenting the markers into the motion of a set of rigid parts and a residual deformation (approximated first as a quadratic transformation and then with radial basis functions). We demonstrate the power of this approach by capturing flexing muscles, high frequency motions, and abrupt decelerations on several actors. We compare these results both to conventional motion capture and skinning and to synchronized video of the actors.
6978005
Pose estimation and integration for complete 3D model reconstruction
An automatic 3D model reconstruction technique is presented to acquire complete 3D models of real objects. The technique is based on novel approaches to pose estimation and integration. Two different poses of an object are used because a single pose often hides some surfaces from a range sensor. The presence of hidden surfaces makes the 3D model reconstructed from any single pose a partial model. Two such partial 3D models are reconstructed for two different poses of the object using a multi-view 3D modeling technique. The two partial 3D models are then registered. Coarse registration is facilitated by a novel pose estimation technique between two models. The pose is estimated by matching a stable tangent plane (STP) of each pose model with the base tangent plane (BTP) which is invariant for a vision system. The partial models are then integrated to a complete 3D model based on voxel classification defined in multi-view integration. Texture mapping is done to obtain a photo-realistic reconstruction of the object.
17579236
Adaptive topology control for wireless Ad hoc networks
Topology control in ad-hoc networks is the problem of adjusting the transmission power at network nodes in order to achieve the optimal topology that maximizes network performance. Recently, using effective topology control to optimize energy usage in the network has come into focus in the research community [1, 2]. The common thesis arrived at by existing works is that the transmission range used by mobile nodes should be the minimum required to keep the network connected. We refer to such a topology as the minimally connected topology in the rest of the paper. We argue in this work that the minimally connected topology does not always provide the optimal performance in typical ad-hoc networks. We show that in contrast, for typical ad-hoc networks with a few hundred nodes distributed over a few square miles area, the optimal topology is a function of the traffic load.