Ändra sökning
Avgränsa sökresultatet
36373839 1901 - 1929 av 1929
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1901. Zuniga, Marco
    et al.
    Irzynska, Izabela
    Hauer, Jan-Hinrich
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Boano, Carlo Alberto
    Römer, Kay
    Link Quality Ranking: Getting the Best out of Unreliable Links2011Konferensbidrag (Refereegranskat)
  • 1902.
    Ågren, Magnus
    RISE, Swedish ICT, SICS. Computer Systems Laboratory.
    Memoisation for constraint-based local search2009Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a memoisation technique for constraint-based local search based on the observation that penalties with respect to some interchangeable elements need only be calculated once. We apply the technique to constraint-based local search on set variables, and demonstrate the usefulness of the approach by significantly speeding up the penalty calculation of a commonly used set constraint.

  • 1903.
    Ågren, Magnus
    RISE., Swedish ICT, SICS.
    Set Constraints for Local Search2007Doktorsavhandling, monografi (Övrigt vetenskapligt)
  • 1904.
    Ågren, Magnus
    RISE, Swedish ICT, SICS. Department of Information Technology.
    Tracing and Explaining the Execution of CLP(FD) Programs in SICStus Prolog2002Självständigt arbete på avancerad nivå (masterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    The increasing interest in Constraint Programming (CP) we now witness gives rise to a demand for new and improved debugging techniques. Graphical tools, such as constraint- and search-tree visualizers, seem to be appropriate to get a general understanding of the complex process of constraint solving. However, many such tools have been built in an ad hoc way, forcing the developer to, for each new tool, provide relevant information from the constraint solver. In this thesis, we present a solution to the problem, limiting ourselves to Constraint Logic Programming over Finite Domains (clpfd). In order to do this, we come up with a trace structure for describing the execution of clpfd programs in detail. The trace structure consists of various trace events, each trace event containing different information depending on when in the solving process it is created. Among other things, the trace structure contains information about constraint posting, constraint awakening and domain narrowing. We also incorporate explanations in the trace structure, i.e. reasons for why certain solver actions occur. Furthermore, we come up with a format for describing the execution of the filtering algorithms of global constraints. An implementation of the trace structure in sicstus Prolog is also presented, as well as a tool using the trace; an extension to the ordinary Prolog debugger.

  • 1905.
    Ågren, Magnus
    et al.
    RISE., Swedish ICT, SICS.
    Beldiceanu, Nicolas
    RISE., Swedish ICT, SICS.
    Carlsson, Mats
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Sbihi, Mohamed
    Truchet, Charlotte
    Zampelli, Stéphane
    Six ways of integrating symmetries within non-overlapping constraints2009Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This report introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ways deal with the conjunction of a chain of lexicographic ordering constraint and a non-overlapping or a cumulative constraint. Experiments on academic two and three dimensional placement problems as well as on industrial problems show the benefit of such a strong integration of symmetry breaking constraints and non-overlapping ones.

  • 1906.
    Ågren, Magnus
    et al.
    RISE., Swedish ICT, SICS.
    Beldiceanu, Nicolas
    Carlsson, Mats
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Sbihi, Mohamed
    Truchet, Charlotte
    Zampelli, Stéphane
    Six ways of integrating symmetries within non-overlapping constraints2009Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper introduces six ways for handling a chain of lexicographic ordering (lex-chain) constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a lex-chain constraint within a generic geometric constraint kernel, the four latter ways deal with the conjunction of a lex-chain constraint and a non-overlapping or a cumulative constraint. Experiments on academic two and three dimensional placement problems as well as on industrial problems show the benefit of such a strong integration of symmetry breaking constraints and non-overlapping ones.

  • 1907.
    Ågren, Magnus
    et al.
    RISE., Swedish ICT, SICS.
    Flener, Pierre
    Pearson, Justin
    Revisiting constraint-directed search2007Ingår i: Proceedings of LSCS'07, the 4th International Workshop on Local Search Techniques in Constraint Satisfaction, 2007, 1Konferensbidrag (Refereegranskat)
    Abstract [en]

    We revisit the exploration of constraint-directed neighbourhoods, where a (small) set of constraints is picked before considering the neighbouring configurations where those constraints have a decreased (or preserved, or increased) penalty. Given the semantics of a constraint, such neighbourhoods can be represented via new attributes or primitives for the corresponding constraint object. We show how to define these neighbourhoods for set constraints, whether built-in or specified in monadic existential second-order logic. We also present an implementation of the corresponding primitives in our local search framework. Using these new primitives, we show how some common local-search algorithms are simplified, compared to using just a variable-directed neighbourhood, while not incurring any run-time overhead.

  • 1908.
    Ågren, Magnus
    et al.
    RISE, Swedish ICT, SICS. Computer Systems Laboratory.
    Flener, Pierre
    Pearson, Justin
    Revisiting constraint-directed search2009Ingår i: Information and Computation, Vol. 207, s. 438-457Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In constraint-based local search the solutions are described declaratively by a conjunction of (often high-level) constraints. In this article we show that this opens up new ideas for constraint-directed search. For a constraint we introduce three neighbourhoods, where the penalty for that constraint alone is decreasing, increasing, or unchanged. We give specialised algorithms for common constraints that efficiently implement these neighbourhoods. Further, we give a general algorithm that implements these neighbourhoods from specifications of constraints in monadic existential second-order logic. Finally, we show how common constraint-directed local search algorithms are often easier to express using these neighbourhoods.

  • 1909.
    Ågren, Magnus
    et al.
    RISE., Swedish ICT, SICS.
    Szeredi, Tamas
    RISE., Swedish ICT, SICS.
    Beldiceanu, Nicolas
    RISE., Swedish ICT, SICS.
    Carlsson, Mats
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Tracing and explaining execution of CLP(FD) programs2002Ingår i: Proceedings of the 12th International Workshop on Logic Programming Environments, WLPE 2002, 2002, 1, , s. 16Konferensbidrag (Refereegranskat)
    Abstract [en]

    Previous work in the area of tracing CLP(FD) programs mainly focuses on providing information about control of execution and domain modification. In this paper, we present a trace structure that provides information about additional important aspects. We incorporate explanations in the trace structure, i.e. reasons for why certain solver actions occur. Furthermore, we come up with a format for describing the execution of the filtering algorithms of global constraints. Some new ideas about the design of the trace are also presented. For example, we have modeled our trace as a nested block structure in order to achieve a hierarchical view. Also, new ways about how to represent and identify different entities such as constraints and domain variables are presented.

  • 1910. Åhman, Fredrik
    et al.
    Waern, Annika
    RISE., Swedish ICT, SICS.
    Modelling the interests of a news service user2001Ingår i: Proceedings of the 8th International Conference on User Modeling 2001, 13-17 July 2001, Sonthofen, Germany, 2001, 1Konferensbidrag (Refereegranskat)
    Abstract [en]

    We have developed a filtering service for an on-line news channel. In this domain, both content-based and collaborative filtering proved difficult to apply. Our solution was make extensive use of user involvement. In particular, we use the information gathered when users send tips about news articles to their friends. The paper describes the types of user involvement that our system allows, the techniques used for user modelling, and how these are used to generate relevant user-adaptive behaviour.

  • 1911.
    Åkesson, Karl-Petter
    et al.
    RISE, Swedish ICT, SICS. ICE.
    Bullock, Adrian
    Rodden, Tom
    A toolkit for user re-configuration of ubiquitous domestic environments2002Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper describes a distributed system with the aim to allow inhabitants to re-configure arrangements of devices and to understand the behaviour of these devices in tandem by making visible the various configurations. The purpose is to address the evolutionary nature of the domestic environments. We describe two different configuration facilities and the underlying infrastructure.

  • 1912.
    Åkesson, Karl-Petter
    et al.
    RISE, Swedish ICT, SICS. ICE.
    Nilsson, Andreas
    Designing Leisure Applications for the Mundane Car-Commute.2002Ingår i: Personal and Ubiquitous Computing, ISSN 1617-4909, E-ISSN 1617-4917, Vol. 6, s. 176-187Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Commuting by car from home to work can be very time consuming. We have conducted a study to explore what people are doing, and want to do, while commuting. People use their time in the car on a wide variety of activities with great innovation. There was no unanimous activity that everyone wanted, rather a wide variety of activities were requested. Three different categories of activity were identified which we refer to as mundane, vocational and traffic related. To demonstrate a possible IT service supporting commuters, a prototype based on speech output and a simple input mechanism from a wheel was developed. This service moves sampling of music from the conventional shop into the car. The prototype was informally tested with users, which resulted in a number of improvements. Preliminary user results indicate good functionality, a comprehensive interaction interface.

  • 1913.
    Åkesson, Karl-Petter
    et al.
    RISE, Swedish ICT, SICS. ICE.
    Simsarian, Kristian
    RISE, Swedish ICT, SICS. ICE.
    Reality Portals1999Konferensbidrag (Refereegranskat)
    Abstract [en]

    Through interactive augmented virtuality we provide the ability to interactively explore a remote space inside a virtual environment. This paper presents a tool and technique that can be used to create such virtual worlds that are augmented by video textures taken of real world objects. The system constructs and updates, in near real-time, a representation of the user-defined salient and relevant features of the real world. This technique has the advantage of constructing a virtual world that contains the relevant video-data of the real world, while maintaining the flexibility of a virtual world. The virtual-real world representation is not dependent on physical location and can be manipulated in a way not subject to the temporal, spatial, and physical constraints found in the real world. Another advantage is that spatializing the video-data may afford more intuitive examination.

  • 1914.
    Österlind, Fredrik
    RISE, Swedish ICT, SICS. Department of Information Technology.
    Improving Low-Power Wireless Protocols with Timing-Accurate Simulation2011Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    Low-power wireless technology enables numerous applications in areas from environmental monitoring and smart cities, to healthcare and recycling. But resource-constraints and the distributed nature of applications make low-power wireless networks difficult to develop and understand, resulting in increased development time, poor performance, software bugs, or even network failures. Network simulators offer full non-intrusive visibility and control, and are indispensible tools during development. But simulators do not always adequately represent the real world, limiting their applicability. In this thesis I argue that high simulation timing accuracy is important when developing high-performance low-power wireless protocols. Unlike in generic wireless network simulation, timing becomes important since low-power wireless networks use extremely timing-sensitive software techniques such as radio duty-cycling. I develop the simulation environment Cooja that can simulate low-power wireless networks with high timing accuracy. Using timing-accurate simulation, I design and develop a set of new low-power wireless protocols that improve on throughput, latency, and energy-efficiency. The problems that motivate these protocols were revealed by timing-accurate simulation. Timing-accurate software execution exposed performance bottlenecks that I address with a new communication primitive called Conditional Immediate Transmission (CIT). I show that CIT can improve on throughput in bulk transfer scenarios, and lower latency in many-to-one convergecast networks. Timing-accurate communication exposed that the hidden terminal problem is aggravated in duty-cycled networks that experience traffic bursts. I propose the Strawman mechanism that makes a radio duty-cycled network robust against traffic bursts by efficiently coping with hidden terminals. The Cooja simulation environment is available for use by others and is the default simulator in the Contiki operating system since 2006.

  • 1915.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Approaching the maximum 802.15.4 multi-hop throughput2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    Recent work in sensor network energy optimization has shown that batch-and-send networks can significantly reduce network energy consumption. Batch-and-send networks rely on effective batch data transport protocols, but the throughput of state-of-the-art protocols is low. We present conditional immediate transmission, a novel packet forwarding mechanism, with which we achieve a 109 kbit/s raw data throughput over a 6-hop multi-channel 250 kbit/s 802.15.4 network; 97% of the theoretical upper bound. We show that packet copying is the bottleneck in high-throughput packet forwarding and that by moving packet copying off the critical path, we nearly double the end-to-end throughput. Our results can be seen as an upper bound on the achievable throughput over a single-route, multi-channel, multihop 802.15.4 network. While it might be possible to slightly improve our performance, we are sufficiently close to the theoretical upper bound for such work to be of limited value.

  • 1916.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Approaching the maximum 802.15.4 multi-hop throughput2008Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Recent work in sensor network energy optimization has shown that batch-and-send networks can significantly reduce network energy consumption. Batch-and-send networks rely on effective batch data transport protocols, but the throughput of state-of-the-art protocols is low. We present conditional immediate transmission, a novel packet forwarding mechanism, with which we achieve a 109 kbit/s raw data throughput over a 6-hop multi-channel 250 kbit/s 802.15.4 network; 97% of the theoretical upper bound. We show that packet copying is the bottleneck in high-throughput packet forwarding and that by moving packet copying off the critical path, we nearly double the end-to-end throughput. Our results can be seen as an upper bound on the achievable throughput over a single-route, multi-channel, multi-hop 802.15.4 network. While it might be possible to slightly improve our performance, we are sufficiently close to the theoretical upper bound for such work to be of limited value. Rather, our results suggests that other mechanisms, such as multi-route forwarding, may be fruitful way to further improve multi-hop throughput.

  • 1917.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Cross-level sensor network simulation with Cooja2007Ingår i: Proceedings of Real-Time in Sweden 2007, 2007, 1Konferensbidrag (Refereegranskat)
  • 1918.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Cross-level sensor network simulation with COOJA2006Konferensbidrag (Refereegranskat)
    Abstract [en]

    Simulators for wireless sensor networks are a valuable tool for system development. However, current simulators can only simulate a single level of a system at once. This makes system development and evolution difficult since developers cannot use the same simulator for both high-level algorithm development and low-level development such as device-driver implementations. We propose cross-level simulation, a novel type of wireless sensor network simulation that enables holistic simultaneous simulation at different levels. We present an implementation of such a simulator, COOJA, a simulator for the Contiki sensor node operating system. COOJA allows for simultaneous simulation at the network level, the operating system level, and the machine code instruction set level. With COOJA, we show the feasibility of the cross-level simulation approach.

  • 1919.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Cross-level simulation in cooja.2007Konferensbidrag (Refereegranskat)
  • 1920.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    He, Zhitao
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Sensornet checkpointing between simulated and deployed networks2009Ingår i: IPSN'09, 2009, 1, , s. 2Konferensbidrag (Refereegranskat)
    Abstract [en]

    Sensor network development is notoriously difficult due to the low visibility of sensor platforms and systems. We propose sensornet checkpointing to increase the visibility of sensor networks. With sensornet checkpointing, we transfer network-wide application checkpoints between simulated and real networks. This approach enable advances in many research areas: visualization, repeatable experiments, fault injection, and application debugging. We demonstrate sensornet checkpointing on a network of Tmote Sky motes running Contiki.

  • 1921.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Sensornet checkpointing: enabling repeatability in testbeds and realism in simulations2009Ingår i: 6th European Conference on Wireless Sensor Networks, 2009, 1Konferensbidrag (Refereegranskat)
    Abstract [en]

    When developing sensor network applications, the shift from simulation to testbed causes application failures, resulting in additional time-consuming iterations between simulation and testbed. We propose transferring sensor network checkpoints between simulation and testbed to reduce the gap between simulation and testbed. Sensornet checkpointing combines the best of both simulation and testbeds: the nonintrusiveness and repeatability of simulation, and the realism of testbeds.

  • 1922.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Cooja TimeLine: A Power Visualizer for Sensor Network Simulation2010Konferensbidrag (Refereegranskat)
    Abstract [en]

    Power consumption is one of the most important factors in wireless sensor network research, but most simulators do not provide support for visualizing the power consumption of an entire sensor network. This makes it hard to develop, debug, and understand mechanisms and protocols based on power-saving mechanisms. We present Cooja TimeLine, an extension to Contiki’s Cooja network simulator, that visualizes radio traffic and radio usage of sensor networks. Cooja TimeLine makes is possible to visually see the behavior of low-power protocols and mechanisms thereby increasing the understanding of the behavior of sensor networks. We see this as an important tool for the field moving forward.

  • 1923.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Mottola, Luca
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Strawman: Resolving Collisions in Bursty Low-Power Wireless Networks2012Konferensbidrag (Refereegranskat)
  • 1924.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Pramsten, Erik
    Roberthson, Daniel
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Integrating Building Automation Systems and Wireless Sensor Networks2007Konferensbidrag (Refereegranskat)
    Abstract [en]

    Building automation systems (BAS) are used to control and improve indoor building climate at reduced costs. By integrating BAS with wireless sensor networks, the need for cabling can be removed, and both installation and operational costs significantly reduced. Furthermore, temporary BAS installations are made possible. By implementing and evaluating the open BAS standard BACnet on resource-constrained sensor nodes we show that integrating existing standard BAS protocols with wireless sensor networks is feasible.

  • 1925.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Pramsten, Erik
    Roberthson, Daniel
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Integrating Building Automation Systems and Wireless Sensor Networks2007Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Building automation systems (BAS) are used to control and improve indoor building climate at reduced costs. By integrating BAS with wireless sensor networks, the need for cabling can be removed, and both installation and operational costs significantly reduced. Furthermore, temporary BAS installations are made possible. By implementing and evaluating the open BAS standard BACnet on the ESB nodes we show that using existing standard BAS protocols is possible on resource-constrained sensor nodes.

  • 1926.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Sasnauskas, Raimondas
    RWTH Aachen University, Germany.
    Dustmann, Oscar Soria
    RWTH Aachen University, Germany.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    Wehrle, Klaus
    RWTH Aachen University, Germany.
    Integrating Symbolic Execution with Sensornet Simulation for Efficient Bug Finding2010Konferensbidrag (Refereegranskat)
    Abstract [en]

    High-coverage testing of sensornet applications is vital for pre-deployment bug cleansing, but has previously been difficult due to the limited set of available tools. We integrate the KleeNet symbolic execution engine with the COOJA network simulator to allow for straight-forward and intuitive high-coverage testing initiated from a simulation environment. A tight coupling of simulation and testing helps detect, narrow down, and fix complex interaction bugs in an early development phase. We demonstrate the seamless transition between COOJA simulation and KleeNet symbolic execution. Our framework enables future research in how high coverage testing tools could be used in cooperation with simulation tools.

  • 1927.
    Österlind, Fredrik
    et al.
    RISE., Swedish ICT, SICS.
    Wirström, Niklas
    RISE., Swedish ICT, SICS.
    Tsiftes, Nicolas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE., Swedish ICT, SICS.
    StrawMAN: Making Sudden Traffic Surges Graceful in Low-Power Wireless Networks2010Konferensbidrag (Refereegranskat)
  • 1928. Öström, Erik
    et al.
    Mottola, Luca
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Nilsson, Martin
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Demo Abstract: Smart Antennas Made Practical: The SPIDA Way2010Konferensbidrag (Refereegranskat)
  • 1929. Öström, Erik
    et al.
    Mottola, Luca
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Evaluation of an Electronically Switched Directional Antenna for Real-world Low-power Wireless Networks2010Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present the real-world evaluation of SPIDA, an electronically switched directional antenna. Compared to most existing work in the field, SPIDA is practical as well as inexpensive. We interface SPIDA with an off-the-shelf sensor node which provides us with a fully working real-world prototype. We assess the performance of our prototype by comparing the behavior of SPIDA against traditional omni-directional antennas. Our results demonstrate that the SPIDA prototype concentrates the radiated power only in given directions, thus enabling increased communication range at no additional energy cost. In addition, compared to the other antennas we consider, we observe more stable link performance and better correspondence between the link performance and common link quality estimators.

36373839 1901 - 1929 av 1929
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.9