Documente Academic
Documente Profesional
Documente Cultură
Recent day development of wireless technology integrates to communicate with each other. A handoff scheme is essential to continue connections whenever a mobile node moves from one coverage area of network to another. The handoff management issues consist of finding the appropriate time to perform the handoff, velocity, channel conditions, cost, bandwidth and RSS etc., In this paper, we propose a vertical handoff decision algorithm for heterogeneous wireless network based on the Velocity of mobile node and the Adaptive traffic load balanced handoff management scheme which adaptively control the handoff time according to the load status of cells. The algorithm considers the number of handoff when the velocity increases with effective reduction of probability of handoff and efficiently manages further overloaded traffic in the system. Simulation result shows that the effectiveness of the proposed algorithm during handover between different wireless networks.
advertisement received are obtained. From the simulation it is inferred that tight coupling is performing better from handover point of view. Co-operative downlink scheduling for cell edge and handoff users We present a new co-operative scheduling approach which provides not only more reliability but also higher effective capacity. Cooperation region is defined for active handoff users between two base stations (BSs) based on the user quality-of-service (QoS) requirements. A proper definition of co-operation or handoff region, where the user can be scheduled in a cooperative manner from more than one BS, is also given based on per-BS load and user QoS. Numerical results are presented showing reliability, user QoS performance, handoff region and capacity gain due to co-operative scheduling. Our analysis indicates that, when the QoS requirement is loose, co-operation provides relatively less gain and the handoff window size is also less. On the other hand, when the QoS requirement becomes more stringent, the gain in the effective capacity increases by using cooperation and the co-operation or handoff window size is also large, which can go up to 25% of the total area.
TIBCRPH: Traffic Infrastructure Based Cluster Routing Protocol with Handoff in VANET
Vehicular Ad Hoc network (VANET), is a hot topic that applying mobile Ad Hoc network (MANET) to ITS in recent years. Special environments and applications cause difficulties to the design of the routing protocols of VANET which can not use the exiting protocols well. Firstly, this paper introduces some concepts of VANET briefly, analyzes and compares some different kinds of existing routing protocols in VANET. Then, basing on the characteristics of the VANET, and utilizing the idea of cluster and handoff, a more efficient protocol is developed in this paper, which is dubbed Traffic Infrastructure Based Cluster Routing Protocol with Handoff (TIBCRPH). Finally, TIBCRPH is compared with other six typical routing protocols on node density and speed respectively by NS2. The results show that TIBCRPH performs better than some traditional routing protocols.
Resource management based on future traffic estimation and 2-tier structure for 4G cellular network
This paper proposes a resource management approach that integrates a two tier structure to future traffic estimation with the purpose of avoiding forced termination and waste of bandwidth in handoffs. An efficient bandwidth reservation mechanism in neighboring cells is important in handoff process, particularly when the handoff traffic is heavy. As the next generation wireless networks cater for various kinds of applications with varying degree of QoS parameters, resource management is an important part in order to optimize the overall system performance. The performance of a wireless network is bounded by the efficiency of resource management. The objective is lessening
the handoff call dropping probability by using future network traffic load and responding properly to it. In prediction based resource reservation, a priori estimation of the future traffic load affects the process of resource reservation. Our scheme is compared through simulations with other schemes. The simulation results show that our proposal provides better performance in terms of handoff dropping probability.
Network selection delay comparison of network selection techniques for safety applications on VANET
Abstract
One of the most challenge applications in VANET is a safety application. The important characteristic of this application is stringent time constraints. To satisfy these constraints, seamless handoffs must be provided. The mechanism making successful seamless handoffs is a network selection technique. Several techniques such as AHP, SAW, GRA and TOPSIS were proposed to select a network satisfying application QoS and user preferences. However, these techniques have not been empirically validated and feasibly studied on embedded boxes in vehicles. Since embedded boxes have limitations on memory usages, CPU speed and etc, then the selection techniques should consume small memory usages and low computation time. In this work, the decision tree for AHP is considered since it utilizes low computation time. Moreover, the empirical comparison and feasible study between AHP, SAW, GRA, TOPSIS and the decision tree for AHP are carried out. The results show that the computation delay of decision tree for AHP is much lower than the one of pre-existing techniques. However, the proposed technique uses little higher memory space than the others.
n recent years, Distributed Hash Tables (DHTs) attract a lot of attentions since they have many advantages such as good routing performance, scalability, fault tolerance, load balancing. Those properties make DHTs are suitable for deploying multicast services at application layer. However, early DHT-based multicast systems are insufficient in addressing a number of technical issues such as heterogeneous node capacity, large-scale multicast and dynamic membership. In this paper, we propose BAM-Chord: Bandwidth Adaptive Multicast over Chord, a DHT-based multicast system that focuses on host heterogeneity, scalability and fault tolerance. In our system, when a node joins into the system, it will And out an appropriate position (i.e. node identifier) on a BAM-Chord ring and create links to neighbor nodes based on node's bandwidth capacity such that the multicast tree can be built efficiently and balanced. Therefore, our system can utilize bandwidth of every node to reduce the depth of the multicast tree and take advantages of DHTs in maintaining the multicast tree.
C4. Vertical handoff in heterogeneous wireless networks with predictive SINR using GM(1, 1)
Heterogeneous wireless network consists of various wireless networks, WiMAX, WiFi and cellular communications. Future wireless networks must be able to coordinate services within a diversenetwork environment. One of the challenging problems for coordination is vertical handoff. In this article a Multi-attributes SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks with Predictive SINR Using GM (1, 1) is proposed. The proposed algorithm uses the combined effects of SINR, user required bandwidth, user traffic cost, utilization from participating access networks and user preference to make handoff decision QoS aware which cannot be achieved with the use of traditional RSS as a vertical handoff criteria. The problem of when to trigger handoff request is handled by using GM (1, 1), Grey Model first order one variable, forecasting technique to predict the next SINR value. If it is lower than a pre-specified threshold,
handoff request will be fired. Simulation results have shown that the proposed algorithm performs better in terms of less cost to user traffic, higher user satisfaction as well as higher system throughput.