Computer Sciences Commons^™

Automated Discovery Of Network Cameras In Heterogeneous Web Pages, Ryan Dailey, Aniesh Chawla, Andrew Liu, Sripath Mishra, Ling Zhang, Josh Majors, Yung-Hisang Lu, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

Reduction in the cost of Network Cameras along with a rise in connectivity enables entities all around the world to deploy vast arrays of camera networks. Network cameras offer real-time visual data that can be used for studying traffic patterns, emergency response, security, and other applications. Although many sources of Network Camera data are available, collecting the data remains difficult due to variations in programming interface and website structures. Previous solutions rely on manually parsing the target website, taking many hours to complete. We create a general and automated solution for aggregating Network Camera data spread across thousands of uniquely …

A Survey Of Enabling Technologies For Smart Communities, Amna Iqbal, Stephan Olariu

Computer Science Faculty Publications

In 2016, the Japanese Government publicized an initiative and a call to action for the implementation of a "Super Smart Society" announced as Society 5.0. The stated goal of Society 5.0 is to meet the various needs of the members of society through the provisioning of goods and services to those who require them, when they are required and in the amount required, thus enabling the citizens to live an active and comfortable life. In spite of its genuine appeal, details of a feasible path to Society 5.0 are conspicuously missing. The first main goal of this survey is to …

Smart Communities: From Sensors To Internet Of Things And To A Marketplace Of Services, Stephan Olariu, Nirwan Ansari (Editor), Andreas Ahrens (Editor), Cesar Benavente-Preces (Editor)

Computer Science Faculty Publications

Our paper was inspired by the recent Society 5.0 initiative of the Japanese Government that seeks to create a sustainable human-centric society by putting to work recent advances in technology: sensor networks, edge computing, IoT ecosystems, AI, Big Data, robotics, to name just a few. The main contribution of this work is a vision of how these technological advances can contribute, directly or indirectly, to making Society 5.0 reality. For this purpose we build on a recently-proposed concept of Marketplace of Services that, in our view, will turn out to be one of the cornerstones of Society 5.0. Instead of …

On Barrier Graphs Of Sensor Networks, Kirk Anthony Boyer

Electronic Theses and Dissertations

The study of sensor networks begins with a model, which usually has a geometric component. This thesis focuses on networks of sensors modeled as collections of rays in the plane whose use is to detect intruders, and in particular a graph derived from this geometry, called the barrier graph of the network, which captures information about the network's coverage. Every such ray-barrier sensor network corresponds to a barrier graph, but not every graph is the barrier graph of some network.

We show that any barrier graph is not just tripartite, but perfect. We describe how to find networks which have …

Toward New Data And Information Management Solutions For Data-Intensive Ecological Research, Christine Marie Laney

Open Access Theses & Dissertations

Ecosystem health is deteriorating in many parts of the world due to direct and indirect anthropogenic pressures. Generating accurate, useful, and impactful models of past, current, and future states of ecosystem structure and function is a complex endeavor that often requires vast amounts of data from multiple sources and knowledge from collaborating researchers. Ecological data collection has improved rapidly over the past few decades due to the development, innovation, and large scale deployment of automated sensors, which are capable of measuring a gamut of ecosystem properties over broad spatiotemporal scales. Although complex ecosystem models and analyses are increasingly parameterized with …

Node Filtering And Face Routing For Sensor Network, Umang Amatya

UNLV Theses, Dissertations, Professional Papers, and Capstones

Greedy forward routing and face routing algorithms have been extensively used for sending messages in sensor networks. In this thesis, we consider the problem of filtering redundant nodes in a sensor network as a pre-processing step for face routing. We propose two algorithms for identifying redundant nodes. We test the performance of proposed filtering algorithms on generated networks. The prototype algorithm for testing the proposed algorithms has been implemented in the Java programming language. Experimental investigation shows that the proposed filtering algorithms are effective in removing redundant nodes without compromising the network connectivity.

Data Management And Wireless Transport For Large Scale Sensor Networks, Ming Li

Ming Li

Today many large scale sensor networks have emerged, which span many different sensing applications. Each of these sensor networks often consists of millions of sensors collecting data and supports thousands of users with diverse data needs. Between users and wireless sensors there are often a group of powerful servers that collect and process data from sensors and answer users' requests. To build such a large scale sensor network, we have to answer two fundamental research problems: i) what data to transmit from sensors to servers? ii) how to transmit the data over wireless links? Wireless sensors often can not transmit …

Roaming Region For Delaunay Triangulation, Romas James Hada

UNLV Theses, Dissertations, Professional Papers, and Capstones

Delaunay graphs have been used in CAD/CAM, sensor network and geographic information systems. We investigate the reliability properties of nodes in Delaunay graphs. For measuring the reliability we formulate the concept of roaming-region for nodes. A node v with large roaming-region r(v) such that v is positioned near the center of r(v) is identified as a reliable node. We develop algorithms for constructing roaming-regions and present an implementation of the proposed algorithm in the Java programming language.

Heaven And Hell: Visions For Pervasive Adaptation, Ben Paechter, Jeremy Pitt, Nikola Serbedzijac, Katina Michael, Jennifer Willies, Ingi Helgason

Professor Katina Michael

With everyday objects becoming increasingly smart and the “info-sphere” being enriched with nanosensors and networked to computationally-enabled devices and services, the way we interact with our environment has changed significantly, and will continue to change rapidly in the next few years. Being user-centric, novel systems will tune their behaviour to individuals, taking into account users’ personal characteristics and preferences. But having a pervasive adaptive environment that understands and supports us “behaving naturally” with all its tempting charm and usability, may also bring latent risks, as we seamlessly give up our privacy (and also personal control) to a pervasive world of …

Distributed Energy-Conserving Routing Protocols, Qun Li, Javed A. Aslam, Daniela Rus

Javed A. Aslam

This paper discusses several distributed power-aware routing protocols in wireless ad-hoc networks (especially sensor networks). We seek to optimize the lifetime of the network. We have developed three distributed power-aware algorithms and analyzed their efficiency in terms of the number of message broadcasts and the overall network lifetime modeled as the time to the first message that can not be sent. These are: (1) a distributed min Power algorithm (modeled on a distributed version of Dijkstra's algorithm), (2) a distributed max-min algorithm, and (3) the distributed version of our the centralized online max-min zPmin algorithm presented in [12]. The first …

A Virtual Infrastructure For Mitigating Typical Challenges In Sensor Networks, Hady S. Abdel Salam

Computer Science Theses & Dissertations

Sensor networks have their own distinguishing characteristics that set them apart from other types of networks. Typically, the sensors are deployed in large numbers and in random fashion and the resulting sensor network is expected to self-organize in support of the mission for which it was deployed. Because of the random deployment of sensors that are often scattered from an overflying aircraft, the resulting network is not easy to manage since the sensors do not know their location, do not know how to aggregate their sensory data and where and how to route the aggregated data. The limited energy budget …

Data Management And Wireless Transport For Large Scale Sensor Networks, Ming Li

Open Access Dissertations

Today many large scale sensor networks have emerged, which span many different sensing applications. Each of these sensor networks often consists of millions of sensors collecting data and supports thousands of users with diverse data needs. Between users and wireless sensors there are often a group of powerful servers that collect and process data from sensors and answer users' requests. To build such a large scale sensor network, we have to answer two fundamental research problems: i) what data to transmit from sensors to servers? ii) how to transmit the data over wireless links? Wireless sensors often can not transmit …

Failure Detectors For Wireless Sensor-Actuator Systems, Hamza A. Zia, Nigamanth Sridhar, Shivakumar Sastry

Electrical and Computer Engineering Faculty Publications

Wireless sensor-actuator systems (WSAS) offer exciting opportunities for emerging applications by facilitating fine-grained monitoring and control, and dense instrumentation. The large scale of such systems increases the need for such systems to tolerate and cope with failures, in a localized and decentralized manner. We present abstractions for detecting node failures and link failures caused by topology changes in a WSAS. These abstractions were designed and implemented as a set of reusable components in nesC under TinyOS. Results, which demonstrate the performance and viability of the abstractions, based on experiments on an 80 node testbed are presented. In the …

Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle

Computer Science Faculty Publications

Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of …

Analysis, Instrumentation, And Visualization Of Embedded Network Systems: A Testbed-Based Approach, Andrew Dalton

All Dissertations

Embedded network systems are gaining adoption and emerging as the next step in the shift toward ubiquitous computing. Deployments range in scale from tens of devices to over a thousand; applications can be massively parallel and distributed, executing over unreliable links and devices. The programming model used to develop these systems is fundamentally different than the models provided by traditional imperative programming languages; many existing software engineering tools and techniques cannot be applied. In particular, the lack of tools and techniques to analyze, instrument, and visualize these systems make their development more difficult.
We present a framework to …

Biology-Inspired Approach For Communal Behavior In Massively Deployed Sensor Networks, Kennie H. Jones

Computer Science Theses & Dissertations

Research in wireless sensor networks has accelerated rapidly in recent years. The promise of ubiquitous control of the physical environment opens the way for new applications that will redefine the way we live and work. Due to the small size and low cost of sensor devices, visionaries promise smart systems enabled by deployment of massive numbers of sensors working in concert. To date, most of the research effort has concentrated on forming ad hoc networks under centralized control, which is not scalable to massive deployments. This thesis proposes an alternative approach based on models inspired by biological systems and reports …

Utility-Based Adaptation In Mission-Oriented Wireless Sensor Networks, Sharanya Eswaran, Archan Misra, Thomas La Porta

Research Collection School Of Computing and Information Systems

This paper extends the distributed network utility maximization (NUM) framework to consider the case of resource sharing by multiple competing missions in a military-centric wireless sensor network (WSN) environment. Prior work on NUM-based optimization has considered unicast flows with sender-based utilities in either wireline or wireless networks. We extend the NUM framework to consider three key new features observed in mission-centric WSN environments: i) the definition of an individual mission's utility as a joint function of data from multiple sensor sources ii) the consumption of each senders (sensor) data by multiple receivers (missions) and iii) the multicast-tree based dissemination of …

Composable Distributed Access Control And Integrity Policies For Query-Based Wireless Sensor Networks, David W. Marsh

Theses and Dissertations

An expected requirement of wireless sensor networks (WSN) is the support of a vast number of users while permitting limited access privileges. While WSN nodes have severe resource constraints, WSNs will need to restrict access to data, enforcing security policies to protect data within WSNs. To date, WSN security has largely been based on encryption and authentication schemes. WSN Authorization Specification Language (WASL) is specified and implemented using tools coded in JavaTM. WASL is a mechanism{independent policy language that can specify arbitrary, composable security policies. The construction, hybridization, and composition of well{known security models is demonstrated and shown to preserve …

Mitigating Dos Attacks Against Broadcast Authentication In Wireless Sensor Networks, Peng Ning, An Liu, Wenliang Du

Electrical Engineering and Computer Science - All Scholarship

Broadcast authentication is a critical security service in wireless sensor networks. There are two general approaches for broadcast authentication in wireless sensor networks: digital signatures and µTESLA-based techniques. However, both signature-based and µTESLA-based broadcast authentication are vulnerable to Denial of Services (DoS) attacks: An attacker can inject bogus broadcast packets to force sensor nodes to perform expensive signature verifications (in case of signature-based broadcast authentication) or packet forwarding (in case of µTESLA-based broadcast authentication), thus exhausting their limited battery power. This paper presents an efficient mechanism called message specific puzzle to mitigate such DoS attacks. In addition to signature-based or …

Containing Denial-Of-Service Attacks In Broadcast Authentication In Sensor Networks, Ronghua Wang, Wenliang Du, Peng Ning

Electrical Engineering and Computer Science - All Scholarship

Broadcast authentication is an important application in sensor networks. Public Key Cryptography (PKC) is desirable for this application, but due to the resource constraints on sensor nodes, these operations are expensive, which means sensor networks using PKC are susceptible to Denial of Service (DoS) attacks: attackers keep broadcasting bogus messages, which will incur extra costs, thus exhaust the energy of the honest nodes. In addition, the long time to verify each message using PKC increases the response time of the nodes; it is impractical for the nodes to validate each incoming message before forwarding it. In this paper we discuss …

Containing Denial-Of-Service Attacks In Broadcast Authentication In Sensor Networks, Ronghua Wang, Wenliang Du, Peng Ning

Electrical Engineering and Computer Science - All Scholarship

Broadcast authentication is an important application in sensor networks. Public Key Cryptography (PKC) is desirable for this application, but due to the resource constraints on sensor nodes, these operations are expensive, which means sensor networks using PKC are susceptible to Denial of Service (DoS) attacks: attackers keep broadcasting bogus messages, which will incur extra costs, thus exhaust the energy of the honest nodes. In addition, the long time to verify each message using PKC increases the response time of the nodes; it is impractical for the nodes to validate each incoming message before forwarding it. In this paper we discuss …

Optimal Layout Of Multicast Groups Using Network Embedded Multicast Security In Ad Hoc Sensor Networks, Richard R. Brooks, Brijesh Pillai, Michele C. Weigle, Matthew Pirretti

Computer Science Faculty Publications

This paper considers the security of sensor network applications. Our approach creates multicast regions that use symmetric key cryptography for communications. Each multicast region contains a single keyserver that is used to perform key management and maintain the integrity of a multicast region. Communications between two multicast regions is performed by nodes that belong to both regions. To ease the network management burden, it is desirable for the networks to self-organize into regions and dynamically select their keyservers. This paper shows how to determine the number of keyservers (k) to use and the size in the number of hops (h) …

Using Angle Of Arrival (Bearing) Information For Localization In Robot Networks, Tolga Eren

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we consider using angle of arrival information (bearing) for localization in robot networks. The essential property we require in this paper is that a node can infer heading information from its neighbors. We address the uniqueness of network localization solutions by the theory of globally rigid graphs. We show that while the parallel rigidity problem for formations with bearings is isomorphic to the distance case, the global rigidity of the formation is simpler (in fact identical to the simpler rigidity case) for a network with bearings, compared to formations with distances. We provide the conditions of localization …

Efficient Support For Application-Specific Video Adaptation, Jie Huang

Dissertations and Theses

As video applications become more diverse, video must be adapted in different ways to meet the requirements of different applications when there are insufficient resources. In this dissertation, we address two sorts of requirements that cannot be addressed by existing video adaptation technologies: (i) accommodating large variations in resolution and (ii) collecting video effectively in a multi-hop sensor network. In addition, we also address requirements for implementing video adaptation in a sensor network.

Accommodating large variation in resolution is required by the existence of display devices with widely disparate screen sizes. Existing resolution adaptation technologies usually aim at adapting video …

A Real-Time Wireless Sensor Media Access Control (Mac) Protocol, Barry W. Park

Theses and Dissertations

Wireless sensor networks are rapidly becoming a platform for applications such as battlefield monitoring, intelligence gathering, environmental monitoring, and emergency response. Inherent in these applications is a priority and urgency of the information or messages. This means the messages must be delivered in a timely manner for them to be useful. This research assigns a message priority level and provides high-priority messages quicker access to the channel. Using MICA2 sensors and a modified Media Access Control (MAC) layer, real-time message End-to-End (ETE) delay was reduced by 50 percent. Coupled with this decrease in delay, these same real-time messages also had …

Data Aggregation Techniques In Sensor Networks: A Survey, Ramesh Rajagopalan, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

Wireless sensor networks consist of sensor nodes with sensing and communication capabilities. We focus on data aggregation problems in energy constrained sensor networks. The main goal of data aggregation algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In this paper, we present a survey of data aggregation algorithms in wireless sensor networks. We compare and contrast different algorithms on the basis of performance measures such as lifetime, latency and data accuracy. We conclude with possible future research directions.

Adaptive Scalable Protocols For Heterogeneous Wireless Networks, Vamsi Krishna Paruchuri

LSU Doctoral Dissertations

The focus of this dissertation is to propose analytical models to study the impact of collisions and interference in heterogeneous wireless networks and propose simple scalable and lightweight protocols that use these models to adapt to network conditions thus increasing efficiency, decreasing energy consumption and prolonging network lifetime. The contributions of this dissertation are multifold and are summarized as follows: - Analytical models to study the impact of collisions and interference on both broadcast and unicast messages. These analytical models are incorporated into the proposed protocols to adapt to the prevailing network conditions to improve their performance. - Optimized Flooding …

Robust And Efficient Localization Techniques For Cellular And Wireless Sensor Networks, Haseebulla M. Khan

Computer Science Theses & Dissertations

Localization in wireless networks refers to a collection of tasks that, collectively, determines the location of a mobile user, striving to hide the effects of mobility from the user and/or application. Localization has become an important issue and has drawn considerable attention, as many applications including E-911, cargo tracking, locating patients, location-sensitive billing, etc., require knowledge of the location of user/objects. It was realized, quite a while back, that extending emergency 911-like services (E-911) to continually growing mobile population is one of the extremely important localization applications. The bulk of the proposed solutions to emergency location management in wireless environments …

Achieving Minimum Coverage Breach Under Bandwidth Constraints In Wireless Sensor Networks, Maggie Xiaoyan Cheng, Lu Ruan, Weili Wu

Computer Science Faculty Research & Creative Works

This paper addresses the coverage breach problem in wireless sensor networks with limited bandwidths. In wireless sensor networks, sensor nodes are powered by batteries. To make efficient use of battery energy is critical to sensor network lifetimes. When targets are redundantly covered by multiple sensors, especially in stochastically deployed sensor networks, it is possible to save battery energy by organizing sensors into mutually exclusive subsets and alternatively activating only one subset at any time. Active nodes are responsible for sensing, computing and communicating. While the coverage of each subset is an important metric for sensor organization, the size of each …

Decision Fusion Rules In Multi-Hop Wireless Sensor Networks, Ying Lin, Biao Chen, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

We consider in this paper the decision fusion problem for a wireless sensor network (WSN) operating in a fading environment. In particular, we develop channel-aware decision fusion rules for a resource constrained WSN where decisions from local sensors may go through multi-hop transmission to reach a fusion center. Each relay node employs a binary relay scheme whereby the relay output is inferred from the channel impaired observation received from its source node. This estimated binary decision is subsequently transmitted to the next node until it reaches the fusion center. Under a flat fading channel model, we derive the optimum fusion …