Change search
Refine search result
78910111213 451 - 500 of 3171
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 451.
    Chatzimisios, Periklis
    et al.
    Alexander Technological Educational Institute of Thessaloniki.
    Habib, Ibrahim
    University of New York.
    Bellavista, Paolo
    University of Bologna.
    Vinel, Alexey
    Saint-Petersburg Institute for Informatics and Automation, Russian Academy of Sciences.
    Guest editorial for the special issue on "Next generation networks service management"2011In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 34, no 9, 1043-1044 p.Article in journal (Refereed)
  • 452.
    Chazalet, Boris
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Opportunistic Content Delivery utilizing Optimized Context Dissemination via the Service Interface in Ambient Networks2007Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    One of the novel and important features of Ambient Networks is the use of context information. Context in Ambient Networks concerns any information that describes the current situation of entities connected to the network (e.g. location, available connectivity and devices, etc.). Such context information can be used by applications, services, or network resources enabling them to automatically adapt their behavior without requiring user intervention. Thus, context in Ambient Networks provides a better user experience due to the auto-configuration, as well as auto-arrangement of service delivery and transport.

    This thesis presents an optimized version and implementation of the Distributed Context eXchange Protocol. This protocol is part of the context-aware architecture for Ambient Networks. The design and architecture of the Distributed Context eXchange Protocol (DCXP), utilizes a P2P overlay on top of UDP. This design and architecture have been revised to enable real-time context dissemination, while simultaneously removing bottlenecks. An analysis of this revised design including measurements in real-world scenarios, shows that DXCP offers a practical approach to context-sensing and dissemination, allowing rapid context changes and spontaneous use of new context sources as these become (un)available in dynamic rearrangements of network connectivity, facilitating the use of Ambient Network technologies. Finally, the thesis presents and demonstrates a novel use and the advantages of Optimized Context Dissemination as the Ambient Networks Service Interface (ASI) for Opportunistic Content Delivery. This is achieved by adding an (subset) API to the ASI which enables a Content Delivery Proxy to interface with DCXP and leverage context information to enable opportunistic content delivery across Ambient Networks.

  • 453.
    Chen, Bolin
    et al.
    Department of Electronic and Electrical Engineering, The University of Sheffield, Sheffield, UK.
    Chen, Zheng
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, Faculty of Science & Engineering.
    Pappas, Nikolaos
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Yuan, Di
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Zhang, Jie
    Department of Electronic and Electrical Engineering, The University of Sheffield, Sheffield, UK.
    Modeling and Analysis of MPTCP Proxy-based LTE-WLAN Path Aggregation2017In: IEEE Global Communications Conference (GLOBECOM) 2017, IEEE Communications Society, 2017Conference paper (Refereed)
    Abstract [en]

    Long Term Evolution (LTE)-Wireless Local Area Network (WLAN) Path Aggregation (LWPA) based on Multi- path Transmission Control Protocol (MPTCP) has been under standardization procedure as a promising and cost-efficient solution to boost Downlink (DL) data rate and handle the rapidly increasing data traffic. This paper aims at providing tractable analysis for the DL performance evaluation of large-scale LWPA networks with the help of tools from stochastic geometry. We consider a simple yet practical model to determine under which conditions a native WLAN Access Point (AP) will work under LWPA mode to help increasing the received data rate. Using stochastic spatial models for the distribution of WLAN APs and LTE Base Stations (BSs), we analyze the density of active LWPA- mode WiFi APs in the considered network model, which further leads to closed-form expressions on the DL data rate and area spectral efficiency (ASE) improvement. Our numerical results illustrate the impact of different network parameters on the performance of LWPA networks, which can be useful for further performance optimization. 

  • 454.
    Chen, Chengshang
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    Rear Approaching Vehicle Detection with Microphone2013Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    When a cyclist is cycling on a suburban road, it’s a problem to notice fast rear approaching vehicles in some cases. Looking back frequently is not a good idea. Finding some technical way to help cyclist perceiving rear approaching vehicles is quite necessary.

    This project aims to find some proper sensor to detect rear approaching vehicles. It’s separated into three steps. First, choose the suitable sensor and capture data. Then, find proper analyzing tool to analyze the capture data. Last but not least, draw a conclusion after analyzing contrast.

    Microphone is chosen as the sensor to recording the sounds form rear approaching vehicles. ”iRig Recorder FREE” is the program to transfer audio format. And the analyzing tool is to be Matlab. Matlab audio analysis makes good frequency spectrum for each piece of audio data. According to the frequency spectrum, the unique amplitude change around 1000 Hz is found when there is a rear approaching vehicle. This change is always distinct with or without noise.

    After getting the spectrum of different audio sources, the cross-correlation coefficient between 800 Hz and 1200 Hz is computed to see the correlation level. Then according to cross-correlation coefficient between new captured data and knowledge data, we can determine if there is a rear approaching vehicle in the new data or not.

    So, this project proves that the cross-correlation coefficient of frequency spectrum can determine if there is rear approaching vehicles or not. The future work would be automatic computer detect depending on this method.

  • 455.
    Chen, Jiajia
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Efficient resiliency mechanisms for next generation passive optical networks2013In: ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing, IEEE Computer Society, 2013, 6782903- p.Conference paper (Refereed)
    Abstract [en]

    Future broadband access networks are expected to cover large service areas while fulfilling high bandwidth request on a per-user basis. The rapidly increasing traffic demand is also driven by the growing popularity of mobile data services, which is placing high-capacity requirement on the backhaul. Due to advances in wavelength division multiplexing (WDM) technology, WDM based architectures have been considered as promising candidates for next generation optical access, such as WDM passive optical network (PON), and hybrid WDM/time division multiplexing (TDM) PON. Meanwhile, resilience technique will play a more prominent role in emerging access networks due to their significantly increased capacity and coverage compared to the current deployments. Therefore, efficient resiliency mechanisms are highly required to enable uninterrupted network operation where a certain level of reliability performance can be guaranteed. In this work, we first evaluate reliability performance of each segment of next generation optical access networks and then identify the most important part for protection. A particular attention is paid to the reduction of failure impact.

  • 456.
    Chen, Jiajia
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Mahloo, Mozhgan
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Reducing the Impact of Failures in Next Generation Optical Access Networks2012In: 2012 Asia Communications And Photonics Conference (ACP), 2012, AS1D.2- p.Conference paper (Refereed)
    Abstract [en]

    Reliability performance of next generation optical access (NGOA) networks offering high bandwidth and large service coverage is evaluated. A particular attention is paid to the reduction of the impact of failures in NGOA.

  • 457.
    Chen, Jiajia
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Urban, Patryk J.
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Fast fault monitoring technique for reliable WDM PON: Achieving significant operational saving2013In: 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference, OFC/NFOEC 2013, IEEE , 2013, 6532499- p.Conference paper (Refereed)
    Abstract [en]

    We propose a fast fault supervision technique compatible with an efficient resilience scheme for WDM PON. Several drop fibres can be monitored simultaneously so that a significant reduction of operational cost can be achieved.

  • 458.
    Chen, Kairang
    Linköping University, Department of Electrical Engineering, Integrated Circuits and Systems. Linköping University, Faculty of Science & Engineering.
    Energy-Efficient Data Converters for Low-Power Sensors2016Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Wireless sensor networks (WSNs) are employed in many applications, such as for monitoring bio-potential signals and environmental information. These applications require high-resolution (> 12-bit) analog-to-digital converters (ADCs) at low-sampling rates (several kS/s). Such sensor nodes are usually powered by batteries or energy-harvesting sources hence low power consumption is primary for such ADCs. Normally, tens or hundreds of autonomously powered sensor nodes are utilized to capture and transmit data to the central processor. Hence it is profitable to fabricate the relevant electronics, such as the ADCs, in a low-cost standard complementary metal-oxide-semiconductor (CMOS) process. The two-stage pipelined successive approximation register (SAR) ADC has shown to be an energy-efficient architecture for high resolution. This thesis further studies and explores the design limitations of the pipelined SAR ADC for high-resolution and low-speed applications.

    The first work is a 15-bit, 1 kS/s two-stage pipelined SAR ADC that has been implemented in 0.35-μm CMOS process. The use of aggressive gain reduction in the residue amplifier combined with a suitable capacitive array digital-to-analog converter (DAC) topology in the second-stage simplifies the design of the operational transconductance amplifier (OTA) while eliminating excessive capacitive load and consequent power consumption. A comprehensive power consumption analysis of the entire ADC is performed to determine the number of bits in each stage of the pipeline. Choice of a segmented capacitive array DAC and attenuation capacitorbased DAC for the first and second stages respectively enable significant reduction in power consumption and area. Fabricated in a low-cost 0.35-μm CMOS process, the prototype ADC achieves a peak signal-to-noise-and-distortion ratio (SNDR) of 78.9 dB corresponding to an effective number of bits (ENOB) of 12.8-bit at a sampling frequency of 1 kS/s and provides a Schreier figure-of-merit (FoM) of 157.6 dB. Without any form of calibration, the ADC maintains an ENOB > 12.1-bit up to the Nyquist bandwidth of 500 Hz while consuming 6.7 μW. Core area of the ADC is 0.679 mm2.

    The second work is a 14-bit, tunable bandwidth two-stage pipelined SAR ADC which is suitable for low-power, cost-effective sensor readout circuits. To overcome the high open-loop DC gain requirement of the OTA in the gain-stage, a 3-stage capacitive charge pump (CCP) is utilized to achieve the gain-stage instead of using the switch capacitor (SC) amplifier. Unity-gain OTAs have been used as the analog buffers to prevent the charge sharing between the CCP stages. The detailed design considerations are given in this work. The prototype ADC, designed and fabricated in a low-cost 0.35-μm CMOS process, achieves a peak SNDR of 75.6 dB at a sampling rate of 20 kS/s and 76.1 dB at 200 kS/s while consuming 7.68 μW and 96 μW, respectively. The corresponding Schreier FoM are 166.7 dB and 166.3 dB. Since the bandwidth of CCP is tunable, the ADC maintains a SNDR > 75 dB up

    to 260 kHz. The core area occupied by the ADC is 0.589 mm2.

    As the low-power sensors might be active only for very short time triggered by an external pulse to acquire the data, the third work is a 14-bit asynchronous two-stage pipelined SAR ADC which has been designed and simulated in 0.18-μm CMOS process. A self-synchronous loop based on an edge detector is utilized to generate an internal clock with variable phase. A tunable delay element enables to allocate the available time for the switch capacitor DACs and the gain-stage. Three separate asynchronous clock generators are implemented to create the control signals for two sub-ADCs and the gain-stage between. Aiming to reduce the power consumption of the gain-stage, simple source followers as the analog buffers are implemented in the 3-stage CCP gain-stage. Post-layout simulation results show that the ADC achieves a SNDR of 83.5 dB while consuming 2.39 μW with a sampling rate of 10 kS/s. The corresponding Schreier FoM is 176.7 dB.

  • 459.
    Chen, Lei
    et al.
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Englund, Cristofer
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR - Center for Applied Intelligent Systems Research. Viktoria Swedish ICT, Gothenburg, Sweden & SAFER Vehicle and Traffic Safety Centre, Chalmers University of Technology, Gothenburg.
    Cooperative Intersection Management: A Survey2016In: IEEE transactions on intelligent transportation systems (Print), ISSN 1524-9050, E-ISSN 1558-0016, Vol. 17, no 2, 570-586 p.Article, review/survey (Refereed)
    Abstract [en]

    Intersection management is one of the most challenging problems within the transport system. Traffic light-based methods have been efficient but are not able to deal with the growing mobility and social challenges. On the other hand, the advancements of automation and communications have enabled cooperative intersection management, where road users, infrastructure, and traffic control centers are able to communicate and coordinate the traffic safely and efficiently. Major techniques and solutions for cooperative intersections are surveyed in this paper for both signalized and nonsignalized intersections, whereas focuses are put on the latter. Cooperative methods, including time slots and space reservation, trajectory planning, and virtual traffic lights, are discussed in detail. Vehicle collision warning and avoidance methods are discussed to deal with uncertainties. Concerning vulnerable road users, pedestrian collision avoidance methods are discussed. In addition, an introduction to major projects related to cooperative intersection management is presented. A further discussion of the presented works is given with highlights of future research topics. This paper serves as a comprehensive survey of the field, aiming at stimulating new methods and accelerating the advancement of automated and cooperative intersections. © 2015 IEEE.

  • 460. Chen, Lei
    et al.
    Englund, Cristofer
    RISE, Swedish ICT, Viktoria.
    Cooperative Intersection Management: A Survey2016In: IEEE transactions on intelligent transportation systems (Print), ISSN 1524-9050, E-ISSN 1558-0016, Vol. 17, no 2, 570-586 p.Article in journal (Refereed)
    Abstract [en]

    Intersection management is one of the most challenging problems within the transport system. Traffic light-based methods have been efficient but are not able to deal with the growing mobility and social challenges. On the other hand, the advancements of automation and communications have enabled cooperative intersection management, where road users, infrastructure, and traffic control centers are able to communicate and coordinate the traffic safely and efficiently. Major techniques and solutions for cooperative intersections are surveyed in this paper for both signalized and nonsignalized intersections, whereas focuses are put on the latter. Cooperative methods, including time slots and space reservation, trajectory planning, and virtual traffic lights, are discussed in detail. Vehicle collision warning and avoidance methods are discussed to deal with uncertainties. Concerning vulnerable road users, pedestrian collision avoidance methods are discussed. In addition, an introduction to major projects related to cooperative intersection management is presented. A further discussion of the presented works is given with highlights of future research topics. This paper serves as a comprehensive survey of the field, aiming at stimulating new methods and accelerating the advancement of automated and cooperative intersections.

  • 461. Chen, Lei
    et al.
    Englund, Cristofer
    RISE, Swedish ICT, Viktoria.
    Cooperative ITS - EU standards to accelerate cooperative mobility2014In: The 3rd International Conference on Connected Vehicles & Expo (ICCVE 2014), 2014, 681-686 p.Conference paper (Refereed)
  • 462. Chen, Lei
    et al.
    Habibovic, Azra
    Englund, Cristofer
    RISE, Swedish ICT, Viktoria.
    Voronov, Alexey
    Walter, Anders
    Coordinating Dangerous Goods Vehicles: C-ITS Applications for Safe Road Tunnels2015In: Intelligent Vehicles Symposium (IV), 2015Conference paper (Refereed)
  • 463.
    Chen, Lei
    et al.
    Viktoria Swedish ICT, Sweden.
    Yuan, Di
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Design of in-building distributed antenna systems: mathematical models and efficient algorithms2015In: 2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOP, IEEE , 2015, 1497-1502 p.Conference paper (Refereed)
    Abstract [en]

    In order to provide sufficient coverage and capacity for indoor users, in-building distributed antenna system (IB-DAS) has been considered. A passive IB-DAS deploys distributed antennas inside the building and connects the antennas to a base station (BS) through coaxial cables and power equipment. Power is distributed from the BS to each of the antennas. We consider an optimal design of passive IB-DAS with the target to minimize the cable usage, together with the consideration of power distribution. We decompose the problem into two sub-problems, namely the topological design and the equipment selection. Mixed integer linear models are developed for solving the sub-problems. Local search is designed to combine the sub-problems and balance their objectives. Application over realistic IB-DAS deployment and comparison with previous studies demonstrate the effectiveness of the algorithm.

  • 464.
    Chen, Lisan
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Schiller Shi, Tingting
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Targeted News in an Intranet2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In SharePoint 2013, Microsoft added a social networking function in the personal sites (My Site) of a user. In this version, a personal news feed has been added which shows events regarding subjects the user follows, such as document changes, user updates, tagged posts, and site activities. The purpose of the thesis is to investigate whether or not it is possible to extend the news feed function by adding an independent component as part of My Site, to allow users to follow corporate news by choosing their categories of interests.

    A prototype of the component was implemented and it met most of the objectives stated in the thesis. It is added to the default page of the user’s My Site as a web part and it is able to retrieve and display news that matches the user’s subscription. Although the web part still needs improvements in both functionality and design, it still confirms that it is possible to extend the current My Site news feed with such a component.

    Since the students working on this thesis had no prior knowledge of SharePoint or .NET development, the project brought new challenges, as the students needed to learn how to work in a SharePoint environment and to learn to use Microsoft Visual Studio for .NET development.

  • 465.
    Chen, Ta-wei
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Optimization of Transport Security for Securing Peer-to-Peer Communication in Heterogeneous Networks2005Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis concerns the security of tomorrow’s peer-to-peer real-time communication in heterogeneous networks. Because of the additional delay caused by inband handshake and the poor compatibilities of some transport protocols, it was determined that existing security protocols such as transport layer security (TLS) and datagram transport layer security (DTLS) are not suitable in such a user scenario and a new security protocol should be designed. This new security protocol is called transport encapsulation security payload (TESP). TESP not only has the advantage of low initialization delay, but also fully supports transport protocols including TCP, UDP, stream control transmission protocol (SCTP), and datagram congestion control protocol (DCCP). Also a security analysis of TESP was carried out and no security flaws were found.

  • 466.
    Chen, Xu
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Performance Analysis of Wireless Multiplayer Games on Terraplay Systems2005Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis project was sponsored by Terraplay System AB. Terraplay System is a wireless online multiplayer game service provider in Europe. The purpose of this project was to provide a convenient and free latency test tool named Terraplay Test Toolkit (TTK) for game developers who utilize the Terraplay platform. Since wireless multiplayer games are latency sensitive, it’s necessary for game developers to estimate the real-time game latency before their development. TTK is based on Java Mobile Edition (J2me) technology, it can performs a real-time Round Trip Time (RTT) latency test. This project explored the application of the mobile development. Mobile development is a brand new field and becoming more and more popular. The design process and source code can be used as reference for mobile developers. Based on the Terraplay Test Toolkit, a series of experiments were conducted to test the ability of TTK. These experiments focused on end-to-end latency effects of wireless multiplayer games under different situations such as different packet size, different sending rates, high speed movement, and so on. Although TTK is not a professional test tool, it still reflects the latency variance under different conditions correctly. From these experiments, it was found that for the Terraplay enabled wireless multiplayer games, large average packet size (300 bytes) is NOT a factor with regard to the latency on the Terraplay System; the packet rate can affect the game latency. In a high speed-moving environment, game latency doesn’t obvious increase. Using HTTP can cause three times higher latency than simply using TCP. These conclusions are based on experimental results. These conclusions should guide wireless multiplayer game developers and game players.

  • 467.
    Chen, Zhaofei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Yavuz, Emre A.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Karlsson, Gunnar
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Demo of a collaborative music sharing system2012In: MobiOpp'12 - Proceedings of the 3rd ACM International Workshop on Mobile Opportunistic Networks, New york: ACM , 2012, 77-78 p.Conference paper (Refereed)
    Abstract [en]

    We demonstrate a wireless real-time music-sharing application that lets users play music directly from their mobiles through a jukebox. We have designed and implemented the application by using a previously developed content-centric opportunistic networking middleware. The jukebox plays the music file that is first in its playlist by streaming it in real-time from the publishing user device. All users can observe the collaboratively formed playlist on their mobiles in real-time. The application shows the usefulness of our middleware and demonstrates a new form of situated applications. The application handles churn and garbage collection after departed users.

  • 468.
    Chen, Zhaofei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Yavuz, Emre Altug
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Karlsson, Gunnar
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    What a juke! A collaborative music sharing system2012In: 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2012 - Digital Proceedings, IEEE , 2012, 6263751- p.Conference paper (Refereed)
    Abstract [en]

    The fast spreading of smart mobile devices has changed the way people create and share multimedia contents. A recently proposed idea is to distribute contents opportunistically when devices are within each other's communication range. In this work we have seized this idea and designed and implemented a real-time music-sharing application that allows people to share a sound system for collective listening. The system utilizes a content-centric opportunistic networking middleware. The application provides an interface for users to play audio files stored in their own mobile devices through a shared jukebox that is within direct communication range. The jukebox plays the audio file that is first in queue in its playlist by streaming it from the publishing user device. All devices synchronize with the jukebox so that the users can observe the contents of the playlist on their displays in real-time. This paper presents the idea and motivation for such a system as well as its design and evaluation.

  • 469.
    Chen, Zheng
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, Faculty of Science & Engineering. University of Paris Sud, France.
    Lee, Jemin
    Daegu Gyeongbuk Institute Science and Technology, South Korea.
    Quek, Tony Q. S.
    Singapore University of Technology and Design, Singapore.
    Kountouris, Marios
    Huawei Technology France SASU, France.
    Cooperative Caching and Transmission Design in Cluster-Centric Small Cell Networks2017In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 16, no 5, 3401-3415 p.Article in journal (Refereed)
    Abstract [en]

    Wireless content caching in small cell networks (SCNs) has recently been considered as an efficient way to reduce the data traffic and the energy consumption of the backhaul in emerging heterogeneous cellular networks. In this paper, we consider a cluster-centric SCN with combined design of cooperative caching and transmission policy. Small base stations (SBSs) are grouped into disjoint clusters, in which in-cluster cache space is utilized as an entity. We propose a combined caching scheme, where part of the cache space in each cluster is reserved for caching the most popular content in every SBS, while the remaining is used for cooperatively caching different partitions of the less popular content in different SBSs, as a means to increase local content diversity. Depending on the availability and placement of the requested content, coordinated multi-point technique with either joint transmission or parallel transmission is used to deliver content to the served user. Using Poisson point process for the SBS location distribution and a hexagonal grid model for the clusters, we provide analytical results on the successful content delivery probability of both transmission schemes for a user located at the cluster center. Our analysis shows an inherent tradeoff between transmission diversity and content diversity in our cooperation design. We also study the optimal cache space assignment for two objective functions: maximization of the cache service performance and the energy efficiency. Simulation results show that the proposed scheme achieves performance gain by leveraging cache-level and signal-level cooperation and adapting to the network environment and user quality-of-service requirements.

  • 470.
    Chen, Zheng
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, Faculty of Science & Engineering.
    Pappas, Nikolaos
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Kountouris, Marios
    Huawei Technologies, France.
    Energy Harvesting in Delay-Aware Cognitive Shared Access Networks2017In: IEEE Workshop on Emerging Energy Harvesting Solutions for 5G Networks (5G-NRG), IEEE, 2017Conference paper (Refereed)
    Abstract [en]

    In this work, we study the effect of energy harvesting in a cognitive shared access network with delay constraints on the primary user. We model the distribution of secondary nodes by a homogeneous Poisson point process (PPP), while the primary user is located at fixed location. The secondary users are assumed to have always packets to transmit whilst the primary transmitter has bursty traffic. We assume an energy harvesting zone around the primary transmitter and a guard zone around the primary receiver. The secondary users are transmitting in a random access manner, however, transmissions of secondary nodes are restricted by their battery status and location. Targeting at achieving the maximum secondary throughput under primary delay constraints, we analyze the impact of various parameters on the performance of the considered network. Our results provide insights into the optimization of access protocol parameters for the energy harvesting-based cognitive shared access network with delay constraints. 

  • 471.
    Chen, Zheng
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, Faculty of Science & Engineering.
    Pappas, Nikolaos
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Kountouris, Marios
    Mathematical and Algorithmic Sciences Lab, France Research Center, Huawei Technologies France SASU, Boulogne-Billancourt, France.
    Energy Harvesting in Delay-Aware Cognitive Shared Access Networks2017In: IEEE Workshop on Emerging Energy Harvesting Solutions for 5G Networks (5G-NRG): May 2017, Paris, France., 2017Conference paper (Refereed)
    Abstract [en]

    In this work, we study the effect of energy harvesting in a cognitive shared access network with delay constraints on the primary user. We model the distribution of secondary nodes by a homogeneous Poisson point process (PPP), while the primary user is located at fixed location. The secondary users are assumed to have always packets to transmit whilst the primary transmitter has bursty traffic. We assume an energy harvesting zone around the primary transmitter and a guard zone around the primary receiver. The secondary users are transmitting in a random access manner, however, transmissions of secondary nodes are restricted by their battery status and location. Targeting at achieving the maximum secondary throughput under primary delay constraints, we analyze the impact of various parameters on the performance of the considered network. Our results provide insights into the optimization of access protocol parameters for the energy harvesting-based cognitive shared access network with delay constraints.

  • 472.
    Chen, Zheng
    et al.
    University of Paris Sud, France.
    Pappas, Nikolaos
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Kountouris, Marios
    Huawei Technology Co Ltd, Peoples R China.
    Angelakis, Vangelis
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Throughput Analysis of Smart Objects with Delay Constraints2016In: 2016 IEEE 17TH INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (WOWMOM), IEEE , 2016Conference paper (Refereed)
    Abstract [en]

    In this paper, we analyze a shared access network with one primary device and randomly distributed smart objects with secondary priority. Assuming random traffic at the primary device and saturated queues at the smart objects with secondary priority, an access protocol is employed to adjust the random access probabilities of the smart objects depending on the congestion level of the primary. We characterize the maximum throughput of the secondary network with respect to delay constraints on the primary. Our results highlight the impact of system design parameters on the delay and throughput behavior of the shared access network with massive number of connected objects.

  • 473.
    Cheng, Hei Victor
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, Faculty of Science & Engineering.
    Aspects of Power Allocation in Massive MIMO2016Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    The past decades have seen a rapid growth of mobile data trac, both in terms of connected devices and data rate. To satisfy the ever growing data trac demand in wireless communication systems, the current cellular systems have to be redesigned to increase both spectral eciency and energy eciency. Massive MIMO (Multiple-Input-Multiple-Output) is one solution that satisfy both requirements. In massive MIMO systems, hundreds of antennas are employed at the base station to provide service to many users at the same time and frequency. This enables the system to serve the users with uniformly good quality of service simultaneously, with low-cost hardware and without using extra bandwidth and energy. To achieve this, proper resource allocation is needed. Among the available resources, transmit power is one of the most important degree of freedom to control the spectral eciency and energy eciency. Due to the use of excessive number of antennas and low-end hardware at the base station, new aspects of power allocation compared to current systems arises. In the rst part of the thesis, a new uplink power allocation schemes that based on long term channel statistics is proposed. Since quality of the channel estimates is crucial in massive MIMO, in addition to data power allocation, joint power allocation that includes the pilot power as additional variable should be considered. Therefore a new framework for power allocation that matches practical systems is developed, as the methods developed in the literature cannot be applied directly to massive MIMO systems. Simulation results conrm the advantages brought by the the proposed new framework. In the second part of the thesis, we investigate the eects of using low-end ampliers at the base stations. The non-linear behavior of power consumption in these ampliers changes the power consumption model at the base station, thereby changes the power allocation. Two dierent scenarios are investigated and both results show that a certain number of antennas can be turned o in low load scenarios.

  • 474.
    Cheng, Yuelong
    et al.
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Electronics, Mathematics and Natural Sciences.
    Ma, Xiaoying
    University of Gävle, Faculty of Engineering and Sustainable Development, Department of Electronics, Mathematics and Natural Sciences.
    Cyclic Redundancy Check for Zigbee-Based Meeting Attendance Registration System2012Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The research accomplished in this dissertation is focused on the design of effective solutions to the problem that error codes occur in the ZigBee-based meeting attendance registration system. In this work, several different check algorithms are compared, and the powerful error-detecting Cyclic Redundancy Check (CRC) algorithm is studied. In view of the features of the meeting attendance registration system, we implement the check module of CRC-8. This work also considers the data reliability. We assume use retransmission mechanism to ensure the validity and completeness of transmission data. Finally, the potential technical improvement and future work are presented.

  • 475.
    Cheng, Yuxin
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Passive Optical Top-of-Rack Interconnect for Data Center Networks2017Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    Optical networks offering ultra-high capacity and low energy consumption per bit are considered as a good option to handle the rapidly growing traffic volume inside data center (DCs). However, most of the optical interconnect architectures proposed for DCs so far are mainly focused on the aggregation/core tiers of the data center networks (DCNs), while relying on the conventional top-of-rack (ToR) electronic packet switches (EPS) in the access tier. A large number of ToR switches in the current DCNs brings serious scalability limitations due to high cost and power consumption. Thus, it is important to investigate and evaluate new optical interconnects tailored for the access tier of the DCNs.

    We propose and evaluate a passive optical ToR interconnect (POTORI) architecture for the access tier. The data plane of the POTORI consists mainly of passive components to interconnect the servers within the rack as well as the interfaces toward the aggregation/core tiers. Using the passive components makes it possible to significantly reduce power consumption while achieving high reliability in a cost-efficient way.

    Meanwhile, our proposed POTORI’s control plane is based on a centralized rack controller, which is responsible for coordinating the communications among the servers in the rack. It can be reconfigured by software-defined networking (SDN) operation. A cycle-based medium access control (MAC) protocol and a dynamic bandwidth allocation (DBA) algorithm are designed for the POTORI to efficiently manage the exchange of control messages and the data transmission inside the rack.

    Simulation results show that under realistic DC traffic scenarios, the POTORI with the proposed DBA algorithm is able to achieve an average packet delay below 10 μs with the use of fast tunable optical transceivers. Moreover, we further quantify the impact of different network configuration parameters on the average packet delay. 

  • 476.
    Cheng, Yuxin
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Fiorani, Matteo
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Chen, Jiajia
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Reliable and Cost Efficient Passive Optical Interconnects for Data Centers2015In: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 19, no 11, 1913-1916 p.Article in journal (Refereed)
    Abstract [en]

    To address the sustainability, scalability, and reliability problems that data centers are currently facing, we propose three passive optical interconnect (POI) architectures on top of the rack. The evaluation results show that all three architectures offer high reliability performance (connection availability for intra-rack interconnections higher than 99.999%) in a cost-efficient way.

  • 477.
    Cheng, Zhuo
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Hybrid Power Control in Time Division Scheduling Wideband Code Division Multiplex Access2011Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    With high date rates using Enhanced Uplink (EUL), a conventional signal to interference ratio (SIR) based power control algorithm may lead to a power rush due to self interference or incompatible SIR target [2]. Time division (TD) scheduling in Wideband Code Division Multiplex Access (WCDMA) is considered to be a key feature in achieving high user data rates. Unfortunately, power oscillation/peak is observed in time division multiplexing (TDM) at the transition between active and inactive transmission time intervals [1]. Therefore there is a need to revisit power control algorithms for different time division scheduling scenarios.

    The objective of power control in the context of this study is to minimize the required rise over thermal noise (RoT) for a given data rate, subject to the constraint that the physical layer control channel quality is sufficient (assuming that the dedicated physical control channel (DPCCH) SIR should not go below 3dB with a probability of at most 5%). Another goal is to minimize the local oscillation in power (power peaks) that may occur, for example due to transitions between active and inactive transmission time intervals.

    The considered hybrid power control schemes are: (1) non-parametric Generalized rake receiver SIR (GSIR) Inner Loop Power Control (ILPC) during active transmission time intervals + Received Signal Code Power (RSCP) ILPC during inactive transmission time intervals and (2) RSCP ILPC during active transmission time intervals + GSIR ILPC during inactive transmission time intervals. Both schemes are compared with pure GSIR and pure RSCP ILPC.

    Link level simulations with multiple users connected to a single cell show that:

    • The power peak problem is obviously observed in GSIR + GSIR transmit power control (TPC), but in general it performs well in all time division scenarios studied. GSIR outperforms other TPC methods in terms of RoT, especially in the TU channel model. This is because it is good in combating instantaneously changed fading and accurately estimates SIR. Among all TPC methods presented, GSIR + GSIR TPC is best in maintaining the quality of the DPCCH channel. No power rush is observed when using GSIR + GSIR TPC.
    • RSCP + RSCP eliminates the power peak problem and outperforms other TPC methods presented under the 3GPP Pedestrial A (pedA) 3km/h channel in terms of RoT. However, in general it is worse in maintaining the control channel’s quality than GSIR + GSIR TPC.
    • GSIR + RSCP ILPC eliminates the power peak problem and out-performs GSIR power control in the scenario of 2 and 4 TDM high data rate (HDR) UE and 2 TDM HDR UE coexistence with 4 Code DivisionMultiplex (CDM) LDR UE, in the pedA 3km/h channel, in terms of RoT. However, the control channel quality is not maintained as well during inactive transmission time intervals.
    • It is not recommended to use RSCP + GSIR TPC since it performs worst among these TPC methods for most of the cases in terms of RoT, even though it is the second best in maintaining the control channel quality. The power peak is visible when using RSCP + GSIR TPC.

    To maintain the control channel’s quality, a minimum SIR condition is always used on top of all proposed TPC methods. However, when there are several connected TDM HDR UEs in the cell, results indicates that it is challenging to meet the quality requirement on the control channels. So it may become necessary to limit the number of connected terminals in a cell in a time division scenario.

  • 478.
    Chengegowda, Venkatesh
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Analysis of Queues for Interactive Voice and Video Response Systems: Two Party Video Calls2012Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Video conversation on mobile devices is popularizing with the advent of 3G. The enhanced network capacity thus available enables transmission of video data over the internet. It has been forecasted by several VOIP service organizations that the present IVR systems will evolve into Voice and Video Response (IVVR) Systems. However, this evolution has many technical challenges on the way. Architectures to implement queuing systems for video data and standards for inter conversion of video data between the formats supported by calling parties are two of these challenges. This thesis is an analysis of queues and media transcoding for IVVRs.

    A major effort in this work involves constructing a prototype IVVR queuing system. The system is constructed by using an open source server named Asterisk and MySql database. Asterisk is a SIP based Public Exchange Server (PBX) and also a development environment for VOIP based IVRs. Functional scenarios for SIP session establishment and the corresponding session setup times for this queueing model are measured. The results indicate that the prototype serves as a sufficient model for a queue, although a significant delay is introduced for session establishment.  The work also includes analysis of integrating DiaStar™, is a SIP based media transcoding engine to this queue. However, this system is not complete to function with DiaStar for media translation. The study concludes with a mention of the areas for future work on this particular system and the general state of IVVR queuing systems in the industry.

  • 479.
    Chia, Yeow-Khiang
    et al.
    Institute for Infocomm Research, Singapore.
    Kittichokechai, Kittipong
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On secure source coding with side information at the encoder2013In: 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE, 2013, 2204-2208 p.Conference paper (Refereed)
    Abstract [en]

    We consider a secure source coding problem with side informations at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate-limited link to a legitimate decoder. The message sent is also observed by the eavesdropper. The encoder aims to minimize both the distortion incurred by the legitimate decoder; and the information leakage rate at the eavesdropper. When the encoder has access to the side information (S.I.) at the decoder, we characterize the rate-distortion-information leakage rate (R.D.I.) region under a Markov chain assumption and when S.I. at the encoder does not improve the rate-distortion region as compared to the case when S.I. is absent. We then extend our setting to consider the case where the encoder and decoder obtain coded S.I. through a rate-limited helper, and characterize the R.D.I. region for several special cases under logarithmic loss distortion (log-loss). Finally, we consider the case of list or entropy constraints at the decoder and show that the R.D.I. region coincides with R.D.I. region under log-loss.

  • 480. Chiaraviglio, L.
    et al.
    Lorincz, J.
    Monti, Paolo
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Towards sustainable and reliable networks with LIFETEL2015In: Proceedings - IEEE INFOCOM, IEEE conference proceedings, 2015, 39-40 p.Conference paper (Refereed)
    Abstract [en]

    We present the LIFETEL project, whose aim is trying to increase the device lifetime in telecommunication networks by exploiting energy-efficient techniques. In particular, we show that the lifetime of a device might increase when it is put in sleep mode. However, the device lifetime might decrease when power state variations (from sleep mode to full power) occur very frequently. Thus, there is a trade-off between the duration of sleep mode and its frequency. Moreover, we report a lifetime analysis for cellular and backbone devices, showing that the electricity saving may be exceeded by the costs due to the fact that devices fail more frequently compared to the situation in which they are always powered on. Thus, we claim that energy-aware network algorithms should be redesigned in order not to impact and to increase (when possible) the lifetime of network devices.

  • 481.
    Chiaraviglio, Luca
    et al.
    CNIT, Italy.
    Blefari-Melazzi, Nicola
    CNIT, Italy.
    Liu, William
    AUT, New Zealand.
    Gutierrez, Jairo A.
    AUT, New Zealand.
    van de Beek, Jaap
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Birke, Robert
    IBM Research, Switzerland.
    Chen, Lydia
    IBM Research, Switzerland.
    Idzikowski, Filip
    Faculty of Electronics and Telecommunications, Poznan University of Technology.
    Kilper, Daniel
    The University of Arizona.
    Monti, Paolo
    KTH Royal Institute of Technology.
    Wu, Jinsong
    University of Chile.
    5G in rural and low-income areas: Is it feasible?2017In: IEEE Communications Standards Magazine, ISSN 2471-2825Article in journal (Refereed)
    Abstract [en]

    Nowadays, at least two billion people are experiencing a complete lack of wireless cellular coverage. Such users live in rural areas and low-income regions, where the network operators are not keen to invest, mainly due to high Capital Expenditure (CapEx) and Operational Expenditure (OpEx) costs, as well as the scarcity of electricity from the grid. We tackle this challenge by proposing a 5G network explicitly designed to serve rural and low-income areas. Our solution investigates the possibility of mounting Remote Radio Heads (RRHs) on top of Unmanned Aerial Vehicles (UAVs), as well as Large Cells (LCs) to increase the coverage range. In addition, 5G-nodes are powered by solar panels and batteries. Preliminary results, obtained over three representative case studies (located in Italy, Cook Islands, and Zimbabwe) show that providing connectivity in rural and low-income areas by means of the proposed 5G architecture is feasible. At the same time, we also show that the monthly subscription fee paid by the users can be kept sufficiently low, e.g., less than 1 [EUR/month] in low-income areas, and less than 10 [EUR/month] in rural regions.

  • 482.
    Chiesa, Marco
    et al.
    Catholic University of Louvain, Belgium.
    Nikolaevskiy, Ilya
    Aalto University, Finland.
    Mitrovic, Slobodan
    Ecole Polytech Federal Lausanne, Switzerland.
    Gurtov, Andrei
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering. ITMO University, Russia.
    Madry, Aleksander
    MIT, MA 02139 USA.
    Schapira, Michael
    Hebrew University of Jerusalem, Israel.
    Shenker, Scott
    University of Calif Berkeley, CA 94720 USA; Int Comp Science Institute, CA 94704 USA.
    On the Resiliency of Static Forwarding Tables2017In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 25, no 2, 1133-1146 p.Article in journal (Refereed)
    Abstract [en]

    Fast reroute and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. In this paper, we embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packet-headerrewriting, with packet-duplication). Our results show that the resiliency of a routing scheme depends on the "connectivity" k of a network, i.e., the minimum number of link deletions that partition a network. We complement our theoretical result with extensive simulations. We show that resiliency to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplication or randomization. Furthermore, our routing schemes provide resiliency against k - 1 failures, with limited path stretch, by storing log(k) bits in the packet header, with limited packet duplication, or with randomized forwarding technique.

  • 483.
    Cho, Jeong-woo
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Jiang, Yuming
    NTNU (Norwegian University of Science and Technology).
    Fundamentals of the Backoff Process in 802.11: Dichotomy of the Aggregation2015In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 61, no 4, 1687-1701 p.Article in journal (Refereed)
    Abstract [en]

    This paper discovers fundamental principles of the backoff process that governs the performance of IEEE 802.11. A simplistic principle founded upon regular variation theory is that the backoff time has a truncated Pareto-type tail distribution with an exponent of $ { (log gamma !)/log m}$ ( $boldsymbol {m}$ is the multiplicative factor and $ {gamma }$ is the collision probability). This reveals that the per-node backoff process is heavy-tailed in the strict sense for $ { gamma > 1/m^{2}}$ , and paves the way for the following unifying result. The state-of-the-art theory on the superposition of the heavy-tailed processes is applied to establish a dichotomy exhibited by the aggregate backoff process, putting emphasis on the importance of time-scales on which we view the backoff processes. While the aggregation on normal time-scales leads to a Poisson process, it is approximated by a new limiting process possessing long-range dependence (LRD) on coarse time-scales. This dichotomy turns out to be instrumental in formulating short-term fairness, extending existing formulas to arbitrary population, and to elucidate the absence of LRD in practical situations. A refined wavelet analysis is conducted to strengthen this argument.

  • 484.
    Cho, Jeong-woo
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Le Boudec, Jean-Yves
    EPFL (École Polytechnique Fédérale de Lausanne).
    Jiang, Yuming
    NTNU (Norwegian University of Science and Technology).
    On the Asymptotic Validity of the Decoupling Assumption for Analyzing 802.11 MAC Protocol2012In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 58, no 11, 6879-6893 p.Article in journal (Refereed)
    Abstract [en]

    Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. This decoupling assumption results from mean field convergence and is generally true in transient regime in the asymptotic sense (when the number of wireless nodes tends to infinity), but, contrary to widespread belief, may not necessarily hold in stationary regime. The issue is often related with the existence and uniqueness of a solution to a fixed point equation; however, it was also recently shown that this condition is not sufficient; in contrast, a sufficient condition is a global stability property of the associated ordinary differential equation. In this paper, we give a simple condition that establishes the asymptotic validity of the decoupling assumption for the homogeneous case (all nodes have the same parameters). We also discuss the heterogeneous and the differentiated service cases and formulate a new ordinary differential equation. We show that the uniqueness of a solution to the associated fixed point equation is not sufficient; we exhibit one case where the fixed point equation has a unique solution but the decoupling assumption is not valid in the asymptotic sense in stationary regime.

  • 485.
    Cho, Ming-King
    KTH, Superseded Departments, Teleinformatics.
    Paving the Information Superhighway at SNRA: A Proposal for Multimedia Traffic Information Systems1995Independent thesis Advanced level (degree of Master (Two Years)), 12 credits / 18 HE creditsStudent thesis
  • 486.
    Cholaraju Narasaraju, Vignesh
    KTH, School of Information and Communication Technology (ICT).
    Impact of Extended DRX Cycles on Battery Lifetimes and UE Reachability2016Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Several UE energy consumption optimization techniques have been proposed for Machine Type Communication (MTC) devices. Extended Discontinuous Reception (eDRX) in idle mode is one such technique wherein an UE in idle mode wakes up only during its Paging Occasion (PO) to monitor paging messages from eNodeB (eNB). The PO is located within a Paging frame (PF). The PF is a function of System Frame Number (SFN) cycle of eNB. The paging messages may be sent asynchronously from multiple eNBs to a UE. Due to asynchronous operation of eNBs, SFN takes on different values at a given point in time and therefore a paging message is transmitted at different points in time from different eNBs. Due to this SFN misalignment between eNBs, an idle mode UE might receive and respond to the same paging message from different eNBs and/or miss a PO and thus the paging message. Due to this spread in time of SFN and PO, the actual handling of paging message by the UE becomes inefficient leading to increased UE energy consumption and decreased reachability. These issues, resulting from paging handling, will get amplified further if DRX period is extended longer (eDRX).

    In this study, we investigate the impact of eDRX cycles and mobility related parameters such as UE speed, cell size and size of SFN misalignment between eNBs on UE energy consumption, use of network resources and UE reachability. Receiving and responding to the same paging message results in increased energy consumption for UE and increased signaling between UE and the network. Missing a PO results in delayed paging reception and hence decreases UE reachability. As the DRX cycle lengths are increased from existing maximum of 2.56 seconds to 10.24 seconds and beyond, we see a reduction in UE energy consumption by more than 90%, but the network signaling and the delay to reach the UE increases linearly as a function of the DRX cycle length. We observe that the number of duplicate paging message receptions/missed POs is minuscule for DRX cycle lengths below 10.24 sec. At DRX cycle length of 10.24 seconds, UEs travelling across 500 m cell radius at speeds of 3, 50, 100 km/h the percentage of duplicate paging receptions are 0.07, 0.11, and 0.15 respectively. This duplicate paging message reception increases the UE energy consumption by 2.31, 6.15 and 12 percent of the total energy units respectively. Similarly, UE misses nearly 0.34, 0.39, and 0.405 percent of the total POs respectively. Depending on the number of consecutive PO misses, the UE reachability decreases. But by reducing the size of SFN misalignment between eNBs, we see that it’s possible to increase the reachability for UEs in eDRX. Further we have proposed solutions based on our analytical study to avoid duplicate paging message reception by UE, increase UE reachability and also reduce UE energy consumption using a windowing technique. We conclude that when a UE is configured with eDRX cycles, the tradeoff between battery lifetimes and UE reachability is based on mobility characteristics and service requirements.

  • 487.
    Choudrey, Sajaval
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Hiltunen, Kim
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Moln för Försvarsmakten2015Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    An organization with such a big responsibility as the Swedish armed forces constantly needs to find new ways to develop and increase their effectiveness when it comes to management, administration and organization. An information system with cloud computing as a basis would mean a modernization of the Swedish armed force’s administration and could potentially live up to the security standards within the organization. The primary goal of the thesis is to present and analyze cloud solutions that the Swedish armed forces eventually could integrate in to their activities. The first part of the thesis gives an introduction to the cloud technology with the security aspects of a cloud as a large part of the focus. This is followed by information about the Swedish armed forces and their current IT-systems, as well as information on the requirements they have for the implementation of new IT-systems within the organization. Two different cloud services from VMware and Cloudstack have been examined in order to see whether these could be used for a future implementation. The focus of the analysis lies heavily on the security issues and questions, that arise, for each solution, as the security aspect is something that is very important for the Swedish armed forces.

    The thesis also touches on the economical benefits and economical difficulties associated with cloud service implementation. The purpose of this is to see whether an eventual implementation is beneficial or not.

  • 488.
    Chrast, Lukas
    et al.
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    Knaperek, Jozef
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    Kovalcik, Marek
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    BANDWIDTH AGGREGATION OF MOBILE BROADBAND LINKS ON RASPBERRY PI BASED ACCESS POINT2014Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This thesis is concerned with the usability of Raspberry Pi as the access point in the mobilebroadband network environment. The first part of the thesis is dedicated to Raspberry Pi itself;hardware required to set up WLAN and WAN; and to the analysis of suitable solutions forbandwidth aggregation, particularly the load balancing of mobile broadband connections andtheir aggregation into one logical link. The second part deals with the implementation of thesesolutions and subsequently with their testing and verification. The evaluation of results gives aninteresting outcome. Load balancing has proven to be resilient and feasible solution forbandwidth aggregation in the mobile broadband network environment where the speed, packetloss and jitter are of main concern. The second scenario, where the connections are bundled intoone logical link, has turned out to give variable results. Its performance is susceptible to thechanges in the mobile broadband network as the packets across the links in the bundle alternatein the round-robin fashion.

  • 489.
    Christensson, Anja
    et al.
    KTH, School of Industrial Engineering and Management (ITM), Energy Technology.
    Gerson, Nadine
    KTH, School of Industrial Engineering and Management (ITM), Energy Technology.
    Wallin, Edit
    KTH, School of Industrial Engineering and Management (ITM), Energy Technology.
    A Mapping of Scandinavian Smart Grid Development in the Distribution System from an ICT perspective2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
  • 490.
    Christiansson, Fredrik
    KTH, Superseded Departments, Teleinformatics.
    A distributed, mobile positioning systemfor wireless, handheld devices2000Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis investigates the possibilities of implementing a location awareness mechanism for the so-called lesswire localNavigator. The author claims that it is possible to implement such a mechanism within the given prerequisites and constraints, even though with today’s technology it may not be economically feasible.

    Due to the lesswire’s constraints: high accuracy (67%), high-resolution (12 m2) and no hardware modification allowed to the mobile device, the suggested scheme uses Time Difference Of Arrival technology (TDOA). The main advantage of TDOA, as stated in this thesis, is the fact that it is almost totally independent of the preferred wireless technology of the mobile device. TDOA technology therefore, can be applied to a wide range of wireless networks (primarily TDMA, CDMA, FDMA – based). A disadvantage of this scheme is the fact that the network infrastructure needs to be extremely well synchronized - which in turn implies higher costs.

    Depending on how the synchronization problem is solved, the proposed system may well be economically feasible in the near future.

  • 491.
    Chu, Thi My Chin
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
    Zepernick, Hans-Jürgen
    Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
    On Capacity of Full-Duplex Cognitive Cooperative Radio Networks with Optimal Power Allocation2017In: 2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), IEEE , 2017Conference paper (Refereed)
    Abstract [en]

    In this paper, we examine a full-duplex transmission scheme for cognitive cooperative radio networks (CCRNs) to improve capacity. In this network, the secondary transmitter and secondary relay are allowed to utilize the licensed spectrum of the primary user by using underlay spectrum access. We assume that the CCRN is subject to the interference power constraint of the primary receiver and maximum transmit power limit of the secondary transmitter and secondary relay. Under these constraints, we propose an optimal power allocation policy for the secondary transmitter and the secondary relay based on average channel state information (CSI) to optimize capacity. Then, we derive an expression for the corresponding achievable capacity of the secondary network over Nakagami-m fading. Numerical results are provided for several scenarios to study the achievable capacity that can be offered by this full-duplex underlay CCRN using the proposed optimal power allocation scheme.

  • 492.
    Chu, Thi My Chinh
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
    Zepernick, Hans-Jürgen
    Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
    Phan, Hoc
    Univ Reading, GBR.
    Hybrid spectrum access with relay assisting both primary and secondary networks under imperfect spectrum sensing2016In: EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1472, E-ISSN 1687-1499, 244Article in journal (Refereed)
    Abstract [en]

    This paper proposes a novel hybrid interweave-underlay spectrum access for a cognitive amplify-and-forward relay network where the relay forwards the signals of both the primary and secondary networks. In particular, the secondary network (SN) opportunistically operates in interweave spectrum access mode when the primary network (PN) is sensed to be inactive and switches to underlay spectrum access mode if the SN detects that the PN is active. A continuous-time Markov chain approach is utilized to model the state transitions of the system. This enables us to obtain the probability of each state in the Markov chain. Based on these probabilities and taking into account the impact of imperfect spectrum sensing of the SN, the probability of each operation mode of the hybrid scheme is obtained. To assess the performance of the PN and SN, we derive analytical expressions for the outage probability, outage capacity, and symbol error rate over Nakagami-m fading channels. Furthermore, we present comparisons between the performance of underlay cognitive cooperative radio networks (CCRNs) and the performance of the considered hybrid interweave-underlay CCRN in order to reveal the advantages of the proposed hybrid spectrum access scheme. Eventually, with the assistance of the secondary relay, performance improvements for the PN are illustrated by means of selected numerical results.

  • 493.
    Chu, Thi My Chinh
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
    Zepernick, Hans-Jürgen
    Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
    Phan, Hoc
    Duy Tan Univ, VNM.
    Optimal Secrecy Capacity of Underlay Cognitive Radio Networks with Multiple Relays2016In: MILCOM 2016 - 2016 IEEE MILITARY COMMUNICATIONS CONFERENCE, 2016, 162-167 p.Conference paper (Refereed)
    Abstract [en]

    In this paper, we study the secrecy capacity of an underlay cooperative cognitive radio network (CCRN) where multiple relays are deployed to assist the secondary transmission. An optimal power allocation algorithm is proposed for the secondary transmitter and secondary relays to obtain the maximum secrecy capacity while satisfy the interference power constraint at the primary receiver and the transmit power budget of the CCRN. Since the optimization problem for the secrecy capacity is non-convex, we utilize an approximation and fitting method to convert the optimization problem into a geometric programming problem which then is solved by applying the Logarithmic barrier function. Numerical results are provided to study the effect of network parameters on the secrecy capacity. Through the numerical results, the advantage of the proposed power allocation algorithm compared to equal power allocation can also be observed.

  • 494.
    Chuasomboon, Sasit
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    A comparison of ranging and localization techniques in indoor, urban, and tunnel environments2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Localization in wireless network sensors is an attractive research area nowadays. It is widely used in many applications e.g., indoor/outdoor asset tracking, intrusion detection, search-and-rescue, road traffic monitoring, and water quality monitoring. An accuracy and robustness to noise are important issues for localization which is needed to study and research to find the best solution. This thesis compares a ranging and localization techniques in indoor, urban and tunnel through a high performance ray-tracing simulator, Wireless InSiteR . Ranging techniques are based on two standard distance related measurement schemes e.g., RSS and TOA. A linearized least squares technique with reference node selection approach is chosen to estimate unknown nodes positions. Indoor and urban area are built-in floor plan and terrain available in simulator program, while tunnel is designed. In general, localization accuracy suffers from multipath and NLOS condition. This thesis also observes characteristic of them from ray-tracing method perspective. Firstly, important simulation parameters such as number ofreflections/diffractions, types of waveform, and types of antenna are analyzed oneach environments. Then, the models for distance estimation based on RSS and TOA measurements are created using measurements in simulated environments. The thesis proposes four scenarios for distance estimation model. They are line-of-sight (LOS), non-line-of-sight (NLOS), combination of LOS and NLOS, and NLOS with obstacle. All four scenarios models are derived along with model error distribution to observe characteristic of noise due to multipath and NLOS condition. Finally, the localization using only LOS condition measurements, is tested on each environment and compared results in term of accuracy.

  • 495.
    Chupisanyarote, Sanpetch
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Kouyoumdjieva, Sylvia
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Helgason, Ólafur
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Karlsson, Gunnar
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Caching in opportunistic networks with churn2012In: 2012 9th Annual Conference on Wireless On-Demand Network Systems and Services, WONS 2012, IEEE Communications Society, 2012, 39-42 p.Conference paper (Refereed)
    Abstract [en]

    In this paper we examine opportunistic content distribution. We design and evaluate a caching strategy where a node will fetch and share contents on behalf of other nodes, although the contents are not of its own interest. We propose three caching options for improving the use of network resources: relay request on demand, hop-limit, and greedy relay request. The proposed strategies are implemented in the OMNeT++ simulator and evaluated on mobility traces from Legion Studio that have churn. We also compare our strategies with a strategy from the literature. The results are analyzed and they show that the use of opportunistic caching for a community of nodes may enhance the performance marginally while overhead increases significantly.

  • 496.
    Cinkler, Tibor
    et al.
    Budapest University of Technology and Economics, Budapest, Hungary.
    Koucheryavy, Yevgeni
    Department of Communications Engineering, Tampere University of Technology, Tampere, Finland.
    Nagy, Peter
    Scientific Association for Infocommunications, Budapest, Hungary.
    Rak, Jacek
    Gdansk University of Technology, Gdansk, Poland.
    Vinel, Alexey
    Saint-Petersburg Institute for Informatics and Automation, Russian Academy of Sciences, St. Petersburg, Russia.
    ICUMT 2011 Congress in Budapest, Hungary2012In: IEEE Global Communications Newsletter, ISSN 0163-6804, no April, 3-3 p.Article in journal (Other (popular science, discussion, etc.))
  • 497.
    Cipriano, Antonio
    et al.
    Thales Communications and Security, Colombes, France.
    Agostini, Philippe
    Thales Communications and Security, Colombes, France.
    Blad, Anton
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Knopp, Raymond
    Institut Eurecom, Sophia Antipolis, France.
    Cooperative Communications with HARQ in a Wireless Mesh Network Based on 3GPP LTE2012In: Signal Processing Conference (EUSIPCO), 2012, IEEE , 2012, 1004-1008 p.Conference paper (Refereed)
    Abstract [en]

    This paper presents some results from of the FP7 ICT-LOLA (achieving LOw LAtency in wireless communications) project on the design of clusterized wireless mesh network based on 3GPP LTE. First, we focus on the general MAC/PHY structure of the clusterized mesh network based on 3GPP LTE. Then, the concept of virtual link is presented for inter-cluster communications combining MAC layer forwarding, hybrid automatic repeat request (HARQ) and cooperative communications with Decode and Forward (DF). The goal of a virtual link is to enable low latency data transfer in inter-cluster communications. The virtual link solution is studied by simulations thanks to OpenAirInterface which integrates LTE MAC and PHY layer procedures, as well as adaptations needed for the LOLA wireless mesh network. Simulation results show that the proposed distributed solution smoothly adapts to the link conditions. A loss in throughput efficiency is the price to be paid in certain configurations for the distributed operation of the virtual link. Nevertheless, the technique helps in reducing the average number of transmissions thus contributing to improve the latency of the system.

  • 498.
    Cobo Jiménez, Enrique
    et al.
    KTH, School of Information and Communication Technology (ICT).
    Nakarmi, P. K.
    Näslund, M.
    Norrman, K.
    Subscription identifier privacy in 5G systems2017In: 2017 International Conference on Selected Topics in Mobile and Wireless Networking, MoWNeT 2017, Institute of Electrical and Electronics Engineers (IEEE), 2017, 8045947Conference paper (Refereed)
    Abstract [en]

    Privacy is a main concern for mobile network users, and there are many proposed enhancements for the protection of the long-Term subscription identifier. Some enhancements require asymmetric key operations, which increase both processing requirements and protocol message sizes. To the best of our knowledge, there has been no practical implementation feasibility study of these enhancements using commodity mobile devices. Neither is it clear whether the enhancements are sufficient. This paper highlights privacy weaknesses, when the long-Term subscription identifier is used in Paging procedures, and proposes new ways to resolve these. Further, the paper evaluates an Android implementation of one of the enhancements, which includes the asymmetric scheme Elliptic Curve Integrated Encryption Scheme (ECIES). We conclude that it is feasible to implement asymmetric encryption methods for the long-Term subscription identifier and that the highlighted privacy weaknesses can be efficiently countered. This removes another set of obstacles for realizing the protection in mobile network standards.

  • 499.
    Collin, Guillaume
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Chazalet, Boris
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Exploiting cooperative behaviors for VoIP communication nodes in a wireless local area network2007Report (Other academic)
    Abstract [en]

    The purpose of this project was to implement a new design for VoIP communication in a wireless local area. One of the main goals was to experiment with a new approach that exploits cooperative behaviors. By cooperative we mean that the nodes try to cooperate so as to achieve higher cell capacity.

    VoIP communications has such specific data flows that it is interesting to build protocols that exploit these characteristics, for example for speech these characteristics are: regularity and timeconstrained delivery. Furthermore the wireless local area network brings another dimension in terms of all of the nodes sharing a wireless cell, as the nodes will share a common bandwidthlimited media. In the current standard for wireless local area networks the computers in the cell have to contend to get access to the shared media which can lead to delays, even if the bandwidth needed is much lower than the bandwidth available. If we focus on the needs of VoIP, one way to improve this is for all nodes to cooperate by organizing themselves to efficiently share the media. If they can agree with each other on what time each node will transmit, then they don't need to contend anymore. Thus the VoIP packets can reach their destination on time and while minimizing the use of resources in this cell.

    In this project we have designed and test a proof of concept of this cooperation in order to prove that it can work and to show what effects and performance it implies. This work can also be seen more generally as contextawareness research where the contextawareness is used to provide input to the cooperative behavior.

  • 500. Colman-Meixner, C.
    et al.
    Figueiredo, G. B.
    Fiorani, Matteo
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Tornatore, M.
    Mukherjee, B.
    Resilient cloud network mapping with virtualized BBU placement for cloud-RAN2017In: 2016 IEEE International Conference on Advanced Networks and Telecommunications Systems, ANTS 2016, Institute of Electrical and Electronics Engineers (IEEE), 2017, 7947790Conference paper (Refereed)
    Abstract [en]

    Cloud Radio Access Network (C-RAN) will improve mobile radio coordination and resource efficiency by allowing baseband processing unit (BBU) functions to be virtualized and centralized, i.e., deployed in a BBU hotel. We consider a BBU hoteling scheme based on the concept of access cloud network (ACN). An ACN consists of virtualized BBUs (vBBUs) placed in metro cloud data centers (metro DCs). A vBBU is connected to a set of remote radio heads (RRHs). ACN resiliency against network and processing failures is critical for C-RAN deployments. Hence, in this study, we propose three protection approaches: 1+1 ACN protection, 1+1 ACN and vBBU protection, and partial ACN protection. Simulation results show that both 1+1 ACN and 1+1 ACN and vBBU protection requires large capacity for backup to provide 100% survivability for singlelink and single-DC failures. As a result, we suggest a partial ACN protection approach which provides degraded services with only 8% additional network resources.

78910111213 451 - 500 of 3171
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf