Showing papers in "Mobile Networks and Applications in 2004"

Distributed construction of connected dominating set in wireless ad hoc networks

Abstract: Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms cannot guarantee to generate a CDS of small size. Their message complexities can be as high as O(n2), and their time complexities may also be as large as O(n2) and O(n3). We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, O(n) time complexity and O(n log n) message complexity. By establishing the Ω(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.

Performance evaluation of routing protocols for ad hoc wireless networks

Abstract: A mobile ad hoc network is a collection of autonomous mobile nodes that communicate with each other over wireless links. Such networks are expected to play an increasingly important role in future civilian and military settings, being useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable and movement of communicating parties is possible. However, since there is no stationary infrastructure such as base stations, mobile hosts need to operate as routers in order to maintain the information about the network connectivity. Therefore, a number of routing protocols have been proposed for ad hoc wireless networks. In this paper, we study and compare the performance of the following routing protocols AODV, PAODV (preemptive AODV), CBRP, DSR, and DSDV. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. Our results indicate that despite its improvement in reducing route request packets, CBRP has a higher overhead than DSR because of its periodic hello messages while AODV's end-to-end packet delay is the shortest when compared to DSR and CBRP. PAODV has shown little improvements over AODV.

On the power assignment problem in radio networks

Abstract: Given a finite set S of points (i.e. the stations of a radio network) on a d-dimensional Euclidean space and a positive integer 1 ≤ h ≤ |S| - 1, the MIN d D h-RANGE ASSIGNMENT problem consists of assigning transmission ranges to the stations so as to minimize the total power consumption, provided that the transmission ranges of the stations ensure the communication between any pair of stations in at most h hops.Two main issues related to this problem are considered in this paper: the trade-off between the power consumption and the number of hops; the computational complexity of the MIN dD h-RANGE ASSIGNMENT problem.As for the first question, we provide a lower bound on the minimum power consumption of stations on the plane for constant h. The lower bound is a function of |S|, h and the minimum distance over all the pairs of stations in S. Then, we derive a constructive upper bound as a function of |S|, h and the maximum distance over all pairs of stations in S (i.e. the diameter of S). It turns out that when the minimum distance between any two stations is "not too small" (i.e. well spread instances) the upper bound matches the lower bound. Previous results for this problem were known only for very special 1-dimensional configurations (i.e., when points are arranged on a line at unitary distance) [Kirousis, Kranakis, Krizanc and Pelc, 1997].As for the second question, we observe that the tightness of our upper bound implies that MIN 2D h-RANGE ASSIGNMENT restricted to well spread instances admits a polynomial time approximation algorithm. Then, we also show that the same approximation result can be obtained for random instances. On the other hand, we prove that for h=|S|-1 (i.e. the unbounded case) MIN 2D h-RANGE ASSIGNMENT is NP-hard and MIN 3D h-RANGE ASSIGNMENT is APX-complete.

Selecting forwarding neighbors in wireless ad hoc networks

Abstract: Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as flooding, is to let every node retransmit the message to all its 1-hop neighbors when receiving the first copy of the message. Despite its simplicity, flooding is very inefficient and can result in high redundancy, contention, and collision. One approach to reducing the redundancy is to let each node forward the message only to a small subset of 1-hop neighbors that cover all of the node's 2-hop neighbors. In this paper we propose two practical heuristics for selecting the minimum number of forwarding neighbors: an O(n log n)time algorithm that selects at most 6 times more forwarding neighbors than the optimum, and an O(n log2 n) time algorithm with an improved approximation ratio of 3, where n is the number of 1- and 2-hop neighbors. The best previously known algorithm, due to Bronnimann and Goodrich [2], guarantees O(1) approximation in O(n3 log n)time.

Integrating heterogeneous wireless technologies: a cellular aided mobile Ad Hoc network (CAMA)

Abstract: A mobile ad hoc network is a collection of wireless terminals that can be deployed rapidly. Its deficiencies include limited wireless bandwidth efficiency, low throughput, large delays, and weak security. Integrating it with a well-established cellular network can improve communication and security in ad hoc networks, as well as enrich the cellular services. This research proposes a cellular-aided mobile ad hoc network (CAMA) architecture, in which a CAMA agent in the cellular network manages the control information, while the data is delivered through the mobile terminals (MTs). The routing and security information is exchanged between MTs and the agent through cellular radio channels. A position-based routing protocol, the multi-selection greedy positioning routing (MSGPR) protocol, is proposed. At times due to the complicated radio environment, the position information is not precise. Even in these cases, the MT can still find its reachable neighbors (the association) by exchanging "hello" messages. This association is used in complement with the position information to make more accurate routing decisions. Simulation results show that the delivery ratio in the ad hoc network is greatly improved with very low cellular overhead. The security issues in the proposed architecture and the corresponding solutions are addressed. The experimental study shows that CAMA is much less vulnerable than a pure ad hoc network.

BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks

Abstract: In this paper we describe BlueMesh, a new protocol for the establishment of scatternets, i.e., multi-hop wireless networks of Bluetooth devices. BlueMesh defines rules for device discovery, piconet formation and piconet interconnection so to generate connected scatternets with the following desirable properties. BlueMesh forms scatternets without requiring the Bluetooth devices to be all in each other transmission range. BlueMesh scatternet topologies are meshes with multiple paths between any pair of nodes. BlueMesh piconets are made up of no more than 7 slaves. Simulation results in networks with over 200 nodes show that BlueMesh is effective in quickly generating a connected scatternet in which each node, on average, does not assume more than 2.4 roles. Moreover, the route length between any two nodes in the network is comparable to that of the shortest paths between the nodes.

A packet scheduling approach to QoS support in multihop wireless networks

Abstract: Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in bandwidth-constrained, shared-channel, multihop wireless networks. Packet scheduling has been a very popular paradigm to ensure minimum throughput and bounded delay access for packet flows. This work describes a packet scheduling approach to QoS provisioning in multihop wireless networks. Besides minimum throughput and delay bounds for each flow, our scheduling disciplines seek to achieve fair and maximum allocation of the shared wireless channel bandwidth. However, these two criteria can potentially be in conflict in a generictopology multihop wireless network where a single logical channel is shared among multiple contending flows and spatial reuse of the channel bandwidth is possible. In this paper, we propose a new scheduling model that addresses this conflict. The main results of this paper are the following: (a) a two-tier service model that provides a minimum "fair" allocation of the channel bandwidth for each packet flow and additionally maximizes spatial reuse of bandwidth, (b) an ideal centralized packet scheduling algorithm that realizes the above service model, and (c) a practical distributed backoff-based channel contention mechanism that approximates the ideal service within the framework of the CSMA/CA protocol.

mPERSONA: personalized portals for the wireless user: An agent approach

Abstract: The needs of the wireless and mobile user regarding information access and services are quite different than those of the desktop user. This need is not about browsing the Web but about receiving personalized services that are highly sensitive to the immediate environment and requirements of the user. Personalization appears to be the most appropriate solution to this need. It comes into aid by creating personalized portals that are specific for the wireless user, which (a) are focus on the local content and (b) directly tones down factors that break up the functionally of the Internet/wireless services when viewed through wireless devices; factors like the "click count", user response time (the "choice" factor) and the size of the wireless network traffic. In this paper we present a flexible personalization system for the wireless user that takes into consideration user mobility, the local environment and the user and device profile. The system utilizes the various characteristics of mobile agents to support flexibility, scalability, modularity and user mobility. We present metrics appropriate to the wireless environment, and an initial performance evaluation indicating improvement ranging from 33% up to, for certain metrics, 60%.

Integrated routing and storage for messaging applications in mobile ad hoc networks

Abstract: This paper is motivated by the observation that traditional ad hoc routing protocols are not an adequate solution for messaging applications (e.g., e-mail) in mobile ad hoc networks. Routing in ad hoc mobile networks is challenging mainly because of node mobility - the more rapid the rate of movement, the greater the fraction of bad routes and undelivered messages. For applications that can tolerate delays beyond conventional forwarding delays, we advocate a relay-based approach to be used in conjunction with traditional ad hoc routing protocols. This approach takes advantage of node mobility to disseminate messages to mobile nodes. The result is the Mobile Relay Protocol (MRP), which integrates message routing and storage in the network; the basic idea is that if a route to a destination is unavailable, a node performs a controlled local broadcast (a relay) to its immediate neighbors. In a network with sufficient mobility - precisely the situation when conventional routes are likely to be non-existent or broken-it is quite likely that one of the relay nodes to which the packet has been relayed will encounter a node that has a valid, short (conventional) route to the eventual destination, thereby increasing the likelihood that the message will be successfully delivered. Our simulation results under a variety of node movement models demonstrate that this idea can work well for applications that prefer reliability over latency.

A two-tier heterogeneous mobile Ad Hoc network architecture and its load-balance routing problem

Abstract: The mobile ad hoc network (MANET) has attracted a lot of interest recently. However, most of the existing works have assumed a stand-alone MANET. In this paper, we propose a two-tier, heterogeneous MANET architecture which can support Internet access. The low tier of the network consists of a set of mobile hosts each equipped with a IEEE 802.11 wireless LAN card. In order to connect to the Internet and handle the network partitioning problem, we propose that the high tier is comprised of a subset of the mobile hosts, called gateways, which can access to cellular/infrastructure networks. The high tier is heterogeneous in the sense that the network interfaces in the gateway hosts could be IEEE 802.11 cards, PHS handsets, or GPRS handsets characterized by different bandwidths and latencies. Observing that the gateways could become the bottlenecks of the two-tier network, we propose a set of solutions, namely boundary-moving, host-partitioning, and probabilistic solutions, to solve the load-balance routing issue. Implementation issues/concerns of these schemes are discussed. Simulation results are presented to compare these load-balance routing schemes.

Mobile Agents for Wireless Computing: The Convergence of Wireless Computational Models with Mobile-Agent Technologies

Abstract: Wireless mobile computing breaks the stationary barrier and allows users to compute and access information from anywhere and at anytime. However, this new freedom of movement does not come without new challenges. The mobile computing environment is constrained in many ways. Mobile elements are resource-poor and unreliable. Their network connectivity is often achieved through low-bandwidth wireless links. Furthermore, connectivity is frequently lost for variant periods of time. The difficulties raised by these constraints are compounded by mobility that induces variability in the availability of both communication and computational resources. These severe restrictions have a great impact on the design and structure of mobile computing applications and motivate the development of new software models. To this end, a number of extensions to the traditional distributed system architectures have been proposed (26). These new software models, however, are static and require a priori set up and configuration. This in effect limits their potential in dynamically serving the mobile client; the client cannot access a site at which an appropriate model is not configured in advance. The contribution of this paper is twofold. First, the paper shows how an implementation of the proposed models using mobile agents eliminates this limitation and enhances the utilization of the models. Second, new frameworks for Web-based distributed access to databases are proposed and implemented.

Bluetooth dynamic scheduling and interference mitigation

Abstract: Bluetooth is a cable replacement technology for Wireless Personal Area Networks. It is designed to support a wide variety of applications such as voice, streamed audio and video, web browsing, printing, and file sharing, each imposing a number of quality of service constraints including packet loss, latency, delay variation, and throughput. In addition to QOS support, another challenge for Bluetooth stems from having to share the 2.4 GHz ISM band with other wireless devices such as IEEE 802.11. The main goal of this paper is to investigate the use of a dynamic scheduling algorithm that guarantees QoS while reducing the impact of interference. We propose a mapping between some common QoS parameters such as latency and bit rate and the parameters used in the algorithm. We study the algorithm's performance and obtain simulation results for selected scenarios and configurations of interest.

On improving the performance of IEEE 802.11 with relay-enabled PCF

Abstract: Integrating wireless LAN (WLAN) techniques with the third generation cellular networks has become a promising way to improve the performance of wireless systems. As WLANs play an important role in such heterogeneous systems, the performance of WLANs becomes important to the whole system. It is well known that WLANs provide a physical layer multi-rate capability, and hence MAC layer mechanisms are needed to exploit this capability. In this paper, we propose a novel MAC layer relay-enabled point coordination function (PCF) protocol, called r PCF, to exploit the physical layer multi-rate capability. Since WLAN supports multiple data rates in response to different channel conditions, data packets may be delivered faster through a relay node than through the direct link if the direct link has low quality and low rate. To enable MAC layer relay, the access point needs to collect information about the channel conditions, and notify the mobile nodes which data rate to use and whether to transmit the data through a relay station. We design protocols to achieve this goal and refine these protocols to minimize the control overhead. Simulation results show that r PCF can significantly improve the system performance in terms of system throughput and transmission delay by adding only a negligible control overhead.

Auction-based resource reservation in 2.5/3G networks

Abstract: We consider UMTS networks in which users request services other than telephony that last for long time intervals: e.g., video clips that last for several minutes. The duration of network time-slots over which resource units are allocated is much shorter. This complicates consistent reservation of resources over longer time scales, where consistent reservation is required to ensure that service quality is constant throughout the entire service session. In this paper, we define an auction-based mechanism for nearly consistent reservation of the resources of a UMTS (or GPRS) network by the users that value them the most, in order to satisfy the longer time scale requirements of their service sessions. Each of these sessions has a fixed target bit-rate. The mechanism is based on a series of Generalized Vickrey Auctions and a set of predefined user utility functions that we propose. Bidding is performed automatically on behalf of the users on the basis of each user's selection of one of these utility functions and his declaration of a total willingness to pay. We argue that under our mechanism the user does not have a clear incentive of not performing a truthful selection of a bidding function according to his own utility. The utility functions we define express appropriately the preferences of the users with respect to the resource allocation pattern in the cases where perfectly consistent allocation cannot be attained. We also provide a mapping of these functions to the UMTS service classes. The effectiveness of our resource reservation mechanism is demonstrated by means of experiments. It appears that most of the users either are served very satisfactorily or essentially are not served at all. The mechanism is implemented at the network base station, and is applicable in practical cases of networks with large numbers of users whose sessions last for many slots.

Roam: A Scalable Replication System for Mobility

Abstract: Nomadic users require replication to store copies of critical data on their mobile machines while disconnected or poorly connected. Existing replication services do not provide all classes of mobile users with the capabilities they require, which include: the ability for direct synchronization between any two replicas, support for large numbers of replicas, and detailed control over what files reside on their local (mobile) replica. Mobile users must adapt their behavior to match the level of service provided by today's replication systems, thereby hindering mobility and costing additional time, money, and systems management. Roam is a replication system designed to satisfy the requirements of the mobile user. Roam is based on the Ward Model, a replication architecture for mobile environments. Using the Ward Model and new distributed algorithms, Roam provides a scalable replication solution for the mobile user. We describe the motivation, design, and implementation of Roam and report its performance.

Data protection and data sharing in telematics

Abstract: Automotive telematics may be defined as the information-intensive applications enabled for vehicles by a combination of telecommunications and computing technology. Telematics by its nature requires the capture, storage, and exchange of sensor data to obtain remote services. Such data likely include personal, sensitive information, which require proper handling to protect the driver's privacy. Some existing approaches focus on protecting privacy through anonymous interactions or by stopping information flow altogether. We complement these by concentrating instead on giving different stakeholders control over data sharing and use. In this paper, we identify several data protection challenges specifically related to the automotive telematics domain, and propose a general data protection framework to address some of those challenges. The framework enables data aggregation before data is released to service providers, which minimizes the disclosure of privacy sensitive information. We have implemented the core component, the privacy engine, to help users manage their privacy policies and to authorize data requests based on policy matching. The policy manager provides a flexible privacy policy model that allows data subjects to express rich constraint-based policies, including event-based, and spatio-temporal constraints. Thus, the policy engine can decide on a large number of requests without user assistance and causes no interruptions while driving. A performance study indicates that the overhead is stable with an increasing number of data subjects.

Performance evaluation of Bluetooth polling schemes: an analytical approach

Abstract: In the recent years, many polling schemes for Bluetooth networks have been proposed and evaluated. To the authors knowledge, however, analysis has been carried out mainly through computer simulations and, up to now, no mathematical treatment of this topic has been presented. In this paper, we propose an analytical framework for performance evaluation of polling algorithms in Bluetooth piconets. The analysis is carried out by resorting to an effective and simple mathematical method, called Equilibrium Point Analysis. The system is modelled as a multidimensional finite Markov chain and performance metrics are evaluated at the equilibrium state. The analysis is focused on three classical polling schemes, namely Pure Round Robin, Gated Round Robin and Exhaustive Round Robin, which are compared in terms of packet delay, channel utilization, and fairness among users. Both analytical and simulation results are presented for three relevant scenarios, in order to validate the accuracy of the analysis proposed.

An end-to-end approach for transparent mobility across heterogeneous wireless networks

Abstract: With the advent of a myriad of wireless networking technologies, a mobile host today can potentially be equipped with multiple wireless interfaces that have access to different wireless networks. It is widely perceived that future generation wireless networks will exhibit a similar trend in supporting a large variety of heterogeneous wireless access technologies that a mobile host can choose from. In this paper, we consider such a multi-homed mobile host and propose an end-to-end solution that enables the seamless use of heterogeneous wireless access technologies. The unique features of the proposed solution include: (i) a purely end-to-end approach to handle host mobility that requires no support from the underlying network infrastructure, (ii) seamless vertical handoffs when the mobile host migrates from one access network to another, (iii) ability to support different congestion control schemes for a live connection traversing different interfaces, and (iv) effective bandwidth aggregation when the mobile host has simultaneous access to multiple networks. We present the design and details of the proposed approach, and evaluate its performance through simulations and real-life field experiments.

Topology management for improving routing and network performances in mobile ad hoc networks

Abstract: A distributed topology management algorithm based on the construction of a forest from the topology of the network is proposed. In this algorithm, each tree of the forest forms a zone, and each zone is maintained proactively. As a result, the network can be seen as a set of non-overlapping zones. We introduce the concept of quality of connectivity for extracting the links connecting the pair of best nodes, and use this quality to construct the forest. We characterize the behaviors of the proposed topology management algorithm under various network density. We study the effect of the topology management on the performance of an ad hoc routing protocol. The results demonstrate that the performance of routing can be significantly improved with the help of topology management.

Up- and downlink admission/congestion control and maximal load in large homogeneous CDMA networks

Abstract: This paper proposes scalable admission and congestion control schemes that allow each base station to decide independently of the others what set of voice users to serve and/or what bit rates to offer to elastic traffic users competing for bandwidth. These algorithms are primarily meant for large CDMA networks with a random but homogeneous user distribution. They take into account in an exact way the influence of geometry on the combination of inter-cell and intra-cell interferences as well as the existence of maximal power constraints of the base stations and users. We also study the load allowed by these schemes when the size of the network tends to infinity and the mean bit rate offered to elastic traffic users. By load, we mean here the number of voice users that each base station can serve.

Service discovery in agent-based pervasive computing environments

Abstract: Directory based service discovery mechanisms are unsuitable for ad-hoc m-commerce environments. Working towards finding an alternate mechanism, we developed Allia: a peer-to-peer caching based and policy-driven agent-service discovery framework that facilitates cross-platform service discovery in ad-hoc environments. Our approach achieves a high degree of flexibility in adapting itself to changes in ad-hoc environments and is devoid of common problems associated with structured compound formation in mobile commerce environments. Device capabilities and limitations, user preferences regarding device usage, application specifics with respect to mobile commerce are factors that our framework adapts to. We have described our initial implementation of Allia over ThinkPads and iPAQs by extending the LEAP Agent Platform and using Bluetooth as the underlying network protocol. In addition, we evaluated Allia's performance by running simulations of our protocol in Glomosim simulator. We also compared our framework against a structured compound-based architecture.

On-demand data broadcasting for mobile decision making

Abstract: The wide spread of mobile computing devices is transforming the newly emerged e-business world into a mobile e-business one, a world in which hand-held computers are the user's front-ends to access enterprise data. For good mobile decision making, users need to count on up-to-date, business-critical data. Such data are typically in the form of summarized information tailored to suit the user's analysis interests. In this paper, we are addressing the issue of time and energy efficient delivery of summary tables to mobile users with hand-held computers equipped with OLAP (On-Line Analytical Processing) front-end tools. Towards this, we propose a new on-demand scheduling algorithm, called STOBS, that exploits the derivation semantics among OLAP summary tables. It maximizes the aggregated data sharing between mobile users and reduces the broadcast length for satisfying a set of requests compared to the already existing techniques. The algorithm effectiveness with respect to access time and energy consumption is evaluated using simulation.

BlueStar: enabling efficient integration between bluetooth WPANs and IEEE 802.11 WLANs

Abstract: Bluetooth is a radio technology for Wireless Personal Area Networking (WPAN) operating in the 2.4 GHz ISM frequency band. So far, there has been little research on how Bluetooth-enabled devices can effectively and efficiently have uninterrupted access to wide area networks (WAN) such as the Internet. We introduce a novel architecture (BlueStar) whereby selected Bluetooth devices, called Bluetooth Wireless Gateways (BWGs), are also IEEE 802.11 enabled so that these BWGs could serve as egress/ingress points to/from the IEEE 802.11 wireless network. We propose mitigating interference between Bluetooth and IEEE 802.11, by employing a hybrid approach of adaptive frequency hopping (AFH) and Bluetooth carrier sense (BCS) of the channels. AFH labels channels as "bad" or "good", and Bluetooth devices only access those channels in the "good" state, whereas BCS is used to avoid collision by sensing the channel prior to any transmission. By combining AFH and BCS, we drastically minimize the effect of the worst-case interference scenario wherein both a Bluetooth and an IEEE 802.11 interface are co-located in a single device. BlueStar enables Bluetooth devices, belonging to either a piconet or a scatternet, to access the WAN through the BWG without the need for any fixed Bluetooth access points, while utilizing widely deployed base of IEEE 802.11 networks. Moreover, we define the protocol stack employed by BlueStar as well as indicate how BWGs efficiently manage their capacity allocation through the different systems. We also mathematically derive an upper bound on the number BWGs needed in a Bluetooth scatternet so that uninterrupted access to all Bluetooth devices could be provided.

Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

Abstract: The main contributions of this paper are two-fold. First, we present a simple, general framework for obtaining efficient constant-factor approximation algorithms for the mobile piercing set (MPS) problem on unit-disks for standard metrics in fixed dimension vector spaces. More specifically, we provide low constant approximations for L1 and L∞ norms on a d-dimensional space, for any fixed d > 0, and for the L2 norm on two- and three-dimensional spaces. Our framework provides a family of fully-distributed and decentralized algorithms, which adapt (asymptotically) optimally to the mobility of disks, at the expense of a low degradation on the best known approximation factors of the respective centralized algorithms: Our algorithms take O(1) time to update the piercing set maintained, per movement of a disk. We also present a family of fully-distributed algorithms for the MPS problem which either match or improve the best known approximation bounds of centralized algorithms for the respective norms and space dimensions.Second, we show how the proposed algorithms can be directly applied to provide theoretical performance analyses for two popular 1-hop clustering algorithms in ad-hoc networks: the lowest-id algorithm and the Least Cluster Change (LCC) algorithm. More specifically, we formally prove that the LCC algorithm adapts in constant time to the mobility of the network nodes, and minimizes (up to low constant factors) the number of 1-hop clusters maintained. While there is a vast literature on simulation results for the LCC and the lowest-id algorithms, these had not been formally analyzed prior to this work.We also present an O(log n)-approximation algorithm for the mobile piercing set problem for nonuniform disks (i.e., disks that may have different radii), with constant update time.

Dynamic adaptive routing for a heterogeneous wireless network

Abstract: This paper presents an integrated architecture of a Heterogeneous Wireless Network (HWN) and a dynamic adaptive routing protocol (DARP) for a HWN. To allow mobile users versatile communication with anyone or any device at any place and anytime, HWN integrates cellular network with an ad hoc network (independent Basic Service Set) in wireless local area network (WLAN) and reserves advantages of sizable coverage in a cellular network and high data rate in deployable ad hoc network. It also enlarges the scope of communication for ad hoc network and improves the throughput for cellular network. Consequently, nodes in HWN can communicate with each other or access Internet ubiquitously. We also address the routing issues for HWN, because the routing protocol for HWN is different from those used in cellular network or ad hoc network. The dynamic adaptive routing protocol establishes a better path for the source to arrive at the destination across multiple hops or cellular network and provides appropriate QoS (quality of service) in HWN.Through simulation, we will demonstrate the merit of the HWN, proposed routing performance on HWN and overhead of control traffic. A performance analysis of the proposed protocol is depicted. The results of the analysis, and simulations, are presented and discussed.

Transaction-Centric Reconciliation in Disconnected Client–Server Databases

Abstract: As mobile computing devices become more and more common, mobile databases are becoming popular. An important feature of these database systems is their ability to allow optimistic replication of data by providing disconnected mobile devices the ability to perform local updates. The key problem to this approach is the reconciliation problem, i.e. the problem of serializing potentially conflicting updates from disconnected clients on all replicas of the database. Reconciliation of conflicting updates is especially critical for disconnected databases where disconnected updates are allowed. We examine some choices for providing solutions to the reconciliation problem. We then present an algorithm that combines multiversion concurrency control schemes on a server with reconciliation of updates from disconnected clients. We also describe a simple but illustrative sample application. Finally we present our conclusions.

Capacity assignment in Bluetooth scatternets: optimal and heuristic algorithms

Abstract: Bluetooth enables portable electronic devices to communicate wirelessly via short-range ad-hoc networks. Initially Bluetooth will be used as a replacement for point-to-(multi)point cables. However, in due course, there will be a need for forming multihop ad-hoc networks over Bluetooth, referred to as scatternets. This paper investigates the capacity assignment problem in Bluetooth scatternets. The problem arises primarily from the special characteristics of the network and its solution requires new protocols. We formulate it as a problem of minimizing a convex function over a convex set contained in the matching polytope. We develop an optimal algorithm which is similar to the well-known flow deviation algorithm and that calls for solving a maximum-weight matching problem at each iteration. A centralized heuristic algorithm with a relatively low complexity is also developed. Then, since in an ad-hoc network there is no central authority that is responsible for network optimization, a distributed heuristic algorithm is proposed. Finally, numerical results are presented and it is shown that the heuristic algorithms usually converge to results that are relatively close to the optimal results.

Performance evaluation of layer 3 low latency handoff mechanisms

Abstract: This paper investigates the performance of two Layer 3 low latency handoff mechanisms proposed by the IETF, namely Pre- and Post-Registration. These protocols use Layer 2 triggers to reduce the built-in delay components of Mobile IP. We propose a simple analytical model that allows assessing the packet loss and the delay characteristics of these mechanisms. We describe several handoff implementations over a wireless access based on the IEEE 802.11 standard and analyze several implementation issues. Finally we study the scalability of the protocols using an OPNET simulation.

A fair and traffic dependent scheduling algorithm for Bluetooth scatternets

Abstract: The Bluetooth specification defines the notion of interconnected piconets, called scatternets, but does not define the actual mechanisms and algorithms necessary to set up and maintain them. The operation of a scatternet requires some Bluetooth units to be interpiconet units (gateways), which need to time-division multiplex their presence among their piconets. This requires a scatternet-scheduling algorithm that can schedule the presence of these units in an efficient manner. In this paper, we propose a distributed scatternet-scheduling scheme that is implemented using the HOLD mode of Bluetooth and adapts to non-uniform and changing traffic. Another attribute of the scheme is that it results in fair allocation of bandwidth to each Bluetooth unit. This scheme provides an integrated solution for both intra-and inter-piconet scheduling, i.e., for polling of slaves and scheduling of gateways.