This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-20 Creation time: 04-11-41 --- Number of references 13 inproceedings 2010-krebs-Globecom10-clustering-mesh-conference Topology Stability-Based Clustering for Wireless Mesh Networks 2010 12 1 1-5 In the past, many clustering algorithms for ad-hoc networks have been proposed. Their main objective is to solve the scalability issue of ad-hoc networks by grouping nodes into clusters. The challenge in MANETs for those clustering algorithms is to cope with the high node mobility which affects the stability of the cluster structures. Wireless mesh networks consist of a static backbone and a number of mobile nodes. In the backbone of a wireless mesh network the topology is relatively static. However, topology changes occur due to frequent link losses and temporary link instability. Due to the static nature of the backbone, mobility-based approaches are not suitable in this case. In this paper, we state the important aspects for stable clustering in wireless mesh networks with unidirectional links based on the investigation of a 45-node wireless mesh testbed. We analyze well-known clustering algorithms and their performance in a large-scale testbed. Finally, we propose a new clustering algorithm called Stable Link Clustering Algorithm (SLCA). fileadmin/papers/2010/2010-lora-clustering-MESH.pdf http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5683417 Print IEEE Proceedings of the IEEE Global Telecommunications Conference GLOBECOM 2010, Miami, USA Miami, FL, USA IEEE Global Telecommunications Conference, GLOBECOM 2010 6 - 10 December 2010 en 978-1-4244-5636-9 10.1109/GLOCOM.2010.5683417 1 MartinKrebs AndréStein Mónica AlejandraLora Girón inproceedings 2010-sensys-sasnauskas-coojakleenet Demo Abstract: Integrating Symbolic Execution with Sensornet Simulation for Efficient Bug Finding 2010 11 383--384 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. kleenet fileadmin/papers/2010/2010-osterlind_sasnauskas-sensys-coojakleenet.pdf Print ACM
New York, NY, USA
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland en 978-1-4503-0344-6 http://doi.acm.org/10.1145/1869983.1870034 1 FredrikÖsterlind RaimondasSasnauskas AdamDunkels OscarSoria Dustmann KlausWehrle
inproceedings schleinzer10 A Security Pattern for Data Integrity in P2P Systems 2010 10 16 Online ACM PLoP 2010, Reno, NV, USA Reno PLoP 2010 unpublished en 1 BenjaminSchleinzer NobukazuYoshioka conference 2010-08-lcn-samad-ASSA Adaptive Security Established on the Requirements and Resource Abilities of Network Nodes 2010 10 11 1 752-755 Online IEEE The 10th IEEE Wireless Local Networks(WLN 2010) in the 35th IEEE Local Computer Networks (LCN 2010), Denver, Colorado, U.S.A. Denver, Colorado, United States IEEE Local Computer Networks (IEEE LCN 2010) 11-14 Oct. 2010 en 978-1-4244-8388-4 FahadSamad SadeqAli Makram inproceedings 2010softcomweingaertnerprotocolanalysis Flexible Analysis of Distributed Protocol Implementations using Virtual Time 2010 9 23 225 - 229 available in IEEE Xplore https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-weingaertner-softcom-analysis.pdf Online FESB
Split, Croatia
Proceedings of the 18th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2010) Hvar, Croatia en 978-1-4244-8663-2 1 EliasWeingaertner MarkoRitter RaimondasSasnauskas KlausWehrle
conference 2010-08-icccn-samad-PiCAT PiCAT: Palliating Channel Assignment Assaults using Adjustable Trust in Wireless Mesh Networks IEEE ICCCN 2010 2010 8 2 1 1 - 7 Online IEEE Medienkombination The 19th International Conference on Computer Communications and Networks (ICCCN 2010), Zurich, Switzerland Zurich, Switzerland 19th International Conference on Computer Communications and Networks (ICCCN 2010) August 2–5, 2010 en 978-1-4244-7114-0 1095-2055 10.1109/ICCCN.2010.5560076 FahadSamad SadeqAli Makram inbook 2010-simtools-sasnauskas-transport Modeling Transport Layer Protocols 2010 6 389-399 Print Klaus Wehrle, Mesut Guenes, James Gross Springer
Germany
17 Modeling and Tools for Network Simulation en 978-3-642-12330-6 1 RaimondasSasnauskas EliasWeingaertner
inproceedings icc2010vpsim Towards Network Centric Development of Embedded Systems 2010 5 23 1-6 Nowadays, the development of embedded system hardware and related system software is mostly carried out using virtual platform environments. The high level of modeling detail (hardware elements are partially modeled in a cycle-accurate fashion) is required for many core design tasks. At the same time, the high computational complexity of virtual platforms caused by the detailed level of simulation hinders their application for modeling large networks of embedded systems. In this paper, we propose the integration of virtual platforms with network simulations, combining the accuracy of virtual platforms with the versatility and scalability of network simulation tools. Forming such a hybrid toolchain facilitates the detailed analysis of embedded network systems and related important design aspects, such as resource effectiveness, prior to their actual deployment. https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-schuermans-weingaertner-network_centric.pdf Online IEEE Proceedings of the IEEE International Conference on Communications (ICC), Cape Town, South Africa, May 23-27 en 978-1-4244-6402-9 1550-3607 10.1109/ICC.2010.5502185 1 StefanSchürmanns EliasWeingaertner TorstenKempf GerdAscheid KlausWehrle RainerLeupers inproceedings 2010-ipsn-sasnauskas-kleenet KleeNet: Discovering Insidious Interaction Bugs in Wireless Sensor Networks Before Deployment 2010 4 12 186--196 Complex interactions and the distributed nature of wireless sensor networks make automated testing and debugging before deployment a necessity. A main challenge is to detect bugs that occur due to non-deterministic events, such as node reboots or packet duplicates. Often, these events have the potential to drive a sensor network and its applications into corner-case situations, exhibiting bugs that are hard to detect using existing testing and debugging techniques. In this paper, we present KleeNet, a debugging environment that effectively discovers such bugs before deployment. KleeNet executes unmodified sensor network applications on symbolic input and automatically injects non-deterministic failures. As a result, KleeNet generates distributed execution paths at high-coverage, including low-probability corner-case situations. As a case study, we integrated KleeNet into the Contiki OS and show its effectiveness by detecting four insidious bugs in the uIP TCP/IP protocol stack. One of these bugs is critical and lead to refusal of further connections. automated protocol testing, experimentation, failure detection, wireless sensor networks kleenet fileadmin/papers/2010/2010-04-ipsn-sasnauskas-KleeNet.pdf Print ACM
New York, NY, USA
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden en 978-1-60558-988-6 http://doi.acm.org/10.1145/1791212.1791235 1 RaimondasSasnauskas OlafLandsiedel Muhammad HamadAlizai CarstenWeise StefanKowalewski KlausWehrle
inproceedings 20104-IPSN-alizai-svr Poster Abstract: Statistical Vector based Point-to-Point Routing in Wireless Networks 2010 4 12 366-367 We present Statistical Vector Routing (SVR), a protocol that efficiently deals with communication link dynamics in wireless networks. It assigns virtual coordinates to nodes based on the statistical distribution of their distance from a small set of beacons. The distance metric predicts the current location of a node in its address distribution. Our initial results from a prototype implementation over real testbeds demonstrate the feasibility of SVR. wld https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf http://portal.acm.org/citation.cfm?id=1791257 Print ACM
New York, NY, USA
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden Stockholm, Sweden 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010) April 12-16, 2010 en 978-1-60558-988-6 1 Muhammad HamadAlizai TobiasVaegs OlafLandsiedel RaimondasSasnauskas KlausWehrle
inproceedings inproceedingsreference201001221179332027 Towards a Flexible and Versatile Cross-Layer-Coordination Architecture 2010 3 15 1-5 In wireless and mobile networking, volatile environ- mental conditions are a permanent challenge, resulting in a demand for cross-layer optimizations. To further increase flexibility, we believe cross-layer architectures should adapt themselves to these changing conditions, just as they adapt the network stack, devices, and applications. In this paper, we propose CRAWLER, a novel cross-layer architecture that combines three core properties: signaling between all layers and system components; extensibility and adaptability at runtime; and high usability for cross-layer developers. CRAWLER increases flexibility, as well as expediting and simplifying cross- layer development. Work in Progress session crawler fileadmin/papers/2010/2010-03-infocom-aktas-crawler.pdf Print IEEE Proceedings of the 2010 INFOCOM IEEE Conference on Computer Communications Workshops, San Diego, CA, USA en 978-1-4244-6739-6 1 IsmetAktas JensOtten FlorianSchmidt KlausWehrle inproceedings inproceedingsreference201001227195395138 Iterative Source-Channel Decoding with Cross-Layer Support for Wireless VoIP 2010 1 18 1 1-6 This paper presents a cross-layer approach for iterative source-channel decoding (ISCD) in wireless VoIP networks. The novelty of the proposed method is the incorporation of both, speech bits as well as protocol header bits, into the ISCD process. The header bits take the role of pilot bits having perfect reliability. These bits are distributed over the frame as strong supporting points for the MAP decoder which results in a significant enhancement of the output speech quality compared to the benchmark scheme using ISCD for speech only. For this approach, we exploit new cross-layer concepts that support the direct communication between non-adjacent layers. These concepts enable the iterative exchange of extrinsic information between the source decoder located on the application layer and the channel decoder located on the physical layer. This technique can also be applied to audio and video transmission. refector fileadmin/papers/2010/2010-01-scc-breddermann-iscd.pdf CD-ROM / DVD-ROM Rudolf Mathar, Christoph Ruland VDE Verlag
Berlin, Germany
Proceedings of International ITG Conference on Source and Channel Coding Proceedings of International ITG Conference on Source and Channel Coding ITG Siegen International ITG Conference on Source and Channel Coding 2010 January 18-21, 2010 en 978-3-8007-3211-1 1 TobiasBreddermann HelgeLueders PeterVary IsmetAktas FlorianSchmidt
inproceedings Eisenblaetter10 <prt>A Two-Stage Approach to WLAN Planning: Detailed Performance Evaluation Along the Pareto Frontier</prt> 2010 227 -236 Proc. of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt'10) AndreasEisenblätter Hans-FlorianGeerdes JamesGross OscarPuñal JonasSchweiger