Search

The growing market of GNSS capable mobile devices is driving the interest of GNSS software solutions, as they can share many system resources (processor, memory), reducing both the size and the cost of their integration. Indeed, with the increasing performance of modern processors, it becomes now feasible to implement in software a multichannel GNSS receiver operating in real time. However, a major issue with this approach is the large computing resources required for the base-band processing, in particular for the correlation operations. Therefore, new algorithms need to be developed in order to reduce the overall complexity of the receiver architecture. Towards that aim, this paper first introduces the challenges of the software implementation of a GPS receiver, with a main focus given to the base-band processing and correlation operations. It then describes the already existing solutions and, from this, introduces a new algorithm based on distributed arithmetic. [ABSTRACT FROM AUTHOR]

Abstract  Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division Multiple-Access (W-CDMA) systems, which plays an important role in third generation mobile communications. In the OVSF problem, codes must be assigned to incoming call requests with different data rate requirements, in such a way that they are mutually orthogonal with respect to an OVSF code tree. An OVSF code tree is a complete binary tree in which each node represents a code associated with the combined bandwidths of its two children. To be mutually orthogonal, each leaf-to-root path must contain at most one assigned code. In this paper, we focus on the online version of the OVSF code assignment problem and give a 10-competitive algorithm (where the cost is measured by the total number of assignments and reassignments used). Our algorithm improves the previous O(h)-competitive result, where h is the height of the code tree, and also another recent constant-competitive result, where the competitive ratio is only constant under amortized analysis and the constant is not determined. We also improve the lower bound of the problem from 3/2 to 5/3. [ABSTRACT FROM AUTHOR]

Broadcast disk technology has become a popular method for data dissemination in wireless information systems. However, factors such as intentional periodic disconnection by the mobile hosts (MH) result in further needs for managing access modes so as to let the mobile hosts procure highest benefit through the disconnections. We address this issue in this paper and propose solutions for the MH to retrieve the broadcast data. Our performance results show that the proposed algorithms indeed achieve almost the optimal performance, but require only 5–30% of the cost of an algorithm that is otherwise designed. [ABSTRACT FROM AUTHOR]

Copyright of Electronics & Electrical Engineering is the property of Electronics & Electrical Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the proximity of a sensor node. This can be an alternative to multihop forwarding of data when we can utilize node mobility in a sensor network. To be useful, a data mule approach needs to minimize data delivery latency. In this paper, we first formulate the problem of minimizing the latency in the data mule approach. The data mule scheduling (OMS) problem is a scheduling problem that has both location and time constraints. Then, for the 1D case of the DMS problem, we design an efficient heuristic algorithm that incorporates constraints on the data mule motion dynamics. We provide lower bounds of solutions to evaluate the quality of heuristic solutions. Through numerical experiments, we show that the heuristic algorithm runs fast and yields good solutions that are within 10 percent of the optimal solutions. [ABSTRACT FROM AUTHOR]

In this paper, two learning automata based adaptive limited fractional guard channel algorithms for cellular mobile networks are proposed. These algorithms try to minimize the blocking probability of new calls subject to the constraint on the dropping probability of the handoff calls. To evaluate the proposed algorithms, computer simulations are conducted. The simulation results show that the performance of the proposed algorithms are close to the performance of the limited fractional guard channel algorithm for which prior knowledge about traffic parameters are needed. The simulation results also show that the proposed algorithms outperforms the recently introduced dynamic guard channel algorithms. [ABSTRACT FROM AUTHOR]

In the paper, algorithms of the pilot symbol embedded channel estimation are compared. Attention is turned to the Least Square (LS) channel estimation and the Sliding Correlator (SC) algorithm. Both algorithms are implemented in Matlab to estimate the Channel Impulse Response (CIR) of a channel exhibiting multi-path propagation. Algorithms are compared from the viewpoint of computational demands, influence of the Additive White Gaussian Noise (AWGN), an embedded pilot symbol and a computed CIR over the estimation error. [ABSTRACT FROM AUTHOR]

Interference cancellation and multiuser detection in CDMA systems are still actual research topics. These techniques enable us to deal with interference and to increase system capacity. In this paper, a so-called Generalized RAKE receiver, an Uplink generalized multiuser detection and a Blind adaptive multiuser detection are described. These algorithms are compared with conventional receivers and their properties are verified via simulations. The results imply that some of these algorithms are able to overcome the performance of the conventional receivers. [ABSTRACT FROM AUTHOR]

Users want to browse and search various web contents with mobile devices which can be used anywhere and anytime without limitations, in the same manner as desktop. But mobile devices have limited resources compared to desktop in terms of computing performance, network bandwidth, screen size for full browsing, and etc, so there are many difficulties in providing support for mobile devices to fully use desktop-based web contents. Recently, mobile network bandwidth has been greatly improved, however, since mobile devices cannot provide the same environment as desktop, users still feel inconvenienced. To provide web contents optimized for each user device, there have been studies about analyzing code to extract blocks for adaptation to a mobile environment. But since web contents are divided into several items such as menu, login, news, shopping, etc, if the block dividing basis is limited only to code or segment size, it will be difficult for users to recognize and find the items they need. Also it is necessary to resolve interface issues, which are the biggest inconvenience for users browsing in a mobile environment. In this paper, we suggest a personalized adaptation system that extracts item blocks from desktop-based web contents based on user interests, layers them, and adapts them for users so they can see preferred contents first. [ABSTRACT FROM AUTHOR]

In cellular communication systems, in order for a network to keep track of inactive mobile stations (MSs), each inactive MS has to update its location from time to time, called location registration. To lighten the task of tracking inactive MSs, the network divides its cells into groups, called location areas (LAs) and tracks inactive MSs at the LA level: an inactive MS sends a registration message to the network to update its location only when it travels to a new LA. Obviously, the performance of a location area design depends on network traffic and the mobility of MSs. In the paper, we propose a general Markov mobility model for MSs in cellular networks, provide a procedure to automatically estimate the system parameters according to the network traffic, derive the performance of LA design, and provide a clustering algorithm to optimize LA designs. A numerical example is provided to show the effectiveness of the proposed procedures. Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Location estimation and tracking for the mobile devices have attracted a significant amount of attention in recent years. The network-based location estimation schemes have been widely adopted based on the radio signals between the mobile device and the base stations. The location estimators associated with the Kalman filtering techniques are exploited to both acquire location estimation and trajectory tracking for the mobile devices. However, most of the existing schemes become inapplicable for location tracking due to the deficiency of signal sources. In this paper, two predictive location tracking algorithms are proposed to alleviate this problem. The Predictive Location Tracking (PLT) scheme utilizes the predictive information obtained from the Kalman filter in order to provide the additional signal inputs for the location estimator. Furthermore, the Geometric-assisted PLT (GPLT) scheme incorporates the Geometric Dilution of Precision (GDOP) information into the algorithm design. Persistent accuracy for location tracking can be achieved by adopting the proposed GPLT scheme, especially with inadequate signal sources. Numerical results demonstrate that the GPLT algorithm can achieve better precision in comparison with other network-based location tracking schemes. [ABSTRACT FROM AUTHOR]

With the development of mobile communication, adaptive algorithms are often chosen in real time process because of their high speed. However, existing adaptive algorithms are not suitable in frequency selective fading channels. In this paper, an improved adaptive synchronization algorithm is proposed for the application under frequency selective fading channels. A novel correlation function is proposed to reduce the effect of intersymbol interference, which only requires coarse channel length estimation. A gate value is also used to combine both the constant and decreasing step size methods; thus, the proposed algorithm is capable of distinguishing between tracking and convergent stages, and then choosing the right step size. Furthermore, an accelerating method is introduced to make the algorithm track faster, i.e. making the algorithm move more steps ?f it searches in the same direction as the last step. it is shown that the mean square errors of time and frequency offset estimates can be reduced to 0.9243 and 0.003 respectively even when the channel length estimate is not good, which totally satisfies Beek's requirement for synchronization. Simulation also shows that it takes only 10-20 symbols for the proposed algorithm to track the change of channel delay. Compared with the existing adaptive algorithm, the proposed algorithm has a higher accuracy with a higher tracking speed, and the proposed algorithm also has advantages over some nonadaptive algorithms with higher accuracy and lower computational complexity. [ABSTRACT FROM AUTHOR]

As it has strong security features, GSM (Global System for Mobile communications) becomes a popular system which is widely used in mobile communication. Hand held devices are not only used for delivering communication facilities, but also they are used in mobile commerce (m-commerce) transactions. As such, security concerns become more and more important when using mobile systems. This paper suggests using Hash algorithm within GSM to protect massage sending and receiving. Five famous Hash algorithms (MD5, SHA1, SHA 384, SHA256,SHA512) were tested with 128 Kbyte files to see which is the best algorithm to be used in mobile devices that supports GSM capabilities, depending on memory usage and power consumption. [ABSTRACT FROM AUTHOR]

Most of the multimedia and Internet services today are asymmetric in nature and require high data rate support. Allocating equal band width in both uplink and downlink is not a prudent solution, as most of the time user requirements are either greater in uplink or downlink. The Multi Carrier Code Division Multiple Access (MC-CDMA) system with Time Division Duplex (TDD) mode can easily meet this requirement by dynamically declaring traffic direction in the TDD slot and adaptively allocating the sub channels. In this paper, we propose an adaptive slot and sub carrier allocation algorithm that can be independently implemented in each cell of a mobile communication network. Our analytical model is the generalization of two cell concept to represent a multi cell model. Based on the two cell concept, four cases of interference pattern have been considered and simulated separately in presence of Additive White Gaussian Noise (AWGN) and Rayleigh Channel. The simulated result suggests the requirement of approximately 9dB of Signal to Noise Ratio (SNR) to maintain Bit Error Rate (BER) below 10-3. We also analyze the average delay incurred by the proposed algorithm in allocating resources. [ABSTRACT FROM AUTHOR]

This paper deals with a novel approach to realize the handover process of a mobile systems network. It concentrates on the existing challenges of Global System for Mobile communication (GSM) networks and how to overcome these challenges. The proposed algorithm extracts the received signal information features in order to track the significant coverage cell. The presented algorithm distinguishes between real problems and false alarms. One of the important contributions of the algorithm is how it predicts the adequate signal of the effective coverage cell. [ABSTRACT FROM AUTHOR]

The Mobile IP Authentication, Authorization, and Accounting (AAA) framework architecture is designed to protect signaling messages from eavesdropping by malicious attackers. The message exchanges for AAA incur heavy signaling overhead and long network access latency for mobility service. To solve this problem, the most typical approach is to adopt a key caching mechanism so that the authentication can locally be done and so that the signaling overhead can be significantly reduced. However, in the literature, very little work has conducted a thorough analytical study on the proposed key caching scheme. As a result, the statistical behavior of these schemes cannot be well justified. In this paper, we develop an analytical model that describes the key caching behavior in Mobile IP networks. The accuracy of this model is validated by simulations. Based on the performance analysis, we then propose an adaptive algorithm that dynamically adjusts key cache size so that the signaling overhead can be minimized. [ABSTRACT FROM AUTHOR]

This paper presents the topological spatial relations that can exist in the geographical space between a Circular Spatially Extended Point and a Line and describes the use of those spatial relations in the identification of the conceptual neighbourhood graphs that state the transitions occurring among relations. The conceptual neighbourhood graphs were identified using the snapshot model and the smooth-transition model. In the snapshot model, the identification of neighbourhood relations is achieved looking at the topological distance existing between pairs of spatial relations. In the smooth-transition model, conceptual neighbours are identified analysing the topological deformations that may change a topological spatial relation. The graphs obtained were analysed as an alternative to map matching techniques in the prediction of the future positions of a mobile user in a road network. [ABSTRACT FROM AUTHOR]

Abstract: While mobility in the sense of node movement has been an intensively studied aspect of mobile ad hoc networks (MANETs), another aspect of mobility has not yet been subjected to systematic research: nodes may not only move around but also enter and leave the network. In fact, many proposed protocols for MANETs exhibit worst case behavior when an intended communication partner is currently not present. Therefore, knowing whether a given node is currently present in the network can often help to avoid unnecessary overhead. In this paper, we present a solution to the presence detection problem. It uses a Bloom filter-based beaconing mechanism to aggregate and distribute information about the presence of network nodes. We describe the algorithm and discuss design alternatives. We assess the algorithm’s properties both analytically and through simulation, and thereby underline the effectiveness and applicability of our approach. [Copyright &y& Elsevier]

Abstract: Wireless sensor and actor networks (WSANs) can be considered as a combination of a sensor network and an actor network in which powerful and mobile actor nodes can perform application specific actions based on the received data from the sensors. As most of these actions are performed collaboratively among the actors, inter-actor connectivity is one of the desirable features of WSANs. In this paper, we propose a novel distributed algorithm for establishing a connected inter-actor network topology. Considering initially disjoint sets of actors, our algorithm first initiates a search process by using the underlying sensor network in order to detect the possible sub-networks of actors in the region. After these sub-networks are detected, our algorithm pursues a coordinated actor movement in order to connect the sub-networks and thus achieve inter-actor connectivity for all the actors. This coordinated movement approach exploits the minimum connected dominating set of each sub-network when picking the appropriate actor to move so that the connectivity of each sub-network is not violated. In addition, the approach strives to minimize the total travel distance of actors and the messaging cost on both sensors and actors in order to extend the lifetime of WSAN. We analytically study the performance of our algorithm. Extensive simulation experiments validate the analytical results and confirm the effectiveness of our approach. [Copyright &y& Elsevier]

In this paper a new mobility management is introduced. The main idea in this approach is that the mobil node should manage the mobility for itself not the network. The network nodes provide only basic services for mobile entities: connectivity and administration. We construct a framework called the Client-based Mobility Frame System (CMFS) for this mobility environment. We developed the CMFS protocol as a solution over IPv4 and we show how to use Mobile IPv6 to realize our concept. We propose some basic mobility management solutions that can be implemented into the mobile clients and give details about a working simulation of a complete Mobility Management System. Example mobility management approaches such as the centralized- and hierarchical- or cellular-like ones are also defined and hints are given what kind of algorithms might be implemented upon the Client-based Mobility Frame System over IPv4 and IPv6 as well. We introduce some example algorithms that can work with the CMFS making mobility management efficient by minimizing signalling load on the network. In the present work modeling and detailed discussion on the parameters of the algorithms is given and comparison to existing mobility approaches and protocols is done. We prepared a simulation to test our protocol and to back up the proposals we provide the reader with simulation results. We stress that still one the most important benefit of our findings is that all the MNs can run different management strategies and can optimize mobility for themselves. [ABSTRACT FROM AUTHOR]

Wireless mobile networks and devices are becoming increasingly popular to provide users the access anytime and anywhere. We are witnessing now an unprecedented demand for wireless networks to support both data and real-time multimedia traffic. The wireless mobile systems are based on cellular approach and the area is covered by cells that overlap each other. In mobile cellular systems the handover is a very important process. Many handover algorithms are proposed in the literature. However, to make a better handover and keep the QoS in wireless networks is very difficult task. For this reason, new intelligent algorithms should be implemented to deal with this problem. In this paper, we carried out a comparison study of two handover systems based on fuzzy logic. We implement two Fuzzy-Based Handover Systems (FBHS) called FBHS1 and FBHS2. The performance evaluation via simulations shows that FBHS2 has better behavior than FBHS1 and can avoid ping-pong effect in all simulation cases. [ABSTRACT FROM AUTHOR]

Positioning and tracking technologies can detect the location and the movement of mobile nodes (MNs), such as cellular phone, vehicular and mobile sensor, to predict potential handoffs. However, most motion detection mechanisms require additional hardware (e.g., GPS and directed antenna), costs (e.g., power consumption and monetary cost) and supply systems (e.g., network fingerprint server). This paper proposes a Momentum of Received Signal Strength (MRSS) based motion detection method and its application on handoff. MRSS uses the exponentially weighted moving average filter with multiple moving average window size to analyze the received radio signal. With MRSS, an MN can predict its motion state and make a handoff trigger at the right time without any assistance from positioning systems. Moreover, a novel motion state dependent MRSS scheme called Dynamic MRSS (DMRSS) algorithm is proposed to adjust the motion detection sensitivity. In our simulation, the MRSS and DMRSS-based handoff algorithms can reduce the number of unnecessary handoffs up to 44% and save battery power up to 75%. [ABSTRACT FROM AUTHOR]

As functionality of vehicles increases in complexity, the demand on the in-vehicle networks increases as well. Maxi- mum bus utilization often becomes the communication bottleneck. One way to satisfy the high bandwidth requirement for future vehicles is to use a higher bandwidth bus or multiple buses. However, the use of a higher bandwidth bus increases the cost of the network. Similarly, the use of multiple buses increases the cost as well as the complexity of wiring and network handling. Both options are becoming solutions to high bandwidth demand. An alternative option is the development of a higher layer protocol that uses data-reduction (DR) techniques to reduce the amount of data to be transferred. Its goal is to communicate the same amount of information using less bus bandwidth. It would be acceptable, provided that it does not increase the message latencies significantly so that the safety of the vehicle is not compromised. The cost of the protocol is expected to be marginal because it consists of one-time changes to software. Various DR algorithms are available in the literature, but DR technology has not been introduced in in-vehicle protocol standards. This paper presents a unique DR methodology, along with its comparison with other proposed methodologies. The performance of this new DR algorithm is found to be better than that of the existing DR algorithms for a wide range of signal dynamics. The cost, as well as the impact of this protocol on the end-to-end message latency, has been found to be very marginal. [ABSTRACT FROM AUTHOR]

In this paper, we propose an Adaptive Hybrid Transmission (AHT) scheme for on-demand mobile IPTV service over broadband wireless access network (i.e. mobile WiMAX, 802.16e). Proposed algorithm utilizes hybrid mechanism which combines multi-channel multicasting and unicast scheme to enhance not only service blocking probability but also reduce overall bandwidth consumption of the wireless system which has very limited resources compared to wired networks. An adaptive resource allocation algorithm is also proposed, and is shown to achieve minimum blocking probability. In order to evaluate the performance, we compare proposed algorithm against traditional unicast and multicast schemes. [ABSTRACT FROM AUTHOR]

The frequency assignment problem involves the assignment of discrete frequencies to the transmitters of a radio network, such as a radio broadcasting network. Frequency separation is necessary to avoid interference by other transmitters to the signal received from the wanted transmitter at the reception region. Here, it is of major importance to minimize the interference while at the same time using the spectrum efficiently. In this paper we present two original distributed algorithms implemented on clusters of PCs used to solve the frequency assignment problem in the field of radio broadcasting. The first one is based on the island distributed [1] implementation of our hybrid genetic algorithm [2]. The second one uses a distributed cooperative Tabu Search. Experimental results show that our algorithms, applied to several instances given by TDF-C2R, lead to important time performance improvements. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks consist of freely moving nodes responsible of not only forwarding packets for other nodes but can also perform extensive computations. One of the most critical issues in these networks is the significant differences in term of processing and energy capacity between the nodes, inducing a load imbalance. Thus, sharing the load between the overloaded and idle nodes is a necessity in ad hoc networks. In this paper, we present a new load balancing algorithm based on clustering where a subset of nodes 'clusterheads' is elected to maintain some balance within their respective clusters while minimizing the overall communication cost. Our primary goal is to minimize the total execution time of the tasks by distributing the workload among nodes. Another goal is to extend the overloaded nodes lifetime inducing a stability of the network. The simulation results have shown that network performance can be reached by distributing load to idle nodes within the network. [ABSTRACT FROM AUTHOR]

In this paper a new technique of Blind Equalization for Multiple Input Multiple Output (MIMO) Systems is proposed based on Recursive Least Squares (RLS) algorithm and Canonical Correlation Analysis (CCA). A Modified Recursive Least Squares (MRLS) algorithm is introduced based on exponentially weighted recursive least squares. Combined CCA and MRLS (CCAMRLS) have better tracking ability compared to CCARLS when they are applied to MIMO systems which are non stationary. Further improvements include good convergence speed and lower residual Inter Symbol Interface (ISI) as compared to CCA-RLS. [ABSTRACT FROM AUTHOR]

Vehicle-based sensors can be used for traffic monitoring. These sensors are usually set with long sampling intervals to save communication costs and to avoid network congestion. In this paper, we are interested in understanding the traffic-monitoring performance that we can expect from such vehicle-based mobile sensor networks, despite the incomplete information provided. This is a fundamental problem to be addressed. A performance evaluation has been carried out in Shanghai, China, by utilizing the vehicle-based sensors installed in about 4000 taxies. Two types of traffic status-estimation algorithms, i.e., the link-based and the vehicle-based, are introduced and analyzed. The results show that estimations of the traffic status based on these imperfect data are reasonably accurate. Therefore, the feasibility of such an application is demonstrated. [ABSTRACT FROM AUTHOR]

The hierarchical architecture has been proven effective for solving the scalability problems in large-scale ad hoc networks. The stability of the hierarchical architecture is a key factor in determining the network performance. Although many solutions have been proposed to construct stable clusters, the maximum stability achievable in mobile environments is still unknown. In this paper, we define three metrics for measuring network stability: 1) the cluster lifetime; 2) the intercluster link lifetime; and 3) the end-to-end path lifetime. We model and analyze the maximum of these lifetimes under the constraint of random node mobility. Analytical results provide the fundamental understanding of the bounds on network stability. Inspired by this understanding, we propose a clustering algorithm and a hierarchical routing protocol that work together to achieve the maximum network stability. The analytical results are verified by simulations. [ABSTRACT FROM AUTHOR]

The stationary signal-strength-difference (SSSD)-based positioning technique has been proposed as a cost-effective, low-complexity solution. The positioning accuracy with this technique, however, is limited, as a result of the large error in the distance. In this paper, we contribute a simple and efficient method for the accuracy improvement issues in the distance. Starting from the concept of the Global Positioning System (GPS) pseudorange (PD) equation, a complete set of distance difference (DD) is formulated. In addition, we then correct the error in the distance by going in the set of DD, based on the least-squares (LS) sense. The theoretical model is established and verified via experimental data gathered in an urban environment. Results clearly show that the proposed method performs well when encountering a large error in the distance. On top of this, we investigate the accuracy improvement issues in the location estimation and propose an iterative LS algorithm by using the corrected distances. The positioning accuracy is studied based on the analysis of different location errors, and the effect of geometric dilution of precision (GDOP) is also investigated. The improvement of the positioning accuracy is clearly demonstrated through the experimental data collected at 55 different test points with 25 133 samples, which is outstanding. [ABSTRACT FROM AUTHOR]

Mobile P2P (MP2P) network has been widely used in everyday life combined with the wireless technology development. However, most previous works concentrate on the assumption that the mobile peers are identical of their inner properties in compositing a MP2P network. However, in current network environment, heterogeneous devices are widely used; they may have different storage sizes, data transmission rate, processing ability and even security levels. In such kind of MP2P Network environment, how to make data transmission effectively is challenge. In this paper, we concentrate on how to effectively obtain a queried multimedia resource and generate a path for such data transmission on the overlay MP2P network, so as to make the resource more effectively transmit among the heterogeneous peers. A new path generating algorithm called SPF-A* (Super Peer First A*) is devised, and simulation studies are conducted to validate our proposal. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are an important tool for monitoring distributed remote environments. As one of the key technologies involved in WSNs, node fault detection is indispensable in most WSN applications. It is well known that the distributed fault detection (DFD) scheme checks out the failed nodes by exchanging data and mutually testing among neighbor nodes in this network., but the fault detection accuracy of a DFD scheme would decrease rapidly when the number of neighbor nodes to be diagnosed is small and the node's failure ratio is high. In this paper, an improved DFD scheme is proposed by defining new detection criteria. Simulation results demonstrate that the improved DFD scheme performs well in the above situation and can increase the fault detection accuracy greatly. [ABSTRACT FROM AUTHOR]

In active networks, programs can be injected to network elements (routers/switches). This allows programmers to enhance existing protocols or deploy new protocols. AMTree protocol is an active network based protocol that makes sending packets to receivers, after source migration, an efficient process. In AMTree protocol, after source migration, handoff latency computed from the time of reconnecting to a new base station until finding nearest core to the mobile source. In this paper we present two new algorithms to minimize the handoff latency in AMTree protocol. We show that handoff latency is much lower than that of AMTree handoff algorithm if the mobile source connects to a base station which is subscribed to the multicast group. Also we show that our algorithm gets better results than AMTree if the new base station is not in the multicast group. [ABSTRACT FROM AUTHOR]

Abstract: Orthogonal variable spreading factor (OVSF) codes provide variable data rate transmissions for different bandwidth requirements in 3G WCDMA networks. In order to effectively utilize limited OVSF resources, many works in the literature have focused on dynamic code assignment (DCA) schemes. This paper investigates genetic algorithm (GA) based approach for dynamic OVSF code assignment in WCDMA networks. Different from existing conventional code assignment (CCA) and dynamic code assignment schemes, population is adaptively constructed according to existing traffic density in the OVSF code-tree. In order to improve the ability of the GA, we employ so-called “dominance & diploidy” structure to adapt to changing traffic conditions. Performances of these two methods are evaluated in terms of blocking probability and spectral efficiency, and also compared with CCA and DCA. The simulation results show that the GA, especially with diploid structure, provides reduced code blocking probability and improved spectral efficiency in the system when compared to the CCA and DCA schemes. In addition to these, different GA operators are also tested under varying traffic loads to increase the overall system performance. [Copyright &y& Elsevier]

The rapid proliferation of mobile applications and services has introduced new vulnerabilities that do not exist in fixed wired networks. Traditional security mechanisms, such as access control and encryption, turn out to be inefficient in modern wireless networks. Given the shortcomings of the protection mechanisms, an important research focuses in intrusion detection systems (IDSs). This paper proposes a multilayer statistical intrusion detection framework for wireless networks. The architecture is adequate to wireless networks because the underlying detection models rely on radio parameters and traffic models. Accurate correlation between radio and traffic anomalies allows enhancing the efficiency of the IDS. A radio signal fingerprinting technique based on the maximal overlap discrete wavelet transform (MODWT) is developed. Moreover, a geometric clustering algorithm is presented. Depending on the characteristics of the fingerprinting technique, the clustering algorithm permits to control the false positive and false negative rates. Finally, simulation experiments have been carried out to validate the proposed IDS. [ABSTRACT FROM AUTHOR]

In this paper, a framework is proposed to improve the effectiveness of the long-term-evolution vehicle-to-vehicle (LTE-V2V) communication system, where the uplink channel of the cellular user equipment (CUE) is reused by multiple V2V links. Since the orthogonal channels occupied by each CUEs are multiplexed by multiple V2V links, the serious interference is generated in the co-tier layer and cross-tier layer. In order to minimize the co-channel interference between CUE link and V2V links, an optimized resource sharing scheme is proposed. Firstly, Fuzzy C-means (FCM) algorithm is proposed to perform the clustering based on the geographical location characteristics of V2V links. In the FCM algorithm, the adjacent V2V links are grouped into a cluster to facilitate the solution of the channel allocation problem. Assuring the V2V links in the same cluster do not share the same channel, the adjacent V2V links are avoided to reuse the same channel. On this basis, the use of reasonable channel allocation scheme can effectively reduce the co-channel interference. Considering that the channel state information (CSI) of mobile links is slowly faded, the total system capacity is maximized by leveraging the CSI while the reliability can be guaranteed for all V2V links. The outage probability constraint is used to ensure the reliability of all V2V links. The channel assignment problem of V2V links is formulated as a weighted two-dimensional matching problem, and the interference bipartite graph is constructed. Finally, Kuhn Munkras (KM) algorithm is introduced to allocate the uplink orthogonal channel of CUEs for the V2V links in the same class in order to maximize the total system capacity. Numerical simulation results show that the algorithm can improve the total system capacity. [ABSTRACT FROM AUTHOR]

Abstract-This paper proposes a dynamic resource-allocation (DRA) algorithm for packet data services in wireless communication systems based on Hopfield neural networks (HNNs). The resource-allocation algorithm assumes a delay-centric approach in that it maximizes resource utilization of the overall system while minimizing the packet delay. The real-time (RT) working capability of HNN hardware implementation means that a very powerful scheduling DRA algorithm can be obtained. A generic formulation of the algorithm is presented to establish the optimal bit rate allocation. In addition, some illustrative examples of this formulation are given, considering specific wireless communication systems, such as General Packet Radio Service (GPRS) or Universal Mobile Telecommunications System (UMTS). lo be more precise, the performance of the proposed DRA algorithm is evaluated in a realistic UMTS scenario, considering both RT and nonreal-time (NRT) services. To obtain the best resource distribution and fulfill the different quality-of-service (QoS) levels required by RT and NRT services, the new HNN-based delay-centric DRA algorithm is performed twice. Initially, only the RT services are considered, and following this, all the NRT services are taken into account. The results reveal that the proposed DRA algorithm outperforms other reference algorithms in terms of not only average packet delay but the allocated total bit rate as well. [ABSTRACT FROM AUTHOR]

This paper considers the coverage problem for hybrid networks which comprise both static and mobile sensors. The mobile sensors in our network only have limited mobility, i.e., they can move only once over a short distance. In random static sensor networks, sensor density should increase as O(log L + k log log L) to provide k-coverage in a network with a size of L. As an alternative, an all-mobile network can provide k-coverage with a constant density of O(k), independent of network size L. We show that the maximum distance for mobile sensors is O(1/√k log3/4(kL)). We then propose a hybrid network structure, comprising static sensors and a small fraction of O(1/√k) of mobile sensors. For this network structure, we prove that k-coverage is also achievable with a constant sensor density of O(k). Furthermore, for this hybrid structure, we prove that the maximum distance which any mobile sensor has to move is bounded as O(log3/4 L). We then propose a distributed relocation algorithm, where each mobile sensor only requires local information in order to optimally relocate itself. We verify our, analysis via extensive numerical evaluations and show an implementation of the mobility algorithm on real mobile sensor platforms. [ABSTRACT FROM AUTHOR]

While the voice over Internet protocol (VoIP) services is expected to be widely supported in wireless mobile networks, the performance of VoIP services has not previously been evaluated in the IEEE 802.16e orthogonal frequency division multiple access (OFDMA) system taking the adaptive modulation and coding scheme into consideration. To support real-time uplink service flows, three different types of scheduling have been designed in the IEEE 802.16e standard: the unsolicited grant service (UGS), the real-time polling service (rtPS), and the extended rtPS (ertPS). In this paper, we compare the three real-time scheduling algorithms in terms of the performance of VoIP services by using the analytical and simulation models that we developed. [ABSTRACT FROM AUTHOR]

Abstract  With the increasing demands for radio spectrum, techniques are being explored that would allow dynamic access of spectrum bands that are under-utilized. In this regard, a new paradigm called dynamic spectrum access is being investigated where wireless service providers (WSPs) would dynamically seek more spectrum from the under-utilized licensed bands when and where they need without interfering with the primary users. Currently, there is little understanding on how such a dynamic allocation will operate so as to make the system feasible under economic terms. In this paper, we consider the dynamic spectrum allocation process where multiple WSPs (bidders) compete to acquire necessary spectrum band from a common pool of spectrum. We use auction theory to analyze the allocation process when the demand from WSPs exceeds the available spectrum. We investigate various auction mechanisms under different spectrum allocation constraints to find WSPs’ bidding strategies and revenue generated by spectrum owner. We show that sequential bidding of bands provides better result than the concurrent bidding when WSPs are constrained to at most single unit allocation. On the other hand, when the bidders request for multiple units, (i.e., they are not restricted by allocation constraints) synchronous auction mechanism proves to be beneficial than asynchronous auctions. [ABSTRACT FROM AUTHOR]

In this paper, based on a distributed particle filter, two tracking algorithms are proposed for tracking mobile targets in cluster-based underwater sensor networks (USNs). Both tracking algorithms run local particle filter sequentially at each cluster along target trajectories, but they adopt different methods of selecting measurements from sensor nodes to balance the information contribution against the cost. Performance metrics are proposed and discussed in terms of tracking performance, communication cost, energy cost, and tracking response time. Simulations are conducted to quantitatively compare the proposed algorithms as well as another tracking algorithm based on extended Kalman filter (EKF). Our results indicate that one tracking algorithm achieves higher tracking accuracy while the other achieves dramatic reduction of communication cost, energy cost, and tracking response time. Furthermore, performance of two tracking algorithms has been studied in terms of detection threshold and sensor density. Copyright © 2008 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper presents an algorithm for positioning circles in a given region to maximise the covered area. Our algorithm has applications in wireless networks, such as positioning a given number of mobile stations in a given region, one goal of which is to cover the largest area possible. Although the evaluation of the function value, i.e., the total covered area, is difficult, we bypass this difficulty by calculating the gradient of the total covered area directly. As long as nodes continuously move in directions that guarantee increasing coverage, a configuration of node positions corresponding to a maximal covered area can eventually be identified. [ABSTRACT FROM AUTHOR]

We present a new 3D mesh codec for mobile devices. Mobile devices have limited resources such as low memory, slow CPU speed, low power, and no floating-point processor. Considering these mobile characteristics, we suggest a new approach: a hybrid of a progressive geometry and a single-rate connectivity coding. By this approach, our algorithm achieves fast visual updates of progressive 3D point clouds on a small screen of a mobile device and later finalizes restoring faces of the mesh without intensive computing. For a progressive geometry coding, an octree is created and coded. For a single-rate connectivity coding, a new distance based algorithm is introduced. Our algorithm uses only fixed-point arithmetic with simple data structures. Our new 3D mesh codec has been tested on a real mobile phone and the statistical and visual results are also presented in this paper. [ABSTRACT FROM AUTHOR]

Most mobile devices are equipped with a NAND flash memory even if it has characteristics of not-in-place update and asymmetric I/O latencies among read, write, and erase operations: write/erase operations are much slower than a read operation in a flash memory. For the overall performance of a flash memory system, the buffer replacement policy should consider the above severely asymmetric I/O latencies. However, existing LRU buffer replacement algorithm cannot deal with the above problem. This paper proposes the LRU-WSR buffer replacement algorithm that enhances LRU by reordering writes of not-cold dirty pages from the buffer cache to flash storage. The enhanced LRU-WSR algorithm focuses on reducing the number of write/erase operations as well as preventing serious degradation of buffer hit ratio. The experimental results show that the LRU-WSR outperforms other algorithms including LRU, CF-LRU, and FAB. [ABSTRACT FROM AUTHOR]

Abstract: Information fusion can assist in the development of sensor network applications by merging capabilities, raw data and decisions from multiple sensors through distributed and collaborative integration algorithms. In this paper, we introduce a multi-layered, middleware-driven, multi-agent, interoperable architecture for distributed sensor networks that bridges the gap between the programmable application layer consisting of software agents and the physical layer consisting of sensor nodes. We adopt an energy-efficient, fault-tolerant approach for collaborative information processing among multiple sensor nodes using a mobile-agent-based computing model. In this model the sink/base-station deploys mobile agents that migrate from node to node following a certain itinerary, either pre-determined or determined on-the-fly, and fuse the information/data locally at each node. This way, the intelligence is distributed throughout the network edge and communication cost is reduced to make the sensor network energy-efficient. We evaluate the performance of our mobile-agent-based approach as well as that of the traditional client/server-based computing model, vis-à-vis energy consumption and execution time, through both analytical study and simulation. We draw important conclusions based on our findings. Finally, we consider a collaborative target classification application, supported by our architectural framework, to illustrate the efficacy of the mobile-agent-based computing model. [Copyright &y& Elsevier]

In this paper, we seek to improve understanding of the structure of human mobility, with a view to using this for designing algorithms for the dissemination of data among mobile users. We analyse community structures and node centrality from the human mobility traces and use these two metrics to design efficient forwarding algorithms in terms of delivery ratio and delivery cost for mobile networks. This is the first empirical study of community and centrality using real human mobility datasets. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid estimation of distribution algorithm (HyEDA) to address the design problem of code division multiple access cellular system configuration. Given a service area, the problem is to find a set of optimal locations of base stations, associated with their corresponding powers and antenna heights in the area, in order to maximize call quality and service coverage, at the same time, to minimize the total cost of the system configuration. HyEDA is a two-stage hybrid approach which integrates an estimation of distribution algorithm, a K-means clustering method, and a simple local search algorithm. We have compared HyEDA with a simulated annealing method on a number of instances. Our simulation results have demonstrated that HyEDA outperforms the simulated annealing method in terms of the solution quality and computational cost. [ABSTRACT FROM AUTHOR]

Historically, Error-Resilient (ER) video transmission and Super-Resolution (SR) image reconstruction techniques have evolved separately. In this paper, we propose a coordinated application of ER and SR to enhance the resolution of image transmitted over mobile ad-hoc networks. In order to combat error propagation, a flexible multiple description coding method based on shifted 3-D SPIHT (3-D Set Partitioning In Hierarchical Trees) algorithm is presented to generate variable independent descriptions (substreams) according to the network condition. And then, a novel unequal error protection strategy based on the priority level is provided to assign a higher level of error protection to more important parts of bitstream. Moreover, a robust SR algorithm is proposed in the presence of different kinds of packet loss rate to enhance the image resolution. Experimental results indicate that the proposed robust resolution-enhancement scheme outperforms the competing methods from the aspects of PSNR (Peak-Signal-to- Noise Ratio) and visual quality under different packet loss rates. [ABSTRACT FROM AUTHOR]

In this paper, we describe a CRC-based optimal blind transport format determination algorithm with application to the UMTS uplink. The derivation, based on MAP detection, is presented and simulation results under both AWGN and fading channel conditions are given. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a network-based approach for access and interface selection (AIS) in the context of resource management in heterogeneous wireless environments (UMTS, WLAN and DVB-T). We focus on the optimization of resource utilization, while ensuring acceptable quality of service (QoS) provision to the end users. Our objective is to optimally manage the overall system resources and minimize the possibility of QoS handovers (non-mobility handovers). The adopted architecture applies to typical heterogeneous environments and network entities (Access Routers) are enhanced with extra functionalities. We propose an AIS algorithm that exploits the multihoming concept and globally manages network resources at both radio access and IP backbone networks. The algorithm can estimate near-optimal solutions in real time and we also introduce a novel triggering policy. We present simulation results of typical scenarios that demonstrate the advantages of our approach. System performance metrics, derived from the simulations, show minimum degradations in high load and congestion situations. Copyright © 2007 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]