In wireless mobile ad hoc networks (MANETs), energy is a crucial resource. Topology control technology allows network nodes to reduce their transmission power while preserving the network connectivity. A MANET is a non-cooperative system so that only when a node earns its payment, which can cover its cost, the cooperation can be stimulated. We design a truthful topology control mechanism (TRUECON) for MANETs to induce the selfish, but rational, network nodes to collaborate. Truth-telling is a dominant strategy in TRUECON. A node needs to reveal its true value in order to obtain the maximum expected utility. We prove the overpayment of TRUECON has a bound depending on different radio propagation models

Quality of service (QoS) for mobile ad hoc networks (MANETs) has received increased attention. Security is a critical aspect of QoS provisioning in MANET environment. Because of the characteristics of the MANETs, the conventional security measures cannot be applied and new security techniques are necessary. In this paper, we propose a security mechanism for MANET QoS signaling systems. The mechanism is able to efficiently detect intrusions on QoS parameters transmitted over a path in the absence of adjacent colluding nodes. Our simulation results show that the system achieves good detection rate and imposes low delay penalty.

We propose a novel data dissemination scheme in wireless sensor networks which achieves energy efficiency by avoiding query flooding and extra data transmission on data storage elsewhere. Moreover, our method achieves further energy efficiency by reducing dissemination of redundant data. In addition, services for data retrieval in multiple levels of detail are provided. Our scheme consists of a localized data-source-forming algorithm and a hierarchical multi-resolution querying scheme which includes a localized node-selection algorithm and a set of registration points (geographical locations) for each type of task. Simulation results show that the performance of our method is much better than early methods like directed diffusion.

One of the main challenges in budding intrusion detection systems (IDSs) for mobile ad hoc networks (MANETs) is to integrate the mobility impact and adjust the behavior of IDSs dynamically. In this paper, focusing on the protection of MANET routing protocols, we first demonstrate that nodes' moving speed, a commonly used parameter in tuning IDS performance, is not an effective metric for the performance measurement of IDSs for MANETs. We then propose a new feature - the link change rate, which can not only act as a unified metric in measuring MANET IDS performance, but also be used to facilitate local MANET IDSs to select normal profiles adaptively. We utilize different mobility models to study the performance of our proposed adaptive mechanisms at different mobility levels. Simulation results show that our proposed adaptive mechanisms are effective and less dependent on mobility models. Detailed analysis of simulation results is also provided.

Summary form only given. In wireless mobile ad hoc networks (MANET), energy is a scarce resource. Though cooperation is the basis of network services, due to the limited energy reserve of each node, there is no guarantee any given protocols would be followed by nodes managed by different authorities. Instead of treating the selfish nodes as a security concern and trying to eliminate them, we propose a novel way to encourage cooperative works - rewarding service providers according to their contributions. Nodes in a MANET can form coalitions to reduce aggregate transmission power on each hop along a route. The payment of each node in a coalition is determined by using Shapley Value, a well-known concept in game theory for allocating payoff for each member in a cooperative coalition. We present the contribution reward routing protocol with Shapley Value (CAP-SV). It achieves the objective of truthfulness. The performance of CAP-SV is studied by simulations using ns-2. Analysis and experimental results show a routing protocol with the consideration of the incentives of individual nodes stimulates cooperation and improves network lifetime without significantly diminishing the performance of the whole network.

A wealth of research proposals in ad hoc networks has been seen on the problem of routing along power efficient paths. However they do not take into account the interests of individual nodes. Managed by different profit-oriented entities, network nodes can no longer be assumed to cooperate with each other. Incentive-compatible routing seems to be more realistic to deal with selfish nodes in ad hoc networks. We propose the transmission power recursive auction mechanism (TEAM) routing protocol to prevent the selfish behavior and stimulate cooperative work from the game theoretic approach. It pays nodes for their services and makes cheating not attractive. Interests of nodes are best served if they only reveal true information. With some assumptions the truthfulness of TEAM can be proved. We present a theoretical bound of the power efficiency of TEAM protocol. It is also shown that, compared to another truthful routing protocol, Ad hoc-VCG, TEAM reduces the message complexity significantly.

Several problems are required to be fixed in order to apply the geographical routing protocol greedy perimeter stateless routing (GPSR) in wireless sensor networks. First, GPSR is designed under the assumption of symmetric links (i.e., bidirectional reachability) which is not realistic for many practical sensor networks. Second, in sensor networks, packet destinations are often marked with locations instead of identifiers like IP address and therefore packets are routed to the home node which is the node geographically closest to the destined location. GPSR is not efficient in identifying the home node when the target location is outside the exterior perimeter of the sensor network. Third, due to the dynamic nature of sensor networks, maintaining data consistency, that is, data retrieved from the home node for a location should be consistent with the data sent to the same location, becomes a challenge when home nodes change. We propose on-demand GPSR (OD-GPSR), a data driven geographical routing protocol customized for sensor networks with solutions to the above three problems. Simulation results show that OD-GPSR performs well in terms of energy efficiency and packet delivery rate at the cost of a little more packet delivery delay.

Up to date, most of approaches proposed for bandwidth reservation in MANETs assume cooperativeness among all nodes. However, in a public network where nodes are owned by different self-interested organizations, willingness to cooperate cannot be assumed. Selfishness of network nodes may cause not only failure of reservation but also degradation of overall networking performance. A mechanism of economic incentives is therefore needed to induce selfish nodes to participate in bandwidth reservation. In this paper, we propose a game theoretic framework based on Nash bargaining game from cooperative game theory. The framework solves the selfishness problem when reserving bandwidth in a forwarding node's neighborhood. We describe the network model in which this framework may be applied, as well as the computation of Nash equilibrium point, which can be considered as a pricing scheme that may obtain social optimality in reservation negotiations. Application of our framework can efficiently prevent network nodes from acting selfishly and therefore would improve the overall performance of the network.

Intrusion detection systems (IDSs) for mobile ad hoc networks (MANETs) are necessary when we deploy MANETs in reality. In this paper, focusing on the protection of MANET routing protocols, we present a new intrusion detection agent model and utilize a Markov chain based anomaly detection algorithm to construct the local detection engine. The details of feature selection, data collection, data preprocess, Markov chain construction, classifier construction and parameter tuning are provided. Based on the routing disruption attack aimed at the dynamic source routing protocol (DSR), we study the performance of the algorithm at different mobility levels. Simulation results show that our algorithm can achieve low false positive ratio, high detection ratio, and small MTFA (mean time to the first alarm), especially when the mobility is low. Detailed analysis of simulation results is also presented.

This paper discusses the use of an isolated network laboratory to teach computer security using persistent cooperative groups and an active learning approach. Computer security and computer security education are areas of increasing importance as computer systems become more interconnected. When offered, undergraduate and graduate computer security courses are routinely taught using a traditional lecture format. If the course includes a class project, the class project is limited in scope and constitutes a relatively small portion of the student's grade. This paper examines a different approach in which the class project is the dominant factor in the student's grade. The students work in persistent cooperative teams as either a black or gold team. Black teams attempt to break into other black team computers or attack the gold team. The gold team operates Windows NT, LINUX, and Solaris-based servers and attempts to defend their servers and role-play system administrators. The entire exercise takes place in an isolated lab so as to separate student class activities from the rest of the departmental intranet. Four years of experience running the class with this format suggests that the use of persistent cooperative groups and active learning are effective approaches for teaching network security and are preferred over a lecture-based course.

Research on Web searching is at an incipient stage. This aspect provides a unique opportunity to review the current state of research in the field, identify common trends, develop a methodological framework, and define terminology for future Web searching studies. In this article, the results from published studies of Web searching are reviewed to present the current state of research. The analysis of the limited Web searching studies available indicates that research methods and terminology are already diverging. A framework is proposed for future studies that will facilitate comparison of results. The advantages of such a framework are presented, and the implications for the design of Web information retrieval systems studies are discussed. Additionally, the searching characteristics of Web users are compared and contrasted with users of traditional information retrieval and online public access systems to discover if there is a need for more studies that focus predominantly or exclusively on Web searching. The comparison indicates that Web searching differs from searching in other environments.

The paper examines techniques for providing adaptation in intrusion detection and intrusion response systems. As attacks on computer systems are becoming increasingly numerous and sophisticated, there is a growing need for intrusion detection and response systems to dynamically adapt to better detect and respond to attacks. The Adaptive Hierarchical Agent-based Intrusion Detection System (AHA! IDS) provides detection adaptation by adjusting the amount of system resources devoted to the task of detecting intrusive activities. This is accomplished by dynamically invoking new combinations of lower level detection agents in response to changing circumstances and by adjusting the confidence associated with these lower-level agents. The Adaptive Agent-based Intrusion Response System (AAIRS) provides response adaptation by weighting those responses that have been successful in the past over those techniques that have not been as successful. As a result, the more successful responses are used more often than the less successful techniques. It also adapts responses based on the system's belief that intrusion detection reports are valid. Intuitively, adaptive detection and response systems will provide more robust protection than static, non-adaptive systems.

article Free Access Share on PACKET tracing: a new paradigm for teaching computer network courses Authors: Willis F. Marti Dept. of Computer Science, College of Engineering, Texas A&M University, College Station, TX Dept. of Computer Science, College of Engineering, Texas A&M University, College Station, TXView Profile , Udo W. Pooch Dept. of Computer Science, College of Engineering, Texas A&M University, College Station, TX Dept. of Computer Science, College of Engineering, Texas A&M University, College Station, TXView Profile , John A. Hamilton Dept. of Electrical Engineering & Computer Science, U.S. Military Academy, West Point, NY Dept. of Electrical Engineering & Computer Science, U.S. Military Academy, West Point, NYView Profile Authors Info & Claims ACM SIGCUE OutlookVolume 24Issue 1-3Jan.-July, 1996 pp 162–164https://doi.org/10.1145/1013718.237637Online:01 January 1996Publication History 3citation258DownloadsMetricsTotal Citations3Total Downloads258Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Discusses the design of a tool that automatically removes security-sensitive information from intruder activity log files collected at a compromised site. The sanitization of sensitive information enables researchers to study the log files without further compromising the security of the affected sites. This paper begins with a brief discussion of the importance of such a tool and a description of the complete sanitization process. This is followed by an examination of the important design issues of the sanitizer. The paper concludes with the final design of a sanitizer for SunOS-based intruder activity logs.>

The goal-oriented Simulation Environment Systems (SES) architecture ‘humanizes‘ the problem solving process by providing a more natural scheme of model construction and experimentation over traditional simulation languages. SES is a collection of integrated tools that allows users to focus on problem solving rather than on the peripheral activities of programming. Interactive software plays a vital role in reducing the burden on the user in describing the various information types. It prompts for information regarding identification of controllable parameters, generation of the goal scenario, and definition of performance criteria. Efforts are made to supply the user with as much information as is currently defined in the model base when eliciting responses. Further, the SES model specification language is specifically designed to support a library of model parts. Such a library serves as a corporate memory of past simulation studies and contains information on component behaviours, transaction sequences, and analysis rules.

The workload processed by a computer system can have a dramatic impact on the system's measured performance. A computer performance evaluation study conducted using empirical techniques requires an executable test workload. A test workload composed of synthetic jobs appears the most promising. Such a synthetic mix requires development of predictor equations which allow the setting of the parameters to produce the desired resource demand patterns. A statistical methodology composed of experimental design techniques and regression analysis is proposed to aid in the development of prediction equations relating the resource descriptor variables and the synthetic job parameters. Two synthetic jobs are posed and the experimental design procedure is demonstrated with workload data from the Amdahl 470/V6 at Texas A & M University. Some factors related to validation of test workloads are presented.

A classical method of measunng the number of lobs m a trine-shared computer system ,s to collect statistics at the epochs of quantum completions.A computer system utilizing round-robin quantum allocations ~s modeled as a feedback queue with Poisson amvals and exponential service times, and the bias in the stausuc taken at the quantum compleuons is quant,fied.The difference botween this statistic and the true Ume-average system size is given for such a system including quanta and overhead.

Recent advances in hardware technology have led to marked decreases in the costs of processors in computer systems. Reduced costs of processors have led to the design and implementation of distributed function computer architectures, using multiple dedicated processors. This paper outlines the hardware, modular operating system and protection features of such a distributed function computer, designed for time shared operation.

The minimization of switching functions involving many variables is a difficult task. This paper presents a new minimization procedure that allows this process to be implemented with reduced computational effort. This procedure, designated as the directed-search algorithm, is applicable to both manual and computer-programmed minimization. The details of the algorithm are presented and illustrated by example. Comparative run-times between another minimization program and the directed-search algorithm, as implemented in Fortran, are also given.

A user-oriented Computer Graphics System (CGS) is described, which primarily has been designed to aid the application programmer, and not just the sophisticated computer graphics user. The system has been designed to provide a very simple interaction capability, where the interaction is based on a variety of input devices and a simple input/output graphics command language. The result of this system has been an increase in programming efficiency, reduction in span time from creations of design to actual implementation. Typical application developments have included such system as flowcharting systems, Computer Aided Architectural Space Planning, Animation, Vehicle-Pedestrian Interactions, Computer-aided designs, and the simulation of the NASA Space Shuttle.