Change search
Refine search result
59606162636465 3051 - 3100 of 3328
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)
  • Disputation date (earliest first)
  • Disputation date (latest 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)
  • Disputation date (earliest first)
  • Disputation date (latest 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.
  • 3051.
    Wigren, Torbjörn
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.
    Anderson, Michael
    Kangas, Ari
    Emergency call delivery standards impair cellular positioning accuracy2010In: Proc. International Conference on Communications: ICC 2010, Piscataway, NJ: IEEE, 2010, p. 4655-4660Conference paper (Refereed)
  • 3052.
    Wigren, Torbjörn
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.
    Colombi, Davide
    Thors, Björn
    Berg, Jan-Erik
    Implication of RF EMF exposure limitations on 5G data rates above 6 GHz2015In: Proc. 82nd Vehicular Technology Conference, Piscataway, NJ: IEEE , 2015Conference paper (Refereed)
  • 3053.
    Wigren, Torbjörn
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.
    Hellqvist, Per
    Estimation of uplink WCDMA load in a single RBS2007In: Proc. 66th Vehicular Technology Conference, Piscataway, NJ: IEEE, 2007, p. 1499-1503Conference paper (Refereed)
  • 3054.
    Wigren, Torbjörn
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.
    Jading, Ylva
    Siomina, Iana
    Kangas, Ari
    Tidestav, Claes
    Enhanced WCDMA fingerprinting localization using OTDOA positioning measurements from LTE2012In: Proc. 76th Vehicular Technology Conference, Piscataway, NJ: IEEE, 2012Conference paper (Refereed)
  • 3055.
    Wigren, Torbjörn
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.
    Karaki, Reem
    Globally stable wireless data flow control2018In: IEEE Transactions on Control of Network Systems, ISSN 2325-5870, Vol. 5, no 1, p. 469-478Article in journal (Refereed)
  • 3056.
    Wigren, Torbjörn
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.
    Palenius, Torgny
    Optimized search window alignment for A-GPS2009In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 58, no 8, p. 4670-4675Article in journal (Refereed)
  • 3057.
    Wigren, Torbjörn
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.
    Wennervirta, Jenni
    RTT positioning in WCDMA2009In: Proc. 5th International Conference on Wireless and Mobile Communications, IEEE Computer Society, 2009, p. 303-308Conference paper (Refereed)
  • 3058.
    Wiklander, Erik
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Mobile Resource Awareness2001Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    New types of cellular networks are appearing on the market, such as GPRS and UMTS. In addition to this, an increasing number of places are being equipped with wireless LAN extensions to the Internet. Simultaneously, new mobile devices are becoming available that can perform complex computations based on events from various input devices and/or information sources. The combination of extended network connectivity and new mobile devices creates new opportunities for network computing.

    This paper presents a scenario where network enabled applications can interact with mobile devices to create a smart space. The ambition is to create a system where mobile devices can be aware of what resources are present at a specific location. The prototype solution in this paper uses an XML-based protocol and a tuple space architecture as a message passing mechanism.

  • 3059.
    Willig, Andreas
    et al.
    Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand.
    Uhlemann, Elisabeth
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).
    Deadline-Aware Scheduling of Cooperative Relayers in TDMA-Based Wireless Industrial Networks2014In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 20, no 1, p. 73-88Article in journal (Refereed)
    Abstract [en]

    In this paper we consider a scenario in which a set of source nodes wishes to transmit real-time data packets periodically to a central controller over lossy wireless links, while using a TDMA-based medium access control protocol. Furthermore, a number of relay nodes are present which can help the source nodes with packet retransmissions. The key question we consider in this paper is how to schedule the TDMA slots for retransmissions while taking advantage of the relay nodes, so that the average number of packets missing their deadlines is minimized. We provide a problem formulation for the general deadline-aware TDMA relay scheduling problem. Since the design space of the general problem is large, we also present one particular class of restricted TDMA relay scheduling problems. We suggest and numerically investigate a range of algorithms and heuristics, both optimal and suboptimal, of the restricted scheduling problem, which represent different trade-offs between achievable performance and computational complexity. Specifically, we introduce two different Markov Decision Process (MDP) based formulations for schedule computation of the restricted TDMA relay scheduling problem. One MDP formulation gives an optimal schedule, another (approximate) formulation gives a sub-optimal schedule which, however, comes very close to the optimal performance at much more modest computational and memory costs. © 2013 Springer Science+Business Media New York.

  • 3060.
    Willig, Andreas
    et al.
    University of Canterbury, Christchurch, New Zealand.
    Uhlemann, Elisabeth
    Högskolan i Halmstad, Inbyggda system (CERES).
    Deadline-Aware Scheduling of Cooperative Relayers in TDMA-Based Wireless Industrial Networks2014In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 20, no 1, p. 73-88Article in journal (Refereed)
    Abstract [en]

    In this paper we consider a scenario in which a set of source nodes wishes to transmit real-time data packets periodically to a central controller over lossy wireless links, while using a TDMA-based medium access control protocol. Furthermore, a number of relay nodes are present which can help the source nodes with packet retransmissions. The key question we consider in this paper is how to schedule the TDMA slots for retransmissions while taking advantage of the relay nodes, so that the average number of packets missing their deadlines is minimized. We provide a problem formulation for the general deadline-aware TDMA relay scheduling problem. Since the design space of the general problem is large, we also present one particular class of restricted TDMA relay scheduling problems. We suggest and numerically investigate a range of algorithms and heuristics, both optimal and suboptimal, of the restricted scheduling problem, which represent different trade-offs between achievable performance and computational complexity. Specifically, we introduce two different Markov Decision Process (MDP) based formulations for schedule computation of the restricted TDMA relay scheduling problem. One MDP formulation gives an optimal schedule, another (approximate) formulation gives a sub-optimal schedule which, however, comes very close to the optimal performance at much more modest computational and memory costs.

  • 3061.
    Willig, Andreas
    et al.
    University of Canterbury.
    Uhlemann, Elisabeth
    Högskolan i Halmstad, Inbyggda system (CERES).
    On relaying for wireless industrial communications: Is careful placement of relayers strictly necessary?2012In: IEEE International Workshop on Factory Communication Systems, 2012, p. 191-200Conference paper (Refereed)
    Abstract [en]

    Relaying is a very promising technique to improve the reliability of data transmission in wireless (industrial) networks. With relaying, relay nodes support source nodes in carrying out retransmissions. A common assumption is that relayers should be placed at “good” positions (e.g. in the middle between source and destination) to achieve benefits. In this paper we tackle the question of whether it is strictly necessary to place relayers at “good” positions (which often requires extensive measurements). We present results indicating that the benefits of relaying are achievable even with randomly placed relayers, as long as enough of them are deployed. Specifically, we present results suggesting that with a sufficient (and still not too high) number of randomly deployed relayers, the probability that all packets, sent by source nodes to a central controller in a TDMA round, reach the controller is larger than for the case with source-only retransmissions. This finding holds true both in the absence and the presence of feedback.

  • 3062.
    Willig, Andreas
    et al.
    University of Canterbury, Christchurch, New Zealand.
    Uhlemann, Elisabeth
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).
    On relaying for wireless industrial communications: Is careful placement of relayers strictly necessary?2012In: IEEE International Workshop on Factory Communication Systems - Proceedings, WFCS, Piscataway, NJ: IEEE Press, 2012, p. 191-200, article id 6242567Conference paper (Refereed)
    Abstract [en]

    Relaying is a very promising technique to improve the reliability of data transmission in wireless (industrial) networks. With relaying, relay nodes support source nodes in carrying out retransmissions. A common assumption is that relayers should be placed at “good” positions (e.g. in the middle between source and destination) to achieve benefits. In this paper we tackle the question of whether it is strictly necessary to place relayers at “good” positions (which often requires extensive measurements). We present results indicating that the benefits of relaying are achievable even with randomly placed relayers, as long as enough of them are deployed. Specifically, we present results suggesting that with a sufficient (and still not too high) number of randomly deployed relayers, the probability that all packets, sent by source nodes to a central controller in a TDMA round, reach the controller is larger than for the case with source-only retransmissions. This finding holds true both in the absence and the presence of feedback. © 2012 IEEE.

  • 3063. Willkomm, Daniel
    et al.
    Hollos, Daniel
    Bohge, Mathias
    Gross, James
    Wolisz, Adam
    Double Hopping: A new Approach for Dynamic Frequency Hopping in Cognitive Radio Networks2008In: IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, 2008. PIMRC 2008, IEEE conference proceedings, 2008, p. 1-6Conference paper (Refereed)
    Abstract [en]

    One of the major challenges in designing cellular cognitive radio (CR) networks is the avoidance of secondary user (SU) interference to so called primary users (PUs) operating in the licensed bands. Usually, SU operation has to be interrupted periodically in order to detect PU activity and avoid the respective frequencies. Recently, dynamic frequency hopping (DFH) mechanisms have been suggested to enable reliable PU detection and continuous SU operation at the same time. Applying DFH in a multi-cell environment adds the challenge of mitigating co-channel interference (CCI). In this paper, we introduce a new DFH approach for cellular CR networks to allow reliable PU detection and continuous SU operation while avoiding CCI: double hopping (DH). We present a distributed frequency assignment heuristic for DH and compare it to the optimal assignment. We show that the performance of the sub-optimal distributed assignment is only slightly worse than the optimal performance, and, thus, outperforms existing distributed approaches by far.

  • 3064.
    Winter, Philipp
    et al.
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science.
    Lindskog, Stefan
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science.
    How China Is Blocking Tor2012Report (Other academic)
    Abstract [en]

    Not only the free web is victim to China’s excessive censorship, but also the Tor anonymity network: the Great Firewall of China prevents thousands of potential Tor users from accessing the network. In this paper, we investigate how the blocking mechanism is implemented, we conjecture how China’s Tor blocking infrastructure is designed and we propose countermeasures. Our work bolsters the understanding of China’s censorship capabilities and thus paves the way towards more effective evasion techniques.

  • 3065.
    Winter, Philipp
    et al.
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science.
    Lindskog, Stefan
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science.
    How the Great Firewall of China is Blocking Tor2012Conference paper (Refereed)
    Abstract [en]

    Internet censorship in China is not just limited to the web: the Great Firewall of China prevents thousands of potential Tor users from accessing the network. In this paper, we investigate how the blocking mechanism is implemented, we conjecture how China's Tor blocking infrastructure is designed and we propose circumvention techniques. Our work bolsters the understanding of China's censorship capabilities and thus paves the way towards more effective circumvention techniques.

  • 3066.
    Wisell, David
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. University of Gavle, Sweden.
    Isaksson, Magnus
    KTH, School of Electrical Engineering (EES), Signal Processing. University of Gavle, Sweden.
    Keskitalo, N.
    A general evaluation criteria for behavioral power amplifier modeling2007In: 69th ARFTG Microwave Measurements Conference - Addressing Metrology Needs for Future High-Speed Information and Communications Systems, 2007, p. 5456311-Conference paper (Refereed)
    Abstract [en]

    In this paper a new goodness measure for behavioral complex envelope power amplifier models is defined in the frequency domain. The measure can be calculated for any input signal using the same formulas, which makes it general and easy to use. The results will however be dependent on the input signal. The total model error, or normalized mean-square error, for power amplifier models are normally dominated by the in-band error, often mainly caused by the linear distortion. The new measure is aimed at capturing the nonlinear modeling performance of the amplifier model. This is of interest since it is most often the nonlinear, rather than the linear, distortion that causes most harm in real-life power amplifier applications.

  • 3067.
    Wolkerstorfer, Martin
    et al.
    FTW Telecommunications Research Center Vienna, Vienna, Austria.
    Jaldén, Joakim
    ACCESS Linnaeus Center, Signal Processing Lab, KTH Royal Institute of Technology, Stockholm, Sweden.
    Nordström, Tomas
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES). FTW Telecommunications Research Center Vienna, Vienna, Austria.
    Column Generation for Discrete-Rate Multi-User and Multi-Carrier Power Control2012In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 60, no 9, p. 2712-2722Article in journal (Refereed)
    Abstract [en]

    We consider a constrained multi-carrier power allocation problem in interference-limited multi-user systems with a finite set of transmission rates. The Lagrange relaxation is a common technique for decomposing such problems into independently solvable per-subcarrier problems. Deviating from this approach our main contribution is the proposal of a novel spectrum management framework based on a Nonlinear Dantzig-Wolfe problem decomposition. It allows for suboptimal initialization and suboptimal power allocation methods with low complexity. While we show that the combinatorial per-subcarrier problems have polynomial complexity in the number of users, we find that such suboptimal methods are indispensable in large systems. Thus we give an overview of various basic dual heuristics and provide simulation results on a set of thousand digital subscriber line (DSL) networks which show the superior performance of our framework compared to previous power control algorithms. © 2012 IEEE.

  • 3068. Wong, E.
    et al.
    Machuca, C. M.
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Survivable architectures for power-savings capable converged access networks2016In: 2016 IEEE International Conference on Communications, ICC 2016, IEEE conference proceedings, 2016, p. 365-371, article id 7510719Conference paper (Refereed)
    Abstract [en]

    The reliance on the loss-of-signal (LOS) of upstream transmissions to indicate fiber/component failure is potentially unsuitable in networks that implement sleep/doze mode operation. In such networks, the transition into sleep/doze mode would result in no signal transmission, and when used in conjunction with conventional LOS to indicate network failure, would result in erroneous triggering of false alarm and subsequently protection switching. Recently, converged access networks using a hybrid passive optical architecture, have been favored as a low-cost and high-bandwidth solution to deliver high-bandwidth applications to both fixed access and mobile users. These networks are referred to as Hybrid PON Converged Access Networks. Protection against fiber/equipment failures in these networks is critical considering the customer base, network span, and traffic supported. This paper proposes four survivable architectures for such converged access networks. These architectures combine rapid fault detection and protection switching against high impact failures but without the need to rely on upstream transmissions for LOS detection. A comparison of the four architectures across three different area densities under three deployment scenarios, is presented. Guidance for selecting the best protection architecture to be deployed, considering area densities and deployment scenarios, is provided.

  • 3069.
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Connection availability in WDM mesh networks with multiple failures2006In: ICTON 2006: 8th International Conference on Transparent Optical Networks, Vol 3, Proceedings / [ed] Marciniak, M, 2006, p. 126-129Conference paper (Refereed)
    Abstract [en]

    Wavelength Division Multiplexed (WDM) technology has revolutionized wide-area networks. As the amount of traffic carried is very large, any single failure can be catastrophic. Thus, survivability of a network that refers to a network's capability to provide continuous service in the presence of failures has become crucial in such networks. Communication networks are usually designed to survive single failure. However, in large networks the occurrence of multiple concurrent failures cannot be neglected. Therefore, in this paper we study connection availability in WDM networks assuming failures of any multiplicity. Shared Path Protection (SPP) scheme is an efficient network recovery mechanism in terms of network resource utilization and in many related works the SPP scheme has been studied to solve a single failure problem. We apply SPP scheme and propose an analytical model for calculation of connection unavailability in WDM mesh networks with multiple failure assumption. We have evaluated our model by simulations and show that the connection unavailability obtained by simulations is very close to the theoretical value obtained by our algorithm, which proves the accuracy of our model.

  • 3070.
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Optical network architectures for datacenters2017In: Optics InfoBase Conference Papers, Optics Info Base, Optical Society of America, 2017, Vol. Part F53Conference paper (Refereed)
    Abstract [en]

    The talk will highlight challenges related to dramatically growing datacenter traffic. The advantages of using photonic technology in intra-datacenter networks will be discussed and a crosslayer view of network architecture design will be presented.

  • 3071.
    Wosinska, Lena
    et al.
    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).
    Monti, Paolo
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Next Generation Optical Access Network Architectures: What is the Best Option?2013Conference paper (Other academic)
  • 3072.
    Wosinska, Lena
    et al.
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Haralson, Joanna
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Thylén, Lars
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Öberg, Johnny
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Hessmo, Björn
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Benefit of Implementing Novel Optical Buffers in an Asynchronous Photonic Packet Switch2004In: Proceedings of ECOC-04, 2004Conference paper (Refereed)
  • 3073.
    Wosinska, Lena
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Monti, Paolo
    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).
    Dreier, Dennis
    KTH, School of Industrial Engineering and Management (ITM), Energy Technology, Energy and Climate Studies, ECS.
    Silveira, Semida
    KTH, School of Industrial Engineering and Management (ITM), Energy Technology, Energy and Climate Studies, ECS.
    ICT Infrastructure for Smart Cities: Curitiba, Brazil2015Conference paper (Other academic)
  • 3074.
    Wosinski, Lech
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Applied Physics, MAP.
    Nanophotonic devices based on silicon-on-insulator nanowire waveguides2006In: ICTON 2006: 8th International Conference on Transparent Optical Networks, Vol 1, Proceedings: ICTON, MPM, INDUSTRIAL, PICAW, GOWN / [ed] Marciniak, M, 2006, p. 206-209Conference paper (Refereed)
    Abstract [en]

    While silica-on-silicon is recognized as one of the dominant platforms for microphotonics today, silicon-on-insulator nanowire waveguides appear to be the technology for next generation of super compact integrated devices. Due to very high refractive index contrast and strong light confinement in the core, the waveguide bend radius can be reduced to a few micrometers and the size reduction of the functional integrated circuits can reach several orders of magnitude. An array waveguide grating multi/demultiplexer that usually occupies several square centimetres in silica-on-silicon technology can be reduced to the size of 50 x 50 mu m(2). The performance of such miniaturized devices with submicrometer-size waveguides strongly depends on the fabrication accuracy: high resolution patterning and low roughness etching. High quality and high precision optimized processing is necessary to obtain satisfactory results. We discuss here the technology issues as well as present some fabricated devices based on silicon nanowire waveguides.

  • 3075.
    Wu, Chia-Lung
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Chen, P. -N
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Ming, Xiao
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Shin-Lin, S.
    A two-phase maximum-likelihood sequence estimation for receivers with partial CSI2013In: 9th International Conference on Information, Communications and Signal Processing, ICICS 2013, IEEE Computer Society, 2013, p. 6782818-Conference paper (Refereed)
    Abstract [en]

    The optimality of the conventional maximum-likelihood sequence estimation (MLSE), also known as the Viterbi Algorithm (VA), relies on the assumption that the receiver has perfect knowledge of the channel coefficients or channel state information (CSI). However, in practical situations that fail the assumption, the MLSE method becomes suboptimal and then exhaustive checking is the only way to obtain the ML sequence. At this background, considering directly the ML criterion for partial CSI, we propose a two-phase low-complexity MLSE algorithm, in which the first phase performs the conventional MLSE algorithm in order to retain necessary information for the backward VA performed in the second phase. Simulations show that when the training sequence is moderately long in comparison with the entire data block such as 1/3 of the block, the proposed two-phase MLSE can approach the performance of the optimal exhaustive checking. In a normal case, where the training sequence consumes only 0.14 of the bandwidth, our proposed method still outperforms evidently the conventional MLSE.

  • 3076. Wu, J.
    et al.
    Zhou, S.
    Niu, Z.
    Liu, C.
    Yang, P.
    Miao, Guowang
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Traffic-Aware Data and Signaling Resource Management for Green Cellular Networks2014Conference paper (Refereed)
    Abstract [en]

    The increasing traffic demands bring heavy load toboth the data and control planes of cellular networks, along withsubstantial energy consumption. To solve the issue, new networkarchitecture that separates signaling and data has been proposedin literature for future green cellular networks. In this paper, weanalyze the data and signaling resource configuration problemin this new network architecture. We find the optimal resourcepartitioning parameters to optimize the blocking performanceand to minimize the overall network power consumption witha blocking probability constraint. More specifically, we adopttraffic-aware resource allocation between the data and signalingbase stations (BSs) to improve network access capability whilereducing the overall network power consumption. Two typesof resource partitioning patterns, complete partitioning andpartial partitioning, are studied. Numerical results show thatgreat energy-saving gain can be achieved compared with thetraditional fixed and traffic-proportional resource partitioningpatterns. Moreover, power consumption and blocking performancetradeoffs are explored, based on which the appropriateresource partitioning pattern can be chosen according to differentquality of service (QoS) requirements.

  • 3077.
    Wu, Jiang
    et al.
    KTH, Superseded Departments, Teleinformatics.
    Maguire Jr., Gerald Q.
    KTH, Superseded Departments, Teleinformatics.
    Agent Based Seamless IP Multicast Receiver Handover2000In: Proceedings of the IFIP TC6/WG6.8 Working Conference on Personal Wireless Communications, Deventer, The Netherlands: Kluwer, B.V. , 2000, p. 213-226Conference paper (Refereed)
  • 3078. Wu, Jing
    et al.
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Optics and Photonics, Photonics.
    Jin, Yaohui
    Araki, Soichiro
    Special Issue on Optical Network Architectures and Management2011In: Optical Switching and Networkning Journal, ISSN 1573-4277, E-ISSN 1872-9770, Vol. 8, no 4, p. 225-225Article in journal (Other academic)
  • 3079. Wu, Jing
    et al.
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Shen, Gangxiang
    Spadaro, Salvatore
    Advances in optical networks control and management2013In: Optical Switching and Networkning Journal, ISSN 1573-4277, E-ISSN 1872-9770, Vol. 10, no 1, p. 1-2Article in journal (Other academic)
  • 3080. Wu, Jinsong
    et al.
    Bisio, Igor
    Gniady, Chris
    Hossain, Ekram
    Valla, Massimo
    Li, Haibo
    KTH, School of Computer Science and Communication (CSC), Media Technology and Interaction Design, MID.
    Context-aware networking and communications: Part 12014In: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, Vol. 52, no 6, p. 14-15Article in journal (Refereed)
  • 3081.
    Wu, Jun
    KTH, School of Information and Communication Technology (ICT).
    Signal Collecting Platform and "Handprint" Positioning System2015Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Mobile computing is an emerging research field in recent years. Although the computation capability of main stream smartphones are several orders of magnitude better than computers twenty years ago, the capacity of battery does not increase at same speed. To save energy, some recent work tries to schedule network traffic according to signal strength variations. To achieve this goal, a database that is used for storing signal strength distribution is essential.We first design and implement a platform to collect cellular network information, including Cell-ID and signal strength information. The platform is designed as a distributed system that supports collecting signal strength data by using crowdsourcing approach.We then deploy the platform and collect signal strength information in Otaniemi area (Finland). After analysing the collected data, we observe several interesting phenomenons. (1) the density of base stations is out of expectation; (2) cells is becoming smaller; (3) in most places a device may connect to different base stations. Based on these observations, we design a new energy-efficient positioning system called “handprint”, which utilises signal strength information from neighbouring smartphones to assist positioning. Compared with Google Geolocation API and other existing work, our “handprint” system can improve positioning accuracy by more than 20%.

  • 3082. Wu, L.
    et al.
    Sun, P.
    Xiao, Ming
    KTH, School of Electrical Engineering (EES), Information Science and Engineering.
    Hu, Y.
    Wang, Z.
    Sparse Signal Aloha: A Compressive Sensing-Based Method for Uncoordinated Multiple Access2017In: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 21, no 6, p. 1301-1304, article id 7849200Article in journal (Refereed)
    Abstract [en]

    We investigate the problem of sparse signal medium access control in the wireless sensor networks. The proposed sparse signal Aloha (SSA) transmits sampled compressive data to the fusion center using Aloha random access protocol. In order to maximize the overall data transmission rate in the presence of packet collision, redundant data are randomly subsampled at individual sensor nodes according to an optimal subsampling rate before transmission. Data loss due to random subsampling and collision in the wireless channel are compensated using compressive sensing recovery method at the fusion center. Simulation results verify the theoretical analysis and show the significant improvement of SSA compared with existing CS-based random access method.

  • 3083.
    Wu, Xiao
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    SIP on an Overlay Network2009Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    With the development of mobile (specifically: wide area cellular telephony) technology, users’ requirements have changed from the basic voice service based on circuit switch technology to a desire for high speed packet based data transmission services. Voice over IP (VoIP), a packet based service, is gaining increasing attention due to its high performance and low cost. However, VoIP does not work well in every situation. Today Network address translation (NAT) traversal has become the main obstruction for future VoIP deployment.

    In this thesis we analyze and compare the existing NAT traversal solutions. Following this, we introduce a VoIP over IPSec (VOIPSec) solution (i.e., a VoIP over IPSec virtual private network (VPN) scheme) and an extended VOIPSec solution mechanism. These two solutions were tested and compared to measure their performance in comparison to a version of the same Session Initiation Protocol (SIP) user agent running without IPSec.

    In the proposed VOIPSec solution, the IPSec VPN tunnel connects each of the SIP clients to a SIP server, thus making all of the potential SIP participants reachable, i.e., solving the NAT traversal problem. All SIP signaling and media traffic for VoIP calls are transmitted through this prior established tunnel. This VPN tunnel provides the desired universal means for VoIP traffic to traverse NAT equipment. Additionally, the IPSec VPN also guarantees the security of VoIP calls at the IP level.

    In order to improve the security level of media streams for the VOIPSec solution, we deployed and evaluated an extended VOIPSec solution which provides end-to-end protection of the real time media traffic. In this extended VOIPSec solution, we used SRTP instead of RTP to carry the media content. This extended method was shown to provide all of the advantages of VOIPSec and SRTP without any additional delay for the media traffic (as compared to the VoIPSec solution).

    Note that the solution proposed in this thesis may be of limited practical importance in the future as more NATs become VoIP capable; but the solution is currently essential for facilitating the increasing deployment of VoIP systems in practice. For VoIP calls that do not need end-to-end security, we recommend the use of the VOIPSec solution as a means to solve the NAT traversal problem and to protect traffic at the IP level. When application to application security is not needed we prefer the VOIPSec solution to the extended VOIPSec solution for the following reasons: (1) our test results show that the time for call setup for the extended VOIPSec solution is twice time the time needed for the VOIPSec solution and the extended VOIPSec solution requires the use of user agents that support SRTP. While, the VOIPSec solution does not require a special user agent and all VoIP clients in the market are compatible with this solution. However, when more SIP user agents add support for SRTP, the extended VOIPSec solution will be applicable for users of these SIP user agents.

  • 3084.
    Wu, Yiming
    et al.
    KTH, School of Electrical Engineering (EES), Industrial Information and Control Systems.
    Honeth, Nicholas
    KTH, School of Electrical Engineering (EES), Industrial Information and Control Systems.
    Nordström, Lars
    KTH, School of Electrical Engineering (EES), Industrial Information and Control Systems.
    Shi, Zhanpeng
    ABB AB, Substn Automat Prod, Vasteras, Sweden.
    Software Merging Unit based IED Functional Test Platform2015Conference paper (Refereed)
    Abstract [en]

    In Substation Automation Systems, application functions such as monitoring, control, and protection are deployed in intelligent electronic devices (IEDs). Before the IEDs are installed in the substation, functions are tested by the manufactures to ensure that the functions operate properly as designed. A conventional function test platform is made of amplifiers with copper wire connection to the IEDs. It has drawbacks such as high cost, limited flexibility, and limited number of signal channels. With the introduction of the IEC61850 standard, IEDs are able to obtain measurement from merging units (MU) via the process bus. Consequently, using MUs to replace the amplifier for IED function testing has been studied by several research groups. All of them use hardware MUs or power system simulator embedded MUs. These MUs based test platforms have weakness such as limitation of the number of MUs and lower flexibility in MU performance modification, This paper proposes a novel IED functional test platform using software MU (sMU), which mitigates the above limitations. Thanks to the software approach, different MU performance scenarios can be easily configured instead of using a complicated communications simulator. The sMU based test platform concept has been proved by performing accuracy and operate-time tests with transformer differential protection. Comparing with conventional test platform, sMU based test platform has better results in the accuracy tests and similar performance in the operate-time tests. Therefore, it is feasible to use sMU based platform for IED functional tests.

  • 3085.
    Wu, Yiming
    et al.
    KTH, School of Electrical Engineering (EES), Industrial Information and Control Systems.
    Saleem, Arshad
    KTH, School of Electrical Engineering (EES), Industrial Information and Control Systems.
    Nordström, Lars
    KTH, School of Electrical Engineering (EES), Industrial Information and Control Systems.
    IEC61850 Logical Node Lookup Service Using Distributed Hash Tables2014In: 2014 IEEE PES Innovative Smart Grid Technologies Conference, ISGT 2014, IEEE Computer Society, 2014, p. 6816443-Conference paper (Refereed)
    Abstract [en]

    Development of Information and Communication Technology (ICT) increases the communication capability of equipment in power system and also creates large number of data sources. In order to reliably share these data sources with applications is a new challenge for power system. This paper presents an alternate data delivery system solution using IEC61850 standard Manufactory Messaging Specification (MMS) across wide area networks, utilizing Distributed Hash Table (DHT) for look-up of Logical Nodes addresses.  Result of the proposed scheme is a flexible, autonomous, scalable, and robust method to address Logical Nodes across a Wide Area Network. In comparison with IEC61850-90-2 solution, this solution can help reduce the manual work in configuration of each link, and enables greater flexibility for adding new data points. The presented platform also opens door of providing adaptive data acquisition for power system applications by implementing a filtering function in the ISG.

  • 3086.
    Wu, Yongliang
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Aggregating product reviews for the Chinese market2009Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    As of December 2007, the number of Internet users in China had increased to 210 million people. The annual growth rate reached 53.3 percent in 2008, with the average number of Internet users increasing every day by 200,000 people. Currently, China's Internet population is slightly lower than the 215 million internet users in the United States. [1]

    Despite the rapid growth of the Chinese economy in the global Internet market, China’s e-commerce is not following the traditional pattern of commerce, but instead has developed based on user demand. This growth has extended into every area of the Internet.

    In the west, expert product reviews have been shown to be an important element in a user’s purchase decision. The higher the quality of product reviews that customers received, the more products they buy from on-line shops. As the number of products and options increase, Chinese customers need impersonal, impartial, and detailed products reviews. This thesis focuses on on-line product reviews and how they affect Chinese customer’s purchase decisions.

    E-commerce is a complex system. As a typical model of e-commerce, we examine a Business to Consumer (B2C) on-line retail site and consider a number of factors; including some seemingly subtitle factors that may influence a customer’s eventually decision to shop on website. Specifically this thesis project will examine aggregated product reviews from different on-line sources by analyzing some existing western companies. Following this the thesis demonstrates how to aggregate product reviews for an e-business website.

    During this thesis project we found that existing data mining techniques made it straight forward to collect reviews. These reviews were stored in a database and web applications can query this database to provide a user with a set of relevant product reviews. One of the important issues, just as with search engines is providing the relevant product reviews and determining what order they should be presented in. In our work we selected the reviews based upon matching the product (although in some cases there are ambiguities concerning if two products are actually identical or not) and ordering the matching reviews by date - with the most recent reviews present first.

    Some of the open questions that remain for the future are: (1) improving the matching - to avoid the ambiguity concerning if the reviews are about the same product or not and (2) determining if the availability of product reviews actually affect a Chinese user's decision to purchase a product.

  • 3087.
    Wuhib, Fetahi
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Dam, Mads
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks.
    A Gossiping Protocol for Detecting Global Threshold Crossings2010In: IEEE Transactions on Network and Service Management, ISSN 1932-4537, E-ISSN 1932-4537, Vol. 7, no 1, p. 42-57Article in journal (Refereed)
    Abstract [en]

    We investigate the use of gossip protocols for the detection of network-wide threshold crossings. Our design goals are low protocol overhead, small detection delay, low probability of false positives and negatives, scalability, robustness to node failures and controllability of the trade-off between overhead and detection delay. Based on push-synopses, a gossip protocol introduced by Kempe et al., we present a protocol that indicates whether a global aggregate of static local values is above or below a given threshold. For this protocol, we prove correctness and show that it converges to a state with no overhead when the aggregate is sufficiently far from the threshold. Then, we introduce an extension we call TG-GAP, a protocol that (1) executes in a dynamic network environment where local values change and (2) implements hysteresis behavior with upper and lower thresholds. Key elements of its design are the construction of snapshots of the global aggregate for threshold detection and a mechanism for synchronizing local states, both of which are realized through the underlying gossip protocol. Simulation studies suggest that TG-GAP is efficient in that the protocol overhead is minimal when the aggregate is sufficiently far from the threshold, that its overhead and the detection delay are largely independent on the system size, and that the tradeoff between overhead and detection quality can be effectively controlled. Lastly, we perform a comparative evaluation of TG-GAP against a tree-based protocol. We conclude that, for detecting global threshold crossings in the type of scenarios investigated, the tree-based protocol incurs a significantly lower overhead and a smaller detection delay than a gossip protocol such as TG-GAP.

  • 3088.
    Wuhib, Fetahi
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Distributed monitoring and resource management for large cloud environments2011In: International Symposium on Integrated Network Management (IM), 2011 IFIP/IEEE, IEEE Communications Society, 2011, p. 970-975Conference paper (Refereed)
    Abstract [en]

    Over the last decade, the number, size and complexityof large-scale networked systems has been growing fast, andthis trend is expected to accelerate. The best known example of alarge-scale networked system is probably the Internet, while largedatacenters for cloud services are the most recent ones. In suchenvironments, a key challenge is to develop scalable and adaptivetechnologies for management functions. This thesis addressesthe challenge by engineering several protocols for distributedmonitoring and resource management that are suitable for largescalenetworked systems. The protocols are evaluated throughtheoretical analysis, simulation studies and testbed experimentation.The evaluation results show that the protocols achieve theirrespective design objectives with respect to quality, efficiency,scalability, controllability and adaptability.

  • 3089.
    Wuhib, Fetahi
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Dam, Mads
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Gossiping for Threshold Detection2009In: 2009 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2009) VOLS 1 AND 2, NEW YORK: IEEE , 2009, p. 259-266Conference paper (Refereed)
    Abstract [en]

    We investigate the use of gossip protocols to detect threshold crossings of network-wide aggregates. Aggregates are computed from local device variables using functions such as SUM, AVERAGE, COUNT, MAX and MIN. The process of aggregation and detection is performed using a standard gossiping scheme. A key design element is to let nodes dynamically adjust their neighbor interaction rates according to the distance between the nodes' local estimate of the global aggregate and the threshold itself. We show that this allows considerable savings in communication overhead. In particular, the overhead becomes negligible when the aggregate is sufficiently far above or far below the threshold. We present evaluation results from simulation studies regarding protocol efficiency, quality of threshold detection, scalability, and controllability.

  • 3090.
    Wuhib, Fetahi
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Spreitzer, Mike
    Gossip-based Resource Management for Cloud Environments2010In: International Conference on Network and Service Management, 2010, p. 1-8Conference paper (Refereed)
    Abstract [en]

    We address the problem of resource management for a large-scale cloud environment that hosts sites. Our contribution centers around outlining a distributed middleware architecture and presenting one of its key elements, a gossip protocol that meets our design goals: fairness of resource allocation with respect to hosted sites, efficient adaptation to load changes and scalability in terms of both the number of machines and sites. We formalize the resource allocation problem as that of dynamically maximizing the cloud utility under CPU and memory constraints. While we can show that an optimal solution without considering memory constraints is straightforward (but not useful), we provide an efficient heuristic solution for the complete problem instead. We evaluate the protocol through simulation and find its performance to be well-aligned with our design goals.

  • 3091. Wuhib, Fetahi
    et al.
    Yanggratoke, Rerngvit
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Allocating Compute and Network Resources under Management Objectives in Large-Scale Clouds2013In: Journal of Network and Systems Management, ISSN 1064-7570, E-ISSN 1573-7705Article in journal (Refereed)
    Abstract [en]

    We consider the problem of jointly allocating compute and network resources in a large Infrastructure-as-a-Service (IaaS) cloud. We formulate the problem of optimally allocating resources to virtual data centers (VDCs) for four well-known management objectives: balanced load, energy efficiency, fair allocation, and service differentiation.  Then, we outline an architecture for resource allocation, which centers around a set of cooperating controllers, each solving a problem related to the chosen management objective. We illustrate how a global management objective is mapped onto objectives that govern the execution of these controllers. For a key controller, the Dynamic Placement Controller, we give a detailed distributed design, which is based on a gossip protocol that can switch between management objectives. The design is applicable to a broad class of management objectives, which we characterize through a property of the objective function.  The property ensures the applicability of an iterative descent method that the gossip protocol implements.  We evaluate, through simulation, the dynamic placement of VDCs for a large cloud under changing load and VDC churn. Simulation results show that this controller is effective and highly scalable, up to 100'000 nodes, for the management objectives considered.

  • 3092.
    Wymeersch, Henk
    et al.
    Chalmers University of Technology, Sweden.
    Penna, Federico
    Politecnico di Torino, Italy.
    Savic, Vladimir
    Technical University of Madrid, Spain.
    Uniformly reweighted belief propagation: A factor graph approach2011In: Proc. of IEEE Intl. Symp. on Information Theory Proceedings (ISIT), 2011, p. 2000-2004Conference paper (Refereed)
    Abstract [en]

    Tree-reweighted belief propagation is a message passing method that has certain advantages compared to traditional belief propagation (BP). However, it fails to outperform BP in a consistent manner, does not lend itself well to distributed implementation, and has not been applied to distributions with higher-order interactions. We propose a method called uniformly-reweighted belief propagation that mitigates these drawbacks. After having shown in previous works that this method can substantially outperform BP in distributed inference with pairwise interaction models, in this paper we extend it to higher-order interactions and apply it to LDPC decoding, leading performance gains over BP.

  • 3093.
    Wymeersch, Henk
    et al.
    Chalmers University of Technology, Sweden.
    Penna, Federico
    Politecnico di Torino, Italy.
    Savic, Vladimir
    Technical University of Madrid, Spain.
    Uniformly Reweighted Belief Propagation for Estimation and Detection in Wireless Networks2012In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 11, no 4, p. 1587-1595Article in journal (Refereed)
    Abstract [en]

    In this paper, we propose a new inference algorithm, suitable for distributed processing over wireless networks. The algorithm, called uniformly reweighted belief propagation (URW-BP), combines the local nature of belief propagation with the improved performance of tree-reweighted belief propagation (TRW-BP) in graphs with cycles. It reduces the degrees of freedom in the latter algorithm to a single scalar variable, the uniform edge appearance probability ρ. We provide a variational interpretation of URW-BP, give insights into good choices of ρ, develop an extension to higher-order potentials, and complement our work with numerical performance results on three inference problems in wireless communication systems: spectrum sensing in cognitive radio, cooperative positioning, and decoding of a low-density parity-check (LDPC) code.

  • 3094.
    Wymeersch, Henk
    et al.
    Chalmers University of Technology, Sweden.
    Penna, Federico
    Fraunhofer Heinrich Hertz Institute, Berlin, Germany.
    Savic, Vladimir
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Zhao, Jun
    Chalmers University of Technology, Sweden.
    Comparison of reweighted message passing algorithms for LDPC decoding2013In: IEEE International Conference on Communications (ICC), 2013, IEEE , 2013, p. 3264-3269Conference paper (Refereed)
    Abstract [en]

    Low density parity check (LDPC) codes can be decoded with a variety of decoding algorithms, offering a trade-off in terms of complexity, latency, and performance. We describe seven distinct LDPC decoders and provide a performance comparison for a practical regular LDPC code. Our simulations indicate that the best performance/latency trade-off is achieved by one version ofthe reweighted max-product decoder. When latency is not an issue, the traditional sum-product decoder yields the best performance.

  • 3095.
    Wåhslén, Jonas
    KTH, School of Technology and Health (STH), Data- och elektroteknik.
    Multi-Sensor Data Synchronization using Mobile Phones2013Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    Body sensor networking is a rapidly growing technology. Today wearable sensors are used to measure and monitor e.g. pulse, temperature, skin conductance, heart activity, and movement (through GPS or inertial measurement units). Mobile phones can act as coordinating nodes in wireless personal area networks used in home automation, healthcare, sport and wellness e.g. to measure pulse and distance. Integration of data from multiple sources sensors (data fusion) means that data from each sensor node needs to be associated with data from other sensor nodes sampled at approximately the same time. Accurate methods for time synchronization are therefore a necessary prerequisite for reliable data fusion.

    This thesis studies time synchronization problems in Bluetooth piconets between multiple wireless sensor nodes connected to a mobile phone that acts as coordinating node. Three different algorithms to enable correct data fusion have been developed, implemented and evaluated. The first is a single clock solution that synchronizes multiple wireless sensor nodes based solely on the mobile phone’s clock. The other two algorithms synchronize the clocks in sensor nodes to the clock in the coordinating node. 

  • 3096.
    Wåhslén, Jonas
    et al.
    KTH, School of Technology and Health (STH), Medical Engineering, Computer and Electronic Engineering.
    Lindh, Thomas
    KTH, School of Technology and Health (STH), Medical Engineering, Computer and Electronic Engineering.
    Real-time Performance Management of Assisted Living Services for Bluetooth Low Energy Sensor Communication2017In: Integrated Network and Service Management (IM), 2017 IFIP/IEEE Symposium on, IEEE conference proceedings, 2017Conference paper (Refereed)
    Abstract [en]

    PerfMon is a prototype implementation of a realtime performance management method for sensor data communication in assisted living applications. It is implemented in accordance with the specification for GATT services in Bluetooth low energy (BLE). PerfMon provides a tool for real-time performance monitoring and control for caregivers and service providers. Test results from monitoring and control of packet loss ratio related to alarm thresholds are presented. PerfMon is adapted to cloud-based web services using RESTful APIs and established object models. Performance management is a necessary component in an overall management system of IoT devices for healthcare and assisted living applications.

  • 3097.
    Wåhslén, Jonas
    et al.
    KTH, School of Technology and Health (STH), Data- och elektroteknik (Closed 20130701).
    Orhan, Ibrahim
    KTH, School of Technology and Health (STH), Data- och elektroteknik (Closed 20130701).
    Lindh, Thomas
    KTH, School of Technology and Health (STH), Data- och elektroteknik (Closed 20130701).
    Eriksson, Martin
    KTH, School of Technology and Health (STH), Medical sensors, signals and systems (MSSS) (Closed 20130701).
    A novel approch to multi-sensor data synchronisation using mobile phones2013In: International Journal of Autonomous and Adaptive Communications Systems, ISSN 1754-8632, E-ISSN 1754-8640, Vol. 6, no 3, p. 289-303Article in journal (Refereed)
    Abstract [en]

    This paper presents a new algorithm for application layer synchronisation of data from multiple sensors arriving to a mobile phone's Bluetooth interface. A system that provides feedback signals to an athlete is one example where it is crucial to synchronise data from several wireless sensors. This paper also discusses synchronisation problems caused by unpredictable Bluetooth transmission performance. 

  • 3098.
    Wåhslén, Jonas
    et al.
    KTH, School of Technology and Health (STH), Data- och elektroteknik (Closed 20130701).
    Orhan, Ibrahim
    KTH, School of Technology and Health (STH), Data- och elektroteknik (Closed 20130701).
    Sturm, Dennis
    KTH, School of Technology and Health (STH), Centres, Centre for Technology in Medicine and Health, CTMH.
    Lindh, Thomas
    KTH, School of Technology and Health (STH), Data- och elektroteknik (Closed 20130701).
    Performance evaluation of time synchronization and clock drift compensation in wireless personal area networks2012In: BodyNets '12 Proceedings of the 7th International Conference on Body Area Networks, ICST , 2012, p. 153-158Conference paper (Refereed)
    Abstract [en]

    Efficient algorithms for time synchronization, including compensation for clock drift, are essential in order to obtain reliable fusion of data samples from multiple wireless sensor nodes. This paper evaluates the performance of algorithms based on three different approaches; one that synchronizes the local clocks on the sensor nodes, and a second that uses a single clock on the receiving node (e.g. a mobile phone), and a third that uses broadcast messages. The performances of the synchronization algorithms are evaluated in wireless personal area networks, especially Bluetooth piconets and ZigBee/IEEE 802.15.4 networks. A new approach for compensation of clock drift and a realtime implementation of single node synchronization from the mobile phone are presented and tested. Finally, applications of data fusion and time synchronization are shown in two different use cases; a kayaking sports case, and monitoring of heart and respiration of prematurely born infants. 

  • 3099.
    Xia, Feng
    et al.
    Dalian University of Technology.
    Vinel, Alexey
    Department of Communications Engineering, Tampere University of Technology.
    Gao, Ruixia
    Dalian University of Technology.
    Wang, Linqiang
    Dalian University of Technology.
    Qiu, Tie
    Dalian University of Technology.
    Evaluating IEEE 802.15.4 for Cyber-Physical Systems2011In: EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1472, E-ISSN 1687-1499, no Article number 596397Article in journal (Refereed)
    Abstract [en]

    With rapid advancements in sensing, networking, and computing technologies, recent years have witnessed the emergence of cyber-physical systems (CPS) in a broad range of application domains. CPS is a new class of engineered systems that features the integration of computation, communications, and control. In contrast to general-purpose computing systems, many cyber-physical applications are safety critical. These applications impose considerable requirements on quality of service (QoS) of the employed networking infrastruture. Since IEEE 802.15.4 has been widely considered as a suitable protocol for CPS over wireless sensor and actuator networks, it is of vital importance to evaluate its performance extensively. Serving for this purpose, this paper will analyze the performance of IEEE 802.15.4 standard operating in different modes respectively. Extensive simulations have been conducted to examine how network QoS will be impacted by some critical parameters. The results are presented and analyzed, which provide some useful insights for network parameter configuration and optimization for CPS design. © 2011 Feng Xia et al.

  • 3100.
    Xia, Feng
    et al.
    School of Software, Dalian University of Technology, China.
    Yang, Laurence T.
    Department of Computer Science, St. Francis Xavier University, Canada.
    Wang, Lizhe
    Indiana University, USA.
    Vinel, Alexey
    Department of Communications Engineering, Tampere University of Technology, Finland.
    Internet of Things2012In: International Journal of Communication Systems, ISSN 1074-5351, E-ISSN 1099-1131, Vol. 25, no 9, p. 1101-1102Article in journal (Refereed)
59606162636465 3051 - 3100 of 3328
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