Showing papers in "IEEE Transactions on Mobile Computing in 2003"
TL;DR: In this paper, the authors presented a detailed analytical study of the spatial node distribution generated by random waypoint mobility and derived an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area.
Abstract: The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks It is known that the spatial distribution of network nodes moving according to this model is, in general, nonuniform However, a closed-form expression of this distribution and an in-depth investigation is still missing This fact impairs the accuracy of the current simulation methodology of ad hoc networks and makes it impossible to relate simulation-based performance results to corresponding analytical results To overcome these problems, we present a detailed analytical study of the spatial node distribution generated by random waypoint mobility More specifically, we consider a generalization of the model in which the pause time of the mobile nodes is chosen arbitrarily in each waypoint and a fraction of nodes may remain static for the entire simulation time We show that the structure of the resulting distribution is the weighted sum of three independent components: the static, pause, and mobility component This division enables us to understand how the model's parameters influence the distribution We derive an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area The good quality of this approximation is validated through simulations using various settings of the mobility parameters In summary, this article gives a fundamental understanding of the behavior of the random waypoint model
1,122 citations
TL;DR: This paper focuses on the multihop performance of a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers, and an idealized scheme (in which the best relay node is always chosen) is discussed.
Abstract: In this paper, we propose a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We focus on the multihop performance of such a solution, in terms of the average number of hops to reach a destination as a function of the distance and of the average number of available neighbors. An idealized scheme (in which the best relay node is always chosen) is discussed and its performance is evaluated by means of both simulation and analytical techniques. A practical scheme to select one of the best relays is shown to achieve performance very close to that of the ideal case. Some discussion about design issues for practical implementation is also given.
964 citations
TL;DR: This work proposes a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services.
Abstract: In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.
877 citations
TL;DR: A novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers and a semi-Markov model is developed which provides a more accurate performance evaluation.
Abstract: In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its energy and latency performance. A simplified analysis is given first, some relevant trade offs are highlighted, and parameter optimization is pursued. Further, a semi-Markov model is developed which provides a more accurate performance evaluation. Simulation results supporting the validity of our analytical approach are also provided.
618 citations
TL;DR: The critical transmitting range for connectivity in wireless ad hoc networks is analyzed and insight into how mobility affects connectivity is yielded and useful trade offs between communication capability and energy consumption are revealed.
Abstract: We analyze the critical transmitting range for connectivity in wireless ad hoc networks. More specifically, we consider the following problem: assume n nodes, each capable of communicating with nodes within a radius of r, are randomly and uniformly distributed in a d-dimensional region with a side of length l; how large must the transmitting range r be to ensure that the resulting network is connected with high probability? First, we consider this problem for stationary networks, and we provide tight upper and lower bounds on the critical transmitting range for one-dimensional networks and nontight bounds for two and three-dimensional networks. Due to the presence of the geometric parameter l in the model, our results can be applied to dense as well as sparse ad hoc networks, contrary to existing theoretical results that apply only to dense networks. We also investigate several related questions through extensive simulations. First, we evaluate the relationship between the critical transmitting range and the minimum transmitting range that ensures formation of a connected component containing a large fraction (e.g., 90 percent) of the nodes. Then, we consider the mobile version of the problem, in which nodes are allowed to move during a time interval and the value of r ensuring connectedness for a given fraction of the interval must be determined. These results yield insight into how mobility affects connectivity and they also reveal useful trade offs between communication capability and energy consumption.
452 citations
TL;DR: This paper proposes a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions, and describes new route selection mechanisms for MANET routing protocols, which are called the minimum drains rate (MDR) and the conditional minimum drain rate (CMDR).
Abstract: Untethered nodes in mobile ad hoc networks strongly depend on the efficient use of their batteries. In this paper, we propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity to determine which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing protocols, which we call the minimum drain rate (MDR) and the conditional minimum drain rate (CMDR). MDR extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission energy consumed per packet. Using the ns-2 simulator and the dynamic source routing (DSR) protocol, we compare MDR and CMDR against prior proposals for energy-aware routing and show that using the drain rate for energy-aware route selection offers superior performance results. Methods keywords are system design and simulations.
256 citations
TL;DR: This paper proves its NP-completeness and proposes two heuristics: power assignment based on minimum spanning tree (denoted by MST) and incremental power and indicates that the incremental power heuristic is always better than MST.
Abstract: Wireless sensor networks have recently attracted lots of research effort due to the wide range of applications. These networks must operate for months or years. However, the sensors are powered by battery, which may not be able to be recharged after they are deployed. Thus, energy-aware network management is extremely important. In this paper, we study the following problem: Given a set of sensors in the plane, assign transmit power to each sensor such that the induced topology containing only bidirectional links is strongly connected. This problem is significant in both theory and application. We prove its NP-completeness and propose two heuristics: power assignment based on minimum spanning tree (denoted by MST) and incremental power. We also show that the MST heuristic has a performance ratio of 2. Simulation study indicates that the performance of these two heuristics does not differ very much, but; on average, the incremental power heuristic is always better than MST.
177 citations
TL;DR: An analytical model for integrated real-time and non-real-time services in a wireless mobile network with priority reservation and preemptive priority handoff schemes and it is observed that the simulation results closely match the analytical model.
Abstract: We propose an analytical model for integrated real-time and non-real-time services in a wireless mobile network with priority reservation and preemptive priority handoff schemes. We categorize the service calls into four different types, namely, real-time and non-real-time service originating calls, and real-time and non real-time handoff service request calls. Accordingly, the channels in each cell are divided into three parts: one is for real-time service calls only, the second is for non-real-time service calls only, and the last one is for overflow of handoff requests that cannot be served in the first two parts. In the third group, several channels are reserved exclusively for real-time service handoffs so that higher priority can be given to them. In addition, a realtime service handoff request has the right to preempt non-real-time service in the preemptive priority handoff scheme if no free channels are available, while the interrupted non-real-time service call returns to its handoff request queue. The system is modeled using a multidimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced termination probability, and average transmission delay. This scheme is also simulated under different call holding time and cell dwell time distributions. It is observed that the simulation results closely match the analytical model. Our scheme significantly reduces the forced termination probability of real-time service calls. The probability of packet loss of non-real-time transmission is shown to be negligibly small, as a non-real-time service handoff request in waiting can be transferred from the queue of the current base station to another one.
152 citations
TL;DR: This paper presents a formal model to predict the lifetime of a routing path based on the random walk model, derived based on a probabilistic model, to provide further insight into issues such as route selection, route maintenance, and network scalability related to MANETs.
Abstract: One wireless network architecture that has received a lot of attention recently is the mobile ad hoc network (MANET). It is attractive because the network can be quickly deployed without the infrastructure of base stations. One main feature of MANET is that mobile hosts may communicate with each other through a sequence of wireless links (i.e., in a multihop manner). While many routing protocols have been proposed for MANET by considering criteria such as length, quality, bandwidth, and signal strength [S. Agarwal et al., 2000], [D.B. Johnson et al., 2000], [R. Dube et al., Feb. 1997], [Z. Haas and M. Pearlman, 2000], [M. Jiang et al., 1998], [C. Perkins and P. Bhagwat, Sept. 1994], the issue of route lifetime has not been addressed formally. This paper presents a formal model to predict the lifetime of a routing path based on the random walk model. Route lifetime is derived based on a probabilistic model. Through such investigation, we hope to provide further insight into issues such as route selection, route maintenance, and network scalability related to MANETs.
121 citations
TL;DR: In this paper, the authors proposed a novel PDA synchronization scheme (CPIsync) based on previous information-theoretic research, which is essentially independent of the overall number of records.
Abstract: Modern personal digital assistant (PDA) architectures often utilize a wholesale data transfer protocol known as "slow sync" for synchronizing PDAs with personal computers (PCs). This approach is markedly inefficient with respect to bandwidth usage, latency, and energy consumption since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync) predicated upon previous information-theoretic research. The salient property of this scheme is that its communication complexity depends on the number of differences between the PDA and PC, and is essentially independent of the overall number of records. Moreover, our implementation shows that the computational complexity and energy consumption of CPIsync is practical and that the-overall latency is typically much smaller than that of slow sync or alternative synchronization approaches based on Bloom (1970) filters. Thus, CPIsync has potential for significantly improving synchronization protocols for PDAs and, more generally, for heterogeneous networks of many machines.
82 citations
TL;DR: A new model for Smart Dust networks communicating through optical links is presented and its applicability when the goal of the network is monitoring an area under the surveillance of a base station is shown.
Abstract: The main contribution of this paper is presenting a new model for Smart Dust networks communicating through optical links and showing its applicability when the goal of the network is monitoring an area under the surveillance of a base station. We analyze the basic parameters of these networks as a new model of random graphs and propose simple distributed protocols for basic communication. These protocols are designed to minimize the energy consumption.
TL;DR: Both theoretical analysis and simulations indicate that the proposed clustering algorithm takes much less time and overhead to cluster a given network with more stable cluster structure, while incurring very small maintenance overhead in a dynamic network resulting from the mobility of the MS.
Abstract: An ad hoc network is a self-organized and distributed entity consisting of a number of mobile stations (MS) without the coordination of any centralized access point. Clustering is one of the fundamental problems in ad hoc networks. In this context, we describe a distributed clustering algorithm for multihop ad hoc networks. We first propose a randomized control channel broadcast access method to maximize the worst-case control channel efficiency, based on which a distributed clustering algorithm is proposed. Both theoretical analysis and simulations indicate that the proposed clustering algorithm takes much less time and overhead to cluster a given network with more stable cluster structure, while incurring very small maintenance overhead in a dynamic network resulting from the mobility of the MS.
TL;DR: Experimental results show that this cell grouping algorithm reduces the number of location updates by 27 percent to 36 percent on average compared to proximity-based cell grouping schemes.
Abstract: A new scheme is developed for optimal location area design in wireless systems New algorithms based on intercell traffic prediction and traffic-based cell grouping are used to select the optimal set of cells for location areas (LAs) The expected intercell movement patterns of mobiles are determined by using the new intercell traffic prediction algorithm Further, the cells are partitioned into LAs by applying the new traffic-based cell grouping algorithm where the cell pairs with higher intercell mobile traffic are grouped into the same LA Hence, the inter-LA mobile traffic is decreased by increasing the intra-LA mobile traffic Experimental results show that this cell grouping algorithm reduces the number of location updates by 27 percent to 36 percent on average compared to proximity-based cell grouping schemes
TL;DR: Numerical results show that the proposed RRM scheme can achieve both effective QoS guarantee and efficient resource utilization, and theoretical analysis of the grade of service performance is given.
Abstract: A novel radio resource management (RRM) scheme for the support of packet-switched transmission in cellular CDMA systems is proposed by jointly considering the physical, link, and network layer characteristics. The proposed resource management scheme is comprised of a combination of power distribution, rate allocation, service scheduling, and connection admission control. Power distribution allows individual connections to achieve their required signal-to-interference-plus-noise ratio, while rate allocation guarantees the required delay/jitter for real-time traffic and the minimum transmission rate requirement for non-real-time traffic. Efficient rate allocation is achieved by making use of the randomness and burstiness; of the packet generation process. At the link layer, a packet scheduling scheme is developed based on information derived from power distribution and rate allocation to achieve quality of service (QoS) guarantee. Packet scheduling efficiently utilizes the system resources in every time slot and improves the packet throughput for non-real-time traffic. At the network layer, a connection admission control (CAC) scheme based on the lower layer resource allocation information is proposed. The CAC scheme makes use of user mobility information to reduce handoff connection dropping probability (HCDP). Theoretical analysis of the grade of service performance, in terms of new connection blocking probability, HCDP, and resource utilization, is given. Numerical results show that the proposed RRM scheme can achieve both effective QoS guarantee and efficient resource utilization.
TL;DR: This paper focuses on techniques for the fast evaluation of the PEEC circuit element for both the frequency and time domain where possible since both are important for the solution of specific problems.
Abstract: A key use of the partial element equivalent circuit (PEEC) method is the solution of combined electromagnetic and circuit problems as they occur in many situations such as today's integrated circuit (VLSI) systems and as components in mobile devices. The method, which has been applied to a multitude of electrical interconnect and package problems, is very flexible since it is easy to add new features to the approach. However, faster solutions are of interest since the problems to be solved are continuously increasing size. A class of fast methods is evolving based on the faster evaluation of the matrix elements and the use of iterative or other matrix solvers of the resultant system for the frequency domain. Fast circuit matrix solvers are easier to obtain in the time domain than the frequency domain since the delay or retardation can be utilized to sparsify the circuit matrix. In this paper, we concentrate on techniques for the fast evaluation of the PEEC circuit element for both the frequency and time domain where possible since both are important for the solution of specific problems.
TL;DR: This paper presents the modeling, simulation, and characterization of the PDN in a high-speed printed circuit board (PCB) designed for chip-to-chip communication at a data rate of 3.2 Gbps.
Abstract: As the operating frequency of digital systems increases and voltage swing decreases, it becomes very important to characterize and analyze power distribution networks (PDNs) accurately. This paper presents the modeling, simulation, and characterization of the PDN in a high-speed printed circuit board (PCB) designed for chip-to-chip communication at a data rate of 3.2 Gbps. The test board consists of transmitter and receiver chips wirebonded onto plastic ball grid array (PGBA) packages on a PCB. In this paper, a hybrid method has been applied for analysis, which consists of the transmission matrix method (TMM) in the frequency domain and macromodeling method in the time domain. As an initial step, power/ground planes have been modeled using TMM. Then, the macromodel of the power/ground planes has been generated at the desired ports using macromodeling. Finally, the macromodel of the planes, transmission lines, and nonlinear drivers have been simulated in standard SPICE-based circuit simulators for computing power supply noise. In addition to noise computation, the self and transfer impedances of power/ground planes have been computed and the effect of decoupling capacitors on power supply noise has been analyzed. The methods discussed have been validated using hardware measurements.
TL;DR: An agent-based service provisioning system for mobile users that allows users moving outside the office to maintain an off ice-like environment at home, or at temporary locations such as a meeting at another company, a business trip, or a hotel.
Abstract: This paper proposes an agent-based service provisioning system for mobile users. It describes a set of cooperative agents distributed over different sites that work together to provide personalized services for mobile users over the Internet. Users moving outside the office are able to maintain an off ice-like environment at home, or at temporary locations such as a meeting at another company, a business trip, or a hotel. Agents representing the end-users and the system agents engage in a negotiation process to facilitate access to personalized services at other sites. This access is obtained in accordance with the users' home policies as well as those at their current location. An Adaptive Service Presentation agent is used to adapt the service presentation to the capabilities of the users' workstations, laptops, phones, PDAs, or other devices. This work is conducted in Canada as part of the Mobile Agent Alliance project involving the University of Ottawa, the National Research Council, and the Mitel Corporation.
TL;DR: This paper quantitatively analyze a hybrid replication with forwarding scheme that can be uniformly applied to all users and shows that the proposed hybrid scheme outperforms both pure replication and forwarding schemes, as well as the CMR threshold-based scheme under all CMR values.
Abstract: A location management scheme in wireless networks must effectively handle both user location update and search operations. Replication and forwarding are two well-known techniques to reduce user search and update costs, respectively, with replication being most effective when the call to mobility ratio (CMR) of the user is high, while forwarding is most effective when the CMR value is low. Thus, based on the user's CMR, the system can adopt a CMR threshold-based scheme such that if the user's CMR is lower than a threshold, then the system applies the forwarding scheme; otherwise, it applies the replication scheme. Applying different location management schemes based on per-user CMR values introduces undesirable high complexity in managing and maintaining location- related information stored in the system as different system support mechanisms must be applied to different users. In this paper, we quantitatively analyze a hybrid replication with forwarding scheme that can be uniformly applied to all users. The most striking feature of the hybrid scheme is that it can determine and apply the optimal number of replicas and forwarding chain length on a per-user basis to minimize the communication cost due to location management operations while still being able to use the same data structure and algorithm to execute location management operations in a uniform way for all users. We develop a stochastic Petri net model to help gather this information and show how the information obtained statically can be used efficiently by the system at runtime to determine the optimal number of replicas and forwarding chain length when given a use user's profile. We show that the proposed hybrid scheme outperforms both pure replication and forwarding schemes, as well as the CMR threshold-based scheme under all CMR values.
TL;DR: The proposed methodology is suitable for a parametric analysis on the electrical performance of the via hole discontinuities and it gives useful results for the extraction of accurate computer-aided design models.
Abstract: A method for de-embedding the scattering parameters matrix for single-end or differential through, buried, and blind via holes in multilayer printed circuit boards for high-speed digital applications is presented. The proposed technique starts from a measurement or simulation of the structure containing the discontinuity and, after the structure's partitioning, extracts the scattering parameters of the required discontinuity. The procedure is applied to different kinds of single-ended and differential via holes and is validated by measurements. The finite integration technique is used to perform the needed three-dimensional electromagnetic simulations. Due to its reduced CPU time, the proposed methodology is suitable for a parametric analysis on the electrical performance of the via hole discontinuities and it gives useful results for the extraction of accurate computer-aided design models.
TL;DR: The results show that the proposed approach can effectively resolve the fault-tolerant problem of Mobile IP in wireless systems.
Abstract: This paper presents the fault tolerance of Mobile IP in wireless systems. Mobile IP can support wireless users with continuous network connections while changing locations. It is achieved by allocating a number of mobility agents (foreign agents and home agents) in the architecture of a wireless system. If a failure occurs in a mobility agent, the wireless users located in the coverage area of the faulty mobility agent will lose their network connections. To tolerate the failures of mobility agents, this paper proposes an efficient approach to maintaining the network connections of wireless users without being affected by the failures. Once detecting a failure in a mobility agent, failure-free mobility agents are dynamically selected to be organized as a backup set to take over the faulty mobility agent. Compared to the previous approaches, the proposed approach does not take any actions against failures during the failure-free period. Besides, the hardware redundancy technique is also not used in the proposed approach. The overhead of the proposed approach is analyzed using the M/G/c/c queuing model. The results show that the proposed approach can effectively resolve the fault-tolerant problem of Mobile IP in wireless systems.
TL;DR: 3-bit reference counting can eliminate the need to invoke the garbage collector in all tested applications and reduces the amount of memory usage by 77 percent, and the hardware cost of the proposed design is very modest.
Abstract: Java possesses many advantages for embedded system development, including fast product deployment, portability, security, and a small memory footprint. As Java makes inroads into the market for embedded systems, much effort is being invested in designing real-time garbage collectors. The proposed garbage-collected memory module, a bitmap-based processor with standard DRAM cells is introduced to improve the performance and predictability of dynamic memory management functions that include allocation, reference counting, and garbage collection. As a result, memory allocation can be done in constant time and sweeping can be performed in parallel by multiple modules. Thus, constant time sweeping is also achieved regardless of heap size. This is a major departure from the software counterparts where sweeping time depends largely on the size of the heap. In addition, the proposed design also supports limited-field reference counting, which has the advantage of distributing the processing cost throughout the execution. However, this cost can be quite large and results in higher power consumption due to frequent memory accesses and the complexity of the main processor. By doing reference counting operation in a coprocessor, the processing is done outside of the main processor. Moreover, the hardware cost of the proposed design is very modest (about 8000 gates). Our study has shown that 3-bit reference counting can eliminate the need to invoke the garbage collector in all tested applications. Moreover, it also reduces the amount of memory usage by 77 percent.
TL;DR: An architecture model for multiagent systems that was developed in the European project LEAP (Lightweight Extensible Agent Platform) is described, whose main feature is a set of generic services that are implemented independently of the agents and can be installed into the agents by the application developer in a flexible way.
Abstract: This paper describes an architecture model for multiagent systems that was developed in the European project LEAP (Lightweight Extensible Agent Platform). Its main feature is a set of generic services that are implemented independently of the agents and can be installed into the agents by the application developer in a flexible way. Moreover, two applications using this architecture model are described that were also developed within the LEAP project. The application domain is the support of mobile, virtual teams for the German automobile club ADAC and for British Telecommunications.
TL;DR: It is shown that combining the full-wave time domain PEEC method with the three-dimensional (3D) fast multipole method allows performing the analysis of electrically large electronic systems, which reduces both memory and CPU-time requirements.
Abstract: High-speed electronic circuits are becoming more and more important in modern communication systems, thus leading to an increasing interest in printed circuit boards, interconnect, and packaging. Nowadays, full-wave numerical methods are widely used in order to investigate both signal integrity and electromagnetic compatibility issues arising in PCBs design. When broadband information is desired and transient effects dominate, it is more efficient using time domain numerical techniques, which may scale better than corresponding frequency-domain methods. This paper presents the derivation of the time domain partial element equivalent circuit (PEEC) method enhanced by the three-dimensional (3D) fast multipole method (FMM). It is shown that combining the full-wave time domain PEEC method with the FMM allows performing the analysis of electrically large electronic systems, which reduces both memory and CPU-time requirements. Several examples are presented confirming the capability of the proposed approach to provide a significant reduction of the computational complexity associated with the transient analysis of large systems.
TL;DR: This paper proposes a protocol for "recovering" a user to an appropriate recent interaction state after such a failure, and describes the user interaction with one or more Web sites using intuitive and familiar concepts from database transactions.
Abstract: With the expansion of Web sites to include business functions, a user interfaces with e-businesses through an interactive and multistep process, which is often time-consuming. For mobile users accessing the Web over digital cellular networks, the failure of the wireless link, a frequent occurrence, can result in the loss of work accomplished prior to the disruption. This work must then be repeated upon subsequent reconnection - often at significant cost in time and computation. This "disconnection-reconnection-repeat work" cycle may cause mobile clients to incur substantial monetary as well as resource (such as battery power) costs. In this paper, we propose a protocol for "recovering" a user to an appropriate recent interaction state after such a failure. The objective is to minimize the amount of work that needs to be redone upon restart after failure. Whereas classical database recovery focuses on recovering the system, i.e., all transactions, our work considers the problem of recovering a particular user interaction with the system. This recovery problem encompasses several interesting subproblems: (1) modeling user interaction in a way that is useful for recovery, (2) characterizing a user's "recovery state", (3) determining the state to which a user should be recovered, and (4) defining a recovery mechanism. We describe the user interaction with one or more Web sites using intuitive and familiar concepts from database transactions. We call this interaction an Internet transaction (iTX), distinguish this notion from extant transaction models, and develop a model for it, as well as for a user's state on a Web site. Based on the twin foundations of our iTX and state models, we finally describe an effective protocol for recovering users to valid states in Internet interactions.
TL;DR: The result of this modeling is an enhanced availability analysis, which takes into account not only the bare estimation of unavailability periods, but also the important congestion phenomenon following outages that contribute to service degradation for a certain period of time after operations resume.
Abstract: The General Packet Radio Service (GPRS) extends the Global System Mobile Communication (GSM) by introducing a packet-switched transmission service. This paper analyzes the GPRS behavior under critical conditions. In particular, we focus on outages, which significantly impact the GPRS dependability. In fact, during outage periods, the cumulative number of users trying to access the service grows proportionally over time. When the system resumes its operations, the overload caused by accumulated users determines a higher probability of collisions on resources assignment and, therefore, a degradation of the overall QoS. This paper adopts a stochastic activity network modeling approach for evaluating the dependability of a GPRS network under outage conditions. The major contribution of this study lies in the novel perspective the dependability study is framed in. Starting from a quite classical availability analysis, the network dependability figures are incorporated into a very detailed service model that is used to analyze the overload effect GPRS has to face after outages, gaining deep insights on its impact on user's perceived QoS. The result of this modeling is an enhanced availability analysis, which takes into account not only the bare estimation of unavailability periods, but also the important congestion phenomenon following outages that contribute to service degradation for a certain period of time after operations resume.
TL;DR: It is shown that WAP performs better in a bursty error environment than in a random error environment, and the goodput of WAP can be improved by increasing the WAP packet group size, but the significance of the improvement depends on the underlying channel condition.
Abstract: In this paper, an analytical model for studying the performance behavior of wireless application protocol (WAP) over wireless links is proposed. A Rayleigh fading channel model is used to characterize the behavior of the wireless channel. Mathematical expressions that represent the performance of WAP as a function of the protocol and the channel parameters are derived. Computer simulation results are presented to validate the analytical results. It is shown that WAP performs better in a bursty error environment than in a random error environment. The goodput of WAP can be improved by increasing the WAP packet group size, but the significance of the improvement depends on the underlying channel condition.
TL;DR: It is shown by the experimental study that the proposed adaptive information dissemination mechanism associated with the online loan-based feedback control is able to achieve a substantial reduction of message traffic for dynamic dissemination in wireless networks.
Abstract: The dissemination of numerous information broadcast services, gives rise to the scalability issue in wireless networks. Previous researchers have shown that the push-based data broadcast mechanism is efficient in reducing message traffic. However, most research efforts are dedicated to the dissemination of static information contents. In practice, information broadcast services can produce and deliver dynamic information contents. To efficiently convey the dynamic data, we device, in this paper, an adaptive information dissemination mechanism by exploiting the functionality of data broadcasting, to support the dissemination of static and dynamic information services simultaneously. In our design, both static and dynamic information services are subsumed as service groups, i.e. the building blocks with the uniform representation of structure and group popularity and, thus, the conventional scenario becomes a special case of our framework. Furthermore, in order to tolerate the broadcast traffic dynamics, we design an online load-based slot allocation and feedback control technique to deal with the adaptation of the service group classification, bandwidth allocation, and broadcast schedule so as to avoid performance degradation. It is shown by the experimental study that the proposed adaptive information dissemination mechanism associated with the online loan-based feedback control is able to achieve a substantial reduction of message traffic for dynamic dissemination in wireless networks.
TL;DR: In this paper, a methodology is proposed to automatically derive, starting from a design model of a mobility-based adaptive software architecture, a Markov model whose solution provides insights about the most effective adaptation strategy based on code mobility in a given execution environment.
Abstract: Adaptable software architectures (SA) have been suggested as a viable solution for the design of distributed applications that operate in a mobile computing environment to cope with the high heterogeneity and variability of this environment. Mobile code techniques can be used to implement this kind of SA since they allow us to dynamically modify the load of the hosting nodes and the internode traffic to adapt to the resources available in the nodes and to the condition of the (often wireless) network link. However, moving code among nodes has a cost (e.g., in terms of network traffic and consumed energy for mobile nodes), so designing an adaptable SA based on mobile code techniques requires a careful analysis to determine its effectiveness from the early design stages. In this respect, our main contribution consists of a methodology, called ASAP (adaptable software architectures performance), to automatically derive, starting from a design model of a mobility-based SA, a Markov model whose solution provides insights about the most effective adaptation strategy based on code mobility in a given execution environment. We assume that the SA model is expressed using the Unified Modeling Language (UML) because of its widespread use in software design, also suggesting some extension to this formalism to better express the "mobility structure" of the application, i.e., which are the mobile components, and the possible targets of their movement.
TL;DR: This paper analyzes the beneficial effects that a thin dielectric material between a pair of power and ground layers (embedded capacitance) has both in reducing power bus resonance amplitudes and radiated emissions as well as signal integrity and electromagnetic compatibility.
Abstract: The continuous technology trend in the telecommunication market toward higher operating frequencies and high processing performances will give rise to new sophisticated chip sets, processors, and RF transceivers which will demand new feature to the PCB designs. As the complexity of the integrated circuits increases, signal integrity (SI) and electromagnetic compatibility (EMC) become key elements in the board design process. This paper analyzes the beneficial effects that a thin dielectric material between a pair of power and ground layers (embedded capacitance) has both in reducing power bus resonance amplitudes (SI approach) and radiated emissions (EMC approach) as well. Scattering parameter measurements carried out on the power bus of two production boards are presented and correlated with the electric field strength measurements conducted on the same boards in a semianechoic chamber.