Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control

In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a certain throughput measure in bit-metres/sec, subject to average network power constraints. The mobility of nodes is restricted to a circular periphery area centered at the nominal location of nodes. We incorporate only randomly varying path-loss characteristics of channel gain due to the random motion of nodes, excluding any multi-path fading or shadowing effects. Computation of the throughput metric in such a scenario leads us to compute the probability density function of random distance between points in two circles. Using numerical analysis we discover that choosing the nearest node as next hop is not always optimal. Optimal throughput performance is also attained at non-trivial hop distances depending on the available average network power.

Performance of a class of multi-robot deploy and search strategies based on centroidal voronoi configurations

This article considers a class of deploy and search strategies for multi-robot systems and evaluates their performance. The application framework used is deployment of a system of autonomous mobile robots equipped with required sensors in a search space to gather information. The lack of information about the search space is modelled as an uncertainty density distribution. The agents are deployed to maximise single-step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for sequential deploy and search (SDS) and combined deploy and search (CDS) strategies. Completeness results are provided for both search strategies. The deployment strategy is analysed in the presence of constraints on robot speed and limit on sensor range for the convergence of trajectories with corresponding control laws responsible for the motion of robots. SDS and CDS strategies are compared with standard greedy and random search strategies on the basis of time taken to achieve reduction in the uncertainty density below a desired level. The simulation experiments reveal several important issues related to the dependence of the relative performances of the search strategies on parameters such as the number of robots, speed of robots and their sensor range limits.

Generalized bidirectional multi-pair multi-antennawireless network coding

In this paper, we focus on increasing the throughput and diversity of network coded MIMO transmissions in bidirectional multi-pair wireless relay networks. All nodes have multi-antenna capability. Pairs of nodes want to exchange messages via a relay having multi-antenna and encoding/decoding capability. Nodes transmit their messages to the relay in the first (MAC) phase. The relay decodes all the messages and XORs them and broadcasts the XORed message in the second (BC) phase. We develop a generalized framework for bidirectional multi-pair multi-antenna wireless network coding, which models different MIMO transmission schemes including spatial multiplexing (V-BLAST), orthogonal STBC (OSTBC), and non-orthogonal STBC (NO-STBC) in a unified way. Enhanced throughputs are achieved by allowing all nodes to simultaneously transmit at their full rate. High diversity orders are achieved through the use of NO-STBCs, characterized by full rate and full transmit diversity. We evaluate and compare the performance of VBLAST, OSTBC, and NO-STBC schemes in one-dimensional 1-pair linear network (one pair of nodes and a relay) and two-dimensional 2-pair `cross' network (two pairs of nodes and a relay).

Mobile agent based TCP attacker identification in MANET using the traffic history (MAITH)

TCP attacks are the major problem faced by Mobile Ad hoc Networks (MANETs) due to its limited network and host resources. Attacker traceback is a promising solution which allows a victim to identify the exact location of the attacker and hence enables the victim to take proper countermeasure near attack origins, for forensics and to discourage attackers from launching the attacks. However, attacker traceback in MANET is a challenging problem due to dynamic network topology, limited network and host resources such as memory, bandwidth and battery life. We introduce a novel method of TCP attacker Identification in MANET using the Traffic History - MAITH. Based on the comprehensive evaluation based on simulations, we showed that MAITH can successfully track down the attacker under diverse mobile multi-hop network environment with low communication, computation, and memory overhead.

Optimal capacity relay node placement in a multi-hop network on a line

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a destination node. The achievable rate formulas that we utilize are for full-duplex radios at the relays and decode-and-forward relaying. For the single relay case, and individual power constraints at the source node and the relay node, we provide explicit formulas for the optimal relay location and the optimal power allocation to the source-relay channel, for the exponential and the power-law path-loss channel models. For the multiple relay case, we consider exponential path-loss and a total power constraint over the source and the relays, and derive an optimization problem, the solution of which provides the optimal relay locations. Numerical results suggest that at low attenuation the relays are mostly clustered close to the source in order to be able to cooperate among themselves, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that a constant rate independent of the attenuation in the network can be achieved by placing a large enough number of relay nodes uniformly between the source and the destination, under the exponential path-loss model with total power constraint.

Measurement Based Impromptu Deployment of a Multi-Hop Wireless Relay Network

We study the problem of optimal sequential (''as-you-go'') deployment of wireless relay nodes, as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for connecting a packet source to be placed at the end of the line with a sink node located at the starting point, to operate in the light traffic regime. In walking from the sink towards the source, at every step, measurements yield the transmit powers required to establish links to one or more previously placed nodes. Based on these measurements, at every step, a decision is made to place a relay node, the overall system objective being to minimize a linear combination of the expected sum power (or the expected maximum power) required to deliver a packet from the source to the sink node and the expected number of relay nodes deployed. For each of these two objectives, two different relay selection strategies are considered: (i) each relay communicates with the sink via its immediate previous relay, (ii) the communication path can skip some of the deployed relays. With appropriate modeling assumptions, we formulate each of these problems as a Markov decision process (MDP). We provide the optimal policy structures for all these cases, and provide illustrations of the policies and their performance, via numerical results, for some typical parameters.

Race Detection for Android Applications

Programming environments for smartphones expose a concurrency model that combines multi-threading and asynchronous event-based dispatch. While this enables the development of efficient and feature-rich applications, unforeseen thread interleavings coupled with non-deterministic reorderings of asynchronous tasks can lead to subtle concurrency errors in the applications. In this paper, we formalize the concurrency semantics of the Android programming model. We further define the happens-before relation for Android applications, and develop a dynamic race detection technique based on this relation. Our relation generalizes the so far independently studied happens-before relations for multi-threaded programs and single-threaded event-driven programs. Additionally, our race detection technique uses a model of the Android runtime environment to reduce false positives. We have implemented a tool called DROIDRACER. It generates execution traces by systematically testing Android applications and detects data races by computing the happens-before relation on the traces. We analyzed 1 5 Android applications including popular applications such as Facebook, Twitter and K-9 Mail. Our results indicate that data races are prevalent in Android applications, and that DROIDRACER is an effective tool to identify data races.

Desarrollo de cliente OMA PoC para Android

[ES]Se presenta el siguiente proyecto de desarrollo, enfocado en el contexto de suplir las necesidades de los equipos de emergencias. Actualmente los equipos de emergencias, hacen uso de walkie talkies para comunicarse entre sí, es decir, hacen uso de la tecnología PTT (Push-to-talk). Es una comunicación unidireccional de un usuario a muchos, de manera que pueden transmitir la información necesaria a varios usuarios simultáneamente. Por otra parte, la comunicación mediante esta tecnología hace posible que sea en tiempo real sin prácticamente ningún retraso. Sin embargo el uso de esta forma de comunicación trae consigo algunos inconvenientes. Por ejemplo, los dispositivos tienen un rango de alcance de transmisión-recepción limitado. Además la banda de frecuencia para poder comunicarse debe ser reservada a fin de evitar posibles problemas de comunicación debido a que el canal estuviera ocupado por otros usuarios, posibles interferencias, etc. La reserva de este rango de frecuencia, supone un coste añadido para el uso de esta tecnología. Con el desarrollo de las redes móviles que ofrecen grandes velocidades de transmisión, se hace posible el uso de la tecnología PTT mediante la red móvil existente. De esta manera, surge el siguiente proyecto de desarrollo de una aplicación móvil Android, como cliente que haga uso de la tecnología PTT sobre la red móvil PoC (Push-to-talk Over Cellular).

System architecture and deployment scenarios for SESAME: Small cEllS coordinAtion for Multi-tenancy and Edge services

The surge of the Internet traffic with exabytes of data flowing over operators mobile networks has created the need to rethink the paradigms behind the design of the mobile network architecture. The inadequacy of the 4G UMTS Long term Evolution (LTE) and even of its advanced version LTE-A is evident, considering that the traffic will be extremely heterogeneous in the near future and ranging from 4K resolution TV to machine-type communications. To keep up with these changes, academia, industries and EU institutions have now engaged in the quest for new 5G technology. In this paper we present the innovative system design, concepts and visions developed by the 5G PPP H2020 project SESAME (Small cEllS coordinAtion for Multi-tenancy and Edge services). The innovation of SESAME is manifold: i) combine the key 5G small cells with cloud technology, ii) promote and develop the concept of Small Cellsas- a-Service (SCaaS), iii) bring computing and storage power at the mobile network edge through the development of nonx86 ARM technology enabled micro-servers, and iv) address a large number of scenarios and use cases applying mobile edge computing. Topics:

A base-emitter self-aligned multi-finger Si1-xGex/Si power heterojunction bipolar transistor

With a crystal orientation dependent on the etch rate of Si in KOH-based solution, a base-emitter self-aligned large-area multi-linger configuration power SiGe heterojunction bipolar transistor (HBT) device (with an emitter area of about 880 mu m(2)) is fabricated with 2 mu m double-mesa technology. The maximum dc current gain is 226.1. The collector-emitter junction breakdown voltage BVCEO is 10 V and the collector-base junction breakdown voltage BVCBO is 16 V with collector doping concentration of 1 x 10(17) cm(-3) and thickness of 400 nm. The device exhibited a maximum oscillation frequency f(max) of 35.5 GHz and a cut-off frequency f(T) of 24.9 GHz at a dc bias point of I-C = 70 mA and the voltage between collector and emitter is V-CE = 3 V. Load pull measurements in class-A operation of the SiGe HBT are performed at 1.9 GHz with input power ranging from 0 dBm to 21 dBm. A maximum output power of 29.9 dBm (about 977 mW) is obtained at an input power of 18.5 dBm with a gain of 11.47 dB. Compared to a non-self-aligned SiGe HBT with the same heterostructure and process, f(max) and f(T) are improved by about 83.9% and 38.3%, respectively.

Genetic mechanisms of multi-antimicrobial resistance in a pathogenic Edwardsiella tarda strain

TX01, a pathogenic Edwardsiella tarda strain isolated from diseased fish at an epidemic-inflicted fish farm in China, exhibits resistance to multiple classes of antimicrobial agents. The genes (kn(R). catA3, and tet(A), respectively) encoding resistance to kanamycin, chloramphenicol, and tetracycline were cloned and found to be 99-100% identical to the corresponding genes carried by known plasmids and transposons of human, animal, and environmental isolates. Further study demonstrated that TX01 harbors a plasmid, pETX, which proved to be (i) the carrier of the tet and cut operons; (ii) a mobile genetic element that is capable of transferring between bacteria of different genera. These results, which, to our knowledge, documented for the first time the co-existence of chloramphenicol and tetracycline resistance determinants on a conjugative plasmid in a pathogenic E tarda strain, indicated that gene acquisition via horizontal transferring of pETX-like mobile genetic entities may have played an important part in the dissemination of antimicrobial resistance and that there have existed for some time widespread genetic exchanges between bacteria of human, animal/fish, and environmental origins. (C) 2008 Elsevier B.V. All rights reserved.

Simultaneous Determination of Multi-Organotin Compounds in Seawater by Liquid-Liquid Extraction-High Performance Liquid Chromatography-Inductively Coupled Plasma Mass Spectrometry

The hyphenated technique of high performance liquid chromatography coupled with inductively coupled plasma mass spectrometry (HPLC-ICP-MS) was applied to the simultaneous determination of five organotin compounds (trimethyltin, dibutyltin, tributyltin, diphenyltin and triphenyltin) in seawater samples. Agilent TC-C18 column was used for the separation, the mobile phase of HPLC was CH3CN : H2O: CH3COOH=65 : 23 : 12 (phi), 0.05% TEA, and pH value was adjusted to 3.0 by diluent ammonia. The flow rate was 0.6 mL . min(-1). Five mixed organotin compounds in a mix standard solution from 100 to 0.5 mu g . L-1 were applied for the method assessment. The experimental results indicate that the correlation coefficient of calibration curves (R-2) for each organotin compound was over 0.998 and the detection limits of the five organotin compounds were lower than 3 ng . L-1. Different mixed organic solvents including dichloromethane or toluene were used for extraction of organotin and the extraction condition of organotin from seawater was optimized. The 100 mL seawater acidized by hydrochloric acid was extracted by 10 mL carbon dichloride (CH2Cl2) with 2% tropolone for 10 min twice. Extracted organic solvents were mixed And blown to one drop by nitrogen with the rate of 1.7 mL . min(-1), then 1 mL acetonitrile was added to the drop for redissolving the organotin compounds. Finally, the mixed redissolution was filtered by 0.22 mu m organic filter membrane before analysis. it was found that the only organotin compound in seawater was triphenyltin (TPHT) and the content was 53.2 ng . L-1. The recoveries test from the standard addition for diphenyltin (DPHT), dibutyltin (DBT), tributyltin (TBT) and triphenyltin (TPHT) were over 80%. However, the recovery for trimethyltin (TMT) was relatively low and the value was 50%. The reason might be attributed to the decomposition or adsorption of those compounds during the extraction procedure. Further study on this subject is in progress.

Stabilization of Dynamic Systems for Multiple Omni-Directional Mobile Robots

本文考虑了由2个全方位移动机器人组成的混合动力学系统的协调拟镇定问题.利用机器人位置之间的向量与机器人目标之间向量的内积,设计了多步拟镇定律,该控制律能够在避碰后按指数速率运动到目标点,且在整个过程中两机器人之间的距离不小于避碰的安全距离.最后对2个全方位移动机器人进行了仿真,验证了所给方法的有效性。

Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks

Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.

An Active Pattern Recognition Architecture for Mobile Robots

An active, attentionally-modulated recognition architecture is proposed for object recognition and scene analysis. The proposed architecture forms part of navigation and trajectory planning modules for mobile robots. Key characteristics of the system include movement planning and execution based on environmental factors and internal goal definitions. Real-time implementation of the system is based on space-variant representation of the visual field, as well as an optimal visual processing scheme utilizing separate and parallel channels for the extraction of boundaries and stimulus qualities. A spatial and temporal grouping module (VWM) allows for scene scanning, multi-object segmentation, and featural/object priming. VWM is used to modulate a tn~ectory formation module capable of redirecting the focus of spatial attention. Finally, an object recognition module based on adaptive resonance theory is interfaced through VWM to the visual processing module. The system is capable of using information from different modalities to disambiguate sensory input.