Search

Highlights • We provide computational intelligence method for different levels of the system. • We describe the development direction of the intelligent system. • We introduce the basic state-of-the-art concepts of data mining. • We validate the performance of the model with discussions on applications. Abstract The integration of intelligent system mainly includes the application of intelligent technology, such as artificial intelligence and computational intelligence method, which is used in different levels of the system. This paper introduces the application and technology of several intelligent system integrations, the advantages and disadvantages of learning theory and expert system. Neural network is applied in intelligent systems and we use scope reviewed several new development of intelligent technology, plus this paper describes the development direction of the intelligent system. This paper introduces the basic concepts of data mining, including data mining technology, artificial intelligence, machine learning, statistical analysis, fuzzy logic, pattern recognition and artificial neural networks and other technologies. We analyze the structure of the general algorithm of data mining, and classify the data mining technology in details, including more than 10 techniques of decision tree technology, neural network technology, rough set and fuzzy set. Finally, the research directions of data mining in artificial intelligence, e-commerce applications and mobile communication computing are discussed. [ABSTRACT FROM AUTHOR]

Mobile systems, such as smartphones, are becoming the primary platform of choice for a user’s computational needs. However, mobile devices still suffer from limited resources such as battery life and processor performance. To address these limitations, a popular approach used in mobile cloud computing is computation offloading, where resource-intensive mobile components are offloaded to more resourceful cloud servers. Prior studies in this area have focused on a form of offloading where only a single server is considered as the offloading site. Because there is now an environment where mobile devices can access multiple cloud providers, it is possible for mobiles to save more energy by offloading energy-intensive components to multiple cloud servers. The method proposed in this paper differentiates the data- and computation-intensive components of an application and performs a multisite offloading in a data and process-centric manner. In this paper, we present a novel model to describe the energy consumption of a multisite application execution and use a discrete time Markov chain (DTMC) to model fading wireless mobile channels. We adopt a Markov decision process (MDP) framework to formulate the multisite partitioning problem as a delay-constrained, least-cost shortest path problem on a state transition graph. Our proposed Energy-efficient Multisite Offloading Policy (EMOP) algorithm, built on a value iteration algorithm (VIA), finds the efficient solution to the multisite partitioning problem. Numerical simulations show that our algorithm considers the different capabilities of sites to distribute appropriate components such that there is a lower energy cost for data transfer from the mobile to the cloud. A multisite offloading execution using our proposed EMOP algorithm achieved a greater reduction on the energy consumption of mobiles when compared to a single site offloading execution. [ABSTRACT FROM AUTHOR]

Narrow band adaptive multi-rate (AMR-NB) is a speech codec that supports multiple bit-rate modes and is widely used in mobile communication systems. However, the synthesized speech quality of its lower bit-rate modes is not very satisfying. This paper aims to improve the synthesized speech quality of the lower bit-rate modes of AMR-NB (e.g., 4.75kb/s) by optimizing its post-processing algorithm. The optimization mainly focuses on four modules including the formant filter with adjusted correction factor, the fixed codebook gain smoothing, the adaptive gain control and the anti-sparse processing. The experimental results show that the AMR-NB codec with the optimized post-processing algorithm achieves an obvious improvement of the synthesized speech quality, and the lower bit-rate mode achieves the bigger improvement. [ABSTRACT FROM AUTHOR]

In this paper we apply a novel meta-heuristic approach, the Coral Reefs Optimization (CRO) algorithm, to solve a Mobile Network Deployment Problem (MNDP), in which the control of the electromagnetic pollution plays an important role. The CRO is a new bio-inspired meta-heuristic algorithm based on the growing and evolution of coral reefs. The aim of this paper is therefore twofold: first of all, we study the performance of the CRO approach in a real hard optimization problem, and second, we solve an important problem in the field of telecommunications, including the minimization of electromagnetic pollution as a key concept in the problem. We show that the CRO is able to obtain excellent solutions to the MNDP in a real instance in Alcalá de Henares (Madrid, Spain), improving the results obtained by alternative algorithms such as Evolutionary, Particle Swarm Optimization or Harmony Search algorithms. [ABSTRACT FROM AUTHOR]

Abstract: The paper proposes a scheme on achieving all-IP communication between wireless sensor networks and IPv6 networks based on sensor nodes'' location information. The paper proposes the sensor node''s IPv6 address structure based on location information, the IPv6-address configuration algorithm based on the proposed IPv6 address structure, the mobility handoff algorithm and the routing algorithm in the link layer. The location information of sensor nodes is utilized to achieve the IPv6-address configuration algorithm and the routing algorithm. In the mobility handoff algorithm, neither does a mobile sensor node need a care-of address during the mobility process, nor is involved in the mobility handoff process. Therefore, a mobile sensor node''s power consumption is reduced and the life span is prolonged. The paper analyzes the performances of the proposed scheme and the existing schemes, and the analytical data show that the performance of the proposed scheme is better. [Copyright &y& Elsevier]

Abstract: The challenges confronting in mobile grid systems are: limited CPU power, limited memory, small screen, short battery life, and intermittent disconnection. Considering all these limitations, this paper is targeted to control energy consumption without compromising system’s performance in mobile grid. In this paper, we focus on using the mobile devices on the mobile grid environment. Mobile devices can serve two important functions in mobile grid environment either as service consumer or as valuable service providers. The proposed approach is not only to reduce energy consumption, but also to improve system performance in mobile grid environment. Utility functions are used to express grid users’ requirements, resource providers’ benefit function and system’s objectives. Dynamic programming is used to optimize the total utility function of mobile grid. A distributed controlling energy algorithm in mobile grid environment is proposed which decomposes mobile grid system optimization problem into sub-problems. In order to verify the efficiency of the proposed algorithm, in the experiment, the performance evaluation of controlling energy algorithm is conducted. [Copyright &y& Elsevier]

Abstract: Wireless mesh networks are an attractive technology for providing broadband connectivity to mobile clients who are just on the edge of wired networks, and also for building self-organized networks in places where wired infrastructures are not available or not deemed to be worth deploying. This paper investigates the joint link scheduling and routing issues involved in the delivery of a given backlog from any node of a wireless mesh network towards a specific node (which acts as a gateway), within a given deadline. Scheduling and routing are assumed to be aware of the physical interference among nodes, which is modeled in the paper by means of a signal-to-interference ratio. Firstly, we present a theoretical model which allows us to formulate the task of deriving joint routing and scheduling as an integer linear programming problem. Secondly, since the problem cannot be dealt with using exact methods, we propose and use a technique based on genetic algorithms. To the best of our knowledge, these algorithms have never been used before for working out these kinds of optimization problems in a wireless mesh environment. We show that our technique is suitable for this purpose as it provides a good trade-off between fast computation and the overall goodness of the solution found. Our experience has in fact shown that genetic algorithms would seem to be quite promising for solving more complex models than the one dealt with in this paper, such as those including multiple flows and multi-radio multi-channels. [Copyright &y& Elsevier]

Abstract: In this paper we present an adaptive application-driven power management (AADPM) strategy with online idle period length distribution learning capability for the IEEE 802.11b WLAN. We discuss its design and evaluate the performance in comparison with other power management strategies using the network simulator NS2. We simulated both the single user and multiple user scenarios. Experimental results have shown that, compared with other power management methods examined in this paper, AADPM achieved the highest energy saving in all cases and it demonstrated strong adaptability to network congestion. [Copyright &y& Elsevier]

Abstract: This paper presents an extension of the terminal assignment problem (TA) in the case that groups of terminals must be assigned together. We analyze this situation by means of an equivalent problem: the wedding banquet problem (WBP). We provide a description of the problem and its mathematical definition. We also describe an application of the WBP to mobile communications network design. Two hybrid metaheuristics algorithms for the WBP are presented in the paper. We test their performance in several computational experiments, including synthetic instances of the WBP, and a mobile network design application. [Copyright &y& Elsevier]

Proximity user equipments (UEs) in mobile networks may be communicated directly without passing their traffic through the base station by using device-to-device (D2D) communications. This can be done using the underlaying approach in which the D2D-UEs (DEs) are allowed to use the same resources allocated for cellular UEs (CEs), which can enhance the spectral efficiency. However, if the resource allocation for DEs is not designed appropriately, it would generate harmful interference on CEs communications. Therefore, this paper addresses a resource allocation and power control problems for D2D communications underlaying multi-cell mobile networks with the consideration of the inter-cell and intra-cell interferences. The problem is formulated to maximise the network performance in terms of achieved throughput while ensuring the quality-of-service (QoS) constraints for CEs and DEs. A two-step algorithm is proposed in which the admission control is performed firstly to determine the set of possible D2D connections and their CE partners that achieve the minimum QoS demands. Then, the optimal power for each permissible DE and its possible partners in different cells are allocated to maximise the network throughput. Simulation results illustrate that the suggested algorithm can remarkably enhance the performance of the network in terms of throughput gain and access rate. [ABSTRACT FROM AUTHOR]

To guarantee the road safety by avoiding collisions at the intersections is one of the major tasks of intelligent transportation systems (ITSs), which contributes to the minimal fatalities and property loss in crashes. This paper proposes an effective algorithm for infrastructure-cooperative intersection accident pre-warning system with the aid of vehicular communications. The proposed algorithm realizes accurate and efficient collision avoidances through five steps, i.e., defining variable, reasoning the vehicles evolution state, verifying safe driving behavior, assessing risk, and making decision. The critical factors are theoretically analyzed, and a vehicle state evolution model based on the Dynamic Bayesian Networks (DBNs) is established. The efficient risk assessment method based on identifying the dangerous driving behavior at intersection and different collision avoidance strategies are proposed according to the actual situation. Finally, extensive simulations are carried out to verify the performance of the proposal, and simulation results show that the proposed algorithm can effectively detect risk and accurately migrate the collision. [ABSTRACT FROM AUTHOR]

Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses in identifying similar functions or roles of nodes in many biological, social and computer networks. With the availability of very large networks in recent years, performance and scalability of community detection algorithms become crucial, i.e. if time complexity of an algorithm is high, it cannot run on large networks. In this paper, we propose a new community detection algorithm, which has a local approach and is able to run on large networks. It has a simple and effective method; given a network, algorithm constructs a preference network of nodes where each node has a single outgoing edge showing its preferred node to be in the same community with. In such a preference network, each connected component is a community. Selection of the preferred node is performed using similarity based metrics of nodes. We use two alternatives for this purpose which can be calculated in 1-neighborhood of nodes, i.e. number of common neighbors of selector node and its neighbors and, the spread capability of neighbors around the selector node which is calculated by the gossip algorithm of Lind et.al. Our algorithm is tested on both computer generated LFR networks and real-life networks with ground-truth community structure. It can identify communities accurately in a fast way. It is local, scalable and suitable for distributed execution on large networks. [ABSTRACT FROM AUTHOR]

• A real-time application for secure data transmission using a different approach. • The receiver system requires a confirmation signal to perform necessary action. • Utilizing chaos dynamics for generating secret codes used in the algorithm. • The transmitted data can be a simple bit or any multimedia data of major systems. In today's technology, remote control or access is widely used in many platforms. However, the fact that remotely controlled platforms are open to external attacks or not secure enough which can have serious negative consequences. In this paper, a real-time LoRa modulation based data transmission application is achieved. The security of remotely transmitted data is not only provided with a basic encryption structure, but also a confirmation signal based transceiver system is designed in which the required process is performed only with a certain time interval. Firstly, the data to be transmitted is mixed with a secret key using XOR operation then transmitter creates a random period of time that specifies how long after the confirmation signal will be sent relative to the data signal. Hence, the entire system security is enhanced by the timing algorithm running with millisecond precision between the transceiver circuits. Encryption of the confirmation signal in a similar structure as the data signal improves security of the entire system. In this application, a PWM signal containing voltage information has been successfully transmitted in ciphered form using LoRa modulation. The designed algorithm for the receiver and transmitter circuits has been tested and verified in real time application. Experimental results show that the proposed scheme can be applied to any application-based communication system. [ABSTRACT FROM AUTHOR]

Micro-cloud, as one kind of mobile cloud computing modes, can reduce network delay and alleviate resource constraint of mobile devices. In this mode, mobile devices use their idle resources to provide services for others. Due to the mobility, irregularity of mobile devices, the stability problem of micro-cloud environment still remains challenging. In order to increase the stability of micro-cloud and decrease network delay, the interest-related and location-aware micro-cloud topology is proposed in this paper. The interest-related mobile device nodes are classified into the same micro-cloud which can raise the probability of resource reuse. For reducing failed requests and enhancing the scalability of micro-cloud topology, both node location and node service capacity are considered. Moreover, the bacteria foraging-based offloading algorithm for interest-related micro-cloud topology is proposed, which is an energy-efficient and response time constraint offloading approach. The experiments are conducted and the experiment results show that the location-aware interest-related micro-cloud topology has better stability and scalability, while the bacteria foraging-based offloading algorithm performs better in terms of reducing response time and energy. [ABSTRACT FROM AUTHOR]

Saving energy is a most important challenge in Mobile Wireless Sensor Networks (MWSNs) to extend the lifetime, and optimal coverage is the key to it. Therefore, this paper proposes a Centralized Immune-Voronoi deployment Algorithm (CIVA) to maximize the coverage based on both binary and probabilistic models. CIVA utilizes the multi-objective immune algorithm that uses the Voronoi diagram properties to provide a better trade-off between the coverage and the energy consumption. The CIVA algorithm consists from two phases to improve the lifetime and the coverage of MWSN. In the first phase, CIVA controls the positions and the sensing ranges of Mobile Sensor Nodes (MSNs) based on maximizing the coverage and minimizing the dissipated energy in mobility and sensing. While the second phase of CIVA adjusts the radio (sleep/active) of MSNs to minimize the number of active sensors based on minimizing the consumption energy in sensing and redundant coverage and preserving the coverage at high level. The performance of the CIVA is compared with the previous algorithms using Matlab simulation for different network configurations with and without obstacles. Simulation results show that the CIVA algorithm outperforms the previous algorithms in terms of the coverage and the dissipated energy for different networks configurations. [ABSTRACT FROM AUTHOR]

Mobile Cloud Computing (MCC) enables mobile devices to use resource providers other than mobile devices themselves to host the execution of mobile applications. Various mobile cloud architectures and scheduling algorithms have been studied recently. However, how to utilize MCC to enable mobile devices to run complex real-time applications while keeping high energy efficiency remains a challenge. In this paper, firstly, we introduce the local mobile clouds formed by nearby mobile devices and give the mathematical models of the mobile devices and their applications. Secondly, we formulate the scheduling problem in local mobile clouds. After describing the resource discovery scheme and the adaptive, probabilistic scheduling algorithm, we finally validate the performance of the proposed algorithm by simulation experiments. [ABSTRACT FROM AUTHOR]

Vehicular communications will be the next quality step in the development of automotive technologies. Defining these communications is currently in the final step of development, the focus being on standardization and field tests of network devices and Advanced Driver Assistance Systems. However, some issues regarding vehicular communications that require a specific research effort are still open and represent a challenge if the technology is to be ultimately implemented and marketed. One of these challenges is to develop effective GeoNetworking in vehicular communications. This concept means that the Vehicle Ad-hoc NETwork (VANET) data package transmission is organized according to the topographical location of the different network nodes (vehicles), with the data flow being organized optimally so as to cover the surroundings of each vehicle. The core of this GeoNetworking system is the GeoRouting algorithm that supports the optimal routing of the data packages and reorganizes the network structure in accordance with the positions of the nodes. In this paper we present a novel GeoRouting algorithm for unicast communications, based on the evolution of the previous results of vehicular mesh networks using IEEE 802.15.4 Wireless Sensor Networks (WSN) technology. This algorithm has been designed, implemented and validated under controlled conditions and tested in real vehicles on real roads with free-flow traffic. The results suggest that the features of this routing algorithm can be inserted into any vehicular architecture to provide functioning GeoNetworking that will support a wide range of Advanced Driving Assistance System (ADAS) applications. [ABSTRACT FROM AUTHOR]

In this paper, we study mobile sensor network (MSN) architectures and algorithms for monitoring a moving phenomenon in an unknown and open area using a group of autonomous mobile sensor (MS) nodes. Monitoring a moving phenomenon involves challenges due to limited communication/sensing ranges of MS nodes, the phenomenon’s unpredictable changes in distribution and position, and the lack of information on the sensing area. To address the challenges and meet the objective of the maximization of weighted sensing coverage, we propose a novel scheme, namely VirFID (Virtual Force (VF)-based Interest-Driven moving phenomenon monitoring). In VirFID, MS nodes move toward the positions where more interesting sensing data can be obtained by utilizing the virtual force, which is calculated based on the distance between MS nodes and sensed values in the area of interest. MS nodes also perform network-wise information sharing to increase the weighted sensing coverage. Depending on the level of information used, three variants of VirFID are evaluated: VirFID-LIB (Local Information-Based), VirFID-GHL (Global Highest and Lowest), and VirFID-IBN (Interests at Boundary Nodes). In addition, an analytical model for estimating MSN speed is designed. Simulations are performed to compare the performance of three VirFID variants with other approaches. Our simulation results show that VirFID algorithms outperform other schemes in terms of the weighted coverage efficiency, and VirFID-IBN achieves the highest weighted coverage efficiency among VirFID variants. [ABSTRACT FROM AUTHOR]

Mobile communication technology can be used for the activation of explosive devices from more remote locations using the short messaging system. The platform eliminates the need for the detonator to be near the Improvised Explosive Devices. It eliminates the need for line of sight between the transmitter and the receiver and can also be used to activate multiple IEDs from one location with one message. This paper presents the development of an algorithm for the minimization or delayed activation of suspected SMS triggered explosive device. It will also enable the detection of GSM enabled IEDs before they are activated and the localization of the source mobile for the trigger SMS in real-time with a possibility of stopping the delivery of such suspected SMS trigger messages. [ABSTRACT FROM AUTHOR]

Abstract: Mobile sinks can be a solution to solve the problem that energy consumption of sensor nodes is not balanced in Wireless Sensor Networks (WSN). Caused by the sink mobility, the paths between the sensor nodes and the sink change with time. It is necessary to find a protocol that can find efficient routings between the mobile sink and sensor nodes but do not consume too many network resources. In this paper, we propose an algorithm called virtual-node greedy embedding (VGE) to embed the topology of a WSN into hyperbolic plane without the physical geographic information. This algorithm gives each node a virtual coordinate that guarantees the greedy forwarding of the packets from sensor nodes to the sink when there is no failed node in WSN, even if some obstacles exist in the network. VGE keeps the greedy property when new nodes join the network after the initial embedding and does not change the node coordinates assigned previously. Based on the characteristic of embedding process, modified gravity-pressures (MGP) algorithm is proposed to find a routing path quickly when there are some failed nodes in WSN. Furthermore, particular solutions of the parameters in VGE are presented with concise style, and the simulations show that our algorithm has an efficient performance. [Copyright &y& Elsevier]

Abstract: To guide users who attempt to deploy wireless networks in military applications, there is an evolving need for developing systematic methodologies to analyze/predict the performance of mobile ad hoc networks (MANETs). In addition, the advance in cognitive networking research provides opportunities for exploiting unused spectrum to optimize throughput of MANETs. However, with the increasing number of parameters/constraints, there is even a more demanding need to develop automated methodologies to design/tune such networks. In this work, we study the concepts and challenges for automatic design/re-configuration of cognitive MANETs, in addition to proposing design automation algorithms. The paper is divided into two parts. In the first part, we describe the design objectives, imposed constraints, and involved parameters in MANET design. We discuss how cognitive techniques can be employed to exploit the unused spectrum in military architectures. We then discuss the challenges that face the design/re-configuration of a cognitive network and their implications at different network layers. We also describe possible implementation options for designing MANETs that employ cognitive features at all layers. In the second part of this work, we propose design automation algorithms for optimally setting parameters to achieve a desired objective and satisfy certain constraints. Despite providing the optimal configuration, the simple approach of testing all possible combinations of parameter settings has significant time complexity (the COMB approach). Thus, we propose a novel heuristic (Sequential Parameter Optimization or SEPO) for searching through the possible parameter settings and selecting the best design options. SEPO is efficient in terms of both convergence speed and parameter tuning. We also discuss the foundation for using supervised learning to speed up the design (search) process. By evaluating realistic design of military-like scenarios that require optimizing a diverse set of metrics, we show that SEPO generates comparable results to the optimal, straightforward (slow-converging) COMB approach that is based on exhaustive search. [Copyright &y& Elsevier]

Abstract: 3GPP Long Term Evolution (LTE) is the upcoming standard for cellular mobile communication. To meet the requirements of high data rate and low latency interactive services, Orthogonal Frequency Division Multiplexing (OFDM) in combination with MIMO is used. From a bit error rate (BER) performance perspective, maximum likelihood (ML) detection is the preferred detection method for multiple input multiple output (MIMO) communication systems. However, for high transmission rates, the K-best algorithm provides close-to-ML bit error rate (BER) performance with its iterative tree search, while its circuit complexity is reduced compared to an exhaustive search. In this paper, Distributed Arithmetic (DA) using parallel architecture based K-best List Sphere Detector (LSD) for a 3GPP LTE receiver is presented. About 50% of the computation time can be decreased and increase in speed with the help of this architecture. [Copyright &y& Elsevier]

Abstract: While creating a framework for adaptive mobile interfaces for m-learning applications we found that in order to ease the use of our framework we needed to present the mobile device characteristics to non-expert users in a easy to understand manner. Using fuzzy sets to represent the characteristics of mobile devices, non-expert developers such as teachers or instructional designers can actively participate in the development or adaptation of the educational tools. To be able to automatically generate the fuzzy membership functions of the sets we needed the data of the mobile device market, regrettably this information is not publicly available. To tackle this problem we have developed a method to estimate the market share of each mobile device based on the popularity metrics recovered from Google Trends and then we use that estimated value as the input to generate the fuzzy set of each characteristic. The proposed method allows us to not only model the state of the market in different periods of time, but also to localize the results to adapt them to the mobile market of specific countries. In this paper we will describe the proposed algorithm and we will discuss the obtained results. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a centralized algorithm to estimate trajectories of mobile nodes using a reasonable number of landmarks, ad hoc wireless communication facility and geographical information. The method identifies such trajectories where nodes move between two landmarks with the shortest time, which may be the shortest paths with high possibility, and uses their intermediate positions as “quasi-landmarks” to localize the others. The method can deal with a realistic case where mobile nodes move along pathways among obstacles. From simulation results, we show that the average estimation error is less than 40% of the wireless range under various scenarios. [Copyright &y& Elsevier]

Abstract: The highly dynamic and uncertain character of mobile ad-hoc networks poses significant challenges for group management. Node mobility often changes the multicast tree, and therefore, frequent updates from group members are required to refresh the multicast tree at the source node. This paper presents Courier, a group communications algorithm that uses the location and velocity of roaming nodes to provide bandwidth efficient multicast between a source and its destinations (i.e., group members) in location aware mobile environments. Toward that end, Courier offers (1) a bandwidth efficient method for location updates from group members, (2) a mobility prediction model for predicting the movement of mobile group members, and (3) an overlay multicast data distribution tree (OMDDT) construction algorithm that is guided by the mobility prediction model. Comparisons of Courier to related multicast algorithms indicate an increase in data transmission success and a decrease in overall bandwidth consumption. [Copyright &y& Elsevier]

Abstract: With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network. [Copyright &y& Elsevier]

Abstract: This paper introduces a new method to implement a motion recognition process using a mobile phone fitted with an accelerometer. The data collected from the accelerometer are interpreted by means of a statistical study and machine learning algorithms in order to obtain a classification function. Then, that function is implemented in a mobile phone and online experiments are carried out. Experimental results show that this approach can be used to effectively recognize different human activities with a high-level accuracy. [Copyright &y& Elsevier]

Abstract: In wireless sensor networks, the requirements on real-time localization algorithm is higher and higher for the rapid movement of nodes. This document introduces a Self-adapting Localization for Mobile Nodes in wireless sensor networks. The principle of the algorithm is mainly presented. Subsequently the experimental data and conclusion are given in this paper. [Copyright &y& Elsevier]

Abstract: Route protocol is becoming the vitally important position during the develoment of wireless sensor network, people pay more and more attention to the mobile nodes especially. This paper starts from the common route protocol to anlyse the initial configuration, route transmit strategy, route choice and maintainance strategy of mobile nodes network route protocol. Then to achieve the network route protocol algorithm based on the mobile nodes. [Copyright &y& Elsevier]

Abstract: Location information is critical essential and indispensable for many applications of wireless sensor networks. Beacon-based localization schemes are more precise than beacon-free ones, but the beacon nodes are more expensive than ordinary sensor nodes. Recently, there has been much focus on mobile-beacon based localization, for they can lower the cost while keeping the localization precision. This paper surveys the current state of the art for mobilebeacon based localization algorithms. We give the taxonomy of these schemes including range-base vs. range-free, single beacon vs. multi-beacons, omni-directional vs. directional antenna. Moreover, we also give a review of path planning methods which are critical to localization algorithm with mobile beacon, and we classify them into static and real-time schemes. We briefly introduce the steps of each localization and path planning algorithm, which serves as an introduction and survey for researchers interested in the area of localization of wireless sensor networks. [Copyright &y& Elsevier]

Abstract: In this paper, we first propose two learning automata based decentralized dynamic guard channel algorithms for cellular mobile networks. These algorithms use learning automata to adjust the number of guard channels to be assigned to cells of network. Then, we introduce a new model for nonstationary environments under which the proposed algorithms work and study their steady state behavior when they use learning algorithm. It is also shown that a learning automaton operating under the proposed nonstationary environment equalizes its penalty strengths. Computer simulations have been conducted to show the effectiveness of the proposed algorithms. The simulation results show that the performances of the proposed algorithms are close to the performance of guard channel algorithm that knows all the traffic parameters. [Copyright &y& Elsevier]

Abstract: Traditional caching technology is not applicable to cache video streaming objects over heterogeneous networking environments. The popularity of mobile devices in the heterogeneous networking environments make the access of Internet content become a common phenomenon. To support different mobile devices in the heterogeneity networking environments, a transcoding proxy is used to transcode different versions of the streaming videos according to clients’ requests. In this paper, we propose a weighted caching replace strategy for video streaming objects over heterogeneous networking environments. A new caching algorithm with static weight transcoding graph and dynamic caching relation tree is introduced. The proposed algorithm is compared with LRU, LFU, CP and PF cache algorithms in three parts: hit ratio, byte hit ratio, and average transmission delay. Experimental results show that the proposed algorithm outperforms than traditional LRU, LFU, CP and PF cache algorithms. [ABSTRACT FROM AUTHOR]

Abstract: This paper proposes new interfaces using semi-synchronous speech and pen input for mobile environments. A user speaks while writing, and the pen input complements the speech so that recognition performance will be higher than with speech alone. Since the input speed and input information are different between the two modes, speaking and writing, a time lag always exists between them. Therefore, conventional multi-modal recognition algorithms cannot be directly applied to this interface. To tackle this problem, we developed a multi-modal recognition algorithm that can handle this asynchronicity (time-lag) by using a segment-based unification scheme and a method of adapting to the time-lag characteristics of individual users. Five different pen-input interfaces, each of which is assumed to be given for a phrase unit in speech, were evaluated in speech recognition experiments using noisy speech data. The recognition accuracy of the proposed method was higher than that of speech alone in all five interfaces. We also carried out a subjective test to examine the usability of each interface. We found a trade-off between usability and improvement in recognition performance. [Copyright &y& Elsevier]

Abstract: We consider a multi-antenna downlink transmission system with multiple users on a shared channel. Transmit beamforming is based on antenna selection and closed-loop (CL) diversity modes adopted from the Universal Mobile Telecommunications System (UMTS) with generalization to more than two antennas. The main contribution of the paper is to compare the performance gain of three physical layer scheduling algorithms: On–Off scheduling, Maximum signal-to-noise ratio (SNR), and Round Robin. The latter two represent respective upper and lower bounds for the scheduling gain while On–Off scheduling is a practical scheme requiring limited feedback. In particular, we concentrate on the joint effect of transmit beamforming together with scheduling. Furthermore, for scheduling we analyze the effect of feedback errors. We see that the use of transmit beamforming with an increased number of antennas reduces the gain from scheduling, but the combined gain remains substantial. We show that the On–Off strategy can reach the performance of the ideal Maximum SNR strategy if the feedback threshold is optimized. However, a low feedback bit error rate (BER) already causes degradation of the performance. [Copyright &y& Elsevier]

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]

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]

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: 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]

Abstract: In this paper, we propose a permission-based message efficient mutual exclusion (MUTEX) algorithm for mobile ad hoc networks (MANETs). To reduce messages cost, the algorithm uses the “look-ahead” technique, which enforces MUTEX only among the hosts currently competing for the critical section. We propose mechanisms to handle dozes and disconnections of mobile hosts. The assumption of FIFO channel in the original “look-ahead” technique is also relaxed. The proposed algorithm can also tolerate link or host failures, using timeout-based mechanisms. Both analytical and simulation results show that the proposed algorithm works well under various conditions, especially when the mobility is high or load level is low. To our knowledge, this is the first permission-based MUTEX algorithm for MANETs. [Copyright &y& Elsevier]

Abstract: Computing paradigms play an important and fundamental role in collaborative processing in wireless sensor networks. The client/server based paradigm and the mobile agent based paradigm are two popular computing models used to facilitate collaboration among sensor nodes. In this paper, we study the key problem of determining the mobile agent itinerary for collaborative processing and model the dynamic mobile agent planning problem. We then present three itinerary planning algorithms, the static, the dynamic, and the predictive dynamic approaches to solve the target tracking problem in wireless sensor networks. We design three metrics (energy consumption, network lifetime, and the number of hops) and use simulation tools to quantitatively measure the performance of different itinerary planning algorithms. Simulation results show considerable improvement over the static itinerary and the dynamic itinerary approaches using the predictive dynamic itinerary algorithm. [Copyright &y& Elsevier]

Abstract: This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constrained mobile nodes with relatively little knowledge of the overall network topology. The mesh routers are stationary wireless nodes with higher transmission rates and more capabilities. We develop a notion of instantaneous capacity regions, and construct algorithms for multi-hop routing and transmission scheduling that achieve network stability and fairness with respect to these regions. The algorithms are shown to operate under arbitrary client mobility models (including non-ergodic models with non-repeatable events), and provide analytical delay guarantees that are independent of the timescales of the mobility process. Our control strategies apply techniques of backpressure, shortest path routing, and Lyapunov optimization. [Copyright &y& Elsevier]

Abstract: Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast algorithm that combines two strategies. Hypergossiping uses adaptive gossiping to efficiently distribute messages within single network partitions and implements an efficient heuristic to distribute them across partitions. Simulation results in ns-2 show that hypergossiping operates well for a broad range of MANETs with respect to node densities, mobility levels and network loads. [Copyright &y& Elsevier]

Bayesian Networks are models which capture uncertainties in terms of probabilities that can be used to perform reasoning under uncertainty. This paper presents an attempt to use Bayesian Networks as a learning technique to manage task execution in mobile robotics. To learn the Bayesian Network structure from data, the K2 structural learning algorithm is used, combined with three different net evaluation metrics. The experiment led to a new hybrid multiclassifying system resulting from the combination of 1-NN with the Bayesian Network, that allows one to use the power of the Bayesian Network while avoiding the computational burden of the reasoning mechanism — the so-called evidence propagation process. As an application example we present an approach of the presented paradigm to implement a door-crossing behaviour in a mobile robot using only sonar readings, in an environment with smooth walls and doors. Both the performance of the learning mechanism and the experiments run in the real robot-environment system show that Bayesian Networks are valuable learning mechanisms, able to deal with the uncertainty and variability inherent to such systems. [Copyright &y& Elsevier]

Abstract: The ubiquitous presence of mobile devices and the demand for better performance and efficiency have motivated research into embedded implementations of cryptography algorithms. In this paper, we propose and explore multiple architectural options for the HashChip. The HashChip is a hardware architecture aimed at providing a unified solution to the task of message hashing with integrated message padding by aggressive exploitation of similarities in the structure of three commercially popular hash algorithms, namely, MD5, SHA1 and RIPEMD160. A generic approach to prototype digital systems on the Xilinx Virtex 2P embedded FPGA platform is presented and utilized for evaluating the HashChip architectures. The performance of the architectures is studied and evaluated for different design metrics. Throughputs in the range of 200–330Mbps are obtained on the Xilinx Virtex2P FPGA depending on the input message size and algorithm choice. [Copyright &y& Elsevier]

Abstract: The continuous broadcast of data together with an index structure is an effective way of disseminating data in a wireless, mobile environment. The availability of an index allows a reduction in the tuning time and thus leads to lower power consumption for a mobile client. This paper considers scheduling index trees in multiple channel environments in which a mobile client can tune into a specified channel at one time instance. Let T be an n-node index tree of height h representing multi-dimensional index structure to be broadcast in a c-channel environment. We describe two algorithms generating broadcast schedules that differ in the worst-case performance experienced by a client executing a general query. A general query is a query which results in an arbitrary traversal of the index tree, compared to a simple query in which a single path is traversed. Our first algorithm schedules any tree using minimum cycle length and it executes a simple query within one cycle. However, a general query may require cycles and thus result in a high latency. The second algorithm generates a schedule of minimum cycle length on which a general query takes at most cycles. For some queries this is the best possible latency. [Copyright &y& Elsevier]

Abstract: Conventional research on DVS assumes that the battery, which is the power source of most mobile devices, provides constant power; the battery, however, has unique discharge characteristics due to its chemical properties. Based on the residual characteristics of the battery, this paper presents a practical approach towards a battery-aware DVS mechanism that can easily be applied to conventional operating systems. The proposed policy monitors the battery residual in runtime, classifies the current battery state as one of three—the recovery effect region, the rate capacity region and the alarm region—then applies a suitable DVS algorithm according to each region, which takes advantage of the underlying battery characteristics. Experiments on commercial PDAs (iPAQ5550 and Zaurus SL-860 PDA) running MPEG applications showed that our policy significantly extends the battery lifetime, compared to the conventional DVS method, with only a marginal QoS degradation. [Copyright &y& Elsevier]

Abstract: An augmented model to greedy multi-rate power control schemes is proposed that integrates mobility information to increase the optimization margins of power efficient packet transmission. The proposed model can be considered as a hierarchical multi-rate power control scheme, where current rate allocation decisions are influenced by a larger time horizon that contains information about directionality and velocity of vehicular mobile users. In this paper we integrate the mobility aware algorithm with a greedy channel rate allocation scheme to illustrate its effectiveness. Numerical investigations show that required power per transmitted packet can be reduced on average by 40% without penalizing throughput. [Copyright &y& Elsevier]

Abstract: In this paper, we first propose a new continuous action-set learning automaton and theoretically study its convergence properties and show that it converges to the optimal action. Then we give an adaptive and autonomous call admission algorithm for cellular mobile networks, which uses the proposed learning automaton to minimize the blocking probability of the new calls subject to the constraint on the dropping probability of the handoff calls. The simulation results show that the performance of the proposed algorithm is close to the performance of the limited fractional guard channel algorithm for which we need to know all the traffic parameters in advance. [Copyright &y& Elsevier]