By Topic

Wireless, Mobile and Multimedia Networks, 2006 IET International Conference on

Date 6-9 Nov. 2006

Filter Results

Displaying Results 1 - 25 of 445
  • A new QoS-aware MPLS-based micro-mobility management technology

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2260 KB)  

    Considering the extended use of MPLS in mobile networks, the idea is emerged of applying IP micro-mobility management to MPLS-based wireless access subnet. A new QoS-aware MPLS-based micro-mobility management technology is proposed, where a Local Mobility Management Server (LMMS) storing the information of roaming hosts and several Paging Servers (PSs) are included, capable of providing paging functionality and eliminating the network bottleneck. QoS is guaranteed by static LSP configuration and network reliability is improved with LSP redundancy. Using LSP forwarding mechanism, the QoS grade will remain unchanged before and after handoff. The updated protocol messages are proposed and the signalling procedures of binding update and handoff are elaborated. Compared with the existing schemes, the proposed technology has shown its merits in its high reliability, flexible expansibility and good practicality. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of Blocking probability in Mobile network

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (4584 KB)  

    As an important parameter of network, Blocking probability has been investigated in various type of networks such as GSM, WLAN, etc. In this paper, blocking probability of mobile router in Mobile network (NEMO) is investigated with analytical model of Markov chain, considering two factors of node mobility model and call arrival rate. First we describe NEMO architecture, then three types of Mobile Network Node (MNN) defined in NEMO are divided into different priority according to network resource allocation, the blocking probability of mobile router in these two types of systems are put forward respectively. Furthermore, we also propose a way to compute blocking probability in nested NEMO. At last analysis result is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical models and control methods with data packets loss on NCS

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2009 KB)  

    Data packets loss is a basic phenomenon of network, and it may affect the system stability in the networked control system (NCS). In this paper, the states and description methods of single data package and multi data packets loss in NCS is put forward, and then an applied compensation and control method is introduced, some of which includes data loss compensator, loss of real time repairing and improving of packet context and self adaptive intelligent control algorithm. The results may be regarded as a main supplement of time-delay NCS. If data package loss problem is treated properly in practical application, it will be sometimes an effective means of increasing system stability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical buffer management scheme for network nodes with QoS requirements

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2361 KB)  

    In this paper, a buffer management mechanism with hierarchically dynamic thresholds is proposed. This mechanism can not only provide fair buffer allocation hierarchically, but also improve the buffer utilization by using the reserved buffer from dynamic threshold. The parameters of dynamic thresholds for each hierarchy, the parameters for low threshold and the buffer sizes are all decided for all parts constituting the switch fabric through system simulation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation-based performance comparison of video transmission over MIPv6, FMIPv6, HMIPv6, and FHMIPv6

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (10270 KB)  

    There has been a recent trend towards an all-IP network as it provides for cost-savings together with optimized network and ease of use. Owing to explosive growth of wireless users and growing demand of wireless services, the internet body IETF has developed mobility management schemes to enhance IPv6 in mobility scenarios for wireless subscribers. These IPv6-based mobility management schemes adversely affect the performance of transport protocols during handoff. In this paper, the performance of video transmission over MIPv6 and recent MIPv6 enhancements, namely, FMIPv6, HMIPv6, and FHMIPv6 is compared. We consider the impact of different parameters like degree of mobility, wired link delay, jitter, error rate, and throughput. Due to the complexity of the required study, simulation is chosen as the most suitable analysis method. The results in this paper are based on simulation experiments performed within the ns network simulator. The simulation environment allows us also to investigate the behavior of the protocol in many cases, e.g., under channel saturation conditions, and considering different traffic sources: CBR, Video, VoIP and TCP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A secure mobile-IPv6 network model

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2776 KB)  

    Mobile-IPv6 technology brings us convenient but also produces a series of security issues. Virtual private networks allow two or more parties to communicate securely over a public network. VPNs provide the assurance such as confidentiality, host authentication and data integrity by using cryptographic algorithms and protocols. In this article the concepts of mobile IP was introduced and the security problem was analyzed. A VPN implemented with the IP Security Protocol (IPSec) is presented to protect the communication between Mobile Node and Home Agent. According to special demands of mobile network, a secure mobile-IPv6 network model is presented based on IPSec. With this kind of model the high security and reliability can be achieved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study on host and station mobility in BGP/MPLS VPN

    Page(s): 1 - 3
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2584 KB)  

    RFC2547bis-based BGP/MPLS VPN has been widely applied in the service provider's backbone networks. But with the increasing demands of its application in remote mobile working, mobile intranet meetings etc., it is urgent to provide users with convenient and reliable mobile VPN service based on the existing BGP/MPLS VPN networks. The present article has proposed different conditions for mobile application in BGP/MPLS VPN for the first time, and conducted profound analyses and discussions in two different conditions, i.e., the mobile host and the mobile site, as well as specific application conditions, to give a whole set of solutions with great value to the practical application. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The technology of route optimization for NEMO based on DHCPPD

    Page(s): 1 - 3
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (3760 KB)  

    The basic NEMO protocol results in a sub-optimal route between Mobile Network Node (MNN) and Correspondent Node (CN). This paper provides a mechanism based on DHCP Prefix Delegation (DHCPPD) to enable Mobile Network Node (MNN) to perform route optimization with CNN which has basic MIPv6 support. The goal is to use DHCPPD to assign Care-Of-Address (COA) to MNN, MNN can bind with Correspondent Node (CN) with basic MIPv6 support [3]. It effectively reduce unnecessary large travelling route and overhead, thereby enhance the performance. The solution is effective for both single NEMO and nested NEMO for which we will deploy DHCP replay mechanism as extension, and has a better performance than the basic NEMO protocol. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic resource reservation ordering based on signal prediction priority queuing in all-IP mobile networks

    Page(s): 1 - 5
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (3576 KB)  

    QoS in wireless mobile network is one of the hottest topics recently, while RSVP protocol is a key technology. The cell is becoming smaller to provide more service, making handoff more frequent. It is necessary to reserve resource to guarantee QoS during handoff. Moreover, priority ordering is important when many mobile hosts need to reserve resource. This paper presents a dynamic ordering algorithm based on signal prediction priority queuing (SPPQ) to efficiently reserve resource for many mobile hosts. Simulation result shows that the presented algorithm not only guarantees fast handoff but also accomplishes efficient resource reservation, and the limited resource is assigned more effectively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using mobile router chain to support route optimization in IPv6 nested NEMO

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1214 KB)  

    Mobility is an important feature of future internet, and mobility of mobile node in IPv6 has been designed as RFC3775, with optimized route and safeguard of binding messages as its characters. However, as the development of sensor network and personal network, the ability of allowing node and route, which reside in a moving network, to visit internet is imminent for applications in reality. Although some approaches to support network mobility are proposed based on extension of mobile ipv6, resolving the basic routing in mobile networks, nested mobile networks is still confronting serious issues, such as binding updates explosion, triangle route, and source address filtration, resulting. In this paper, we propose an approach to optimize route in IPv6 nested mobile networks by designing mobile router chain, which can be used by mobile and fixed networks and nodes, residing in a mobile network, to analyze the nested topology and improve mobility management in result. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differentiated mobile IPv6 based on the movement domain

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (4107 KB)  

    In this paper a differentiated optimal mobility support in IPv6 is presented in order to provide efficient mobile IPv6 implementation based on the movement domain. We explore the inefficient mechanisms of MIPv6 in current network architecture, and put forward our ideas. Analysis on the new scheme shows that the differentiate optimal mobile IPv6 can lower the cost and raise the processing efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new route optimization algorithm for nested NEMO

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2459 KB)  

    In NEMO (Mobile Network) research, route optimization for nested mobile networks is one of the major challenges. So we propose a new route optimization algorithm for nested NEMO in this paper. Its basic idea is to integrate NEMO with MANET (Mobile Ad hoc Networks) to eliminate nesting when several mobile networks are attached together. In other words, a mobile router acts as an ad hoc node when it wants to select an Access Router (AR) in foreign link, so that it can select the fixed foreign router as its AR directly even there's multi-hop between them. Evaluation results show that our approach has little additional communication cost and almost has no influence on the current protocols. Furthermore, our scheme has good adaptability to fast handoff scenario. We also discussed other issues such as address assignment, router advertisement in the framework of our algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of an intelligent transportation system based on GPS and GPRS

    Page(s): 1 - 3
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1025 KB)  

    The design of an intelligent transportation system which bases on GPS and GPRS is advanced. In this system GPS information, vehicle, GPS and traffic light information are transmitted by means of GPRS wireless network to traffic control center, and finally the traffic control center displays above information and sends commands control to all the subsystems. In this paper we introduce the whole structure of this system, including hardware components and software framework, and analyze the implementation of the key technology and the performance of the system. This system has much good performance such as high speed of the transportation of the data, high precision, real time and good reliability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A random geometric graph coverage model of wireless sensor networks

    Page(s): 1 - 3
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1680 KB)  

    A new random geometric graph coverage model is presented in this article. Compared with other old simple models, this new model considers not only the sensitivity of node but also the reliability of links. It is more appropriate to real situations, affected by various factors. The model shows its applicability when all wireless sensor networks' (WSN) nodes obtaining its own coordinate for coverage and surveillance purposes. We also analyze some key parameters of WSN as a new model of random geometric graph and propose a simple greedy localization algorithm. In the end, empirical results demonstrate the validity of proposed model and algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast algorithm for wireless sensor networks localization based on Metric least squares scaling

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1909 KB)  

    Accurate and low-cost wireless sensor networks localization is now a very popular research topic. Multidimensional Scaling (MDS) localization techniques have been successfully applied to the problem of node locating. In this paper, a relaxation algorithm which is based on Metric least squares scaling (LSS), a MDS technique, is devised for sensor location estimation. We investigate several variants of Metric LSS and compare their rate of convergence with relaxation algorithm. Simulation results show that our method achieves convergence faster than others at the same expense of computational cost. At last, the simulation results of localization accuracy comparison are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A joint data link layer and network layer design for cluster-based wireless sensor networks

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2038 KB)  

    To improve the performance of wireless sensor networks, there has been increased interest in network protocols that rely on cross-layer design recently. In this paper, we present a cross-layer method for cluster-based wireless sensor networks to provide energy efficiency and low latency. In the proposed approach, the adaptive cluster head selection scheme and the cluster route scheme can eliminate the idle listening and collisions to improve power efficiency and reduce transmission latency. Simulation results show the improvement of the network performance by using the joint design. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A network-based global mobility management architecture

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (3726 KB)  

    This paper specifies a network-based global mobility management architecture, named NetGMM. NetGMM supports network-based mobility management and non-Mobile IP mobile environment. There are two design considerations. The first is that future mobile network requires network-based mobility management shifting the mobility management function from mobile node to access network nodes. The second is that future mobile network will support IP multi-services, introducing a separation between network address and identity of a mobile node entity allow heterogeneous networks to work together without loss of functionality. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable routing protocol for low energy Wireless Sensor Networks

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1401 KB)  

    The recent interest in Wireless Sensor Networks has led to a number of routing mechanisms that use the limited energy available at sensors more efficiently. In this article, we present a scalable routing protocol for low energy wireless sensor networks. Our routing protocol is based on clustering network topology, which reduces the routing overhead efficiently and makes the scalable networks possible. To maximize network lifetime, we propose energy efficient algorithms in the wireless temperature sensor network platform. Experiment results indicate that performances of this routing protocol satisfy all the parameters in super low energy wireless sensor networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-metric QoS Routing based on Fuzzy Theory in Wireless mesh network

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (3554 KB)  

    A novel traffic engineering routing algorithm called Multi-metric QoS-aware Routing based on Fuzzy Theory (MQRFT) is proposed to solve traffic management problem and achieve a good trade-off between QoS provision and network performance based on DSR. The simulation results show that the protocol can improve the performance of managing network congestion effectively in terms of delay, overhead and average throughput. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cluster-based routing with backup route in mobile ad hoc networks

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (3973 KB)  

    Effective routing is critical in mobile ad hoc networks (MANETs). In recent years, many hierarchical routing protocols have been proposed to build a backbone structure for supporting MANET routing, especially for large scalability. The clustering approach is seen as the first step in providing a flat network with a hierarchical architecture. The clusterheads become the backbone nodes (BNs), which use greater power to transmit packets, forming the backbone network. Backbone network routing can reduce the number of data-packet forwarding hops throughout the entire network. However, previous protocols have focused on clustering schemes. Fault tolerance in a backbone structure has not been considered. In this paper, we propose a backup routing scheme that can repair broken links locally without activating a route re-discovery procedure. The backup route is piggybacked in the data packet header to achieve the most durable route. The proposed method can improve the packet delivery ratio and reduce control overhead, compared to general hierarchical routing protocols. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neighborhood-based distributed topological hole detection algorithm in sensor networks

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2039 KB)  

    Topological holes in sensor networks usually indicate the region where nodes are depleted or not dense enough due to kinds of reasons. In this paper, we study the problem of detecting topological holes in wireless sensor networks. Those sensor nodes have no geographic location information and have a limited communication range. We present a novel distributed topological holes detection algorithm which is based purely on the logical communication topology graph. By exchanging information with its 1-hop and 2-hop neighbors, each node can independently decide whether it is on the boundary of a hole. Those boundary sensor nodes together could describe the region of the topological hole. Experimental results show that our distributed algorithm is effective in exploiting those characteristics of those nodes on the boundaries of holes. And thus it could identify those holes in sensor networks of moderate node densities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the connectivity and reliability of the large-scale wireless sensor network with the percolation

    Page(s): 1 - 3
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2859 KB)  

    This paper investigates the critical connectivity phenomena in the large-scale wireless sensor network with continuum percolation theory. We analyze the critical number of nodes and critical transmit radius that above which the network is fully connected. The impact of node reliability on network connectivity is also studied and discussed. Our results are of practical value for the design and simulation of wireless sensor networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement to a geolocation algorithms in wireless sensor networks

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (4538 KB)  

    Location awareness is important in many wireless sensor networks. In sensor networks because of the size, weight, battery life and price some nodes (e.g. GPS-equipped nodes) are self-located but all other nodes have to determine their locations by communication with location-aware neighbors. The classical distance-based technique for location determination is triangulation/lateration (referred to as 3NA for short), which determines the location of a node by communication with three neighbors. In 2004 Barbeau et al proposed an algorithm, referred to as 2N+aB for short, that can locate a location-unknown node using two location-aware neighbors plus certain information from a third adjacent location-aware node. In this paper an improvement to Barbeau et al's algorithm, referred to as 2N+cB for short, is proposed. Our computer simulations show that for randomly deployed low-density sensor networks 2N+cB can increase the number of located location-unknown nodes by at least 31% compared with 2N+aB, and the average increase achieves 43.6%. Besides, we give an analysis of 3NA, as an example for the analysis of 2N+aB and 2N+cB, and our simulation result well matches the theoretical analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An on-demand routing protocol with cache administration in ICAR system

    Page(s): 1 - 4
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (5289 KB)  

    Integrated cellular and ad hoc relaying system (iCAR) is a new wireless system architecture based on the combination of cellular and modern ad hoc relaying technologies. The ICAR system can balance loads of the system, increase the system's capacity cost effectively, reduce transmission power for mobile hosts and extend system coverage by using ad hoc relaying stations (ARS) to relay traffic from one cell cluster to another dynamically. Fast efficient relaying routing protocols that can exactly reflect the cell's status are important to ICAR networks. In this paper, a routing protocol designed based on on-demand routing protocol is proposed for ICAR system. We analyze the performance of the routing protocol and the impact of cache administration on the performance of the routing protocol. Some simulation results are displayed. The results show that routing cache affects the performance of the routing protocol greatly, and the protocol can provide a shortest path from a congested cell to a noncongested cell in the least time. In sum, the time delay of the call diversion is within a tolerable range. The probability of the call failure is controlled within a comparatively low standard. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel improved AODV algorithm based on cross-layer mechanism in wireless mesh network

    Page(s): 1 - 3
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1173 KB)  

    Wireless mesh networks (WMNs) suffer from random variations in channel condition. This leads to poor performance in multi-hop wireless mesh networks specially with a conventional routing. To cope with instability of wireless links, new routing metrics must be explored. In this paper we propose a new end-to-end Bit Error Rate (BER) aware metric for multi-hop wireless routing and take hop number into account. We show that using this metric in AODV protocol improves the performance of routing in terms of end-to-end delay and throughput in comparison to minimum-hop count metric. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.