1 Page

2005_125_Yang

Course: A 2005, Fall 2009
School: U. Houston
Rating:
 
 
 
 
 

Word Count: 635

Document Preview

of Development Wireless Stations for Distributed Field Operations T. Andrew Yang, Sadegh Davari ISTRIBUTED FIELD OPERA tions involve dispersed mobile units operating in a wide geographical area, such as battlefield operations or exploration on the moon. One or more wireless stations may be deployed for effec tive connectivity among the units. In this project, we investigate the security and performance issues of...

Register Now

Unformatted Document Excerpt

Coursehero >> Texas >> U. Houston >> A 2005

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
of Development Wireless Stations for Distributed Field Operations T. Andrew Yang, Sadegh Davari ISTRIBUTED FIELD OPERA tions involve dispersed mobile units operating in a wide geographical area, such as battlefield operations or exploration on the moon. One or more wireless stations may be deployed for effec tive connectivity among the units. In this project, we investigate the security and performance issues of wireless stations in mobile ad hoc networks (MANET), with a focus on the public key management sys tem using certificates. T. Andrew Yang One of the main issues to consider in a certificate-based scheme is the secure distribution of the public keys to all the nodes in the network. The Public Key Infrastructure (PKI) defines methods to handle public key man agement using X.509 certificates. In a wired network, there exists a centralized certificate server which handles the creation, renew al, and revocation of certificates. This is not feasible in mobile ad hoc networks (MANET), which are composed of mobile nodes that may be constantly moving in the geographical area and do not have a fixed infrastructure or centralized management. Besides, because of the dynamic topology of the network, frequent link fail ures may occur, resulting in issues such as re-authentication and timely communication with the certificate server. To devise a secure and effective certificate-based authentica tion scheme for mobile ad hoc networks, our immediate goal is evaluation of existing approaches by running network simula tions to compare their respective strengths and weaknesses. Our contribution so far includes the following: (1) We analyzed the requirements of a secure distributed authentication system for MANETs. (2) We surveyed some of the existing certificatebased authentication mechanisms by analyzing their features, including pros and cons, in the context of distributed authenti cation. (3) We designed a series of scenario-based simulation experiments and metrics to evaluate these features. In order to study the effectiveness of these mechanisms, we proposed a set of realistic for scenarios simulation. Before defining the scenarios, we first needed to define some parame ters: (1) The mobility model represents the realistic movements of nodes in the network. (2) Node Density also varies according to a particular scenario. (3) Traffic rates vary according to the D node linkage failures, congestion, and mobility. Having defined the parameters for the scenarios, we further identified the following metrics, on which basis the authentica tion mechanisms can be evaluated: (a) Successful Certification Ratio () measures the ratio of the number of successful certifi cation services (including issuance, NCISS, and renewal, NCREN, respectively) to the total number of requests for such services (NCTotIss and NCTotRen, respectively). (b) Settling time (st) meas ures the initial time taken for all the nodes in the network to be issued valid certificates. (c) Frequency of Certification (fcert) measures the number of certification services per time interval. (d) Average Certification Delay (acd) is measured as the time delay between the certificate service request (CSReq) and the cer tificate service reply (CSRep) averaged over the simulation time. Publications Sadasivam, K., V. Changrani, and T. A. Yang. Evaluation of Ce...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

U. Houston - A - 2001
UH researchers have developed a fluoresAbstract cence-based system for real-time detection of live bacteria. This technique is based on employment of Light Emitting Diodes (LEDs) used to excite Fluorescent Proteins (FP) that can link to specific bact
U. Houston - A - 2004
Development of Wireless Stations for Distributed Field OperationsT. Andrew Yang Computer Science Department Sadegh Davari AbstractDistributed field operationsinvolve dispersed mobile units operating in a wide geographical area, such as battlefield
U. Houston - A - 9900
Investigative Team UH PI: Clinton L. Rappole, Ph.D., Professor and Eric Hilton Distinguished Chair Conrad N. Hilton College of Hotel and Restaurant Management Houston, TX 77204-3902 Phone: (713) 743-2429 E-Mail: clrappole@uh.edu NASA-JSC PI: Vickie L
U. Houston - A - 2006
Ultra-Wideband Two-Cluster Angle-Of-Arrival Tracking System Design for Space ExplorationBy Dickey Arndt, Edward Dickerson, and Jianjun NiRESEARCH SCIENTISTSare exploiting ABSTRACT-This UWB technology study describes a to implement a UWB design
U. Houston - PH - 1321
Exam 11) A worker drags a crate across a factory floor by pulling on a rope tied to a crate.The worker exerts a force of 450 N on the rope, which is inclined at an angle 38 degrees above the horizontal.The floor exerts a horizontal force of 125
U. Houston - ECON - 7395
The Beveridge-Nelson Decomposition in Retrospect and ProspectCharles R. Nelson*This draft August 2, 2006Abstract Beveridge and Nelson (1981) proposed that the long-run forecast is a measure of trend for time series such as GDP that do not follow
U. Houston - ECON - 8331
Econ 8331 Econometrics 2 Fall 2008Professor Chris Murray McElhinney 211 D Email: cmurray@mail.uh.edu Course Website: http:/www.uh.edu/~cmurray/courses/econ_8331Time and Location: Tuesday & Thursday, 10:00-11:20, 113-M. Friday, 2:30-4:00, 212-M. O
U. Houston - ECON - 7331
Econ 7331 Econometrics 1 Spring 2009Professor Chris Murray McElhinney 211 D Email: cmurray@mail.uh.eduCourse Website: http:/www.uh.edu/~cmurray/courses/econ_7331 Time and Location: Tuesday and Thursday, 1:00-2:20, 107-M. Friday, 1:00-3:00, 212-M.
U. Houston - ECON - 7395
Cyclical Properties of Baxter-King Filtered Time SeriesChristian J. Murray University of Houston January 15, 2002AbstractThis note demonstrates that the Baxter-King (1999) filter, and in general any band-pass filter, does not isolate the cycle i
U. Houston - HDCS - 3303
Chapter 3: Multichannel RetailingHDCS 3303 Section 12711 Introduction to Merchandising Evangeline CaridasI. Non-store Versus Store-based Retailers While only 10% of retail sales are made through non-store channels, sales in non-store formats are
U. Houston - TECH - 132
TMTH 3360 Example problem: Describing Data Using Minitab Problem 2.44 page 88 (expanded)Time 2.1 9 14.7 19.2 4.1 7.4 14.1 8.7 1.63.7 4.4 2 9.6 6.9 18.4 0.2 1 243.5 12.6 2.7 6.6 16.7 4.3 0.2 8.3 2.41.4 11.4 23.1 32.3 3.9 7.4 3.3 6.1 0.32.4 8.
U. Houston - ECO - 4468
Page 1 of 5Lecture 4: Demography Demography is the description and prediction of population growth and patterns in age/size structure. Derived from the deme = population Demography derives the vital statistics for a population which include: Probab
U. Houston - ECO - 4468
Page 1 of 3 Lecture 2 Organism/Environmental Interactions Patterns of distribution and abundance of a species are a product of: 1. 2. 3. 4. 5. geological history of a species - plate tectonics. the resources required to make a living. Rates of births
U. Houston - ECO - 4468
Page 1 of 4 Lecture 3 Dispersal can be an important process in accounting for distribution of a species. Particularly in explaining why some organisms have a limited distribution while others occur over a wide distribution. Definition: spreading of
U. Houston - ECO - 4468
Page 1 of 2Lecture 1 IntroductionsJerry Wellington - coral reef ecologist Zac Forsman - Phylogeny of corals Franc Trampus - E&E of ant behavior Adrienne Sloan - Symbiosis Invitation to lab S&R II 329 Review of syllabus: lecture and lab (no
U. Houston - ECO - 4468
Page 1 of 4Lecture 7 Evolution of Life History Strategies Consider the following life history patterns: 1. After spending 5 years feeding in the open waters of the North Pacific, a salmon enters a river and without eating swims some 2,000 up stream
U. Houston - ECO - 4468
Page 1 of 3Lecture 9 Life-history (continued) Last week we addressed question of how often should an organism breed. Extreme case: once only (semelparous) or more than once (iteroparous) Noted that all else being equal both strategies are equal whe
U. Houston - COSC - 6385
COSC 6385 Computer Architecture Exercises Name:_ 1. Caches a) The average memory access time (AMAT) can be modeled using the following formula: AMAT = Hit time + Miss rate * Miss penalty Name and explain (briefly) one technique for each of the three
U. Houston - COSC - 6374
COSC 6374 Parallel Computation 1st HomeworkEdgar Gabriel Spring 2009Edgar Gabriel1st Assignment Rules Each student should deliver Source code (.c, .h and Makefiles files) Please: no .o files and no executables! Documentation (.pdf, .doc, .
U. Houston - COSC - 6374
COSC 6374 Parallel Computation Recap and exercisesEdgar Gabriel Spring 2008Edgar GabrielTopics for the midterm exam (I) General parallel concepts: Flynns taxonomy, parallel architectures, network topologies, speedup, scaleup, parallel efficiency
U. Houston - COSC - 3351
COSC 3351 Software Design Performance Oriented Software DesignEdgar Gabriel Spring 2008Edgar GabrielAmdahls Law Describes the performance gains by enhancing one part of the overall system (code, computer)Performance of entire task using the enh
U. Houston - COSC - 6374
COSC 6374 Parallel Computation Performance Analysis of Parallel MPI ApplicationsEdgar Gabriel and Hatem Ltaief Spring 2007COSC 6374 Parallel Computation Edgar GabrielPerformance Analysis of parallel applications Sometimes, it is useful to see
U. Houston - COSC - 6384
Addressing Memory Fragmentation in a Real-Time Garbage Collector for MonoQuinn Lewis21 April 2005Outline Current trends Virtual Machines (VMs) Garbage Collectors (GCs) in VMs GC in Mono Past Work Current Work Future WorkIntroduction Gro
U. Houston - CS - 6360
COSC 6360MIDTERMMARCH 7, 2001This exam is closed book. You can have two sheets (i.e., four pages) of notes. Please answer every part of every question 1. Consider a clock policy with two hands where the second hand follows the first hand at a f
U. Houston - CS - 6360
COSC 6360SECOND MIDTERMMARCH 30, 2005This exam is closed book. You can have two pages of notes. UH expels cheaters. 1. A system of physical clocks consists of two clocks, one that is slow and loses one minute every hour and another that is fast
U. Houston - CS - 6360
THE DESIGN AND IMPLEMENTATION OF A LOGSTRUCTURED FILE SYSTEMM. Rosenblum and J. K. Ousterhout University of California, BerkeleyTHE PAPER Presents a new file system architecture allowing mostly sequential writes Assumes most data will be in RAM
U. Houston - CS - 6360
UNIVERSITY OF HOUSTON Department of Computer Science COSC 6360: OPERATING SYSTEMS FINAL EXAMINATION AND QUALIFYING EXAMINATION General Questions
U. Houston - CS - 6367
Parameter controlChapter 8A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAsMotivation 1An EA has many strategy parameters, e.g. mutation operator and mutation rate crossover operator and crossover rat
U. Houston - CS - 6367
Reinforcement Learning Introduction Passive Reinforcement Learning Temporal Difference Learning Active Reinforcement Learning Applications SummaryEick: Reinforcement Learning.IntroductionSupervised Learning: Example ClassReinforcement Le
U. Houston - CS - 6367
Christoph F. Eick: Using EC to Solve Transportation ProblemsOn Initialization and Mutation5 111. 2. 3.10 951 49 11 44. 5. 6.Values tij have to be between 0 and min(source(i),distination(j) I can compute delta_tij=min(Source(i)- Sumj
U. Houston - CS - 6340
Dr. Christoph F. EickGraded Homework3 COSC 6340 Spring 2005Due: Th., May 5, 9a (electronic submission) - submit hardcopy during the Lab3 Demo! Last updated: April 25, 12:30a Remark: Points associated with particular problems are subject to change
U. Houston - TAI - 95
Time (approx.) \ Monday (11/6) | Tuesday (11/7) | Wednesday (11/8)-|-|-|- 8:30a.m.- 9:30a.m. | K-1 | K-2 | SA-7&SA-810:00a.m.-12:00p.m. |AIP-1,AISE-1,IA-1 |AISE-3,ML-1,APP-2 |AIP-4,IA-3,ML-2 1:00p.m.- 2:3
U. Houston - ASSIGNMENT - 3
Assignment 3 (server part) & 4 (client part): Due Wednesday December 7th 6PM Note: You need to start early to be able to finish this. No extensions will be given. What to submit? Zipped Assignment3Code directory with your completed code, that is Assi
U. Houston - HW - 4
A (2) What if I call getUsage before calling someService?B (2) Not a simple asmx page (that is writting with notepad)C (10) Irrelevant file submittedD (10) No submission116 -125 -132 -134 A(2)166 A(2)171 -181 A(2)183 A(2), B(2)187 -188
U. Houston - HW - 2
HW2 Due October 22 6:00PM (Follow same steps as in HW1 for submission)This is in the context of web services and SOAP.A. What do RPC and Document refer to?B. What do Encoded and literal refer to?C. What is the difference between RPC-Encoded
U. Houston - HW - 3
Homework 3. Due December 1st 5:30PMOn line submission only. No email submissions will be accepted.Your name: 1. One may simply use SSL to entrypt the transmission. Why dowe need some thing like WS-Security?2. How does WS-Security address th
U. Houston - HW - 3
A (3). Question 1B (4). Question 2C (3). Question 3317 B(3)166 B(3)
U. Houston - ASSIGN - 3
317105 -5 (There are simple methods you may use)166106 -5 (There are simple methods you may use)306107 -5 (There are simple methods you may use)123108 543109 -188110 -398111 -5 (There are simple methods you may use)336112 -642113 -4
U. Houston - HW - 2
If you have questions about your scores or grades, please talk to Venkatduring his office hours after class on Mondays. No emails about gradesrelated issues please.This file contains general solution and comments on why you as an individual lost
U. Houston - ASSIGN - 2
A (20) AuthenticationB (20) DIMEC (20) Concurrency - Did you handle the case if exception is thrown. Are you unlocking ifexception is thrown? Use of the "finally" block in try will take care of this.D (20) Exception handlingE (5) Minimum code
U. Houston - HW - 4
HW4 Due December 13th (Monday) 6PMSubmit this text file filled in.Name: YOUR NAME GOES HERE(a) What is the difference between marshal by reference and marshal by value and how do you make an object behaveone way or other.(b) What options are
U. Houston - HW - 1
Hard copy due by Wednesday September 5th, 5:45PM in class.This is an individual work (not a group effort). Please be awareof Academic Dishonesty Policy.The following information may be useful in solving the homework.(a) At least one VTable is c
U. Houston - ASSIGNMENT - 2
Due Monday November 15th 2004 6PMIn this assignment we will create a web service in.NET that does the following:1. getTime returns the current time as string.2. getUsageCount returns an int that tells how many times auser has called getTime m
U. Houston - ASSIGN - 3
Assignment 3: Building the Security Information ComponentAssignment 4: Buliding the Security Checkin/Checkout ClientDue date: December 8th 7PM Online copy of ziped projectsThe objective of these assignments is to practice development of compone
U. Houston - HW - 2
HW2 Due April 12th 1999Rework HW1 using the ATL Smart pointers.
U. Houston - ASSIGNMENT - 3
C1 (5) - Authentication not used properly on clientS1 (10) - papers.xml uses hard coded file pathS2 (5) - Machine name hard coded in code or attributeS3 (5) - Locking not implemented correctly or unimplementedS4 (10) - Not good layering or layer
U. Houston - ASSIGNMENT - 1
Note: If you have any questions about your scores, grades, etc.please talk to Venkat during his office hours. Venkat encourages as many technical emails as you like and please do ask technical questions by email. Emails related to scores or grade
U. Houston - ME - 2009
MutationD an Gr aur1DNA sequences are usually copied exactly during DNA replication. Rarely, however, errors occur, giving rise to novel sequences. These errors are called mutations.2Mutations can occur in either somatic or germline cells. Som
U. Houston - ME - 2009
Number of substitutions between two proteincoding genesDan Graur1Computing the number of substitutions between two proteincoding sequences is more complicated, because a distinction should be made between synonymous and nonsynonymous substitution
U. Houston - ME - 2009
Molecular PhylogeneticsDan Graur1?2Charles Darwin to Thomas Huxley (1857)"The time will come I believe, though I shall not live to see it, when we shall have fairly true genealogical [phylogenetic] trees of each great kingdom of nature."3
U. Houston - ME - 2009
A SHORT INTRODUCTION TO PROBABILITYBecause of the stochastic nature of genetics and evolution, we have to rely on the theory of probability.TerminologyThe possible outcomes of a stochastic process are called events. (A deterministic process has o
U. Houston - ME - 2009
Molecular clocks1Molecular clock? The molecular clock hypothesis was put forward by Zuckerkandl and Pauling in 1962. They noted that rates of amino acid replacements in animal hemoglobins were proportional to time of divergence-as judged from th
U. Houston - ME - 2009
Time Table and other information for Molecular Evolution (Spring 2009)* Textbook: Fundamentals of Molecular Evolution, 2000, Graur and Li, Sinauer, MA. Websites: http:/groups.google.com/group/molecular-evolution-uh-2009 http:/nsm.uh.edu/~dgraur/ Jan
U. Houston - BIOINFO - 2007
Assignment III Pairwise Sequence Alignment and Dot Plots1. a. Use the LALIGN web server to do three pairwise global alignments with default parameters for the following sequences, and find the pair of sequences with the highest sequence identity. (1
U. Houston - BIOINFO - 2007
Assignment VII Trees1. Choose ten complete 18S ribosomal DNA sequences from Magnoliophyta. Infer phylogenetic relationships among the sequences using Neighbor-Joining and MaximumParsimony. a. Report query and database used to acquire sequences. (10
U. Houston - BIOINFO - 2007
Assignment IV Blast1. The following "thing" has just been sequenced in your lab. Run a blastn against the Nucleotide collection (nr/nt) database to identify similar sequences.TGCCTGGGTCGTCGAGCATCACTTCCTCGAGGAATATTCGCACTCGCCGTCAGGAATCGTTCCTGGCG GCGG
U. Houston - BIOINFO - 2007
Assignment V Distances, Multiple Sequence Alignment, Dn/Ds1. Get the following mRNA sequences (GI numbers) of lactate dehydrogenase from NCBI: 2047304 63565 535359 473568 52885 6652536 5199136 165452. - Align the sequences with ClustalW (with defaul
U. Houston - BIOINFO - 2007
Homework assignment 1PubMed[32 points]1. How many titles of papers by B. Vogelstein on the subject of colorectal neoplasms are available through PubMed? (6 points) a. Search without tags b. Search with the author tag c. Use the tags for author
U. Houston - ME - 2009
Weak forces in EvolutionDan Graur1t. re important. a t. e frequencies llel o important. s Changes in a ncies are not e notype frequ e Changes in g1. 2.2Mating3Deviation from randomness: By genetic similarity: Assortative mating Disassort
U. Houston - CS - 6360
Time, clocks and the ordering of events in a distributed systemL. Lamport Computer Science Laboratory SRI International CACM, 21, 7 (1978), pp. 558-565.clock to a value greater than or equal to its present value and greater than Tm. 3. Ordering th
U. Houston - CS - 6360
KERBEROS: AN AUTHENTICATION SERVICEFOR OPEN NETWORK SYSTEMSJ. G. Steiner, C. Neuman and J. I. Schiller Proc. Winter 1988 USENIX Conf., 1988, pp. 205-211. Passwords are ineffective in open network systems because they are vulnerable to snooping. Ker