Learn More
—Segmentation decomposes a network with complex and irregular shape into a set of subnetworks, each under a simple boundary condition without bottlenecks. It has a wide spectrum of applications in routing, coverage, localization, backbone construction and maintenance, and in-network data centric storage and retrieval. To our best knowledge, this is the(More)
—Compared with its 2D counterpart, the scalability problem is greatly exacerbated in a 3D wireless sensor network. In this paper, we propose a scalable routing algorithm, dubbed Bubble Routing. It preprocesses global knowledge via a distributed algorithm, such that a node only needs to store a small constant information to make correct and efficient local(More)
OBJECTIVES The aim of the study is to evaluate tools that can improve surgical precision and minimize surgical trauma for removal of cavernomas in the paracentral area. Moreover, the surgical strategies for the treatment of symptomatic epilepsy in cavernoma patients are discussed. PATIENTS AND METHODS Between June 2000 and July 2007, 17 patients suffering(More)
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify the nodes on the boundaries of a 3D network, which serve as a key attribute that characterizes the network, especially in such geographic exploration tasks as terrain and underwater(More)
—Triangulation serves as the basis for many geometry-based algorithms in wireless sensor networks. In this paper we propose a distributed algorithm that produces a triangulation for an arbitrary sensor network, with no constraints on communication model or granularity of the triangulation. We prove its correctness in 2D, and further extend it to sensor(More)
On-chip communication, including short, often-multicast, latency-critical coherence and synchronization messages, and long, unicast, throughput-sensitive data transfers, limits the power efficiency and performance scalability of many-core chip-multiprocessor systems. This article analyzes on-chip communication challenges and studies the characteristics of(More)
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate the approximate geometry of the 3D sensor network, producing a set of " sealed " triangular boundary surfaces for separating non-boundary nodes and boundary node candidates. The former(More)
Location awareness is imperative for a variety of sensing applications and network operations. Although a diversity of GPS-less and GPS-free solutions have been developed recently for autonomous localization in wireless sensor networks, they primarily target at 2D planar or 3D volumetric settings. There exists unique and fundamental hardness to extend them(More)
This research focuses on distributed and localized algorithms for precise boundary detection in 3-D wireless networks. Our objectives are twofold. First, we aim to identify the nodes on the boundaries of a 3-D network, which serve as a key attribute that characterizes the network, especially in such geographic exploration tasks as terrain and underwater(More)