Sun, 27 Jul 2008 07:35:30 BST CiteULike: samo83's library [101 articles] http://www.citeulike.org/user/samo83 CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/samo83/article/2205450 <i>(2005)</i><br /><br />Active data mining is becoming prevalent in applications requiring focused sampling of data relevant to a high-level mining objective. It is especially pertinent in scientific and engineering applications where we seek to characterize a configuration space or design space in terms of spatial aggregates, and where data collection can become costly. Examples abound in domains such as aircraft design, wireless system simulation, fluid dynamics, and sensor networks. This paper develops an active... Gaussian processes for active data mining of spatial aggregates N Ramakrishnan Bailey Kellogg S Tadepalli V Pandey (2005) 2008-01-07T23:58:32-00:00 2005 no-tag http://www.citeulike.org/user/samo83/article/2087030 <i>Computers & Geosciences, Vol. 30, No. 6. (July 2004), pp. 671-682.</i><br /><br />At present, there is a growing interest in wireless applications, due to the fact that the technology begins to support them at reasonable costs. In this paper, we present the technology currently available for use in wireless environments, focusing on Geographic Information Systems. As an example, we present a newly developed platform for the commercialization of advanced geographical information services for use in portable devices. This platform uses available mobile telephone networks and wireless local area networks, but it is completely scalable to new technologies such as third generation mobile networks. Users access the service using a vector map player that runs on a Personal Digital Assistant with wireless access facilities and a Global Positioning System receiver. Before accessing the information, the player will request authorization from the server and download the requested map from it, if necessary. The platform also includes a system for improving Global Positioning System localization with the Real Time Differential Global Positioning System, which uses short GSM messages as the transmission medium. Wireless technology applied to GIS Jordi Casademont Elena Lopez-Aguilera Josep Paradells Alfonso Rojas Anna Calveras Francisco Barcelo Josep Cotrina doi:10.1016/j.cageo.2004.02.004 Computers & Geosciences, Vol. 30, No. 6. (July 2004), pp. 671-682. 2007-12-10T22:32:34-00:00 2004 Computers & Geosciences 30 6 671 682 gis wireless http://www.citeulike.org/user/samo83/article/1061473 <i>Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on, Vol. 2 (2005), pp. 534-539 Vol. 2.</i><br /><br />Some of the algorithms developed within the artificial neural-networks tradition can be easily adopted to wireless sensor network platforms and will meet the requirements for sensor networks like: simple parallel distributed computation, distributed storage and data robustness. As a result of the dimensionality reduction obtained simply from the outputs of the neural-networks clustering algorithms, lower communication costs and energy savings can also be obtained. In this paper we will present two possible implementations of the ART and FuzzyART neural-networks algorithms, which are unsupervised learning methods for categorization of the sensory inputs. They are tested on a data obtained from a set of several motes, equipped with several sensors each. Results from simulations of purposefully faulty sensors show the data robustness of these architectures. The proposed neural-networks classifiers have distributed short and long-term memory of the sensory inputs and can function as security alert when unusual sensor inputs are detected. Tracking of unusual events in wireless sensor networks based on artificial neural-networks algorithms A Kulakov D Davcev Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on, Vol. 2 (2005), pp. 534-539 Vol. 2. 2007-01-23T00:31:33-00:00 2005 Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on 2 534 539 Vol. 2 no-tag http://www.citeulike.org/user/samo83/article/604302 <i>(2002), pp. 317-327.</i> Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks Chris Savarese Jan Rabaey Koen Langendoen (2002), pp. 317-327. 2006-04-27T09:31:26-00:00 2002 317 327 USENIX Association no-tag http://www.citeulike.org/user/samo83/article/717068 <i>Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE, Vol. 3 (2003), pp. 1609-1614 vol.3.</i><br /><br />We present two algorithms for the efficient placement of sensors in a sensor field. The proposed approach is aimed at optimizing the number of sensors and determining their placement to support distributed sensor networks. The optimization framework is inherently probabilistic due to the uncertainty associated with sensor detections. The proposed algorithms address coverage optimization under the constraints of imprecise detections and terrain properties. These algorithms are targeted at average coverage as well as at maximizing the coverage of the most vulnerable grid points. The issue of preferential coverage of grid points (based on relative measures of security and tactical importance) is also modeled. Experimental results for an example sensor field with obstacles demonstrate the application of our approach. Sensor placement for effective coverage and surveillance in distributed sensor networks SS Dhillon K Chakrabarty Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE, Vol. 3 (2003), pp. 1609-1614 vol.3. 2006-06-30T07:39:14-00:00 2003 Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE 3 1609 1614 vol.3 no-tag http://www.citeulike.org/user/samo83/article/717044 <i>INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 3 (2001), pp. 1380-1387 vol.3.</i><br /><br />Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. We address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining the computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, we establish the main highlight of the paper-optimal polynomial time worst and average case algorithm for coverage calculation. We also present comprehensive experimental results and discuss future research directions related to coverage in sensor networks Coverage problems in wireless ad-hoc sensor networks S Meguerdichian F Koushanfar M Potkonjak MB Srivastava INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 3 (2001), pp. 1380-1387 vol.3. 2006-06-30T07:26:49-00:00 2001 INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE 3 1380 1387 vol.3 no-tag http://www.citeulike.org/user/samo83/article/446836 <i>(2003), pp. 28-39.</i> Integrated coverage and connectivity configuration in wireless sensor networks Xiaorui Wang Guoliang Xing Yuanfang Zhang Chenyang Lu Robert Pless Christopher Gill doi:10.1145/958491.958496 (2003), pp. 28-39. 2005-12-21T16:57:53-00:00 2003 28 39 ACM Press no-tag http://www.citeulike.org/user/samo83/article/352724 <i>Proceedings of the IEEE, Vol. 91, No. 8. (2003), pp. 1247-1256.</i><br /><br />Wireless microsensor networks have been identified as one of the most important technologies for the 21st century. This paper traces the history of research in sensor networks over the past three decades, including two important programs of the Defense Advanced Research Projects Agency (DARPA) spanning this period: the Distributed Sensor Networks (DSN) and the Sensor Information Technology (SensIT) programs. Technology trends that impact the development of sensor networks are reviewed, and new applications such as infrastructure security, habitat monitoring, and traffic control are presented. Technical challenges in sensor network development include network discovery, control and routing, collaborative signal and information processing, tasking and querying, and security. The paper concludes by presenting some recent research results in sensor network algorithms, including localized algorithms and directed diffusion, distributed tracking in wireless ad hoc networks, and distributed classification using local agents. Sensor networks: evolution, opportunities, and challenges Chee-Yee Chong SP Kumar doi:10.1109/JPROC.2003.814918 Proceedings of the IEEE, Vol. 91, No. 8. (2003), pp. 1247-1256. 2005-10-17T12:21:20-00:00 2003 Proceedings of the IEEE 91 8 1247 1256 history military sensor-networks http://www.citeulike.org/user/samo83/article/1112084 <i>Int. J. Netw. Manag., Vol. 15, No. 4. (July 2005), pp. 235-253.</i> Management and configuration issues for sensor networks Pedro Marr&\#243;n Andreas Lachenmann Daniel Minder Matthias Gauger Olga Saukh Kurt Rothermel doi:10.1002/nem.571 Int. J. Netw. Manag., Vol. 15, No. 4. (July 2005), pp. 235-253. 2007-02-19T01:15:40-00:00 2005 Int. J. Netw. Manag. 1099-1190 15 4 235 253 John Wiley & Sons, Inc. management http://www.citeulike.org/user/samo83/article/1112077 <i>(2006), pp. 1039-1044.</i> Multipath fading in wireless sensor networks: measurements and interpretation Daniele Puccinelli Martin Haenggi doi:10.1145/1143549.1143757 (2006), pp. 1039-1044. 2007-02-19T01:10:58-00:00 2006 1039 1044 ACM Press multipath http://www.citeulike.org/user/samo83/article/500131 <i>(2005), pp. 51-63.</i> A macroscope in the redwoods Gilman Tolle Joseph Polastre Robert Szewczyk David Culler Neil Turner Kevin Tu Stephen Burgess Todd Dawson Phil Buonadonna David Gay Wei Hong doi:10.1145/1098918.1098925 (2005), pp. 51-63. 2006-02-09T15:31:27-00:00 2005 51 63 ACM Press redwoods http://www.citeulike.org/user/samo83/article/500132 <i>(2005), pp. 64-75.</i> Design and deployment of industrial sensor networks: experiences from a semiconductor plant and the north sea Lakshman Krishnamurthy Robert Adler Phil Buonadonna Jasmeet Chhabra Mick Flanigan Nandakishore Kushalnagar Lama Nachman Mark Yarvis doi:10.1145/1098918.1098926 (2005), pp. 64-75. 2006-02-09T15:34:10-00:00 2005 64 75 ACM Press design industrial sensor-networks http://www.citeulike.org/user/samo83/article/1106032 <i>: Network and Parallel Computing (2004), pp. 544-550.</i> Online Mining in Sensor Networks Xiuli Ma Dongqing Yang Shiwei Tang Qiong Luo Dehui Zhang Shuangfeng Li : Network and Parallel Computing (2004), pp. 544-550. 2007-02-13T22:56:02-00:00 2004 : Network and Parallel Computing 544 550 data-mining http://www.citeulike.org/user/samo83/article/1106015 <i>(2001)</i><br /><br />This paper describes an incremental deployment algorithm for mobile sensor networks. A mobile sensor network is a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. The algorithm described in this paper will deploy such nodes one-at-a-time into an unknown environment, with each node making use of information gathered by previously deployed nodes to determine its deployment location. The algorithm is designed to maximize network... An incremental self-deployment algorithm for mobile sensor networks A Howard M Matadd G Sukhatme (2001) 2007-02-13T22:37:37-00:00 2001 self-deployment sensor-networks http://www.citeulike.org/user/samo83/article/276216 <i>(1999), pp. 263-270.</i><br /><br />Networked sensors -- those that coordinate amongst themselves to achieve a larger sensing task -- will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present unique challenges in the design of unattended autonomous sensor networks. These challenges lead us to hypothesize that sensor network coordination applications may need to be structured differently... Next Century Challenges: Scalable Coordination in Sensor Networks Deborah Estrin Ramesh Govindan John Heidemann Satish Kumar (1999), pp. 263-270. 2005-08-07T08:31:08-00:00 1999 263 270 sensor-networks http://www.citeulike.org/user/samo83/article/1082696 <i>Annals of Operations Research, Vol. V86, No. 0. (1 January 1999), pp. 559-568.</i> An exact algorithm for a milk tanker scheduling and sequencing problem C Basnet LR Foulds JM Wilson doi:10.1023/A:1018943910798 Annals of Operations Research, Vol. V86, No. 0. (1 January 1999), pp. 559-568. 2007-02-01T23:26:53-00:00 1999 Annals of Operations Research V86 0 559 568 scheduling sequencing http://www.citeulike.org/user/samo83/article/846987 <i>(1999), pp. 271-278.</i><br /><br />Large-scale networks of wireless sensors are becoming an active topic of research. Advances in hardware technology and engineering design have led to dramatic reductions in size, power consumption and cost for digital circuitry, wireless communications and Micro ElectroMechanical Systems (MEMS). This has enabled very compact, autonomous and mobile nodes, each containing one or more sensors, computation and communication capabilities, and a power supply. The missing ingredient is the networking... Next Century Challenges: Mobile Networking for ”Smart Dust” JM Kahn RH Katz KSJ Pister (1999), pp. 271-278. 2006-09-16T21:13:19-00:00 1999 271 278 smart-dust http://www.citeulike.org/user/samo83/article/482190 <i>(2000), pp. 56-67.</i> Directed diffusion: a scalable and robust communication paradigm for sensor networks Chalermek Intanagonwiwat Ramesh Govindan Deborah Estrin doi:10.1145/345910.345920 (2000), pp. 56-67. 2006-01-27T03:27:50-00:00 2000 56 67 ACM Press directed-diffusion sensor-networks http://www.citeulike.org/user/samo83/article/911532 <i>J. Phys.: Conf. Ser., Vol. 48, No. 1. (2006), 1195.</i> The Design of Wireless Sensor Network System Based on ZigBee Technology for Greenhouse YW Zhu XX Zhong JF Shi doi:10.1088/1742-6596/48/1/223 J. Phys.: Conf. Ser., Vol. 48, No. 1. (2006), 1195. 2006-10-24T18:42:43-00:00 2006 J. Phys.: Conf. Ser. 1742-6596 48 1 1195 Institute of Physics Publishing sensor-networks zigbee http://www.citeulike.org/user/samo83/article/942337 <i>(1994), pp. 212-225.</i> MACAW: a media access protocol for wireless LAN's Vaduvur Bharghavan Alan Demers Scott Shenker Lixia Zhang doi:10.1145/190314.190334 (1994), pp. 212-225. 2006-11-14T02:19:09-00:00 1994 212 225 ACM Press protocol routing wireless http://www.citeulike.org/user/samo83/article/942335 <i>Mobile Networks and Applications, Vol. 1, No. 2. (1996), pp. 89-104.</i><br /><br />. Mobile wireless networks pose interesting challenges for routing system design. To produce feasible routes in a mobile wireless network, a routing system must be able to accommodate roving users, changing network topology, and fluctuating link quality. We discuss the impact of node mobility and wireless communication on routing system design, and we survey the set of techniques employed in or proposed for routing in mobile wireless networks. 1. Introduction Mobile wireless networking has... A Survey of Routing Techniques for Mobile Communications Networks S Ramanathan Martha Steenstrup Mobile Networks and Applications, Vol. 1, No. 2. (1996), pp. 89-104. 2006-11-14T02:14:49-00:00 1996 Mobile Networks and Applications 1 2 89 104 routing wireless http://www.citeulike.org/user/samo83/article/936007 <i>Computer Communications, special issue on Sensor Networks</i><br /><br />Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The sensor coverage problem has received increased attention recently, being considerably driven by recent advances in affordable and efficient integrated electronic devices. This problem is centered around a fundamental question: How well do the sensors observe the physical space? The coverage concept is subject to a wide range of interpretations due to a variety of sensors and their applications. Different coverage formulations have been proposed, based on the subject to be covered (area versus discrete points) and sensor deployment mechanism (random versus deterministic) as well as on other wireless sensor network properties (e.g. network connectivity and minimum energy consumption). In this article, we survey recent contributions addressing energy efficient coverage problems in the context of static wireless sensor networks. We present various coverage formulations, their assumptions, as well as an overview of the solutions proposed. Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks Mihaela Cardei Jie Wu Computer Communications, special issue on Sensor Networks 2006-11-08T02:32:50-00:00 Computer Communications, special issue on Sensor Networks coverage energy sensor-networks wireless http://www.citeulike.org/user/samo83/article/531196 <i>Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International (2004), 220.</i><br /><br />Summary form only given. Most of the current research in wireless sensor networks (WSN, for short) is constraint driven and focuses on optimizing the use of limited resources (for example, power) at each sensor. While such constraints are important, there is a need for more general performance metrics describing the effectiveness of WSNs. There is also a need for a unified model that would enable comparison of different types of WSNs. We propose a new service-centric model that focuses on services provided by a WSN and their corresponding performance metrics. A WSN is modeled at different levels of abstraction. For each level, a set of services and a set of metrics are defined. A mapping between metrics at different levels relates high-level, mission-oriented metrics to low-level capability-oriented metrics. The proposed model consists of mission, network, region, sensor, and capability layers. Within each layer, four planes are identified, namely, communications, management, application, and generation learning. The proposed model provides a flexible, open framework for expressing and evaluating capabilities, functionalities, management, behavior, and evolution of a WSN. In addition, the proposed model provides a holistic approach to comparing WSNs and to measuring their effectiveness. The generation learning plane is unique in that it serves to extend the longevity of the network and to enhance the network effectiveness over time. On modeling wireless sensor networks D Gracanin M Eltoweissy S Olariu A Wadaa Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International (2004), 220. 2006-03-05T23:46:29-00:00 2004 Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International 220 sensor-networks wireless http://www.citeulike.org/user/samo83/article/471061 <i>Wireless Networks, Communications and Mobile Computing, 2005 International Conference on, Vol. 1 (2005), pp. 458-463.</i><br /><br />Wireless mesh networks (WMN) will play an important role in the next-generation wireless communication systems because it can support broadband services with ubiquitous coverage by low transmission power. In this paper, we propose a multi-channel ring-based wireless mesh network and develop an analytical framework to evaluate the capacity and coverage of such a network. In the analytical framework, we first establish a physical (PHY)/medium access control (MAC) cross-layer throughput performance model by including the carrier sense multiple access (CSMA) MAC protocol and distance-based rate adaptation with multi-hop connections. Based on the derived throughput model, we apply the mixed-integer nonlinear programming (MINLP) optimization approach to maximize the capacity (throughput) and service coverage of a mesh cell, in which the number of rings in a mesh cell and the radius for each ring are determined. Coverage and Capacity of A Wireless Mesh Network Jane-Hwa Huang Li-Chun Wang Chung-Ju Chang Wireless Networks, Communications and Mobile Computing, 2005 International Conference on, Vol. 1 (2005), pp. 458-463. 2006-01-19T15:15:25-00:00 2005 Wireless Networks, Communications and Mobile Computing, 2005 International Conference on 1 458 463 capacity coverage wireless http://www.citeulike.org/user/samo83/article/514252 <i>Journal of Combinatorial Optimization, Vol. 11, No. 1. (February 2006), pp. 21-41.</i> Coverage by directional sensors in randomly deployed wireless sensor networks Jing Ai Alhussein Abouzeid doi:10.1007/s10878-006-5975-x Journal of Combinatorial Optimization, Vol. 11, No. 1. (February 2006), pp. 21-41. 2006-02-21T11:30:18-00:00 2006 Journal of Combinatorial Optimization 1382-6905 11 1 21 41 Springer coverage sensor-networks wireless http://www.citeulike.org/user/samo83/article/622187 <i>Journal of Combinatorial Optimization, Vol. 11, No. 3. (May 2006), pp. 291-304.</i> Efficient point coverage in wireless sensor networks Jie Wang Ning Zhong doi:10.1007/s10878-006-7909-z Journal of Combinatorial Optimization, Vol. 11, No. 3. (May 2006), pp. 291-304. 2006-05-10T22:04:51-00:00 2006 Journal of Combinatorial Optimization 1382-6905 11 3 291 304 Springer coverage sensor-networks wireless http://www.citeulike.org/user/samo83/article/241999 <i>Mobile Networks and Applications, Vol. 10, No. 4. (January 2005), pp. 519-528.</i> The Coverage Problem in a Wireless Sensor Network Chi-Fu Huang Yu-Chee Tseng doi:10.1007/s11036-005-1564-y Mobile Networks and Applications, Vol. 10, No. 4. (January 2005), pp. 519-528. 2005-07-02T04:26:11-00:00 2005 Mobile Networks and Applications 1383-469X 10 4 519 528 Kluwer Academic Publishers coverage sensor-networks wireless http://www.citeulike.org/user/samo83/article/935997 <i></i><br /><br />Wireless networks have a lot of geometric properties since the signal strength corresponds directly to the distance. Earlier research findings in geometry, such as Voronoi diagram, have found a lot of applications in wireless networks. In this paper, a new geometric diagram, referred to as the umbrella diagram, is proposed. The umbrella diagram is comparable to the Voronoi diagram. The Voronoi diagram deals with a set of points, whereas the umbrella diagram deals with a set of different networks. The umbrella diagram of a set of hexagonal networks is to divide the plane into regions such that the points in a region have a larger distance to one network than to the other networks. Unlike the Voronoi diagram, the regions in the umbrella diagram are not necessarily convex. The paper gives an efficient solution to compute the umbrella diagram of n networks with the same cell size and orientation. Like the Voronoi diagram, the umbrella diagram has potential to be used in many areas. To illustrate its usefulness, the paper further gives two applications in wireless networks: the optimal network deployment and the maximum base station reuse. The optimal network deployment intends to find the best position to fix the network such that the network is closest to all existing base stations. The maximum base station reuse problem is to maximize the number of base stations that can be reused under a given bound. A Novel Geometric Diagram and Its Applications in Wireless Networks Guangbin Fan Jingyuan Zhang 2006-11-08T02:24:11-00:00 IEEE INFOCOM 2004 geometry wireless http://www.citeulike.org/user/samo83/article/935995 <i>Lecture notes in computer science (Lect. notes comput. sci.) ISSN 0302-9743</i><br /><br />Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such networks, namely the coverage problem, in which we would like to determine whether a region of interest is sufficiently covered by a given set of sensors. This problem is motivated by monitoring applications in sensor networks, as well as robustness concerns and protocol requirements. We show that the coverage problem and some of its variants can be treated in a unified manner using suitable generalizations of the Voronoi diagram. As a result, we are able to give algorithms that have better runtimes than those proposed in previous works (see, e.g., [5, 6]). Our approach also yields efficient algorithms for coverage problems where the sensing region of a sensor is an ellipse or an Lpball, where p >= 1. On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams Anthony So Yinyu Ye Lecture notes in computer science (Lect. notes comput. sci.) ISSN 0302-9743 2006-11-08T02:19:49-00:00 Lecture notes in computer science (Lect. notes comput. sci.) ISSN 0302-9743 Springer, Berlin, ALLEMAGNE (2005) (Monographie) coverage geometry sensor-networks wireless http://www.citeulike.org/user/samo83/article/935994 <i></i><br /><br />Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. In this paper, we address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, we establish the main highlight of the paper - optimal polynomial time worst and average case algorithm for coverage calculation. We also present comprehensive experimental results and discuss future research directions related to coverage in sensor networks. Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian Farinaz Koushanfar Miodrag Potkonjak Mani Srivastava 2006-11-08T02:13:08-00:00 coverage sensor-networks wireless http://www.citeulike.org/user/samo83/article/935988 <i>Landslides and debris flows: analysis, monitoring, modeling and hazard (March 2005)</i><br /><br />This work presents the first results of an experiment aiming to derive a high resolution Digital Terrain Model (DTM) by kinematic GPS surveying. The accuracy of the DTM depends on both the operational GPS precision and the density of GPS samples. The operational GPS precision, measured in the field, is about 10 cm. A Monte Carlo analysis is performed to study the dependence of the DTM error on the sampling procedure. The outcome of this analysis is that the accuracy of the topographic reconstruction is less than 1m even in areas with a density of samples as low as one sample per 100m2, and becomes about 30 cm in areas with at least one sample per 10m2. The kinematic GPS technique gives a means for a fast and accurate mapping of terrain surfaces with an extension of a few km2. Examples of application are the investigation of archaeological sites and the stability analysis of landslide prone areas. Terrain modelling by kinematical GPS survey G Nico P Rutigliano C Benedetto F Vespe Landslides and debris flows: analysis, monitoring, modeling and hazard (March 2005) 2006-11-08T02:05:48-00:00 2005 Landslides and debris flows: analysis, monitoring, modeling and hazard Natural hazards and earth system sciences gps http://www.citeulike.org/user/samo83/article/935956 <i>ACM Computing Surveys, Vol. 23, No. 3. (September 1991)</i><br /><br />This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. The paper puts particular emphasis on the unified exposition of its mathematical and algorithmic properties. Finally, the paper provides the first comprehensive bibliography on Voronoi diagrams and related structures. Voronoi Diagrams —A Survey of a Fundamental Geometric Data Structure Franz Aurenhammer ACM Computing Surveys, Vol. 23, No. 3. (September 1991) 2006-11-07T23:50:38-00:00 1991 ACM Computing Surveys 23 3 geometry http://www.citeulike.org/user/samo83/article/935923 <i>(2006), pp. 253-260.</i><br /><br />To obtain a satisfied performance of wireless sensor network, an adaptable sensor deployment method for various applications is essential. In this paper, we propose a centralized sensor deployment method, DT-Score, aims to maximize the coverage of a given sensing area with obstacles. The DT-Score consists of two phases. In the first phase, we use a contour-based deployment to eliminate the coverage holes near the boundary of sensing area and obstacles. In the second phase, a deployment method based on the Delaunay Triangulation is applied for the uncovered regions. Before deploying a sensor, each candidate position generated from the current sensor configuration is scored by a probabilistic sensor detection model. A new sensor is placed to the position with the most coverage gains. According to the simulation results, DT-Score can reach higher coverage than grid-based and random deployment methods with the increasing of deployable sensors. A Delaunay Triangulation Based Method for Wireless Sensor Network Deployment Chun-Hsien Wu Kuo-Chuan Lee Yeh-Ching Chung doi:10.1109/ICPADS.2006.11 (2006), pp. 253-260. 2006-11-07T22:50:03-00:00 2006 253 260 IEEE Computer Society geometry sensor-networks wireless http://www.citeulike.org/user/samo83/article/935922 <i>(2001)</i><br /><br />Application-layer multicast supports group applications without the need for a network-layer multicast protocol. Here, applications arrange themselves in a logical overlay network and transfer data within the overlay. In this paper, we present an application-layer multicast solution that uses a Delaunay triangulation as an overlay network topology. An advantage of using a Delaunay triangulation is that it allows each application to locally derive next-hop routing information without requiring a routing protocol in the overlay. A disadvantage of using a Delaunay triangulation is that the mapping of the overlay to the network topology at the network and data link layer may be suboptimal.We present a protocol, called Delaunay triangulation (DT protocol), which constructs Delaunay triangulation overlay networks. We present measurement experiments of the DT protocol for overlay networks with up to 10 000 members, that are running on a local PC cluster with 100 Linux PCs. The results show that the protocol stabilizes quickly, e.g., an overlay network with 10 000 nodes can be built in just over 30 s. The traffic measurements indicate that the average overhead of a node is only a few kilobits per second if the overlay network is in a steady state. Results of throughput experiments of multicast transmissions (using TCP unicast connections between neighbors in the overlay network) show an achievable throughput of approximately 15 Mb/s in an overlay with 100 nodes and 2 Mb/s in an overlay with 1000 nodes. Application-Layer Multicasting with Delaunay Triangulation Overlays J Liebeherr M Nahas W Si (2001) 2006-11-07T22:48:18-00:00 2001 University of Virginia geometry multicasting http://www.citeulike.org/user/samo83/article/935920 <i></i> Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks 2006-11-07T22:45:18-00:00 geometry wireless http://www.citeulike.org/user/samo83/article/935904 <i>Wirel. Commun. Mob. Comput., Vol. 6, No. 2. (March 2006), pp. 247-258.</i><br /><br />In this paper, we propose a general algorithm (based on an unified framework for both routing and geocasting problems), in which message is forwarded to exactly those neighbors which may be best choices for a possible position of destination (using the appropriate criterion). We then propose and discuss new VD-GREEDY and CH-MFR methods and define R-DIR, modified version of existing directional methods. In VD-GREEDY method, these neighbors are determined by intersecting the Voronoi diagram of neighbors with the circle (or rectangle) of possible positions of destination, while the portion of the convex hull of neighboring nodes is analogously used in the CH-MFR method. Routing and geocasting algorithms differ only inside the circle/rectangle. The proposed methods may be also used for the destination search phase allowing the application of different routing schemes after the exact position of destination is discovered. VD-GREEDYand CH-MFR algorithms are loop free, and have smaller flooding rate (with similar success rate) compared to directional method.We proposed to use dominating set concept to reduce flooding ratio significantly, with a marginal impact on success rate and hop count. Simulations, involving the proposed and some known algorithms, are performed for two basic scenarios, one for geocasting and reactive routing, and the other for proactive routing, and both showed that our methods have higher success rate and lower flooding rate compared to existing methods. Voronoi diagram and convex hull based geocasting and routing in wireless networks: Research Articles Ivan Stojmenovic Anand Ruhil DK Lobiyal doi:10.1002/wcm.v6:2 Wirel. Commun. Mob. Comput., Vol. 6, No. 2. (March 2006), pp. 247-258. 2006-11-07T22:30:41-00:00 2006 Wirel. Commun. Mob. Comput. 1530-8669 6 2 247 258 John Wiley and Sons Ltd. geocasting geometry routing wireless http://www.citeulike.org/user/samo83/article/935900 <i>(2003)</i><br /><br />A wireless sensor network is a special kind of ad-hoc network with distributed sensing and processing capability that can be used in a wide range of applications, such as environmental monitoring, industrial applications and precision agriculture. Despite their potential applications, such networks have particular features imposed by resource restrictions, such as low computational power, reduced bandwidth and specially limited power source. In case of a network with a high density of sensor nodes, some problems may arise such as the intersection of sensing area, redundant data, communication interference, and energy waste. A management application is necessary to make the most of network resources. On the other hand, a high-density network can introduce a fault-tolerant mechanism, increase precision, and provide multi-resolution data. The network density control depends on the application. In this paper, we propose a method to set up which nodes should be turned off or on. The management may take the sensor node out of service temporally. Our design uses a Voronoi Diagram, which decomposes the space into regions around each node. That schema could be used in a management architecture for a wireless sensor network. Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach Marcos Luiz Linnyer Ruiz Antonio Loureiro Antonio Fernandes Jos&\#233; (2003) 2006-11-07T22:23:57-00:00 2003 IEEE Computer Society geometry scheduling sensor-networks wireless http://www.citeulike.org/user/samo83/article/555179 <i>(1999)</i><br /><br />When n identical randomly located nodes, each capable of transmitting at W bits/sec and using a fixed range, form a wireless network, the throughput (n) obtainable by each node for a randomly chosen destination is ( W p n log n ) bits/sec under a non-interference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission's range is optimally chosen, the bit-distance product that can be transported by the network per second... Capacity of wireless networks P Gupta P Kumar (1999) 2006-03-17T02:06:31-00:00 1999 capacity wireless http://www.citeulike.org/user/samo83/article/832124 <i></i><br /><br />This paper introduces BGR, a new beacon-less geographic routing algorithm for wireless sensor networks. Data packets are forwarded toward the destination, and nodes which hear the packet compete for becoming the next hop. A recovery strategy is provided for the case of empty forwarding areas. The main innovation is a strategy to avoid simultaneous forwarding situations, which would otherwise cause packet failures. It is confirmed by simulation that BGR sends very few packets and is... BGR: Blind Geographic Routing For Networks 2006-09-06T04:44:45-00:00 geography routing sensor-networks wireless http://www.citeulike.org/user/samo83/article/828063 <i>Networks, Vol. 25 (1995), pp. 59-68.</i><br /><br />Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a competitive ratio of 6 for unit disk graphs. Our heuristics do not need a geometric representation of unit... Simple Heuristics for Unit Disk Graphs Madhav Marathe Heinz Breu Harry SS Ravi Daniel Rosenkrantz Networks, Vol. 25 (1995), pp. 59-68. 2006-09-04T23:07:47-00:00 1995 Networks 25 59 68 unit-disk-graphs http://www.citeulike.org/user/samo83/article/820250 <i>(1999)</i><br /><br />An ad hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a... A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks E Royer C Toh (1999) 2006-08-28T22:54:47-00:00 1999 ad-hoc metrics routing wireless http://www.citeulike.org/user/samo83/article/820249 <i>(October 2002)</i><br /><br />Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-hop-count routing often chooses routes that have significantly less capacity than the best paths that exist in the network. Much of the reason for this is that many of the radio links between nodes have loss... Performance of Multihop Wireless Networks: Shortest Path is Not Enough Douglas De Couto Daniel Aguayo Benjamin Chambers Robert Morris (October 2002) 2006-08-28T22:51:42-00:00 2002 metrics routing wireless http://www.citeulike.org/user/samo83/article/820247 <i>(2003)</i><br /><br />This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the... A High-Throughput Path Metric for Multi-Hop Wireless Routing D De Couto D Aguayo J Bicket R Morris (2003) 2006-08-28T22:47:01-00:00 2003 metrics routing wireless http://www.citeulike.org/user/samo83/article/394503 <i>Vol. 34, No. 4. (October 2004), pp. 121-132.</i> Link-level measurements from an 802.11b mesh network Daniel Aguayo John Bicket Sanjit Biswas Glenn Judd Robert Morris doi:10.1145/1015467.1015482 Vol. 34, No. 4. (October 2004), pp. 121-132. 2005-11-15T20:48:51-00:00 2004 0146-4833 34 4 121 132 ACM Press 80211 measurements mesh wireless http://www.citeulike.org/user/samo83/article/816126 <i>(2004), pp. 116-123.</i> An energy conservation method for wireless sensor networks employing a blue noise spatial sampling technique Mark Perillo Zeljko Ignjatovic Wendi Heinzelman doi:10.1145/984622.984640 (2004), pp. 116-123. 2006-08-25T00:03:22-00:00 2004 116 123 ACM Press blue-noise energy sensor-networks wireless http://www.citeulike.org/user/samo83/article/816123 <i>Communications, 2005. ICC 2005. 2005 IEEE International Conference on, Vol. 5 (2005), pp. 3307-3313 Vol. 5.</i><br /><br />In wireless sensor networks (WSN), monitoring applications use in-network aggregation to minimize energy overhead by reducing the number of transmissions between the nodes. We note that nearby sensor nodes monitoring an environmental feature (e.g., temperature or brightness) typically register similar values. In this paper, we propose clustered aggregation (CAG), which is a mechanism that reduces the number of transmissions and provides approximate results to aggregate queries by utilizing the spatial correlation of sensor data. The result is guaranteed to be within a user-provided error-tolerance threshold. While a query is disseminated to the network, CAG forms clusters of nodes sensing similar values. Subsequently, only one value per cluster is transmitted up the aggregation tree. We use mathematical models and simulations with synthetic and empirical data to evaluate the efficiency-correctness tradeoff of CAG. Our simulation shows that with highly correlated sensor reading and 10% error threshold, CAG can save the communication overhead by as much as 70.9% over TAG while incurring a modest 1.7% error in result. Exploiting spatial correlation towards an energy efficient clustered aggregation technique (CAG) [wireless sensor network applications] Sunhee Yoon C Shahabi Communications, 2005. ICC 2005. 2005 IEEE International Conference on, Vol. 5 (2005), pp. 3307-3313 Vol. 5. 2006-08-24T23:51:10-00:00 2005 Communications, 2005. ICC 2005. 2005 IEEE International Conference on 5 3307 3313 Vol. 5 clustering energy spatial http://www.citeulike.org/user/samo83/article/816121 <i>(2005), pp. 187-194.</i> Exploiting redundancy in sensor networks for energy efficient processing of spatiotemporal region queries Alexandru Coman Mario Nascimento J&\#246;rg Sander doi:10.1145/1099554.1099589 (2005), pp. 187-194. 2006-08-24T23:49:16-00:00 2005 187 194 ACM Press energy sensor-networks spatial http://www.citeulike.org/user/samo83/article/816118 <i>(2000), pp. 1506-1513.</i><br /><br />In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different transmit powers on the average power consumption and end-to-end network throughput in a wireless ad-hoc environment. This power management approach would help in reducing the system power consumption and hence prolonging the battery life of mobile nodes. Furthermore, it improves the end-to-end network throughput as compared to ... Power Management for Throughput Enhancement in Wireless Ad-Hoc Networks Tamer Elbatt Srikanth Krishnamurthy Dennis Connors Son Dao (2000), pp. 1506-1513. 2006-08-24T23:47:15-00:00 2000 1506 1513 ad-hoc power wireless http://www.citeulike.org/user/samo83/article/816117 <i>(2003)</i><br /><br />In this paper, we consider the problem of power control when nodes are non-homogeneously dispersed in space. In such situations, one seeks to employ per packet power control depending on the source and destination of the packet. This gives rise to a joint problem which involves not only power control but also clustering. We provide three solutions for joint clustering and power control. Power control and clustering in ad hoc networks V Kawadia P Kumar (2003) 2006-08-24T23:43:10-00:00 2003 ad-hoc clustering power http://www.citeulike.org/user/samo83/article/808844 <i>(6 July 2005)</i> A Proposed Method to Estimate Signal to Noise Plus Interference Levels in Order to Improve the Performance of Mobile Ad Hoc Network Routing Protocols John Mullen (6 July 2005) 2006-08-21T03:49:51-00:00 2005 ad-hoc snir