By Topic

Mobile Computing and Wireless Communication International Conference, 2006. MCWC 2006. Proceedings of the First

Date 17-20 Sept. 2006

Filter Results

Displaying Results 1 - 25 of 52
  • [Front cover]

    Page(s): C1
    Save to Project icon | PDF file iconPDF (141 KB)  
    Freely Available from IEEE
  • Program

    Page(s): nil1 - nil10
    Save to Project icon | PDF file iconPDF (2879 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Page(s): nil11
    Save to Project icon | PDF file iconPDF (113 KB)  
    Freely Available from IEEE
  • MCWC 2006 Reviewers

    Page(s): nil12 - nil14
    Save to Project icon | PDF file iconPDF (490 KB)  
    Freely Available from IEEE
  • MCWC 2006 Technical Program Committee

    Page(s): nil15
    Save to Project icon | PDF file iconPDF (379 KB)  
    Freely Available from IEEE
  • General Chairman's Message

    Page(s): nil16
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • Organizer's Message

    Page(s): nil17
    Save to Project icon | Request Permissions | PDF file iconPDF (42 KB)  
    Freely Available from IEEE
  • [Breaker page]

    Page(s): nil18
    Save to Project icon | Request Permissions | PDF file iconPDF (13 KB)  
    Freely Available from IEEE
  • Milestones in Communications

    Page(s): 1
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (26 KB) |  | HTML iconHTML  

    First Page of the Article
    View full abstract»

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

    Page(s): nil19 - nil22
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (142 KB)  

    Summary form only for tutorial. View full abstract»

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

    Page(s): nil23 - nil28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1191 KB)  

    Summary form only for tutorial. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Breaker page]

    Page(s): nil29
    Save to Project icon | Request Permissions | PDF file iconPDF (13 KB)  
    Freely Available from IEEE
  • Party: Pastry-Like Multi-hop Routing Protocol for Wireless Self-Organizing Networks

    Page(s): 2 - 7
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (3227 KB) |  | HTML iconHTML  

    In this paper we propose Party, a new routing protocol for wireless Self-Organizing Networks. This protocol is intended to be applied in environments with large number of nodes where the scalability of the routing protocols plays an important issue; it is well known that the current ad hoc routing protocols do not scale to work efficiently in networks of more than a few hundred nodes. In Party, nodes build a network infrastructure which allocates each node a unique temporary address according to its current relative location, our routing is also unique and only depends on the current node's neighborhood, where in order to implement the routing table, each node needs only to exchange local information with its direct neighbors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • G-OPEP: An On-Demand Group Key Agreement Protocol for MANETs

    Page(s): 8 - 13
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2180 KB) |  | HTML iconHTML  

    Securing a multicast architecture is a basic procedure in order to avoid attacks and guarantee the communication integrity and confidentiality. This becomes more vital when dealing with ad hoc network. The lack of physical and administrative infrastructure and the dynamic topology, make the ad-hoc network more arduous to be secured. In this paper, we propose a key management protocol to secure ad-hoc network. Our proposal relies on the routing mechanism. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Power-Aware Routing in OLSR Protocol

    Page(s): 14 - 19
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1416 KB) |  | HTML iconHTML  

    In ad hoc networks, where there is no infrastructure, batteries lifetime are scare resource. However, many routing protocols in ad hoc networks have been proposed to provide and maintain routes without taking into account energy consumption. Recently, power control in mobile ad-hoc networks has been the focus of extensive research. In this paper, we propose a new scheme to make energy aware routing in OLSR (optimized link state routing protocol). OLSR is one of the routing protocols under study by the IETF MANET Working Group. We develop a new heuristic that allow OLSR to find an optimal power path in which the maximum energy consumption on that path is smaller among the maximum energy consumption of all possible paths. We discuss via simulation the interplay between routing in new OLSR protocol and the medium access control (MAC). Also we study the overhearing impact on the energy power-aware routing protocol. Simulation results show that our scheme improves classical OLSR routing while taking into account lifetime of the network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Balanced Ad Hoc Routing Protocol

    Page(s): 20 - 26
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1107 KB) |  | HTML iconHTML  

    Most of the routing algorithms in mobile ad hoc networks are based on the shortest path metric, which results in using the same path for several sessions. Consequently, nodes will lose their power, and their paths will eventually become invalid. This paper presents a new method for achieving better load balancing in mobile ad hoc networks. It targets load balancing at the routing layer of the Dynamic Source Routing Protocol (DSR). The new method defines the load in term of the relative time needed to process and forward packets in each node. Also, congestion is predicted and cured using a modified version of the random early detection (RED) queue. A set of changes is applied to the DSR protocol to give the nodes the most recent information about the load within paths and neighborhoods. Simulation results show that the new method results in an overall enhancement of 37% in term of end to end delay when compared with the load-aware on-demand routing (LAOR) Protocol and the load-sensitive routing for Mobile Ad Hoc Networks (LSR). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyses Authentication and KeyAgreement (AKA) Protocol for UMTS Mobile Networks

    Page(s): 27 - 31
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2390 KB) |  | HTML iconHTML  

    This paper analyses the authentication and key agreement (AKA) protocol for UMTS mobile networks, where a new authentication protocol which is able to reduce the network traffic and signaling message between entities, and consequently the bottleneck at authentication centre is avoided, this is achieved by reducing the number of messages between mobile and authentication centre, and then reducing the authentication times and setup time as well as improving authentication efficiency as shown in numerical analysis and simulation results. In this paper we propose dynamic length (L) for an array for authentication vector (AV). This required designing new technique to predict the numbers of records in AV in each authentication data request depending on the to arrival rate of authentication events and residence time of MS in VLR/SGSN. The proposed AKA with dynamic L for AV is compared with the current AKA with fixed length for AV. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimised resource management for NEMO mobile networks

    Page(s): 32 - 37
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (2185 KB) |  | HTML iconHTML  

    In NEMO (NEwork Mobility) context, service degradation or forced call termination may occur because of frequent handoffs. In this paper, we propose and evaluate a new scheme for quality of service guaranty support. This scheme called Time-based Bandwidth Reservation (TBR) is adapted to NEMO specifications and consists in sending reservation requests to the neighboring cells based on real-time measures of mobile networks. The goal of our scheme is to adjust the amount of time for which bandwidth has to be allocated and reserved in a cell. Detailed performance results of TBR scheme and comparison with guard channel scheme are presented. The simulation results show that the proposed TBR scheme can efficiently improve the flow dropping probability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vertical Handover Support for Multimode Mobile Terminal using Multi-Homed MIPv4

    Page(s): 38 - 43
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (535 KB) |  | HTML iconHTML  

    Basic mobile IPv4 (MIPv4) operation constraints applications bound to the same home address (HoA) to use the same physical interface because traffic is only tunneled towards a single care-of-address (CoA) by the home agent (HA). This prevents different applications from using different physical interfaces. Solutions to address this problem have been proposed that require configuration of filters in the HA to tunnel traffic towards different CoAs but these require modifications to the network, and additional signaling between the mobile terminal (MT) and the network. This paper describes a solution to support multimode operation using MIPv4 with no changes to the network, as well as the multimode MT architecture supporting such MIPv4 operation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power Management Mechanism for routing in Ad-Hoc Wireless Networks

    Page(s): 44 - 49
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (690 KB) |  | HTML iconHTML  

    Power control techniques are used in wireless communications to reduce interference and save energy. This strategy has particularly interesting applications in a multihop MANET(mobile ad-hoc networks), because the transmission power required for the communication between two nodes is increased exponentially with their distance, and the total power required to transmit a packet via multihop may be less than the energy required to transmit it directly. In this paper, we propose a new power saving mechanism in a tree constructed by TDA (topology discovering algorithm) (Zabian and Bonuccelli, 2005). The idea is the reduction of power consumption in each node (when it is possible) by adjusting the transmission range that allows a significant power saving in all the network. Our results show that, the power consumption in a tree like that constructed by TDA is related to the height of the tree and tightly related to the packet size. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Level Model for the Wireless Channel Unreliability in Mobile Cellular Networks

    Page(s): 50 - 55
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (4095 KB) |  | HTML iconHTML  

    In this paper, a new system level approach for the wireless channel unreliability modeling is proposed. Firstly, in order to characterize the call interruption process due to the wireless channel unreliability, the Gilbert-Elliot model is used to obtain the probability distribution of the interruption time. Then, it is shown that link unreliability can be adequately modeled by considering a Poissonian call interruption process. This allows simplifying system level mathematical analysis and easily identifying the factors that mainly influence the performance of mobile cellular networks. For the characterization of the interruption process in real cellular networks, it is enough to know some few system level statistics that can be easily obtained at base stations. Then, with the proposed call interruption modeling, an elegant teletraffic analysis for the performance evaluation of mobile cellular networks considering both wireless link unreliability and resource insufficiency is developed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • M-PSK Modulation using Mod-M Turbo Codes

    Page(s): 56 - 61
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1203 KB) |  | HTML iconHTML  

    In most communication systems, power and bandwidth are limited. To achieve more reliability with consuming less power, turbo codes can be used as a powerful coding technique. On the other hand, to overcome the bandwidth constraint, a higher order modulation, such as M-PSK, may be needed. Heuristically it seems natural to use an encoding scheme whose symbol size is equal to the size of modulation symbols. In this paper we study the combination of mod-M turbo code with M-PSK modulation. Both cases of single input and multiple input encoders are considered. For the general case of multiple inputs, a decoding algorithm is formulated and its complexity is analyzed. Cases of M=4 and 8 are considered for simulation. The results show that there exists mod-M turbo codes which outperform the best known binary turbo codes, having the same complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and equalization of delay in asynchronous CDMA system using unscented filtering

    Page(s): 62 - 66
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1756 KB) |  | HTML iconHTML  

    In this paper, we present analysis and equalization for asynchronous received signals in a code-division- multiple-access (CDMA) system. The equalization is performed using the unscented filer (UF). This equalization helps the multiuser detector to estimate the desired signal in asynchronous system without the need of estimating the delays of the asynchronous users. Simulations are presented to show the performance of the equalizer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BER for M-QAM with Space Diversity and MRC in Rician Fading Channels

    Page(s): 67 - 72
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1547 KB) |  | HTML iconHTML  

    This paper presents simple bit error rate results for M-ary quadrature amplitude modulation (M-QAM) transmitted over slow, flat, identically independently distributed (i.i.d) Rician fading channels and using space diversity to enhance coverage and capacity. A single exponential function is used to approximate the bit error rates (BER) for M-QAM modulation over a Gaussian channel. This approximation is bounded within 1 dB for the signal alphabet M ges 4 and 0 les SNR les 30 dB. BER for optimum, maximal-ratio-combining (MRC) receive diversity, with channel side information known at the receiver (CSIR) is then obtained. Recently exact analysis of symbol error rate (SER) has been presented in the literature for M-ary differentially encoded/ differentially decoded phase shift keying (MDPSK) and coherent M-ary phase shift keying (MPSK), and for M-QAM transmitted over Rician fading channel using N branch receive MRC diversity. The results are presented either in an integral form or in the form of hyper-geometric infinite series. Unfortunately its use leads to numerical un-stability. Our analysis has followed the same track and the simplicity of the SER expressions used has resulted in simple closed form expression of the SER of N order diversity at Rician fading channel. Our expressions contain only exponential functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supported Active Users in a MC-CDMA System Under Intercell Interference

    Page(s): 73 - 77
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (3098 KB) |  | HTML iconHTML  

    In this proposal the sensitivity and the impact of an interfering base station based on a MC-CDMA system is investigated and analyzed. The maximum number of active users in an MC-CDMA system is analyzed using conventional channel coding, turbo code and iterative de-mapping processes with different values of signal interference ratio, under an intercell interference environment. View full abstract»

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