Change search
Refine search result
1 - 10 of 10
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.
  • 1.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Karl, Holger
    Kutscher, Dirk
    Zhang, Lixia
    Special section on Information-Centric Networking (editorial)2013In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 36Article in journal (Refereed)
  • 2.
    Dannewitz, Christian
    et al.
    University of Paderborn, Germany.
    Kutscher, Dirk
    NEC Laboratories Europe, Germany.
    Ohlman, Börje
    Ericsson Research, Sweden.
    Farrell, Stephen
    Trinity College Dublin, Ireland.
    Ahlgren, Bengt
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Karl, Holger
    University of Paderborn, Germany.
    Network of Information (NetInf): An Information-Centric Networking Architecture2013In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 36, no 7, p. 721-735Article in journal (Refereed)
    Abstract [en]

    Information-centric networking (ICN) is a promising approach to networking that has the potential to provide better -- more natural and more efficient -- solutions for many of today's important communication applications including but not limited to large-scale content distribution. This article describes the NetInf architecture -- a specific ICN approach that targets global-scale communication and supports many different types of networks and deployments, including traditional Internet access/core network configurations, data centers, as well as challenged and infrastructure-less networks. NetInf's approach to connecting different technology and administrative domains into a single information-centric network is based on a hybrid name-based routing and name resolution scheme. In this article, we describe the most important requirements that motivated the NetInf design. We present an architecture overview and discuss the different architecture elements such as naming, message forwarding, caching, and a NRS in detail. As efficient caching and a scalable NRS are two main success factors, we present an evaluation of both elements based on a theoretical analysis, complemental simulation results, and prototyping results. The results suggest that a scalable NRS for 10^15 and more objects with resolution latencies (well) below 100ms is possible, implying that a global NetInf that removes the need for today's application-specific overlay solutions is feasible.

  • 3.
    Grasic, Samo
    et al.
    Luleå University of Technology, Sweden.
    Lindgren, Anders
    RISE, Swedish ICT, SICS.
    Revisiting a remote village scenario and its DTN routing objective2014In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 48, p. 133-140Article in journal (Refereed)
    Abstract [en]

    Use of opportunistic connectivity together with the delay tolerant network (DTN) architecture provides an economically viable alternative to traditional ICT solutions for communication challenged areas. Here, the remote village scenario is commonly established as a motive in terrestrial DTN research. However, the majority of the DTN research does not discuss the remote village scenario as a concept at any length. Instead, urban scenarios are employed, both as benchmarks and as target scenarios. This can be a problem as it does not take into account the specific characteristics of a concrete real-world remote village scenario. In this paper we discuss how these characteristics affect and shape the deployment of network and the network itself. Furthermore, we show how these network conditions forced us to change the focus from the traditional DTN routing objective forwarding problem to the traffic queuing problem. Finally, we discuss how the characteristics seen in the case study of one remote village can be generalized for other remote village scenarios. All material and observations used in this paper are drawn from our 5 years experiences of DTN deployments in remote mountainous villages of Sweden.

  • 4.
    Krentz, Konrad-Felix
    et al.
    Uppsala University, Sweden.
    Voigt, Thiemo
    RISE Research Institutes of Sweden, Digital Systems, Data Science. Uppsala University, Sweden.
    Secure opportunistic routing in 2-hop IEEE 802.15.4 networks with SMOR2024In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 217, p. 57-69Article in journal (Refereed)
    Abstract [en]

    The IEEE 802.15.4 radio standard features the possibility for IEEE 802.15.4 nodes to run on batteries for several years. This is made possible by duty-cycling medium access control (MAC) protocols, which allow IEEE 802.15.4 nodes to leave their radios in energy-saving sleep modes most of the time. Yet, duty-cycling MAC protocols usually incur long routing delays since it may take a while until a particular forwarder becomes available for forwarding a packet. Opportunistic routing alleviates this problem by opportunistically using a currently available forwarder, rather than waiting for a particular forwarder. Among all opportunistic routing schemes, so-called dynamic switch-based forwarding (DSF) schemes are most promising from a security and practical perspective, but some security and reliability issues with them persist. In this paper, we propose secure multipath opportunistic routing (SMOR), a DSF scheme that improves on current DSF schemes in three regards. First, SMOR builds on a denial-of-sleep-resilient MAC layer. Current DSF schemes, by comparison, rest on MAC protocols that put the limited energy reserves of battery-powered IEEE 802.15.4 nodes at risk. Second, SMOR operates in a distributed fashion and efficiently supports point-to-point traffic. All current DSF schemes, by contrast, suffer from a single point of failure and focus on convergecast traffic. Third, SMOR duplicates packets on purpose and routes them along disjoint paths. This makes SMOR tolerant of compromises of single IEEE 802.15.4 nodes, whereas current DSF schemes lack intrusion tolerance. We integrated SMOR into the network stack of the Contiki-NG operating system and benchmarked SMOR against the Routing Protocol for Low-Power and Lossy Networks (RPL) with the Cooja network simulator. Indeed, SMOR turns out to improve on RPL’s delays by between 33.51% and 39.84%, depending on the exact configurations and network dynamics. Furthermore, SMOR achieves between 0.16% and 2.03% higher mean packet delivery ratios (PDRs), thereby attaining mean PDRs of 99.999% in all simulated scenarios. Beyond that, SMOR has only a fraction of RPL’s memory requirements. SMOR’s intrusion tolerance, on the other hand, increases the mean energy consumption per IEEE 802.15.4 node by between 1.55% and 2.74% compared to RPL in our simulations. SMOR specifically targets IEEE 802.15.4 networks with a network diameter of 2, such as body area networks. © 2024 The Authors

    Download full text (pdf)
    fulltext
  • 5.
    Nikoui, Tina
    et al.
    Islamic Azad University, Iran.
    Rahmani, Amir
    National Yunlin University of Science and Technology, Taiwan.
    Balador, Ali
    RISE Research Institutes of Sweden, Digital Systems, Industrial Systems.
    Haj Seyyed Javadi, Hamid
    Shahed University, Iran.
    Analytical model for task offloading in a fog computing system with batch-size-dependent service2022In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 190, p. 201-215Article in journal (Refereed)
    Abstract [en]

    Task offloading is one of the main concepts in fog computing which improves the system efficiency and decreases latency. Previously proposed models, such as exponential queue models, addressed the offloading models in a simple model. This study proposes a novel analytical model that examines batch queuing systems and the influence of batch size-dependent service time on system performance. Some of the system's properties are indicated using this model, and the correctness of the suggested model via numerical evaluations and simulations is shown. The evaluation results show that our proposed model provides acceptable accuracy and enables efficient task offloading, applied to fog computing systems. 

  • 6. Palme, Jacob
    et al.
    Karlgren, Jussi
    RISE, Swedish ICT, SICS.
    Pargman, Daniel
    Issues when designing filters in messaging systems1996In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 19, p. 95-101Article in journal (Refereed)
    Abstract [en]

    The increasing size of messaging communities increases the risk of information overload, especially when group communication tools like mailing lists or asynchronous conferencing systems (like Usenet News) are used. Future messaging systems will require more capable filters to aid users in the selection of what to read. The increasing use of networks by non-computer professionals requires filters that are easier to use and manage than most filtering software today. Filters might use evaluations of messages made by certain users as an aid to filtering these messages for other users.

  • 7.
    Righetti, Francesca
    et al.
    University of Pisa, Italy.
    Vallati, Carlo
    University of Pisa, Italy.
    Tiloca, Marco
    RISE Research Institutes of Sweden, Digital Systems, Data Science.
    Anastasi, Giuseppe
    University of Pisa, Italy.
    Vulnerabilities of the 6P protocol for the Industrial Internet of Things: Impact analysis and mitigation2022In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 194, p. 411-432Article in journal (Refereed)
    Abstract [en]

    The 6TiSCH architecture defined by the IETF provides a standard solution for extending the Internet of Things (IoT) paradigm to industrial applications with stringent reliability and timeliness requirements. In this context, communication security is another crucial requirement, which is currently less investigated in the literature. In this article, we present a deep assessment of the security vulnerabilities of 6P, the protocol used for resource negotiation at the core of the 6TiSCH architecture. Specifically, we highlight two possible attacks against 6P, namely the Traffic Dispersion and the Overloading attacks. These two attacks effectively and stealthy alter the communication schedule of victim nodes and severely thwart network basic functionalities and efficiency, by specifically impacting network availability and energy consumption of victim nodes. To assess the impact of the attacks two analytical models have been defined, while, to demonstrate their feasibility, they have been implemented in Contiki-NG. The implementation has been used to quantitatively evaluate the impact of the two attacks by both simulations and measurements in a real testbed. Our results show that the impact of both attacks may be very significant. The impact, however, strongly depends on the position of the victim node(s) in the network and it is highly influenced by the dynamics of the routing protocol. We have investigated mitigation strategies to alleviate this impact and proposed an extended version of the Minimal Scheduling Function (MSF), i.e., the reference scheduling algorithm for 6TiSCH. This allows network nodes to early detect anomalies in their schedules possibly due to an Overloading attack, and thus curb the attack impact by appropriately revising their schedule. 

    Download full text (pdf)
    fulltext
  • 8.
    Righetti, Francesca
    et al.
    University of Pisa, Italy.
    Vallati, Carlo
    University of Pisa, Italy.
    Tiloca, Marco
    RISE Research Institutes of Sweden, Digital Systems, Data Science.
    Anastasi, Giuseppe
    University of Pisa, Italy.
    Vulnerabilities of the 6P protocol for the Industrial Internet of Things: Impact analysis and mitigation2022In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Computer Communications, Vol. 194, p. 411-432Article in journal (Refereed)
    Abstract [en]

    The 6TiSCH architecture defined by the IETF provides a standard solution for extending the Internet of Things (IoT) paradigm to industrial applications with stringent reliability and timeliness requirements. In this context, communication security is another crucial requirement, which is currently less investigated in the literature. In this article, we present a deep assessment of the security vulnerabilities of 6P, the protocol used for resource negotiation at the core of the 6TiSCH architecture. Specifically, we highlight two possible attacks against 6P, namely the Traffic Dispersion and the Overloading attacks. These two attacks effectively and stealthy alter the communication schedule of victim nodes and severely thwart network basic functionalities and efficiency, by specifically impacting network availability and energy consumption of victim nodes. To assess the impact of the attacks two analytical models have been defined, while, to demonstrate their feasibility, they have been implemented in Contiki-NG. The implementation has been used to quantitatively evaluate the impact of the two attacks by both simulations and measurements in a real testbed. Our results show that the impact of both attacks may be very significant. The impact, however, strongly depends on the position of the victim node(s) in the network and it is highly influenced by the dynamics of the routing protocol. We have investigated mitigation strategies to alleviate this impact and proposed an extended version of the Minimal Scheduling Function (MSF), i.e., the reference scheduling algorithm for 6TiSCH. This allows network nodes to early detect anomalies in their schedules possibly due to an Overloading attack, and thus curb the attack impact by appropriately revising their schedule.

  • 9.
    Sivieri, A.
    et al.
    Politecnico di Milano, Italy.
    Mottola, Luca
    RISE, Swedish ICT, SICS. Politecnico di Milano, Italy.
    Cugola, G.
    Politecnico di Milano, Italy.
    Building Internet of Things software with ELIoT2016In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 89-90, p. 141-153Article in journal (Refereed)
    Abstract [en]

    We present ELIoT, a development platform for Internet-connected smart devices. Unlike most solutions for the emerging "Internet of Things" (IoT), ELIoT allows programmers to implement functionality running within the networks of smart devices without necessarily leveraging the external Internet, and yet enables the integration of such functionality with Internet-wide services. ELIoT thus reconciles the demand for efficient localized performance, e.g., reduced latency for implementing control loops, with the need to integrate with the larger Internet. To this end, ELIoT's programming model provides IoT-specific inter-process communication facilities, while its virtual machine-based execution caters for the need of software reconfiguration and the devices' heterogeneity. Moreover, ELIoT addresses network-wide integration concerns by enabling standard-compliant interactions through REST and CoAP interfaces, with the added ability to dynamically reconfigure REST interfaces as application requirements evolve. We demonstrate the features and effectiveness of ELIoT based on a smart-home application, and quantitatively derive performance figures atop two hardware platforms compared to implementations using plain C or Java using the AllJoin framework. Compared to the C implementation, our results indicate that the performance cost for the increased programming productivity brought by ELIoT is still viable; for example, memory consumption in ELIoT is comparable, whereas the processing overhead remains within practical limits. Compared to the Java implementation using AllJoin, ELIoT provides a similar level of abstraction in programming, with much better performance both in memory consumption and processing overhead.

  • 10. Tian, Min
    et al.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Naumowicz, Tomasz
    Ritter, Hartmut
    Schiller, Jochen
    Performance Considerations for Mobile Web Services2004In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 27, no 11, p. 1097-1105Article in journal (Refereed)
1 - 10 of 10
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