Change search
Refine search result
1 - 30 of 30
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • 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.
    Carlsson, Marcus
    et al.
    Luleå tekniska universitet.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Ljungström, Anne-Marie
    Luleå tekniska universitet.
    Marklund, Daniel
    Luleå tekniska universitet.
    Ranta, Jonas Ohlsson
    Luleå tekniska universitet.
    Reuterswärd, Mats
    Luleå tekniska universitet.
    NetSync2000Report (Other academic)
    Abstract [en]

    This paper describes NetSync, a protocol for automation of software updates and log file retrieval on lightweight terminals. It is mainly developed for use in a scientific test environment, but there are other possible uses as well. NetSync is a very flexible protocol, and while designed to be able to be run on handheld units with low storage and computing capacity, it could also be used for high end systems with much storage and computing capacity.

  • 2.
    Carlsson, Marcus
    et al.
    Luleå tekniska universitet.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Ljungström, Anne-Marie
    Luleå tekniska universitet.
    Marklund, Daniel
    Luleå tekniska universitet.
    Ranta, Jonas Ohlsson
    Luleå tekniska universitet.
    Reuterswärd, Mats
    Luleå tekniska universitet.
    NetSync client and server2000Report (Other academic)
    Abstract [en]

    This document describes the server and client for the NetSync protocol implemented as part of the networking project course at Lulea University of Technology. The server was implemented as a daemon for the FreeBSD operating system, and the client was implemented for PalmOS

  • 3.
    Grasic, Samo
    et al.
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Human Work Science.
    Lindgren, Anders
    An analysis of evaluation practices for DTN routing protocols2012In: CHANTS '12: Proceedings of the seventh ACM international workshop on Challenged network, New York: Association for Computing Machinery (ACM), 2012, p. 57-65Conference paper (Refereed)
    Abstract [en]

    Over the past decade, a lot of research has been done to develop efficient routing protocols for Delay- and Disruption Tolerant Networks (DTNs). In the course of this work, many comparative evaluation studies have been done to determine which of two proposed protocols is the better one (for a given situation). The majority of these evaluations are based on results gained from simulated network environments. In order to conduct a relevant evaluation of routing schemes, numerous conditions, policies and data need to be specified and fed into the simulation environment. The aim of our work in this paper is to discuss current DTN evaluation practices through a thorough and critical literature study. Based on the surveyed material, we show some weaknesses and lack of argumentation used in the evaluations. Through this, we hope to aid in bridging the gap between simulated and real-world DTN environments. In addition, and as a call for further research, we propose a model for evaluation of DTN routing schemes that outlines the most crucial inputs that needs to be considered in the evaluation process. This model is then projected onto evaluation practices used for evaluations of DTN routing protocols in a set of sixteen papers roughly covering a decade of DTN research.

  • 4.
    Grasic, Samo
    et al.
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Human Work Science.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    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 five years experiences of DTN deployments in remote mountainous villages of Sweden.

  • 5.
    Leguay, Jeremie
    et al.
    Université Pierre et Marie Curie.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Scott, James W.
    Intel Research Cambridge.
    Friedman, Timur
    Université Pierre et Marie Curie.
    Crowcroft, Jon
    University of Cambridge.
    Opportunistic content distribution in an urban setting2006In: Proceedings of the ACM SIGCOMM 2006 Workshops: CHANTS'06, Pisa, Italy - Septebmer 15, 2006, ACM SIGCOMM Workshop on Challenged Networks, New York: ACM Digital Library, 2006, p. 205-212Conference paper (Refereed)
    Abstract [en]

    This paper investigates the feasibility of a city-wide content distribution architecture composed of short range wireless access points. We look at how a target group of intermittently and partially connected mobile nodes can improve the diffusion of information within the group by leveraging fixed and mobile nodes that are exterior to the group. The fixed nodes are data sources, and the external mobile nodes are data relays, and we examine the trade off between the use of each in order to obtain high satisfaction within the target group, which consists of data sinks. We conducted an experiment in Cambridge, UK, to gather mobility traces that we used for the study of this content distribution architecture

  • 6.
    Li, Yaoxing
    et al.
    Institute of Operating System and Computer Networks, Technische Universität Braunschweig.
    Li, Yuhong
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications.
    Wolf, Lars C.
    Institute of Operating System and Computer Networks, Technische Universität Braunschweig.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Wang, Ji
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications.
    A named data approach for DTN routing2017In: 2017 Wireless Days, WD 2017 / [ed] Salgado H.,Ruela J.,Pessoa L.,Teixeira F.,Ricardo M.,Campos R.,Morla R, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2017, p. 163-166, article id 7918135Conference paper (Refereed)
    Abstract [en]

    Many common DTN routing protocols are replication-based, which have relatively good performance in terms of message delivery ratio but high overhead, and leave the issue of garbage collection open. In this paper, we propose Named Data Distance Routing (NDDR), a named data based DTN routing approach which makes routing decisions for named data based on topological distance information. This helps to reduce the overhead of routing. We have implemented NDDR in the ONE simulation environment and the simulation results show that the proposed routing method has better performance in terms of message delivery ratio and network overhead compared with several typical replication-based DTN routing protocols

  • 7.
    Li, YH
    et al.
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, China. Tongji Univ, Key Lab Embedded Syst & Serv Comp, Minist Educ, Shanghai 201804, China.
    Shi, XY
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, China.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. RISE SICS, Kista.
    Hu, Z
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, China.Tongji Univ, Key Lab Embedded Syst & Serv Comp, Minist Educ, Shanghai, China .
    Zhang, P
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, China.
    Jin, D
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, China.
    Zhou, YC
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, China.
    Context-Aware Data Dissemination for ICN-Based Vehicular Ad Hoc Networks2018In: Information (Switzerland), ISSN 2078-2489, Vol. 9, no 11, article id 263Article in journal (Refereed)
    Abstract [en]

    Information-centric networking (ICN) technology matches many major requirements of vehicular ad hoc networks (VANETs) in terms of its connectionless networking paradigm accordant with the dynamic environments of VANETs and is increasingly being applied to VANETs. However, wireless transmissions of packets in VANETs using ICN mechanisms can lead to broadcast storms and channel contention, severely affecting the performance of data dissemination. At the same time, frequent changes of topology due to driving at high speeds and environmental obstacles can also lead to link interruptions when too few vehicles are involved in data forwarding. Hence, balancing the number of forwarding vehicular nodes and the number of copies of packets that are forwarded is essential for improving the performance of data dissemination in information-centric networking for vehicular ad-hoc networks. In this paper, we propose a context-aware packet-forwarding mechanism for ICN-based VANETs. The relative geographical position of vehicles, the density and relative distribution of vehicles, and the priority of content are considered during the packet forwarding. Simulation results show that the proposed mechanism can improve the performance of data dissemination in ICN-based VANET in terms of a successful data delivery ratio, packet loss rate, bandwidth usage, data response time, and traversed hops.

  • 8.
    Li, Yuhong
    et al.
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
    Su, Xiang
    Centre for Ubiquitous Computing, University of Oulu.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Shi, Xinyue
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
    Cai, Xiang
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
    Riekki, Jukka
    Centre for Ubiquitous Computing, University of Oulu.
    Distance Assisted Information Dissemination with Broadcast Suppression for ICN-based VANET2016In: / [ed] Hsu C.-H.,Wang S.,Zhou A.,Shawkat A, Springer, 2016, p. 179-193Conference paper (Refereed)
    Abstract [en]

    Information-centric networking (ICN) is being applied to the vehicular networks by more and more researchers on account of its lightweight and connectionless networking paradigm and in-network caching characteristics, making it suitable for the dynamic environments of vehicular networks. However, wireless transmission of interest packets to find content in the network may lead to broadcast storms that can affect the performance of information dissemination severely. This paper proposes a distance assisted data dissemination method with broadcast storm suppressing mechanism (DASB) for supporting rapid and efficient information dissemination in ICN-based vehicular ad hoc networks (VANETs). Geo-position data of vehicles are used to accelerate packet forwarding, and vehicular nodes in certain areas are restricted to forward packets in order to suppress the broadcast storm. Simulation results show that the proposed method can greatly reduce the total number of packets transmitted in the network, and the successful information delivery ratio and information delivery time can also be improved

  • 9.
    Li, Yuhong
    et al.
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
    Wang, Ji
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Su, Xiang
    Centre for Ubiquitous Computing, University of Oulu.
    Riekki, Jukka
    Centre for Ubiquitous Computing, University of Oulu.
    Implicit Cooperative Caching based on Information Popularity for Vehicular Networks2017In: CHANTS 2017: Proceedings of the 12th Workshop on Challenged Networks, co-located with MobiCom 201720 October 2017, New York: ACM Digital Library, 2017, p. 51-56Conference paper (Refereed)
    Abstract [en]

    Information dissemination is one of the most important tasks of vehicular networks. Therefore, information-centric networking (ICN) technology is being more and more widely used in vehicular networks due to the connectionless and lightweight characteristics of this networking paradigm. Caching plays an essential role in information-centric networks, but current caching techniques for ICN are not ideal for use in vehicular networks on account of the dynamicity and wireless transmission of vehicular networks. This paper presents a caching approach for ICN-based vehicular networks that takes into account both the dynamicity of vehicular networks and the popularity of the information to be distributed. By introducing the “interval” metric and estimating the popularity of information and current networking conditions of the vehicles on road, cooperative caching among nodes can be realized without exchanging cache management information among them. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks.

  • 10.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    On three issues in wireless networking2003Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    In this thesis, three issues in wireless and mobile networks are considered. The first issue is the enabling of real-time traffic in wireless local area networks (WLANs). Real-time services such as streaming voice and video require a certain quality of service (QoS) such as low packet loss and low delay to perform well. Four different mechanisms for providing service differentiation in a wireless LAN are evaluated through simulations. The second issue concerns ad hoc networking. In ad hoc networks, there is no fixed infrastructure, but all nodes are considered equal and take equal part in the routing and forwarding of packets. This may not always be desirable, as some nodes may be equipped with virtually unlimited power supplies, while others have to rely on battery power. Thus, we propose the creation of "infrastructured" ad hoc networks by the deployment of pseudo base-stations (PBSs), which are nodes that have constant power supply (e.g., through a power outlet or a car battery), do not move, and are present just to act as routers and forward packets for other nodes, thus allowing the mobile nodes to save power. A routing protocol that enables this kind of network is presented. The final issue is that of routing and forwarding in intermittently connected networks, where there may rarely or never exist a fully connected path between source and destination. This invalidates some of the basic assumptions of traditional networking and renders traditional networking protocols unusable end-to-end. Therefore, routing in such intermittently connected networks is studied, and a novel routing protocol taking advantage of the mobility of nodes, and the predictability of that mobility is presented.

  • 11.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Routing and quality of service in wireless and disruption tolerant networks2006Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Wireless networks have become a common means of communication, and their popularity continues to rise as they enable communication in locations and settings where it was previously unfeasible. While promising many advantages, these networks also pose new challenges. The limited radio coverage, unreliable nature of the wireless channel, and mobility of network nodes can lead to frequent disruption of communication links, dynamic network topology, variable bandwidth availability, and high channel error rates. These challenges seek novel solutions to allow a growing number of wireless, mobile users to run applications and avail network services in ways similar to that in wired networks. This thesis makes contributions to three research areas related to wireless and disruption tolerant networks: (1) routing and forwarding to enable disruption tolerant communication in intermittently connected networks, (2) analysis of properties of human mobility and their effect on network protocols in disruption tolerant networks, and (3) quality of service mechanisms for wireless and mobile networks. In intermittently connected networks, there may rarely or never exist a fully connected path between a source and destination. This invalidates the basic assumption of end-to-end communication prevalent in the Internet and renders traditional routing protocols impractical. We propose PRoPHET, a novel routing protocol for intermittently connected networks. PRoPHET takes advantage of the mobility of nodes, and the predictability of that mobility for routing. The protocol and various forwarding strategies and queueing policies are studied in detail. The benefits of PRoPHET are evident on comparing its performance with contemporary work. Communication in intermittently connected and disruption tolerant networks is often highly dependent on the mobility of the nodes in the network. Thus, it is important to have good understanding of basic properties of user mobility in order to design network protocols that can operate under those conditions. Using real-life traces, we characterize human mobility patterns and their impact on forwarding algorithms in mobile networks with and without infrastructure. Finally, the thesis presents our work on two different aspects of quality of service in wireless and mobile networks. We evaluate four mechanisms for providing service differentiation in a wireless LAN, and give recommendations on their use in different scenarios. We propose a novel admission control scheme for mobile ad hoc networks, which is able to better cope with high mobility in the network compared to previous solutions.

  • 12.
    Lindgren, Anders
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Abdesslem, Fehmi Ben
    SICS Swedish ICT AB.
    Ahlgren, Bengt
    SICS Swedish ICT AB.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Malik, Adeel Mohammad
    Ericsson.
    Design choices for the IoT in Information-Centric Networks2016In: 2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC): Las Vegas, 9-12 Jan. 2016, Piscataway, NJ: IEEE Communications Society, 2016, p. 882-888, article id 7444905Conference paper (Refereed)
    Abstract [en]

    This paper outlines the tradeoffs involved in utilizing Information-Centric Networking (ICN) for Internet of Things (IoT) scenarios. It describes contexts and applications where the IoT would benefit from ICN, and where a host-centric approach would be better. Requirements imposed by the heterogeneous nature of IoT networks are discussed in terms of connectivity, power availability, computational and storage capacity. Design choices are then proposed for an IoT architecture to handle these requirements, while providing efficiency and scalability. An objective is to not require any IoT specific changes of the ICN architecture per se, but we do indicate some potential modifications of ICN that would improve efficiency and scalability for IoT and other applications

  • 13. Lindgren, Anders
    et al.
    Almquist, A.
    Luleå tekniska universitet.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Evaluation of quality of service schemes for IEEE 802.11 wireless LANs2001In: Proceedings: LCN 2001, 26th Annual IEEE Conference on Local Computer Networks : 14 - 16 November 2001, Tampa, Fl, Los Alamitos, Calif: IEEE Communications Society, 2001, p. 348-351Conference paper (Refereed)
    Abstract [en]

    This paper evaluates four mechanisms for providing service differentiation in IEEE 802.11 wireless LANs, the point coordinator function (PCF) of IEEE 802.11, the enhanced distributed coordinator function (EDCF) of the proposed IEEE 802.11e extension to IEEE 802.11, distributed fair scheduling (DFS), and Blackburst using the ns-2 simulator. The metrics used in the evaluation are throughput, medium utilization, collision rate, average access delay, and delay distribution for a variable load of real time and background traffic. The PCF performance is comparably low, while the EDCF performs much better. The best performance is achieved by Blackburst. The DFS provides relative differentiation and consequently avoids starvation of low priority traffic

  • 14. Lindgren, Anders
    et al.
    Almquist, Andreas
    Luleå tekniska universitet.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Quality of service schemes for IEEE 802.11 wireless LANs: an evaluation2003In: Journal on spesial topics in mobile networks and applications, ISSN 1383-469X, E-ISSN 1572-8153, Vol. 8, no 3, p. 223-235Article in journal (Refereed)
    Abstract [en]

    This paper evaluates four mechanisms for providing service differentiation in IEEE 802.11 wireless LANs. The evaluated schemes are the Point Coordinator Function (PCF) of IEEE 802.11, the Enhanced Distributed Coordinator Function (EDCF) of the proposed IEEE 802.11e extension to IEEE 802.11, Distributed Fair Scheduling (DFS), and Blackburst. The evaluation was done using the ns-2 simulator. Furthermore, the impact of some parameter settings on performance has also been investigated. The metrics used in the evaluation are throughput, medium utilization, collision rate, average access delay, and delay distribution for a variable load of real time and background traffic. The simulations show that the best performance is achieved by Blackburst. PCF and EDCF are also able to provide pretty good service differentiation. DFS can give a relative differentiation and consequently avoids starvation of low priority traffic.

  • 15. Lindgren, Anders
    et al.
    Belding-Royer, Elisabeth M.
    Department of Computer Science, University of California, Santa Barbara.
    Multi-path admission control for mobile ad hoc networks2005In: MobiQuitous 2005: the Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, July 17 - 21, 2005, San Diego, California / [ed] Ramesh Rao, Los Alamitos, Calif: IEEE Computer Society Press , 2005, p. 407-417Conference paper (Refereed)
    Abstract [en]

    As wireless networks become more prevalent, users will demand the same applications that are currently available in wired networks. Further, they will expect to receive a quality of service similar to that obtained in a wired network. Included in these applications are real-time applications such as voice over IP and multimedia streams. To enable the support of applications that require real-time communication in ad hoc networks, congestion must be prevented so that the needed quality of service can be provided. An admission control mechanism is an essential component of the quality of service solution. Unfortunately, current admission control solutions encounter problems during mobility, often resulting in unacceptable disruptions in communication. To solve this problem, we apply multi-path routing mechanisms that maintain alternate paths to the destination and propose a new admission control protocol. We show through simulation that our solution is able to prevent communication disruptions and meet the QoS needs of applications better than previous solutions

  • 16.
    Lindgren, Anders
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Belding-Royer, Elizabeth M.
    University of Califonia, Santa Barbara.
    Multi-path admission control for mobile ad hoc networks2004In: Mobile Computing and Communications Review, ISSN 1559-1662, Vol. 8, no 4, p. 68-71Article in journal (Refereed)
    Abstract [en]

    To enable the use of applications that require real-time communication in ad hoc networks, an admission control mechanism must be in place to prevent the network from becoming congested, since congestion results in reduced quality of service for applications. Current admission control solutions encounter problems in the face of mobility, resulting in unacceptable disruptions in communication. To solve this problem, we apply multi-path routing mechanisms and propose a new admission control protocol. We show through simulation that our solution is able to prevent communication disruptions and meet the QoS needs of the application.

  • 17.
    Lindgren, Anders
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Diot, Christophe
    Thomson Research.
    Scott, James W.
    Intel Research Cambridge.
    Impact of communication infrastructure on forwarding in pocket switched networks2006In: Proceedings of the ACM SIGCOMM workshop on Challenged Networks: CHANTS 2006, New York: ACM Digital Library, 2006Conference paper (Refereed)
    Abstract [en]

    Recently, it has been established on multiple experimental data sets that human contact processes exhibit heavy-tailed inter-event distributions. This characteristic makes it difficult to transport data with a finite transfer time in a network of mobile devices, relying on opportunistic contacts only. Using various experimental data sets, we analyze how different types of communication infrastructure impact the feasibility of data transfers among mobile devices. The first striking result is that the heavy tailed nature of the contact processes persists after infrastructure is introduced. We establish experimentally that infrastructure improves significantly multiple opportunistic contact properties, relevant to opportunistic forwarding algorithms. We discuss how infrastructure can be used to design simpler and more efficient (in terms of delay and number of hops) opportunistic forwarding algorithms. In addition to this, for the first time in a study like this, the communication pattern of nodes is taken into account in the analysis. We also show that node pairs that have a real-life history of communication have contact properties that are better for opportunistic message forwarding to each other than what other node pairs have.

  • 18.
    Lindgren, Anders
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Doria, Avri
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Human Work Science.
    Experiences from deploying a real-life DTN system2007In: 2007 4th IEEE Consumer Communications and Networking Conference: Las Vegas, Nevada, USA, 11 - 13 January 2007 ; [CCNC 2007], Piscataway, NJ: IEEE Communications Society, 2007, p. 217-221Conference paper (Refereed)
    Abstract [en]

    The Sámi Network Connectivity (SNC) project works to enable Internet connectivity for the Sámi population of reindeer herders in the Laponia region in northern Sweden. In this area, no infrastructure and thus, no Internet connectivity is normally available. Thus, DTN functionality is used to enable connectivity through the use of mobile relays. This paper describes a deployment and field test done within the SNC project, in which a Delay-Tolerant Networking system was deployed in the target region. Tests were run of the PRoPHET routing protocol, and three different applications were deployed and tested sucessfully

  • 19. Lindgren, Anders
    et al.
    Doria, Avri
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences.
    Davies, E.
    Grasic, Samo
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Human Work Science.
    Probabilistic Routing Protocol for Intermittently Connected Networks2012Report (Refereed)
    Abstract [en]

    This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning the epidemic distribution tree to minimize resource usage while still attempting to achieve the best-case routing capabilities of epidemic routing. It is intended for use in sparse mesh networks where there is no guarantee that a fully connected path between the source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. These networks are examples of networks where there is a disparity between the latency requirements of applications and the capabilities of the underlying network (networks often referred to as delay and disruption tolerant). The document presents an architectural overview followed by the protocol specification.

  • 20. Lindgren, Anders
    et al.
    Doria, Avri
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Human Work Science.
    Lindblom, Jan
    Luleå tekniska universitet.
    Ek, Mattias
    Luleå tekniska universitet.
    Networking in the land of northern lights: two years of experiences from DTN system deployments2008In: Proceedings of the 2008 ACM workshop on Wireless networks and systems for developing regions: MobiCon 08, New York: ACM Digital Library, 2008, p. 1-8Conference paper (Refereed)
    Abstract [en]

    The Sámi Network Connectivity (SNC) project was started to enable Internet connectivity for the Sámi population of reindeer herders in the Laponia region in northern Sweden. In this area, no infrastructure and thus, no Internet connectivity is normally available. Thus, DTN functionality is used to enable connectivity through the use of mobile relays. This paper describes deployments and field tests done within the SNC project and its continuation SNC+1, in which a Delay-Tolerant Networking system was deployed in the target region. During these deployments, the PRoPHET routing protocol, and three different applications were deployed and tested sucessfully.

  • 21. Lindgren, Anders
    et al.
    Doria, Avri
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Probabilistic routing in intermittently connected networks2003Conference paper (Other academic)
    Abstract [en]

    We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.

  • 22. Lindgren, Anders
    et al.
    Doria, Avri
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Probabilistic routing in intermittently connected networks2004In: Service Assurance with Partial and Intermittent Resources: First International Workshop, SAPIR 2004, Fortaleza, Brazil, August 1-6, 2004, Proceedings / [ed] Petre Dini; Pascal Lorenz; José Neuman De Souza, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2004, p. 239-254Conference paper (Refereed)
    Abstract [en]

    In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead

  • 23. Lindgren, Anders
    et al.
    Doria, Avri
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Routing in intermittently connected networks using a probabilistic approach2003In: Swedish National Computer Networking Workshop - Proceedings: SNCNW 2003, Stockholm, 2003Conference paper (Other academic)
    Abstract [en]

    In this paper we consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There do however exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through such networks. We propose PROPHET, a probabilistic routing protocol for such networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PROPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.

  • 24.
    Lindgren, Anders
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Phanse, Kaustubh
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Evaluation of queueing policies and forwarding strategies for routing in intermittently connected networks2006In: The 1st International Conference on Communication System Software and Middleware: COMSWARE 2006 : January 8-12, 2006, Delhi, India, Piscataway, N.J.: IEEE Communications Society, 2006, p. 1-10Conference paper (Refereed)
    Abstract [en]

    Delay tolerant networking (DTN) and more specifically the subset known as intermittently connected networking, is emerging as a solution for supporting asynchronous data transfers in challenging environments where a fully connected end-to-end path between a source and destination may never exist. Message delivery in such networks is enabled via scheduled or opportunistic communication based on transitive local connectivity among nodes influenced by factors such as node mobility. Given the inherently store-and-forward and opportunistic nature of the DTN architecture, the choice of buffer management policies and message forwarding strategies can have a major impact on system performance. In this paper, we propose and evaluate different combinations of queueing policies and forwarding strategies for intermittently connected networks. We show that a probabilistic routing approach along with the correct choice of buffer management policy and forwarding strategy can result in much performance improvements in terms of message delivery, overhead and end-to-end delay.

  • 25. Lindgren, Anders
    et al.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Infrastructured ad hoc networks2002In: International Conference on Parallel Processing Workshops: 18 - 21 August 2002, Vancouver, B.C., Canada ; proceedings / [ed] Stephan Olariu, Los Alamitos, Calif: IEEE Communications Society, 2002, p. 64-70Conference paper (Refereed)
    Abstract [en]

    In traditional ad hoc networks, all nodes are considered equal and take equal part in the routing and forwarding of packets. We believe that this may not always be desirable. Rather, some nodes may be equipped with virtually unlimited power supplies, while others have to rely on battery power Thus, we propose the creation of "infrastructured" ad hoc networks by the deployment of pseudo base-stations (PBSs), which are nodes that have constant power supply (e.g., through a power outlet or a car battery), do not move, and are present just to act as routers and forward packets for other nodes, thus allowing the mobile nodes to save power The paper also presents ISAIAH, an ad hoc routing protocol based on the ad-hoc on-demand distance vector (AODV) routing protocol, which tries to select routes that go through PBSs instead of through mobile nodes to reduce the amount of power spent by these mobile nodes. Furthermore, it allows nodes to enter a power-saving mode, significantly reducing the power consumption compared to AODV

  • 26. Lindgren, Anders
    et al.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Almquist, Andreas
    Luleå tekniska universitet.
    Quality of service schemes for IEEE 802.11: a simulation study2001In: Quality of Service: 9th International Workshop Karlsruhe, Germany, June 6-8, 2001 Proceedings / [ed] Lars Wolf, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2001, p. 281-287Conference paper (Refereed)
    Abstract [en]

    This paper analyzes and compares four different mechanisms for providing QoS in IEEE 802.11 wireless LANs. We have evaluated the IEEE 802.11 mode for service differentiation (PCF), Distributed Fair Scheduling, Blackburst, and a scheme proposed by Deng et al. using the ns-2 simulator. The evaluation covers medium utilization, access delay, and the ability to support a large number of high priority mobile stations. Our simulations show that PCF performs badly, and that Blackburst has the best performance with regard to the above metrics. An advantage with the Deng scheme and Distributed Fair Scheduling is that they are less constrained, with regard to the characteristics of high priority traffic, than Blackburst is.

  • 27.
    Lindgren, Anders
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Åkerberg, Johan
    Björkman, Mats
    Feasibility of ICN in Automation Networks2017Conference paper (Refereed)
  • 28.
    Qiao, Yuanyuan
    et al.
    Beijing Key Laboratory of Network System Architecture and Convergence, BUPT, Beijing.
    Zhang, Yanting
    Beijing Key Laboratory of Network System Architecture and Convergence, BUPT, Beijing.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Yang, Jie
    Beijing Key Laboratory of Network System Architecture and Convergence, BUPT, Beijing.
    Understanding Online Shopping and Offline Mobility Behavior in Urban Area from the View of Multilayer Network2016Conference paper (Refereed)
    Abstract [en]

    The interactive nature of the Internet offers many opportunities to increase the efficiency of online shopping by improving availability of product information, enabling direct multi-attribute comparisons, and reducing buyer search costs. A great body of research focuses on how consumers shop online or why and how online shopping impacts urban development, but the understanding of mutual influence between online and offline behavior of consumers remains somewhat underserved. This paper bridges that gap by quantifying the relationship between consumers' online shopping and offline mobility behavior. The results of the study give insights to further understand human behavior from both a cyber and real world point of view, which may help to place location based targeted advertisements, and plan commercial & retail centers in urban areas.

  • 29.
    Rao, Akhila
    et al.
    SICS Swedish ICT AB, Sweden.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. SICS Swedish ICT AB, Sweden.
    Performance implications for IoT over information centric networks2016In: CHANTS '16: Proceedings of the Eleventh ACM Workshop on Challenged Networks, New York: ACM Digital Library, 2016, p. 57-62Conference paper (Refereed)
    Abstract [en]

    Information centric networking (ICN) is a proposal for a future in-ternetworking architecture that is more efficient and scalable. Whileseveral ICN architectures have been evaluated for networks carry-ing web and video traffic, the benefits and challenges it poses forInternet of Things (IoT) networks are relatively unexplored. In ourwork, we evaluate the performance implications for typical IoT net-work scenarios in the ICN paradigm. We study the behavior of in-network caching, introduce a way to make caching more efficientfor periodic sensor data, and evaluate the impact of presence andlocation of lossy wireless links in IoT networks. In this paper, wepresent and discuss the results of our evaluations on IoT networksperformed through emulations using a specific ICN architecture,namely, content centric networking (CCN). For example, we showthat the newly proposed UTS-LRU cache replacement strategy forimproved caching performance of time series content streams re-duces the number of messages transmitted by up to 16%. Our find-ings indicate that the performance of IoT networks using ICN areinfluenced by the content model and the nature of its links, and mo-tivates further studies to understand the performance implicationsin more varied IoT scenarios.

  • 30.
    Zhao, Xiaoxing
    et al.
    Beijing University of Posts and Telecommunications.
    Qiao, Yuanyuan
    Beijing University of Posts and Telecommunications.
    Si, Zhongwei
    Beijing University of Posts and Telecommunications.
    Yang, Jie
    Beijing University of Posts and Telecommunications.
    Lindgren, Anders
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Prediction of user app usage behavior from geo-spatial data2016In: GeoRich '16: Proceedings of the Third International ACM SIGMOD Workshop on Managing and Mining Enriched Geo-Spatial Data, New York: ACM Digital Library, 2016, p. 37-42, article id 7Conference paper (Refereed)
    Abstract [en]

    In the era of mobile Internet, a vast amount of geo-spatial data allows us to gain further insights into human activities, which is critical for Internet Services Providers (ISP) to provide better personalized services. With the pervasiveness of mobile Internet, much evidence show that human mobility has heavy impact on app usage behavior. In this paper, we propose a method based on machine learning to predict users' app usage behavior using several features of human mobility extracted from geo-spatial data in mobile Internet traces. The core idea of our method is selecting a set of mobility attributes (e.g. location, travel pattern, and mobility indicators) that have large impact on app usage behavior and inputting them into a classification model. We evaluate our method using real-world network traffic collected by our self-developed high-speed Traffic Monitoring System (TMS). Our prediction method achieves 90.3% accuracy in our experiment, which verifies the strong correlation between human mobility and app usage behavior. Our experimental results uncover a big potential of geo-spatial data extracted from mobile Internet

1 - 30 of 30
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • 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