Digital Communications and Networking Commons^™

Anonymous Query Processing In Road Networks, Kyriakos Mouratidis, Man Lung Yiu

Kyriakos MOURATIDIS

The increasing availability of location-aware mobile devices has given rise to a flurry of location-based services (LBSs). Due to the nature of spatial queries, an LBS needs the user position in order to process her requests. On the other hand, revealing exact user locations to a (potentially untrusted) LBS may pinpoint their identities and breach their privacy. To address this issue, spatial anonymity techniques obfuscate user locations, forwarding to the LBS a sufficiently large region instead. Existing methods explicitly target processing in the euclidean space and do not apply when proximity to the users is defined according to network distance …

On-Line Discovery Of Hot Motion Paths, Dimitris Sacharidis, Kostas Patroumpas, Manolis Terrovitis, Verena Kantere, Michalis Potamias, Kyriakos Mouratidis, Timos Sellis

Kyriakos MOURATIDIS

We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investigate the problem of maintaining hot motion paths, i.e., routes frequently followed by multiple objects over the recent past. Motion paths approximate portions of objects' movement within a tolerance margin that depends on the uncertainty inherent in positional measurements. Discovery of hot motion paths is important to applications requiring classification/profiling based on monitored movement patterns, such as targeted advertising, resource allocation, etc. To achieve this goal, we delegate part of the path extraction process to objects, …

Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias

Kyriakos MOURATIDIS

Wireless data broadcast is a promising technique for information dissemination that leverages the computational capabilities of the mobile devices in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may then tune in the broadcast channel and process their queries locally without contacting the server. Previous work on spatial query processing for wireless broadcast systems has only considered snapshot queries over static data. In this paper, we propose an air indexing framework that 1) outperforms the existing (i.e., snapshot) techniques in …

Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis

Kyriakos MOURATIDIS

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable …

Continuous Spatial Assignment Of Moving Users, Leong Hou U, Kyriakos Mouratidis, Nikos Mamoulis

Kyriakos MOURATIDIS

Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), …

Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis

Kyriakos MOURATIDIS

Shortest path computation is one of the most common queries in location-based services that involve transportation net- works. Motivated by scalability challenges faced in the mo- bile network industry, we propose adopting the wireless broad- cast model for such location-dependent applications. In this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the rst framework to compute shortest paths on the air, and demonstrate the practicality and …

Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu

Kyriakos MOURATIDIS

Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate …

Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Link failure is a common reason for disruption in communication networks. If communication between processes of a weighted distributed network is maintained by a spanning tree T, and if one edge e of T fails, communication can be restored by finding a new spanning tree, T’. If the network is 2-edge connected, T’ can always be constructed by replacing e by a single edge, e’, of the network. We refer to e’ as a swap edge of e.

The best swap edge problem is to find the best choice of e’, that is, that e which causes the new spanning …

Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti

UNLV Theses, Dissertations, Professional Papers, and Capstones

The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration.

Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that the algorithm is starting over again from an arbitrary state. There are a number of such algorithms in the …

Self-Stabilizing Group Membership Protocol, Mahesh Subedi

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis, we consider the problem of partitioning a network into groups of bounded diameter.

Given a network of processes X and a constant D, the group partition problem is the problem of finding a D-partition of X, that is, a partition of X into disjoint connected subgraphs, which we call groups, each of diameter no greater than D. The minimal group partition problem is to find a D-partition {G1, ... Gm} of X such that no two groups can be combined; that is, for any Gi and Gj, where i ≠ j, either Gi U Gj is disconnected …

The Kerf Toolkit For Intrusion Analysis, Javed A. Aslam, Sergey Bratus, David Kotz, Ron Peterson, Brett Tofel, Daniela Rus

Javed A. Aslam

To aid system administrators with post-attack intrusion analysis, the Kerf toolkit provides an integrated front end and powerful correlation and data-representation tools, all in one package.

Reputation-Based Internet Protocol Security: A Multilayer Security Framework For Mobil Ad Hoc Networks, Timothy H. Lacey

Theses and Dissertations

This research effort examines the theory, application, and results for a Reputation-based Internet Protocol Security (RIPSec) framework that provides security for an ad-hoc network operating in a hostile environment. In RIPSec, protection from external threats is provided in the form of encrypted communication links and encryption-wrapped nodes while internal threats are mitigated by behavior grading that assigns reputations to nodes based on their demonstrated participation in the routing process. Network availability is provided by behavior grading and round-robin multipath routing. If a node behaves faithfully, it earns a positive reputation over time. If a node misbehaves (for any number of …

Hijacking User Uploads To Online Persistent Data Repositories For Covert Data Exfiltration, Curtis P. Barnard

Theses and Dissertations

As malware has evolved over the years, it has gone from harmless programs that copy themselves into other executables to modern day botnets that perform bank fraud and identity theft. Modern malware often has a need to communicate back to the author, or other machines that are also infected. Several techniques for transmitting this data covertly have been developed over the years which vary significantly in their level of sophistication. This research creates a new covert channel technique for stealing information from a network by piggybacking on user-generated network traffic. Specifically, steganography drop boxes and passive covert channels are merged …

Engaging Students In Real-Life Data And Network Security Assessment Of Pace Computing Environment, Narayan Murthy, Ravi Ravishanker

Cornerstone 3 Reports : Interdisciplinary Informatics

No abstract provided.

Open Innovation In Platform Competition, Mei Lin

Research Collection School Of Computing and Information Systems

We examine the competition between a proprietary platform and an open platform,where each platform holds a two-sided market consisted of app developers and users.The open platform cultivates an innovative environment by inviting public efforts todevelop the platform itself and permitting distribution of apps outside of its own appmarket; the proprietary platform restricts apps sales solely within its app market. Weuse a game theoretic model to capture this competitive phenomenon and analyze theimpact of growth of the open source community on the platform competition. We foundthat growth of the open community mitigates the platform rivalry, and balances the developernetwork sizes on …

Hidra: Hierarchical Inter-Domain Routing Architecture, Bryan Clevenger

Master's Theses

As the Internet continues to expand, the global default-free zone (DFZ) forwarding table has begun to grow faster than hardware can economically keep pace with. Various policies are in place to mitigate this growth rate, but current projections indicate policy alone is inadequate. As such, a number of technical solutions have been proposed. This work builds on many of these proposed solutions, and furthers the debate surrounding the resolution to this problem. It discusses several design decisions necessary to any proposed solution, and based on these tradeoffs it proposes a Hierarchical Inter-Domain Routing Architecture - HIDRA, a comprehensive architecture with …

Pretty Lights, Nicholas (Nick) Delmas, Matthew (Matt) Maniaci

Computer Engineering

Digital media players often include a visualization component that allows a user to watch a visualization synchronized to their music or videos. This project uses the visualization plugin API of an existing media playback program (WinAmp) but it displays its visuals using physical LED lights. Instead of outputting visuals to the computer screen, data is sent over USB to a micro controller that runs the LED lights. This project aims to give users a more visceral visual experience than traditional visualizations on the computer screen.

Providing Location Security In Vehicular Ad Hoc Networks, Gongjun Yan

Computer Science Theses & Dissertations

Location is fundamental information in Vehicular Ad-hoc Networks (VANETs). Almost all VANET applications rely on location information. Therefore it is of importance to ensure location information integrity, meaning that location information is original (from the generator), correct (not bogus or fabricated) and unmodified (value not changed). We present validation mechanisms to provide location integrity for VANETs. In the initial mechanism, we assume that all vehicles are equipped with a radar, a GPS receiver, and a transceiver. Since radar has a limited radar range and transceiver has a limited transmission range, we build network cells as a security unit as well …

Managing Media Rich Geo-Spatial Annotations For A Map-Based Mobile Application Using Clustering, Khasfariyati Razikin, Dion Hoe-Lian Goh, Ee Peng Lim, Aixin Sun, Yin-Leng Theng, Thi Nhu Quynh Kim, Kalyani Chatterjea, Chew-Hung Chang

Research Collection School Of Computing and Information Systems

With the prevalence of mobile devices that are equipped with wireless Internet capabilities and Global Positioning System (GPS) functionality, the creation and access of user-generated content are extended to users on the go. Such content are tied to real world objects, in the form of geospatial annotations, and it is only natural that these annotations are visualized using a map-based approach. However, viewing maps that are filled with annotations could hinder the serendipitous discovery of data, especially on the small screens of mobile devices. This calls for a need to manage the annotations. In this paper, we introduce a mobile …

Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …

Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), …

A Secure On-Line Credit Card Transaction Method Based On Kerberos Authentication Protocol, Jung Eun Kim

UNLV Theses, Dissertations, Professional Papers, and Capstones

Nowadays, electronic payment system is an essential part of modern business. Credit cards or debit cards have been widely used for on-site or remote transactions, greatly reducing the need for inconvenient cash transactions. However, there have been a huge number of incidents of credit card frauds over the Internet due to the security weakness of electronic payment system. A number of solutions have been proposed in the past to prevent this problem, but most of them were inconvenient and did not satisfy the needs of cardholders and merchants at the same time.

In this thesis, we present a new secure …

Visually Managing Ipsec, Peter J. Dell'accio

Theses and Dissertations

The United States Air Force relies heavily on computer networks to transmit vast amounts of information throughout its organizations and with agencies throughout the Department of Defense. The data take many forms, utilize different protocols, and originate from various platforms and applications. It is not practical to apply security measures specific to individual applications, platforms, and protocols. Internet Protocol Security (IPsec) is a set of protocols designed to secure data traveling over IP networks, including the Internet. By applying security at the network layer of communications, data packets can be secured regardless of what application generated the data or which …

Developing Cyberspace Data Understanding: Using Crisp-Dm For Host-Based Ids Feature Mining, Joseph R. Erskine

Theses and Dissertations

Current intrusion detection systems generate a large number of specific alerts, but do not provide actionable information. Many times, these alerts must be analyzed by a network defender, a time consuming and tedious task which can occur hours or days after an attack occurs. Improved understanding of the cyberspace domain can lead to great advancements in Cyberspace situational awareness research and development. This thesis applies the Cross Industry Standard Process for Data Mining (CRISP-DM) to develop an understanding about a host system under attack. Data is generated by launching scans and exploits at a machine outfitted with a set of …

A Distributed Network Logging Topology, Nicholas E. Fritts

Theses and Dissertations

Network logging is used to monitor computer systems for potential problems and threats by network administrators. Research has found that the more logging enabled, the more potential threats can be detected in the logs (Levoy, 2006). However, generally it is considered too costly to dedicate the manpower required to analyze the amount of logging data that it is possible to generate. Current research is working on different correlation and parsing techniques to help filter the data, but these methods function by having all of the data dumped in to a central repository. Central repositories are limited in the amount of …

Handshaking Protocols And Jamming Mechanisms For Blind Rendezvous In A Dynamic Spectrum Access Environment, Aaron A. Gross

Theses and Dissertations

Blind frequency rendezvous is an important process for bootstrapping communications between radios without the use of pre-existing infrastructure or common control channel in a Dynamic Spectrum Access (DSA) environment. In this process, radios attempt to arrive in the same frequency channel and recognize each other’s presence in changing, under-utilized spectrum. This paper refines existing blind rendezvous techniques by introducing a handshaking algorithm for setting up communications once two radios have arrived in the same frequency channel. It then investigates the effect of different jamming techniques on blind rendezvous algorithms that utilize this handshake. The handshake performance is measured by determining …

Service-Differentiated And Reliable Communication In Event-Based Wireless Sensor Networks, Yuyan Xue

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Wireless Sensor Networks (WSNs) consist of low-power embedded devices with integrated sensing, computing and wireless communication capabilities. These devices, called sensor nodes or motes, are often battery-powered and deployed in a distributed manner to provide observations on the physical world. Reliably and promptly collecting the sensing data to convey the features of a surveillance area, especially the events of interest, to the sink is one of the most critical requirements of WSN design. However, dynamic wireless channel conditions and the constrained energy resources make it a challenging task to provide the end-to-end performance guarantees in multi-hop WSNs.

The objective of …

Reverberation-Chamber Test Environment For Outdoor Urban Wireless Propagation Studies, Helge Fielitz, Kate A. Remley, Christopher L. Holloway, Qian Zhang, Qiong Wu, David W. Matolak

Faculty Publications

We introduce a test environment to replicate the well-known clustering of reflections in power delay profiles arising from late-time delays and reflections. Urban wireless propagation environments are known to exhibit such clustering. The test setup combines discrete reflections generated by a fading simulator with the continuous distribution of reflections created in a reverberation chamber. We describe measurements made in an urban environment in Denver, CO, that illustrate these multiple distributions of reflections. Our comparison of measurements made in the urban environment to those made in the new test environment shows good agreement.

Architecture And Usability Aspects Of Environmental Data Portals, Michael Mcmahon, Jr.

2010 Annual Nevada NSF EPSCoR Climate Change Conference

12 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR Abstract: -Web Portal: A web site that acts as a starting point or gateway to Internet content, services, and information. Portals expose this information via a consistent set of visual elements and organizational constructs that improve the user experience and may relate, unify, or otherwise enhance the content. -Data Portal: A web site that acts as a starting point or gateway to Internet content, web/data services, and related information. Portals expose this information via a consistent set of visual elements and organizational constructs that improve the user experience and relate, …

Survey Of Environmental Data Portals: Features, Characteristics, And Reliability Issues, Shahram Latifi, David Walker

2010 Annual Nevada NSF EPSCoR Climate Change Conference

24 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR Abstract: -What is a Data Portal? -Presents information from diverse sources in a unified way -Enables instant, reliable and secure exchange of information over the Web -The "portal" concept is to offer a single web page that aggregates content from several systems or servers.