Search

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]

The focus of this paper is to analyze the throughput performance of TCP Thhoe and Reno on a differentiated services network with correlated wireless losses. An analytical model of TCP on a wireless link with differentiated services (DiffServ) based on the packet train model is developed. The network model is based on the state dependent arrival process. A major contribution of this paper is an analytical model combining the performance of TCP throughput and DiffServ leading to a model that represents an almost complete network scenario. It is shown that DiflServ in a wireless channel with correlated error losses is possible if the prob' ability of the channel changing from a good state to a bad state is less than a particular value. It is also shown that TCP Reno has a higher sensitivity to DiffServ than Tahoe. Our analytical model is validated through a number of simulations. [ABSTRACT FROM AUTHOR]

This paper provides mobility estimation and pree-diction for a variant of the GSM network that resembles an ad hoc wireless mobile network in which base stations and users are both mobile. We propose using a Robust Extended Kalman Filter (REKF) to derive an estimate of the mobile user's next mobile base station from the user's location, heading, and altitude, to improve connection reliability and bandwidth efficiency of the underlying system. Our analysis demonstrates that our algorithm can successfully track the mobile users with less system complexity, as it requires measurements from only one or two closest mobile base stations. Further, the technique is robust against system uncertainties caused by the inherent deterministic nature of the mobility model. Through simulation, we show the accuracy of our prediction algorithm and the simplicity of its implementation. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid resource management system for the uplink in Universal Mobile Telecommunications System wideband code-division multiple access (WCDMA) with components in the Node-B and user equipment (UE) has been proposed. A rate scheduler in the client focuses on average packet delays as a means of abstracting application-specific requirements from the rest of the resource management scheme. It controls uplink transmission through variable spreading gain to optimize resource usage while meeting target delays. Service change requests from the distributed rate schedulers are collectively processed through interservice and intraservice priority queuing in a manner that is shown to exhibit fairness in allocation of resources when cumulative load exceeds system capacity. The performance of the proposed algorithm is explored through discrete-event simulations for three classes of traffic, namely voice, video, and data, over the WCDMA uplink in the presence of short-term Rayleigh fading, automatic repeat request, forward error correction, target transmission delays to meet the respective quality of service, and frame error rate targets in a ‘multicell’ environment. The authors analyze two alternatives for distributed resource management with the UE or Node-B in control of rate scheduling and observe the fairness in resource allocation of both systems. Priority of speech, video, and data traffic is respected and reflected in 95th percentile transmission delays for heavily loaded systems. [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]

The wireless mesh network (WMN) has recently emerged as a promising technology for next-generation wireless networking. In the WMN, it is crucial to support mobile users roaming around the network without service interruption. This consideration motivates us to develop an efficient fast handoff approach using distributed computing technology. Particularly, we propose a mobile agent (MA).based handoff architecture for the WMN, where each mesh client has an MA residing on its registered mesh router to handle the handoff signaling process. To guarantee quality of service (QoS) and achieve differentiated priorities during the handoff, we develop a proportional threshold structured optimal effective bandwidth (PTOEB) policy for call admission control (CAC) on the mesh router, as well as a genetic algorithm (GA)-based approximation approach for the heuristic solution. The simulation study shows that the proposed CAC scheme can obtain a satisfying tradeoff between differentiated priorities and the statistical effective bandwidth in a WMN handoff environment. [ABSTRACT FROM AUTHOR]

We study the problem of accurate localization of static or mobile nodes in a wireless ad hoc network using the distance estimates of a group of untrusted anchors within the communication range of the nodes. Some of the anchors may be malicious and may independently lie about the distance estimate. The malicious anchors may also collude to lie about the distance estimates. In both cases, accurate node localization may be seriously undermined. We propose a scheme that performs accurate localization of the nodes in the network despite the presence of such malicious anchors. We also show how to identify most of these malicious anchors. In the case where measurements are error free, we derive a critical threshold B for the number of malicious anchors that can be tolerated in the localization process without undermining accuracy. We also show how to correctly localize a node and identify all the malicious anchors in this setting. In the presence of measurement errors, we propose a convex optimization-based localization scheme that can accurately localize a node, as long as the number of malicious anchors in its communication range is no more than B. Simulation results show that our schemes are very effective. When the measurements are error prone and the number of malicious anchors is no more than B, our scheme localizes a node with an error less than 8% and is also able to identify a significant number of malicious anchors. Our schemes guarantee that a true anchor is not identified as malicious. [ABSTRACT FROM AUTHOR]

Several channel-allocation algorithms have been pro- posed in the literature for traditional cellular networks with static base stations (BS5), while not much attention has been given to channel-allocation problems for cellular networks where BSs are mobile. In cellular networks with mobile BSs (MBSs), the network topology is dynamic due to the mobility of the BSs. This makes the channel-allocation problem in such networks more challenging. Moreover, the MBSs may fail and degrade the performance of the cellular network. Therefore, it is desirable that the channel- allocation algorithm be fault tolerant. Thus, even in the presence of failure of the MBSs, the channel-allocation algorithm should work reasonably well. It is also desirable to design a channel-allocation approach that guarantees that the request from a mobile host (MH) is responded to in a timely manner. In this paper, a distributed dynamic channel-allocation algorithm that addresses these problems in cellular networks with MBSs is proposed. The proposed algorithm is fault tolerant and guarantees that the time to respond to an MH's request for supporting a call is upperbounded. The performance evaluation of the proposed algorithm shows that the proposed algorithm performs well, even in the presence of failure of the MBSs. [ABSTRACT FROM AUTHOR]

Scheduling plays an important role in providing quality of service (QoS) support to multimedia communications in various kinds of wireless networks, including cellular networks, mobile ad hoc networks, and wireless sensor networks. The authors propose a scheduling algorithm at the medium access control (MAC) layer for multiple connections with diverse QoS requirements, where each connection employs adaptive modulation and coding (AMC) scheme at the physical (PHY) layer over wireless fading channels. Each connection is assigned a priority, which is updated dynamically based on its channel and service status; the connection with the highest priority is scheduled each time. The authors' scheduler provides diverse QoS guarantees, uses the wireless bandwidth efficiently, and enjoys flexibility, scalability, and low implementation complexity. Its performance is evaluated via simulations. [ABSTRACT FROM AUTHOR]