Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 10 of 10
Full-Text Articles in Physical Sciences and Mathematics
A Combined Routing Method For Ad Hoc Wireless Networks, Zhenhui Jiang
A Combined Routing Method For Ad Hoc Wireless Networks, Zhenhui Jiang
Dartmouth College Master’s Theses
To make ad hoc wireless networks adaptive to different mobility and traffic patterns, we studied in this thesis an approach to swap from one protocol to another protocol dynamically, while routing continues. By the insertion of a new layer, we were able to make each node in the ad hoc wireless network notify each other about the protocol swap. To ensure that routing works efficiently after the protocol swap, we initialized the destination routing protocol's data structures and reused the previous routing information to build the new routing table. We also tested our approach under different network topologies and traffic …
Performance Evaluation Of Distributed Security Protocols Using Discrete Event Simulation, Meiyuan Zhao
Performance Evaluation Of Distributed Security Protocols Using Discrete Event Simulation, Meiyuan Zhao
Dartmouth College Ph.D Dissertations
The Border Gateway Protocol (BGP) that manages inter-domain routing on the Internet lacks security. Protective measures using public key cryptography introduce complexities and costs. To support authentication and other security functionality in large networks, we need public key infrastructures (PKIs). Protocols that distribute and validate certificates introduce additional complexities and costs. The certification path building algorithm that helps users establish trust on certificates in the distributed network environment is particularly complicated. Neither routing security nor PKI come for free. Prior to this work, the research study on performance issues of these large-scale distributed security systems was minimal. In this thesis, …
Improving Large-Scale Network Traffic Simulation With Multi-Resolution Models, Guanhua Yan
Improving Large-Scale Network Traffic Simulation With Multi-Resolution Models, Guanhua Yan
Dartmouth College Ph.D Dissertations
Simulating a large-scale network like the Internet is a challenging undertaking because of the sheer volume of its traffic. Packet-oriented representation provides high-fidelity details but is computationally expensive; fluid-oriented representation offers high simulation efficiency at the price of losing packet-level details. Multi-resolution modeling techniques exploit the advantages of both representations by integrating them in the same simulation framework. This dissertation presents solutions to the problems regarding the efficiency, accuracy, and scalability of the traffic simulation models in this framework. The ``ripple effect'' is a well-known problem inherent in event-driven fluid-oriented traffic simulation, causing explosion of fluid rate changes. Integrating multi-resolution …
Efficient Wait-Free Algorithms For Implementing Ll/Sc Objects, Srdjan Petrovic
Efficient Wait-Free Algorithms For Implementing Ll/Sc Objects, Srdjan Petrovic
Dartmouth College Ph.D Dissertations
Over the past decade, a pair of instructions called load-linked (LL) and store-conditional (SC) have emerged as the most suitable synchronization instructions for the design of lock-free algorithms. However, current architectures do not support these instructions; instead, they support either CAS (e.g., UltraSPARC, Itanium, Pentium) or restricted versions of LL/SC (e.g., POWER4, MIPS, Alpha). Thus, there is a gap between what algorithm designers want (namely, LL/SC) and what multiprocessors actually support (namely, CAS or restricted LL/SC). To bridge this gap, this thesis presents a series of efficient, wait-free algorithms that implement LL/SC from CAS or restricted LL/SC.
Natural Image Statistics For Digital Image Forensics, Siwei Lyu
Natural Image Statistics For Digital Image Forensics, Siwei Lyu
Dartmouth College Ph.D Dissertations
We describe a set of natural image statistics that are built upon two multi-scale image decompositions, the quadrature mirror filter pyramid decomposition and the local angular harmonic decomposition. These image statistics consist of first- and higher-order statistics that capture certain statistical regularities of natural images. We propose to apply these image statistics, together with classification techniques, to three problems in digital image forensics: (1) differentiating photographic images from computer-generated photorealistic images, (2) generic steganalysis; (3) rebroadcast image detection. We also apply these image statistics to the traditional art authentication for forgery detection and identification of artists in an art work. …
On The Design Of An Immersive Environment For Security-Related Studies, Yougu Yuan
On The Design Of An Immersive Environment For Security-Related Studies, Yougu Yuan
Dartmouth College Master’s Theses
The Internet has become an essential part of normal operations of both public and private sectors. Many security issues are not addressed in the original Internet design, and security now has become a large concern for networking research and study. There is an imperative need to have an simulation environment that can be used to help study security-related research problems. In the thesis we present our effort to build such an environment: Real-time Immersive Network Simulation Environment (RINSE). RINSE features flexible configuration of models using various networking protocols and real-time user interaction. We also present the Estimate Next Infection (ENI) …
Managing Access Control In Virtual Private Networks, Twum Djin
Managing Access Control In Virtual Private Networks, Twum Djin
Dartmouth College Undergraduate Theses
Virtual Private Network technology allows remote network users to benefit from resources on a private network as if their host machines actually resided on the network. However, each resource on a network may also have its own access control policies, which may be completely unrelated to network access. Thus users� access to a network (even by VPN technology) does not guarantee their access to the sought resources. With the introduction of more complicated access privileges, such as delegated access, it is conceivable for a scenario to arise where a user can access a network remotely (because of direct permissions from …
Lower Bounds On The Communication Complexity Of Shifting, Marco D. Adelfio
Lower Bounds On The Communication Complexity Of Shifting, Marco D. Adelfio
Dartmouth College Undergraduate Theses
We study the communication complexity of the SHIFT (equivalently, SUM-INDEX) function in a 3-party simultaneous message model. Alice and Bob share an n-bit string x and Alice holds an index i and Bob an index j. They must send messages to a referee who knows only n, i and j, enabling him to determine x[(i+j) mod n]. Surprisingly, it is possible to achieve nontrivial savings even with such a strong restriction: Bob can now make do with only ceil(n/2) bits. Here we show that this bound is completely tight, for all n. This is an exact lower bound, with no …
On-Line Metasearch, Pooling, And System Evaluation, Robert A. Savell
On-Line Metasearch, Pooling, And System Evaluation, Robert A. Savell
Dartmouth College Ph.D Dissertations
This thesis presents a unified method for simultaneous solution of three problems in Information Retrieval--- metasearch (the fusion of ranked lists returned by retrieval systems to elicit improved performance), efficient system evaluation (the accurate evaluation of retrieval systems with small numbers of relevance judgements), and pooling or ``active sample selection" (the selection of documents for manual judgement in order to develop sample pools of high precision or pools suitable for assessing system quality). The thesis establishes a unified theoretical framework for addressing these three problems and naturally generalizes their solution to the on-line context by incorporating feedback in the form …
A Toy Rock Climbing Robot, Matthew P. Bell
A Toy Rock Climbing Robot, Matthew P. Bell
Dartmouth College Undergraduate Theses
The goal of this thesis was to build a simple toy rock climbing robot, and to explore problems related to grasping, path planning, and robot control. The robot is capable of climbing a wall of pegs either under manual control through a host system and an infrared interface, or on the basis of a set of pre-recorded keyframes. In addition, the robot can climb certain peg configurations using a cyclic gait. The robot climbs in an open-loop mode without sensor feedback. All communications are sent through the IR connection, and the tether to the robot consists only of two power …