Wireless sensor networks (WSNs) are made up of sensor nodes that can only be equipped with limited energy resources, but can still be used over an extensive set of diverse applications. The traffic inherent to WSNs is...
详细信息
Wireless sensor networks (WSNs) are made up of sensor nodes that can only be equipped with limited energy resources, but can still be used over an extensive set of diverse applications. The traffic inherent to WSNs is however, variable and highly correlated. We analyze the energy-efficiency with the varying traffic in such networks. We expect sensor nodes to save more energy by using an adaptive scheme for varying traffic conditions giving robustness to different application scenarios. A random timing scheme for optimizing the radio on/off time-interval by adapting to traffic loads is discussed. The discussion in this paper aims to produce a reliable energy-aware sensing network, in spite of node failures, minimizing energy consumption at the same time.
scalability concerns of QoS implementations have stipulated service architectures where QoS is not provisioned separately to each flow, but instead to aggregates of flows. This paper determines stochastic bounds for t...
详细信息
scalability concerns of QoS implementations have stipulated service architectures where QoS is not provisioned separately to each flow, but instead to aggregates of flows. This paper determines stochastic bounds for the service experienced by a single flow when resources are managed for aggregates of flows and when the scheduling algorithms used in the network are not known. Using a recently developed statistical network calculus, per-flow bounds can be calculated for backlog, delay, and the burstiness of output traffic.
The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network parameters (capacity, buffer size, topology, s...
详细信息
The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network parameters (capacity, buffer size, topology, scheduling) and of the characteristics of each TCP (RTT, route etc.) and UDP flow. This work is based on the description via some fluid evolution equations, of the joint evolution of the window sizes of all flows over a single bottleneck router/link, as function of the synchronization rate. It is shown that the generalization of this fluid dynamics to a network composed of several routers can be described via equations allowing one to simulate the interaction of e.g. millions of TCP flows on networks composed of tens of thousands of links and routers on a standard workstation. The main output of the simulator are the mean value and the fluctuations of the throughput obtained by each flow, the localization of the bottleneck routers/links, the losses on each of them and the time evolution of aggregated input traffic at each router or link. The method is validated against NS simulations. We show that several important statistical properties of TCP traffic which were identified on traces are also present on traffic generated by our simulator: for instance, aggregated traffic generated by this representation exhibits the same short time scale statistical properties as those observed on real traces. Similarly, the experimental laws describing the fairness of the bandwidth sharing operated by TCP over a large network are also observed on the simulations.
In this paper we propose a scalable differentiated service model paradigm to provide fine QoS granularity in Internet via the framework of a distributed admission control scheme referred to as explicit endpoint admiss...
详细信息
In this paper we propose a scalable differentiated service model paradigm to provide fine QoS granularity in Internet via the framework of a distributed admission control scheme referred to as explicit endpoint admission control (EEAC). Specifically, in the proposed EEAC scheme the end host sends out probing packet to the network and makes admission decision according to the probing results that are explicitly provided at each router along the path. By introducing the concept of service vector, the proposed service model paradigm allows users to choose different services at different nodes along the path from the source to the destination to achieve fine QoS granularity and architectural scalability. Models for both users and network service providers to maximize their benefits are also discussed in this paper. The corresponding simulation results demonstrate that the new service model paradigm and EEAC scheme can result in lower request drop ratio, satisfactory end-to-end performance, and lower cost for each user.
We propose an admission control scheme for guaranteeing the mobile QoS in mobile ipnetworks. The proposed scheme considers the tunnel reservation for keeping handoff dropping probability below predefined values. It r...
详细信息
We propose an admission control scheme for guaranteeing the mobile QoS in mobile ipnetworks. The proposed scheme considers the tunnel reservation for keeping handoff dropping probability below predefined values. It reserves resources dynamically by estimating the number of mobile users and mobility features in each mobility agent. We propose mobility entities that depict mobility features and the history which has statistical mobility information in each mobility agent. We describe the requirements for macro mobility considerations and prove that our scheme satisfies them. With the mobility entities and the history, our scheme makes a history tuple to predict a mobility feature of the next time. It can be applied to a real world, because it reflects mobility features of each mobility agent to measure and analysis mobility entities. It provides an adaptive reservation scheme which allocates additional resources depending on a measured handoff dropping probability even if a handoff probability is changed unexpectedly.
Optimization of handover boundaries has been suggested to cope with non-homogeneous traffic distribution in GSM/GPRS networks. In this paper, an automatic optimization algorithm is proposed, which is able to maximize ...
详细信息
Optimization of handover boundaries has been suggested to cope with non-homogeneous traffic distribution in GSM/GPRS networks. In this paper, an automatic optimization algorithm is proposed, which is able to maximize the overall traffic carried in the network by equalizing long-term blocking effects. Field trial results indicate that system capacity can be significantly improved with respect to homogeneous handover parameter settings.
Faster computational power and higher network bandwidth facilitates Internet applications to improve the way we live, work and play. For video streaming applications, it is a challenge to provide the scalability while...
详细信息
Faster computational power and higher network bandwidth facilitates Internet applications to improve the way we live, work and play. For video streaming applications, it is a challenge to provide the scalability while maintaining the central manageability and the robustness. In this paper, we propose the centralized peer-to-peer streaming protocol (P2PSP), which features the centralized management, guaranteed perceived quality of service (PQoS), while decentralized the traffic loads. To evaluate the protocol, a layered video coding technique based on 3D discrete cosine transform (DCT) is designed. This codec applies self-organizing tree map (SOTM) to generate cascaded vector quantization codebooks. We demonstrate the effectiveness of the centralized P2PSP by comparing the video streaming simulations under the proposed architecture and the client/server architecture.
Peer-to-peer networks have gained much attention due to their attractive features of self-organization, scalability and decentralized control. The key challenge in these networks is how to efficiently locate and retri...
详细信息
Peer-to-peer networks have gained much attention due to their attractive features of self-organization, scalability and decentralized control. The key challenge in these networks is how to efficiently locate and retrieve the correct data. In this paper, we propose propagation and routing algorithms for a fully decentralized, self-organizing network. Our goal is to maximize the probability of finding the data, minimize peer access latencies and balance the workload among many peers. Central to our approach is the Kundali data structure that represents the set of data maintained by the peers and drives the smart routing of the search requests (queries). We have implemented our algorithms in the context of a fully decentralized Internet caching service in our internal network. Our mechanism is inexpensive, highly scalable, and resilient to node failures and with low administration cost. Experimental results validate or algorithms and show that they have good performance results.
This paper discusses the role of ad hoc networking in future wireless communications. Ad hoc networks are classified as isolated ad hoc networks with large and small sizes, integrated ad hoc networks in various scenar...
详细信息
This paper discusses the role of ad hoc networking in future wireless communications. Ad hoc networks are classified as isolated ad hoc networks with large and small sizes, integrated ad hoc networks in various scenarios and cellular ad hoc networks for the future mobile access networks. The very low traffic performance of large-scale ad hoc networks is shown by simulation results, indicating such a king of networks having little commercial potential. Small size ad hoc networks seem to be ubiquitous because of the availability of cheap wireless LAN technologies. Integration of small size ad hoc networks with the global Internet can be realized by ad hoc gateways, which are proposed in this paper. In contrast to large scale isolated ad hoc networks, traffic performance of a cellular ad hoc network is very promising, indicating that cellular ad hoc networking seems to be a promising solution to fulfill the requirements of future wireless communication systems.
Multiprotocol label switching and traffic engineering are proposed by the IETF to improve the network performance. Moreover, some QoS routing algorithms must be added in order to optimize the path selection process. H...
详细信息
Multiprotocol label switching and traffic engineering are proposed by the IETF to improve the network performance. Moreover, some QoS routing algorithms must be added in order to optimize the path selection process. However, in highly dynamic large networks, existing QoS routing algorithms suffer from a blocking probability, which in part is due to the existence of inaccuracy in the network state information used to select the path. This paper deals with the BYPASS based routing mechanism, which was introduced in the previous paper to overcome this routing inaccuracy effect in ip/MPLS scenarios. We suggest an enhancement of the BBR mechanism to optimize the bandwidth allocation by balancing the path length and the residual bandwidth, and its performance is evaluated by simulation.
暂无评论