Search

There has been recent extensive research on integrating cellular networks and ad hoc networks to overcome the limitations of cellular networks. Although several schemes have been proposed to use such hybrid networks to improve the performance of individual multicast groups, they do not address quality of service (QoS) issues when multiple groups are present. This paper, on the other hand, considers an interesting scenario of hybrid networks when an ad hoc network cannot accommodate all the groups and a base station has to select a subset of groups to optimize its bandwidth savings and maximize the utilization of the ad hoc network while providing QoS support for multicast users. In this paper, a network model for multicast admission control that takes wireless interference into account is developed, the group selection problem is formulated as a multidimensional knapsack problem, and an integer linear programming (ILP) formulation and a polynomial-time dynamic algorithm are proposed. A distributed implementation of the dynamic algorithm in real systems is also examined. Simulation studies demonstrate that the dynamic algorithm is able to achieve very competitive performance under various conditions, in comparison with the optimal solution computed by the ILP approach. [ABSTRACT FROM AUTHOR]

Privacy is becoming a major issue in ad hoc networks. In this paper, using pseudonimity for achieving communication anonymity in networks that apply geographic-routing algorithms is explored. An Anonymous Receiver-Contention POsitioning (ARCPO) routing algorithm is proposed. Node identities (IDs) are kept anonymous. Pseudonyms, i.e., the positions of destinations, are used for data-packet delivery. The anonymity for a destination relies on the difficulty of matching its position to its ID by any observer. Position servers that provide node position information act as trusted third parties and handle identity management. Node mobility makes the use of the pseudonym momentary, and therefore can further improve privacy. The anonymity for the source and intermediate nodes in the path is also achieved because they are not required to reveal any identity information. A receiver-contention mechanism is proposed so that a next hop can be generated without local position information exchange, which otherwise may lead to severe privacy degradation. Analysis and simulation show that while ARCPO guarantees anonymous communication in ad hoc networks, its routing performance degrades moderately compared with other position routing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, the authors propose a node-cooperative automatic repeat request (ARQ) scheme for wireless ad hoc networks, which is suitable for mobile wireless channels with high and correlated frame-error profile. An analytical model based on a two-state Markovian process is proposed to describe the behavior of the proposed retransmission scheme and to obtain its throughput, average delay, and delay jitter. The results of Monte Carlo simulations are included to demonstrate the efficacy of the proposed scheme and to verify the accuracy of the analytical models. Results show that a cooperation among a small number of nodes can significantly improve the performance of the retransmission process in terms of throughput, average delay, and delay jitter by reducing the average duration of retransmission trials. [ABSTRACT FROM AUTHOR]

During the last several years, the interest in wireless networking has grown significantly due to the availability of many wireless products, such as cell phones, wireless enabled mice, keyboards, modems, and many other products. Bluetooth-enabled cell phones, personal digital assistance (PDAs), and laptops are becoming common. Wireless fidelity (Wi-Fi) products are growing at a rapid rate. Several companies have already started developing WiMax products. The reason for the rapid growth of wireless technology is that it provides the users with additional convenience over the wired technology. General Motors Corporation introduced a Bluetooth network in its 2003 Saab 9–3 model car. Having a wireless personal area network (WPAN) in a vehicle will allow the driver to control the various operations within the vehicle without taking his hands off the steering wheel. For example, the driver will be able to make a phone call through a Bluetooth-enabled headset and a Bluetooth-enabled cell phone using voice-activated dialing features. If the Bluetooth network is connected to the vehicle's wired network through an appropriate gateway device, then the driver will be able to control the lights, windshield wipers, air flow, heat, and various other features of the vehicle through a Bluetooth-enabled headset and voice-activated features. An in-vehicle WPAN will also allow the users to use their PDAs as electronic car keys. Though an in-vehicle WPAN can provide the users with many convenient features, it can also make the vehicle system vulnerable to many types of security attacks unless it is properly designed. In this paper, the authors present a technique for building an in-vehicle secure WPAN (SWPAN). The technique is user friendly and easy to use. [ABSTRACT FROM AUTHOR]

This paper examines the problem of quality-of-service group communications in a heterogeneous network, which consists of multiple mobile ad hoc networks attached to the backbone Internet. A heuristic multicast algorithm named delay and delay variation multicast algorithm (DDVMA) is proposed. DDVMA is designed for solving the delay- and delay-variation-bounded multicast tree problem, which has been proved to be NP-complete. It can find a multicast tree satisfying the multicast end-to-end delay constraint and minimizing the multicast delay variation. Two concepts, which can help the DDVMA achieve better performance in terms of multicast delay variation than the delay and delay variation constraint algorithm that is known to be the most efficient so far, are proposed, namely, 1) the proprietary second shortest path and 2) the partially proprietary second shortest path. An analysis is given to show the correctness of DDVMA, and simulations are conducted to demonstrate the performance improvement of DDVMA in terms of multicast delay variation. It is also shown that the strategy employed by DDVMA is also applicable to handling the mobility of mobile hosts in a heterogeneous network. [ABSTRACT FROM AUTHOR]

Energy constraints have a significant impact on the design and operation of wireless sensor networks. This paper investigates the base station (BS) selection (or anycast) problem in wireless sensor networks. A wireless sensor network having multiple BSs (data sink nodes) is considered. Each source node must send all its locally generated data to only one of the BSs. To maximize network lifetime, it is essential to optimally match each source node to a particular BS and find an optimal routing solution. A polynomial time heuristic is proposed for optimal BS selection and anycast via a sequential fixing procedure. Through extensive simulation results, it is shown that this algorithm has excellent performance behavior and provides a near-optimal solution. [ABSTRACT FROM AUTHOR]

In this paper, a new cross-layer communication protocol for vehicular Internet access along highways is introduced. The objective of the new Controlled Vehicular Internet Access (CVIA) protocol is to increase the end-to-end throughput while achieving fairness in bandwidth usage between road segments. To achieve this goal, the CVIA protocol eliminates contention in relaying packets over long distances. CVIA creates single-hop vehicle clusters and mitigates the hidden node problem by dividing the road into segments and controlling the active time of each segment. Using an analytical throughput estimation model, the protocol parameters are flue-tuned to provide fairness among road segments. Simulation results confirm that the proposed CVIA protocol provides higher throughput and better fairness in multihop data delivery in vehicular networks when compared with purely IEEE 802.11-based protocols. [ABSTRACT FROM AUTHOR]

A network of sensors can be used to obtain state-based data from the area in which they are deployed. To reduce costs, the data, sent via intermediate sensors to a sink, are often aggregated (or compressed). This compression is done by a subset of the sensors called ‘aggregators.’ Inasmuch as sensors are usually equipped with small and unreplenishable energy reserves, a critical issue is to strategically deploy an appropriate number of aggregators so as to minimize the amount of energy consumed by transporting and aggregating the data. In this paper, the authors first study single-level aggregation and propose an Energy-Efficient Protocol for Aggregator Selection (EPAS) protocol. Then, they generalize it to an aggregation hierarchy and extend EPAS to Hierarchical EPAS. The optimal number of aggregators with generalized compression and power-consumption models was derived, and fully distributed algorithms for aggregator selection were presented. Simulation results show that the algorithms significantly reduce the energy consumption for data collection in wireless sensor networks. Moreover, the algorithms do not rely on particular routing protocols and are thus applicable to a broad spectrum of application environments. [ABSTRACT FROM AUTHOR]

One of the main characteristics of wireless ad hoc networks is their node-centric broadcast nature of communication, leading to interferences and spatial contention between adjacent wireless links. Due to such interferences, pessimistic concerns have been recently raised with respect to the decreasing network capacity in wireless ad hoc networks when the number of nodes scales to several orders of magnitude higher. Such studies assume uniformly distributed nodes in the network and randomized traffic patterns. In this paper, we argue that in all cases of end-to-end data communications—including one-to-k unicast and multicast data dissemination as well as/c-to-one data aggregation—the maximum achievable end-to-end data throughput (measured on the sources) heavily depends on the strategy of arranging the topology of transmission between sources and destinations, as well as possible per-node operations such as coding. An optimal strategy achieves better end-to-end throughput than an arbitrary one. We present theoretical studies and critical insights with respect to how these strategies may be designed so that end-to-end throughput may be increased. After all, under all circumstances—in either a lightly loaded or a congested network—increasing end-to-end throughput from its baseline is always beneficial to applications using ad hoc networks to communicate. [ABSTRACT FROM AUTHOR]

Several information systems' and computer-mediated communication studies in the literature measure user's perceptions of email. The user's perceptions of email were used to develop and validate the Technology Acceptance Model (TAM). While a user's perceptions of email play an important role in literature, very few studies have focused solely on developing a construct for measuring these perceptions. In this paper, we develop a construct to measure an individual's perceptions of email as a medium for electronic communication in organizations. Using a survey of management and non management employees in Northeastern US, we empirically test our theoretical construct. The results of our research indicate that an individual's perceptions of email are a multidimensional construct with two dimensions: the individual level dimension and the organizational level. At an individual level, a person's perceptions may be impacted by email's role in improving productivity, supporting team work, and providing global reach. At an organizational level a person's perceptions may be impacted by email's role in making an organization vulnerable to viruses, exposing proprietary information, and/or encouraging unprofessional and illegal behavior. [ABSTRACT FROM AUTHOR]

Software-driven hardware configurations account for the majority of modern safety-critical complex systems. The often costly failures of such systems can be attributed to software specific, hardware specific, or software/hardware interaction failures. The understanding of how failures propagate in such complex systems might provide critical information to designers, because, while a software component may not fail in terms of loss of function, a software operational state can cause an associated hardware failure. The least expensive phase of the product life cycle to address failures is during the design stage. This research presents a means to evaluate how a combined software/hardware system behaves and how such failures propagate to result in potential failures downstream, during the conceptual design stage. In particular, this paper proposes the use of high-level system modeling and model-based reasoning approaches to model failure propagation in combined software-hardware systems, introducing the Function-Failure Identification and Propagation (FFIP) analysis framework to help formalize the design of safety-critical systems. The fact that the hardware and software designers do not share the same background, knowledge, methods, or language contributes significantly to software/hardware interaction failures. A high-level systems analysis method, such as FFIP, is geared toward the unification of language and modeling concepts and may help to more seamlessly bridge such a gap. The technique is applied to the design of the Reaction Control System Jet Selection of the NASA space shuttle to evaluate failure propagation within the Reaction Control System Jet selection, specifically for the redundancy management system. The paper concludes with the extensions and mappings to the software domain that are required for a truly integrated methodology. [ABSTRACT FROM AUTHOR]

Previous analytical work [16], [17] on the resilience of P2P networks has been restricted to disconnection arising from simultaneous failure of all neighbors in routing tables of participating users. In this paper, we focus on a different technique for maintaining consistent graphs—Chord's successor sets and periodic stabilizations—under both static and dynamic node failure. We derive closed-form models for the probability that Chord remains connected under both types of node failure and show the effect of using different stabilization interval lengths (i.e., exponential, uniform, and constant) on the probability of partitioning in Chord. [ABSTRACT FROM AUTHOR]