Today, emission legislations for engine exhaust particles are mass based. The engines of today are low-emitting with respect to particle mass, with the emissions approaching the detection limit of the current measurement method. This calls for new and improved measurement methods. Both from the point of view of the engine developers and regarding human health effects, particle number seem to be the particle property of greatest interest to legislate upon. Recently, a proposal for a new particle number based measurement methodology has been put forward by the United Nations Economic Commission for Europe (UN ECE). The gas and particle mixture (the aerosol) of engine exhaust is not a stable system. The size and the number of the particles change over time as the temperature and pressure change. Particle number measurements call for dilution which changes the gas-phase concentrations of the condensing gases. The dilution process alters the conditions in the aerosol and thereby influences the measurements. Within the current project it was desired to better understand the outcome of particle number measurements and the complexities of particle sampling, dilution and conditioning prior to measurements. Two experimental set-ups have been developed within the project. The first system includes a rotating disc diluter followed by a volatility Tandem Differential Mobility Analyser (v-TDMA). The second set-up, called the EMIR-system, includes ejector diluters in series followed by a stand-alone Condensation Particle Counter (CPC). After the development of these experimental set-ups, the v-TDMA has been used to study the volatility and the size distributed number concentration of exhaust particles. The EMIR-system was used for total number concentration measurements including only the solid fraction of the aerosol. The experimental work has given practical experience that can be used to estimate the benefits and disadvantages of upcoming measuring methodology. For the engine developers, in order to produce engines that meet future legislation limits, it is essential to know how the measurement procedure influences the aerosol. In summary, the experimental studies have shown that the number of nucleation mode particles is strongly affected by varied dilution. No upper threshold value of the dilution has been found where the dilution effect diminishes. The volatility studies have shown that it is mainly the nucleation mode particles that are affected by heat. The v-TDMA instrument have shown to be a sensitive analytical tool which, if desired to use for further engine exhaust particle characterization, needs some development work. Experimental work with the EMIR-system, which in principle is similar to the instruments proposed for a future standard, shows that these types of measurement systems are sensitive to small changes in the detector cut-off. The major outcome of the project lies in the new detailed knowledge about particle number measurements from engines. / QC 20100628

In recent years, a number of power control concepts have been studied and implementedeither in simulation or in practice for different communication systems. It is still the case that a great deal of research is being conducted within the area of energyefficient power control mechanisms for future wireless communication networksystems. However, only a limited amount of practical work has been implemented onreal test beds environment. The main goal of this thesis is to propose and develop newprototype Transmit Power Control Mechanisms (TPCM) on WARP (Wireless Open-Access Research Platform) boards for point-to-point communications, which are to bedeveloped and tested in an indoor environment. This work mainly focuses on the automaticpower control nodes, transmission and reception over-the-air. In this thesis, wehave designed and developed TPCM to adjust the power levels on a transmitter nodeby following the feedback (ACK) approach. In this case, the destination (receiver)node always sends the feedback (ACK) to transmitter node during every successfultransmission of message signal and the main focus is on a reduction in the packetloss rate (PLR), an increase in the packet reception rate (PRR) and the capacity ofthe nodes. In this real work, we have developed and measured the results based ontwo functions namely, with and without packet window function power control mechanisms. According to the measurements section, both with and without function powercontrol mechanisms proved to have better performances for different tunable parameters.If both functions are compared, then the with window function power controlmechanism was shown to produce better performances than the without windowpower control mechanism and it also converged faster than the without window function.If consideration was given to controlling a reduction in packet loss rate, thenthe with widnow function offered higher performances than those without the windowfunction. In this regard, it was found that the with window function has acheived amaximum packet reception rate than that for the without window function for differenttunable parameters. In relation to the power consumption scenario, it was determinedthat the without window fuction proved to produce energy saving performances thanthe with window function. There are several interesting aspects of the transmit powercontrol mechanisms highlighted in the results and discussion chapter.

Ad hoc wireless networks are constructed by several mobile hosts and have a property that its topology is changed as mobile hosts moved. There is no stationary infrastructure or based station to coordinate packets transmissions and advertise the information of network topology or something important. The special networks are used in temporal wireless networks, such as battlefield, disease rescue place, and so on. So without any stationary infrastructure supported, mobile hosts can communicate with others immediately or indirectly. Because topology is often changed while mobile hosts moving, mobile hosts must exchange information to deal with the changed conditions. Mobile hosts often utilize broadcasting to exchange information with their neighbor hosts, but there is high bit error ratio in wireless networks, packet corruption occurs frequently, so that mobile host might lost some important information sent from its neighboring host. In 802.11 standard, lack of acknowledgement, broadcasting is an unreliable transmission, because sender host do not know whether all of it neighboring hosts received broadcasting packets correctly or no. Many proposed papers of reliable broadcast assumed that links between mobile hosts are bidirectional links, but bidirectional link is an ideal assumption. In real environment, links are unidirectional, so host A could send packets to host B immediately, but host B could not because of their transmission range are different. In this paper, we propose a new reliable broadcast scheme, Highly Reliable Broadcast Scheme with Directional Antennas (HRBSDA). HRBSDA can reduce the influence of unidirectional links and reach for highly reliable broadcasting. HRBSDA uses directional antennas and concept of Time Division Multiple Access (TDMA)-like. HRBSDA divide DCF Inter-Frame Space (DIFS) into several minislots, and mobile hosts use these minislots to ask sender for retransmission of lost packets. By the way, HRBSDA can not only reach for highly reliable broadcasting, but also reduce Packet Loss Recovery Time, and avoid causing extra overhead. Using directional antennas HRBSDA can reduce collision, so that improving throughput and channel utilization.

<p>In today's GSM system there is a complex resource situation when it comes to the scarce TDMA channels in the air interface, the time slots. There are both voice call services that use one or a half time slot and there are packet data users, that may share time slots with other packet data users, and they can use multiple channels at the same time. Allocating time to users is a crucial part in the system and it may affect the performance for the end user substantially.</p><p>In the future there may be more types of services than just voice and packet data and that these services may have specific demands on their channels, time slots. That means they would not be able to use just any of the available channels. The way to "give" services channels is what is called channel allocation. In this thesis four different services and three different principles for channel allocation is implemented in a Matlab simulator and simulated. The thesis goal is to determine which principle is best for which mix of services.</p><p>The principles that have been investigated are Flexible Algorithm that lets all services use all channels, Fix Dedication Algorithm where all channels are dedicated to a service and only can be used by that one and finally Soft Dedication Algorithm where all channels are dedicated to a service but may be used by other services when it is not needed by the preferred one.</p><p>The conclusion is, simplified, that the Soft Dedication Algorithm generates low blocking rates, high bandwidth and that it is a quite robust principle although the borrowing user may be preempted. It may not always be the best one but over all it is the one to prefer.</p> / <p>Detta examensarbete är utfört på uppdrag av och i samarbete med Ericsson och rör kanal- och resurshantering i GSM-systemet.</p><p>Ett ständigt problem vid trådlös och mobil kommunikation är den begränsade mängd frekvenser som finns tillgängliga i radiogränssnittet och hur pass nära två radioresursers frekvenser kan ligga varandra. I GSM används TDMA (Time Division Multiple Access) för att få plats med många användare på ett smalt frekvensband. TDMA innebär förenklat att tiden delas upp i åtta tidsluckor och att varje användare får tillgång till en av radioresurserna under en sådan tidslucka (kanal). Detta gäller både i upp- och nedlänk.</p><p>I nuläget finns två tjänster, paketdata och tal, som använder tidsluckorna på olika sätt. En talanvändare använder en eller en halv lucka själv medan paketdataanvändare kan dela på en eller flera luckor. Det finns alltså en mängd olika sätt att allokera, "dela ut", dessa luckor till ett givet antal användare. I nuläget har man en väl fungerande algoritm för detta men man tror att det i framtiden kommer att finnas fler tjänster med mer specifika krav på sina tidsluckor (kanaler) och att man då inte längre kan använda samma princip för kanalallokeringen.</p><p>I detta exjobb har tre nya, enkla och renodlade principer för kanalallokering undersökts för fyra fiktiva tjänster. Det tre principerna är Flexible Algorithm, där alla tjänster tillåts använda alla kanaler, Fix Dedication Algorithm, där alla kanaler är dedicerade till någon tjänst och endast kan användas av just denna tjänst; och slutligen Soft Dedication Algorithm som fungerar liknande den föregående men här kan tjänster "låna" kanaler av andra tjänster så längs som de är lediga. I Soft Dedication Algorithm kan en eventuell "låntagare" bli avbruten om en användare av rätt tjänst inte hittar en ledig kanal.</p><p>Utvärdering har skett genom att simulera systemet i en, delvis egengjord, Matlabsimulator.</p><p>Resultaten visar, förenklat, att Soft Dedication Algorithm är den bästa vad gäller låg blockering, kanalutnyttjande och även bandbredder. Den är även förhållandevis robust mot variationer i last.</p>

ITC/USA 2012 Conference Proceedings / The Forty-Eighth Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2012 / Town and Country Resort & Convention Center, San Diego, California / We propose a spectrally-efficient multiple-access technique that is particularly suitable for aeronautical telemetry applications involving serial streaming of data from multiple test articles to a ground station. Unlike conventional frequency-division multiple access, we assign overlapping frequency bands to different users with a minimum carrier separation corresponding to the symbol rate. We utilize multiuser detection strategies at the ground station to separate the transmissions from different test articles. As shown by the simulation results, the proposed scheme is robust to large frequency offsets due to oscillator offsets and Doppler shifts commonly encounters in aeronautical telemetry applications.

In today's GSM system there is a complex resource situation when it comes to the scarce TDMA channels in the air interface, the time slots. There are both voice call services that use one or a half time slot and there are packet data users, that may share time slots with other packet data users, and they can use multiple channels at the same time. Allocating time to users is a crucial part in the system and it may affect the performance for the end user substantially. In the future there may be more types of services than just voice and packet data and that these services may have specific demands on their channels, time slots. That means they would not be able to use just any of the available channels. The way to "give" services channels is what is called channel allocation. In this thesis four different services and three different principles for channel allocation is implemented in a Matlab simulator and simulated. The thesis goal is to determine which principle is best for which mix of services. The principles that have been investigated are Flexible Algorithm that lets all services use all channels, Fix Dedication Algorithm where all channels are dedicated to a service and only can be used by that one and finally Soft Dedication Algorithm where all channels are dedicated to a service but may be used by other services when it is not needed by the preferred one. The conclusion is, simplified, that the Soft Dedication Algorithm generates low blocking rates, high bandwidth and that it is a quite robust principle although the borrowing user may be preempted. It may not always be the best one but over all it is the one to prefer. / Detta examensarbete är utfört på uppdrag av och i samarbete med Ericsson och rör kanal- och resurshantering i GSM-systemet. Ett ständigt problem vid trådlös och mobil kommunikation är den begränsade mängd frekvenser som finns tillgängliga i radiogränssnittet och hur pass nära två radioresursers frekvenser kan ligga varandra. I GSM används TDMA (Time Division Multiple Access) för att få plats med många användare på ett smalt frekvensband. TDMA innebär förenklat att tiden delas upp i åtta tidsluckor och att varje användare får tillgång till en av radioresurserna under en sådan tidslucka (kanal). Detta gäller både i upp- och nedlänk. I nuläget finns två tjänster, paketdata och tal, som använder tidsluckorna på olika sätt. En talanvändare använder en eller en halv lucka själv medan paketdataanvändare kan dela på en eller flera luckor. Det finns alltså en mängd olika sätt att allokera, "dela ut", dessa luckor till ett givet antal användare. I nuläget har man en väl fungerande algoritm för detta men man tror att det i framtiden kommer att finnas fler tjänster med mer specifika krav på sina tidsluckor (kanaler) och att man då inte längre kan använda samma princip för kanalallokeringen. I detta exjobb har tre nya, enkla och renodlade principer för kanalallokering undersökts för fyra fiktiva tjänster. Det tre principerna är Flexible Algorithm, där alla tjänster tillåts använda alla kanaler, Fix Dedication Algorithm, där alla kanaler är dedicerade till någon tjänst och endast kan användas av just denna tjänst; och slutligen Soft Dedication Algorithm som fungerar liknande den föregående men här kan tjänster "låna" kanaler av andra tjänster så längs som de är lediga. I Soft Dedication Algorithm kan en eventuell "låntagare" bli avbruten om en användare av rätt tjänst inte hittar en ledig kanal. Utvärdering har skett genom att simulera systemet i en, delvis egengjord, Matlabsimulator. Resultaten visar, förenklat, att Soft Dedication Algorithm är den bästa vad gäller låg blockering, kanalutnyttjande och även bandbredder. Den är även förhållandevis robust mot variationer i last.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-05-30T14:18:27Z No. of bitstreams: 1 luamoloisefernandesdasilveira.pdf: 589211 bytes, checksum: e51494b1c23ff74fa1fc26264147a6a1 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-05-30T15:36:08Z (GMT) No. of bitstreams: 1 luamoloisefernandesdasilveira.pdf: 589211 bytes, checksum: e51494b1c23ff74fa1fc26264147a6a1 (MD5) / Made available in DSpace on 2017-05-30T15:36:08Z (GMT). No. of bitstreams: 1 luamoloisefernandesdasilveira.pdf: 589211 bytes, checksum: e51494b1c23ff74fa1fc26264147a6a1 (MD5) Previous issue date: 2016-08-19 / Recentemente, Power Line Communication (PLC) tem atraído o interesse de pesquisadores de todo mundo. Contudo, sistemas PLC enfrentam diversos desafios em termos da degradação da qualidade de comunicação de dados. Para superar tais problemas, propomos o CodePLC, um protocolo MAC para PLC que utiliza network coding. Utilizamos um nó intermediário para intermediar a comunicação, armazenar e repassar uma combinação linear de pacotes PLC. Avaliamos o desempenho do CodePLC através da simulação de uma topologia comum em um sistema PLC baseado no esquema Orthogonal Frequency Division Multiplexing whith Time Domain Multiple Access (TDMA-OFDM), sob uma ampla gama de cenários. Em suma, os resultados mostram que, para transmissões do tipo broadcast, o uso de network coding melhora desempenho geral do sistema PLC baseado no TDMA-ODFM. De fato, quando comparado a um sistema que utiliza uma camada MAC PLC multihop stop&wait tradicional, podemos observar um pico de aumento de 110% no valor de pico do goodput. Além disso, nosso protocolo reduz em até 71,4% a ocupação dos buffers da rede. Finalmente, CodePLC pode reduz a latência média em até quatro vezes. / Recently, power line communication (PLC) has attracted interest of worldwide researchers. However, PLC systems face several challenges which degrade data communication quality. To overcome such issues, we propose CodePLC, a network coding PLC MAC protocol. We use a single relay node to intermediate communication, storing and forwarding linear combinations of PLC data packets. We evaluate CodePLC performance through simulations of a common topology for a PLC system based in Orthogonal Frequency Division Multiplexing whith Time Domain Multiple Access (TDMA-OFDM) under a wide range of scenarios. In summary, our results show that in a broadcast like transmission, the use of network coding enhances overall system performance. In fact, when compared to a traditional PLC system using multihop stop&wait MAC layer protocol, we have observed an peak of 110% goodput increase. Moreover, our protocol reduces in 71,4% network occupancy buffers. Finally, CodePLC reduces mean latency by four times.

One of the major driving elements behind the explosive boom in wireless revolution is the advances in the field of modulation which plays a fundamental role in any communication system, and especially in cellular radio systems. Hence, the elaborate choice of an efficient modulation scheme is of paramount importance in the design and employment of any communications system. Work presented in this thesis is an investigation (study) of the feasibility of whether multilevel FSK modulation scheme would provide a viable alternative modem that can be employed in TDMA cordless communications systems. In the thesis the design and performance analysis of a non-coherent multi-level modem that offers a great deal of bandwidth efficiency and hardware simplicity is studied in detail. Simulation results demonstrate that 2RC pre-modulation filter pulse shaping with a modulation index of 0.3, and pre-detection filter normalized equivalent noise bandwidth of 1.5 are optimum system parameter values. Results reported in chapter 5 signify that an adjacent channel rejection factor of around 40 dB has been achieved at channel spacing of 1.5 times the symbol rate while the DECT system standards stipulated a much lower rejection limit criterion (25-30dB), implying that CP-QFSK modulation out-performs the conventional GMSK as it causes significantly less ACI, thus it is more spectrally efficient in a multi-channel system. However, measured system performance in terms of BER indicates that this system does not coexist well with other interferers as at delay spreads between 100ns to 200ns, which are commonly encountered in such indoor environment, a severe degradation in system performance apparently caused by multi-path fading has been noticed, and there exists a noise floor of about 40 dB, i.e. high irreducible error rate of less than 5.10-3. Implementing MRC diversity combiner and BCH codec has brought in a good gain.

In this paper, a new concept for ultrasonic indoor positioning based on instantaneous frequency of ultrasonic signals is presented. Nonlinear phase characteristics of ultrasonic transducers introduce a frequency deviation in ultrasonic signals. By sweeping at very fast rates, a large spike in the deviation is introduced. The artefacts observable in instantaneous frequency estimations are highly localized and present an opportunity for accurate frequency detection. In order to be useful, the artefacts need to take place within the pulse and have sufficient magnitude for accurate processing. The system consists of a transducer transmitter and receiver pair, which have a center frequency of 40kHz and a bandwidth of 460Hz. In order to incorporate more transmitters, a time-division multiple access (TDMA) scheme is applied to ensure orthogonality of signals. The concept includes four ultrasonic transmitters and a single receiver, which can uniquely identify each transmitter by a distinct signal sweep. Linear chirp signals are used to form narrow pulses and ensure no interference in the TDMA scheme. The received signal is amplified and passed through a phase-locked loop (PLL) to detect the chirp signals. Accurate instantaneous frequency detection can be done on the voltage-controlled oscillator (VCO) of the PLL, which has a narrower bandwidth than the overall signal sweep. The instantaneous frequency estimation methods are largely explored in this work and consider two methods: the Hilbert transform and a zero-crossings method. This work highlights some of the advantages and disadvantages of both methods. Time of flight (ToF) in this system can ultimately be obtained by considering the instantaneous frequency estimations and the time for one particular frequency to be transmitted and received.

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第18623号 / 情博第547号 / 新制||情||97(附属図書館) / 31523 / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 守倉 正博, 教授 高橋 達郎, 教授 梅野 健 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM