This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-19 Creation time: 04-35-53 --- Number of references 63 article 2024_pennekamp_supply-chain-sensing IEEE Access 2024 1 8 12 9350-9368 Supply chains increasingly develop toward complex networks, both technically in terms of devices and connectivity, and also anthropogenic with a growing number of actors. The lack of mutual trust in such networks results in challenges that are exacerbated by stringent requirements for shipping conditions or quality, and where actors may attempt to reduce costs or cover up incidents. In this paper, we develop and comprehensively study four scenarios that eventually lead to end-to-end-secured sensing in complex IoT-based supply chains with many mutually distrusting actors, while highlighting relevant pitfalls and challenges—details that are still missing in related work. Our designs ensure that sensed data is securely transmitted and stored, and can be verified by all parties. To prove practical feasibility, we evaluate the most elaborate design with regard to performance, cost, deployment, and also trust implications on the basis of prevalent (mis)use cases. Our work enables a notion of secure end-to-end sensing with minimal trust across the system stack, even for complex and opaque supply chain networks. blockchain technology; reliability; security; trust management; trusted computing; trusted execution environments internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-pennekamp-secure-sensing.pdf 2169-3536 10.1109/ACCESS.2024.3350778 1 JanPennekamp FritzAlder LennartBader GianlucaScopelliti KlausWehrle Jan TobiasMühlberg incollection 2023_rueppel_crd-b2.ii 2023 2 8 221-246 The main objectives in production technology are quality assurance, cost reduction, and guaranteed process safety and stability. Digital shadows enable a more comprehensive understanding and monitoring of processes on shop floor level. Thus, process information becomes available between decision levels, and the aforementioned criteria regarding quality, cost, or safety can be included in control decisions for production processes. The contextual data for digital shadows typically arises from heterogeneous sources. At shop floor level, the proximity to the process requires usage of available data as well as domain knowledge. Data sources need to be selected, synchronized, and processed. Especially high-frequency data requires algorithms for intelligent distribution and efficient filtering of the main information using real-time devices and in-network computing. Real-time data is enriched by simulations, metadata from product planning, and information across the whole process chain. Well-established analytical and empirical models serve as the base for new hybrid, gray box approaches. These models are then applied to optimize production process control by maximizing the productivity under given quality and safety constraints. To store and reuse the developed models, ontologies are developed and a data lake infrastructure is utilized and constantly enlarged laying the basis for a World Wide Lab (WWL). Finally, closing the control loop requires efficient quality assessment, immediately after the process and directly on the machine. This chapter addresses works in a connected job shop to acquire data, identify and optimize models, and automate systems and their deployment in the Internet of Production (IoP). Process control; Model-based control; Data aggregation; Model identification; Model optimization internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-rueppel-iop-b2.i.pdf Springer Interdisciplinary Excellence Accelerator Series Internet of Production: Fundamentals, Applications and Proceedings 978-3-031-44496-8 10.1007/978-3-031-44497-5_7 1 Adrian KarlRüppel MuzafferAy BenediktBiernat IkeKunze MarkusLandwehr SamuelMann JanPennekamp PascalRabe Mark P.Sanders DominikScheurenberg SvenSchiller TiandongXi DirkAbel ThomasBergs ChristianBrecher UweReisgen Robert H.Schmitt KlausWehrle inproceedings 2022_matzutt_redactchain 2022 5 3 Blockchains gained tremendous attention for their capability to provide immutable and decentralized event ledgers that can facilitate interactions between mutually distrusting parties. However, precisely this immutability and the openness of permissionless blockchains raised concerns about the consequences of illicit content being irreversibly stored on them. Related work coined the notion of redactable blockchains, which allow for removing illicit content from their history without affecting the blockchain's integrity. While honest users can safely prune identified content, current approaches either create trust issues by empowering fixed third parties to rewrite history, cannot react quickly to reported content due to using lengthy public votings, or create large per-redaction overheads. In this paper, we instead propose to outsource redactions to small and periodically exchanged juries, whose members can only jointly redact transactions using chameleon hash functions and threshold cryptography. Multiple juries are active at the same time to swiftly redact reported content. They oversee their activities via a global redaction log, which provides transparency and allows for appealing and reversing a rogue jury's decisions. Hence, our approach establishes a framework for the swift and transparent moderation of blockchain content. Our evaluation shows that our moderation scheme can be realized with feasible per-block and per-redaction overheads, i.e., the redaction capabilities do not impede the blockchain's normal operation. redactable blockchain; illicit content; chameleon hash functions; threshold cryptography mynedata; impact-digital; digital-campus https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-matzutt-redactchain.pdf IEEE Proceedings of the 2022 IEEE International Conference on Blockchain and Cryptocurrency (ICBC '22), May 2-5, 2022, Shanghai, China Shanghai, China May 2-5, 2022 978-1-6654-9538-7/22 10.1109/ICBC54727.2022.9805508 1 RomanMatzutt VincentAhlrichs JanPennekamp RomanKarwacik KlausWehrle inproceedings 2020-hiller-ccs-crosssigning 2020 11 11 1289-1306 PKI; X.509; SSL; TLS; cross-signing; cross certification https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-hiller-ccs-cross_signing.pdf https://github.com/pki-xs-analysis ACM

New York, NY, USA

Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (CCS ’20), November 9–13, 2020, Virtual Event, USA. Orlando, FL, USA November 9-13, 2020 10.1145/3372297.3423345 1 JensHiller JohannaAmann OliverHohlfeld inproceedings 2020_pennekamp_supply_chain_sensing 2020 7 1 Trust along digitalized supply chains is challenged by the aspect that monitoring equipment may not be trustworthy or unreliable as respective measurements originate from potentially untrusted parties. To allow for dynamic relationships along supply chains, we propose a blockchain-backed supply chain monitoring architecture relying on trusted hardware. Our design provides a notion of secure end-to-end sensing of interactions even when originating from untrusted surroundings. Due to attested checkpointing, we can identify misinformation early on and reliably pinpoint the origin. A blockchain enables long-term verifiability for all (now trustworthy) IoT data within our system even if issues are detected only after the fact. Our feasibility study and cost analysis further show that our design is indeed deployable in and applicable to today's supply chain settings. supply chain; trusted computing; trusted execution; blockchain; Internet of Production; condition monitoring internet-of-production https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-pennekamp-supply-chain-sensing.pdf IEEE Proceedings of the 5th International Workshop on Cyber-Physical Systems Security (CPS-Sec '20), co-located with the 8th IEEE Conference on Communications and Network Security (CNS '20), June 29-July 1, 2020, Avignon, France Avignon, France June 29-July 1, 2020 978-1-7281-4760-4 10.1109/CNS48642.2020.9162337 1 JanPennekamp FritzAlder RomanMatzutt Jan TobiasMühlberg FrankPiessens KlausWehrle article 2020-holz-ccr-tls13 ACM SIGCOMM Computer Communications Review (CCR) 2020 7 50 3 3-15 Selected for the 'Best of CCR' session at SIGCOMM 2021. https://ccronline.sigcomm.org/wp-content/uploads/2020/08/sigcomm-ccr-paper430-with-open-review.pdf Association for Computing Machinery

New York, NY, USA

10.1145/3411740.3411742 1 RalphHolz JensHiller JohannaAmann AbbasRazaghpanah ThomasJost NarseoVallina-Rodriguez OliverHohlfeld inproceedings 2020-mann-ur-weldseamstudy 2020 6 https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-mann-weld-seam-geometry-control.pdf Proceedings of the 2020 Internal Conference on Ubiquitous Robots Internal Conference on Ubiquitous Robots June 22-26, 2020 10.1109/UR49135.2020.9144839 1 SamuelMann RenéGlebke IkeKunze DominikScheurenberg RahulSharma UweReisgen KlausWehrle DirkAbel article dombrowski-vdi VDE Positionspapier 2017 6 1 VDE - Verband der Elektrotechnik, Elektronik, Informationstechnik e.V.

Stresemannallee 15, 60596 Frankfurt am Main, Germany

IsmetAktas AlexanderBentkus FlorianBonanati ArminDekorsy ChristianDombrowski MichaelDoubrava AliGolestani FrankHofmann MikeHeidrich StefanHiensch RüdigerKays MichaelMeyer AndreasMüller Stephanten Brink NedaPetreska MilanPopovic LutzRauchhaupt AhmadSaad HansSchotten ChristophWöste IngoWolff inproceedings 2017-serror-ew-koi 2017 5 17 koi https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-serror-radio-design-ew17.pdf IEEE Proc. of 23rd European Wireless Conference (EW17), Dresden, Germany Dresden, Germany Proc. of 23rd European Wireless Conference (EW17) 17.-19. May 2017 1 Shehzad AliAshraf Y.-P. EricWang SamehEldessoki BerndHolfeld DonaldParruca MartinSerror JamesGross proceedings 2017-serror-netsys-industrial 2017 3 16 koi https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/Ansari_et_al_Wireless_Industrial_Automation_Demo_NetSys_2017.pdf IEEE Göttingen, Germany International Conference on Networked Systems (NetSys 2017) 10.1109/NetSys.2017.7931496 1 JunaidAnsari IsmetAktas ChristianBrecher ChristophPallasch NicolaiHoffmann MarkusObdenbusch MartinSerror KlausWehrle JamesGross inproceedings 2016-ahmed-sensys-poster-incremental 2016 11 14 1--2 We propose incremental checkpointing techniques enabling transiently powered devices to retain computational state across multiple activation cycles. As opposed to the existing approaches, which checkpoint complete program state, the proposed techniques keep track of modified RAM locations to incrementally update the retained state in secondary memory, significantly reducing checkpointing overhead both in terms of time and energy. /fileadmin/misc/2016/2016-ahmed-sensys-poster-incremental.pdf http://dl.acm.org/citation.cfm?id=2996701 2016-11-20 http://sensys.acm.org/2016/ Online ACM Proceedings of the 14th ACM Conference on Embedded Networked Sensor Systems (SenSys 2016), Stanford, CA, USA Stanford, CA, USA Sensys '16 November 14-16, 2016 en 978-1-4503-4263-6/16/11 http://dx.doi.org/10.1145/2994551.2996701 1 SaadAhmed HassanKhan Junaid HaroonSiddiqui Jó AgilaBitsch Link Muhammad HamadAlizai inproceedings 2016-ackermann-healthcom-eeg-emotion 2016 9 14 159--164 Automatic emotion recognition is an interdisciplinary research field which deals with the algorithmic detection of human affect, e.g. anger or sadness, from a variety of sources, such as speech or facial gestures. Apart from the obvious usage for industry applications in human-robot interaction, acquiring the emotional state of a person automatically also is of great potential for the health domain, especially in psychology and psychiatry. Here, evaluation of human emotion is often done using oral feedback or questionnaires during doctor-patient sessions. However, this can be perceived as intrusive by the patient. Furthermore, the evaluation can only be done in a non-continuous manner, e.g. once a week during therapy sessions. In contrast, using automatic emotion detection, the affect state of a person can be evaluated in a continuous non-intrusive manner, for example to detect early on-sets of depression. An additional benefit of automatic emotion recognition is the objectivity of such an approach, which is not influenced by the perception of the patient and the doctor. To reach the goal of objectivity, it is important, that the source of the emotion is not easily manipulable, e.g. as in the speech modality. To circumvent this caveat, novel approaches in emotion detection research the potential of using physiological measures, such as galvanic skin sensors or pulse meters. In this paper we outline a way of detecting emotion from brain waves, i.e., EEG data. While EEG allows for a continuous, real-time automatic emotion recognition, it furthermore has the charm of measuring the affect close to the point of emergence: the brain. Using EEG data for emotion detection is nevertheless a challenging task: Which features, EEG channel locations and frequency bands are best suited for is an issue of ongoing research. In this paper we evaluate the use of state of the art feature extraction, feature selection and classification algorithms for EEG emotion classification using data from the de facto standard dataset, DEAP. Moreover, we present results that help choose methods to enhance classification performance while simultaneously reducing computational complexity. /fileadmin/papers/2016/2016-ackermann-healthcom-emorec.pdf http://ieeehealthcom2016.com/ Online IEEE 2016 IEEE 18th International Conference on e-Health Networking, Applications and Services (Healthcom) Munich, Germany 2016 IEEE 18th International Conference on e-Health Networking, Applications and Services (Healthcom) September 14-17, 2016 en 978-1-5090-3370-6 1 PascalAckermann ChristianKohlschein Jó AgilaBitsch Link KlausWehrle SabinaJeschke article 2014-cheng-acta-geodyn-geomater Acta Geodynamica et Geomaterialia 2014 10 8 11 4 1--12 Accelerometer and inclinometer are inertial sensors capable of measuring corresponding magnitude of Earth gravitational field along the direction of each axis. By means of rotation matrices related to inertial navigation methods, the output values of a three-dimensional accelerometer or a two-dimensional inclinometer can be transformed and processed into the azimuth and dip angle of the monitored target. With the rapid growth in development and cost reduction of Micro Electro Mechanical Systems (MEMS) and Wireless Sensor Network (WSN) in recent years, the engineers are able to carry out real-time wireless geotechnical monitoring during construction. In this paper, we set up a one-day measurement implemented by a self- developed wireless MEMS monitoring system on the surface in the construction site of South Hongmei Road super high way tunnel in Shanghai, by making use of rotation matrices in specific ways, the raw data are processed to expressions of three-dimensional normal vectors that represent the change of the ground. After unifying the vectors in the same coordinate system, we conduct a brief ground settlement analysis by means of an evaluation of the dip angles in the cross section and the azimuths of the sensor nodes. http://www.irsm.cas.cz/index_en.php?page=acta_detail_doi&id=96 Online Institute of Rock Structure and Mechanics of the ASCR, v.v.i.

Prague, Czech Republic

Online en 2336-4351 10.13168/AGG.2014.0015 1 ChengLi TomásFernández-Steeger Jó AgilaBitsch Link MatthiasMay RafigAzzam conference parruca_2014ICIC 2014 9 21 To minimize interference in LTE networks, several inter-cell interference coordination (ICIC) techniques have been in- troduced. Among them, semi-static ICIC offers a balanced trade-off between applicability and system performance. The power allocation per resource block and cell is adapted in the range of seconds according to the load in the system. An open issue in the literature is the question how fast the adaptation should be performed. This leads basically to a trade-off between system performance and feasible compu- tation times of the associated power allocation problems. In this work, we close this open issue by studying the impact that different durations of update times of semi-static ICIC have on the system performance. We conduct our study on realistic scenarios considering also the mobility of mobile terminals. Secondly, we also consider the implementation aspects of a semi-static ICIC. We introduce a very efficient implementation on general purpose graphic processing units, harnessing the parallel computing capability of such devices. We show that the update periods have a significant impact on the performance of cell edge terminals. Additionally, we present a graphic processing unit (GPU) based implementation which speeds up existing implementations up to a factor of 92x. OFDMA; LTE; ICIC; Inter-Cell Interference Coordination; GPU; GA; Genetic Algorithm; 4G; Cellular Networks; In- terference; Proportional Fair Scheduling ACM ACM Proceedings of the 17th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM-14) Montreal, QC, Canada International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM-14) September 21-26 2014 http://dx.doi.org/10.1145/2641798.2641818 1 DonaldParruca FahadAizaz SoamsiriChantaraskul JamesGross inproceedings 2014-aktas-wintech-a-framework-for-remote-automation-configuration-and-monitoring 2014 9 7 1--8 crawler fileadmin/papers/2014/2014-aktas-wintech-remote-cross-layer.pdf Online ACM Proceedings of the 9th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2014), Hawaii, USA Hawaii, USA 9th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2014) 7 September 2014 en 978-1-4503-3072-5 10.1145/2643230.2643236 1 IsmetAktas OscarPuñal FlorianSchmidt TobiasDrüner KlausWehrle inproceedings 2014-aktas-punal-wowmom-machine-learning-based-jamming-detection-for-80211-conference Proceedings of the 15th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'14), Sydney, Australia 2014 6 16 1--10 crawler fileadmin/papers/2014/2014-aktas-wowmom-jammingdetection.pdf Online IEEE Proceedings of the 15th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'14), Sydney, Australia Sydney 15th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'14) 16-19 June, 2014 en 1 OscarPuñal IsmetAktas Caj-JulianSchnelke GloriaAbidin JamesGross KlausWehrle inproceedings 2014-comsnets-aktas-graph-based-redundancy-removal 2014 1 7 1-8 crawler http://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-aktas-comsnets-redundancy.pdf Online IEEE Proceedings of the 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS), Bangalore, India Bangalore, India 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS) 7-10 January, 2014 en 978-1-4799-3635-9 10.1109/COMSNETS.2014.6734899 1 IsmetAktas MartinHenze Muhammad HamadAlizai KevinMöllering KlausWehrle article 2014-alizai-pad-jnca Elsevier Journal of Network and Computer Applications (JNCA) 2014 unpublished en 1 Muhammad HamadAlizai KlausWehrle article 2013-elsevir-aktas-harnessing-cross-layer-design Elsevir Ad-hoc Networks 2013 10 1 crawler 1 IsmetAktas Muhammad HamadAlizai FlorianSchmidt HannoWirtz KlausWehrle inproceedings 2013-bitsch-extremecom-oneway 2013 8 24 1--6 fileadmin/papers/2013/2013-bitsch-extremecom-oneway.pdf Online Hui, Pan and Lindgren, Anders ACM Proceedings of the 5th Extreme Conference on Communication Thorsmork, Iceland 5th Extreme Conference on Communication August 24-30, 2013 en 978-1-4503-2171-6 1 Jó AgilaBitsch Link AlaaAlhamoud KlausWehrle inproceedings 2013-wons-wirtz-fuzzy 2013 3 Online IEEE Proceedings of the 10th International Conference on Wireless On-demand Network Systems and Services (WONS '13), Banff, Canada Banff, Canada en 978-1-4799-0747-2 10.1109/WONS.2013.6578338 1 HannoWirtz Muhammad HamadAlizai KlausWehrle article 2013-wirtz-alizai-tinywifi-jnca Journal of Network and Computer Applications (JNCA) 2013 Co-primary authorship Alizai, Wirtz fileadmin/papers/2013/2013-wirtz-alizai-tinywifi-jnca.pdf http://www.sciencedirect.com/science/article/pii/S108480451300060X en 1084-8045 10.1016/j.jnca.2013.02.022 1 HannoWirtz Muhammad HamadAlizai BernhardKirchen KlausWehrle inproceedings 2012-aktas-new2an-AnAdaptiveCodecSwitchingSchemeforSIPbasedVoIP-conference Proceedings of the 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012) 2012 8 27 1-12 Contemporary Voice-Over-IP (VoIP) systems typically ne- gotiate only one codec for the entire VoIP session life time. However, as different codecs perform differently well under certain network conditions like delay, jitter or packet loss, this can lead to a reduction of quality if those conditions change during the call. This paper makes two core contributions: First, we compare the speech quality of a set of stan- dard VoIP codecs given different network conditions. Second, we propose an adaptive end-to-end based codec switching scheme that fully conforms to the SIP standard. Our evaluation with a real-world prototype based on Linphone shows that our codec switching scheme adapts well to changing network conditions, improving overall speech quality. crawler fileadmin/papers/2012/2012-aktas-new2an-codecswitching.pdf Online LNCS Proceedings of the 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012), St. Pettersburg, Russia. St. Pettersburg, Russia 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012) 27-29 August, 2012 en 978-3-642-32685-1 10.1007/978-3-642-32686-8_32 1 IsmetAktas FlorianSchmidt EliasWeingaertner Caj-JulianSchnelke KlausWehrle inproceedings 2012-aktas-wowmom-CRAWLER:AnExperimentationPlatformforSystemMonitoringandCross-Layer-Coordination-conference Proceedings of the 13th International Symposium on a World of Wireless, Mobile and MultimediaNetworks (WoWMoM'12), San Francisco, USA 2012 6 25 1--9 crawler fileadmin/papers/2012/2012-aktas-wowmom-crawler.pdf Online IEEE Proceedings of the 13th International Symposium on a World of Wireless, Mobile and MultimediaNetworks (WoWMoM'12), San Francisco, USA San Francisco 13th International Symposium on a World of Wireless, Mobile and MultimediaNetworks (WoWMoM'12) 25-28 June, 2012 en 978-1-4673-1238-7 10.1109/WoWMoM.2012.6263686 1 IsmetAktas FlorianSchmidt Muhammad HamadAlizai TobiasDrüner KlausWehrle article 2012-4-alizai-wild-ijdsn International Journal of Distributed Sensor Networks (IJDSN) 2012 4 2 wld fileadmin/papers/2012/2012-ijdsn-wld-alizai.pdf unpublished en 1550-1329 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle inproceedings 2012-aktas-simutools-FANTASY:FullyAutomaticNetworkEmulationArchitecturewithCross-LayerSupport-conference 2012 3 19 57-64 crawler, fantasy fileadmin/papers/2012/2012-aktas-simutools-fantasy.pdf http://dl.acm.org/citation.cfm?id=2263019&CFID=88550183&CFTOKEN=31687193 Online ICST

Brussels, Belgium

Proceedings of the 5th ACM International ICST Conference on Simulation Tools and Techniques (SIMUTools '12), Desenzano del Garda, Italy Desenzano, Italy 5th ACM International ICST Conference on Simulation Tools and Techniques (SIMUTools '12) 19-23 March, 2012 en 978-1-4503-1510-4 10.4108/icst.simutools.2012.247759 1 IsmetAktas Hendrikvom Lehn ChristophHabets FlorianSchmidt KlausWehrle inproceedings Punal12_Jamming 2012 83--92 ACM Proc. of the 9th ACM International Workshop on Vehicular Inter-Networking, Systems, and Applications (VANET'12) OscarPuñal AnaAguiar JamesGross inproceedings 2011-12-conext-schmidt-refector 2011 12 6 1--12 refector fileadmin/papers/2011/2011-schmidt-refector-conext.pdf Online ACM

New York, NY, USA

Proceedings of the 7th International Conference on emerging Networking EXperiments and Technologies (CoNEXT), Tokyo, Japan Tokyo, Japan 7th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) 6-9 December, 2011 en 978-1-4503-1041-3 10.1145/2079296.2079318 1 FlorianSchmidt Muhammad HamadAlizai IsmetAktas KlausWehrle inproceedings VaegsABW2011 2011 9 16 77-80 A tremendous amount of energy is wasted today, because computing devices are left running all the time even though they are needed only sporadically. Especially in office environments many devices (e.g., printers) are very rarely turned off, because they need to be available from time to time and because it is inconvenient having to switch them on and off manually. Existing solutions, such as Wake-on-LAN (WoL), provide support for managing the power consumption of the network devices remotely using an always-on data channel. However, these solutions are inefficient, because power to the network interface has to be maintained even when the host system is asleep just to ensure remote accessibility. We propose a Wireless Sensor Network (WSN) based out-of-band signaling architecture for network interfaces which minimizes the systems’ power consumption during the large idle periods when nobody is using them. This is done by separating the data and control channels on the Internet-enabled devices using a low-power out-of-band signaling channel based on battery driven, energy scavenging devices. Unlike existing solutions, which only allow parts of the system to go in sleep modes, our architecture allows the whole system, including the main power supply, to be shut down. Our initial investigation indicates a significant reduction in energy consumption of devices during idle times compared to the existing in-band signaling mechanisms such as WoL. Energy Saving, Wireless Sensor Network, Out-of-Band Signalling https://www.comsys.rwth-aachen.de/fileadmin/papers/2011/2011-vaegs-fgsn-ecocom.pdf Online Proceedings of the 10th GI/ITG KuVS Fachgespräch Drahtlose Sensornetze (FGSN), Paderborn, Germany RWTH Aachen University Paderborn, Germany 10th GI/ITG KuVS Fachgespräch Drahtlose Sensornetze (FGSN11) September 15-16, 2011 en 1 TobiasVaegs Muhammad HamadAlizai Jó AgilaBitsch Link KlausWehrle inproceedings 2011-wintech-alizai-tinywifi 2011 9 19-27 tinywifi fileadmin/papers/2011/2010-09-tinywifi-alizai-wintech.pdf Online ACM

New York, NY, USA

Proceedings of the Sixth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization (WiNTECH ), Las Vegas, NV, USA Las Vegas, NV, USA The 17th Annual International Conference on Mobile Computing and Networking September 2011 en 978-1-4503-0867-0 10.1145/2030718.2030725 1 Muhammad HamadAlizai HannoWirtz BernhardKirchen TobiasVaegs OmprakashGnawali KlausWehrle inproceedings 2011-iscc-alizai-ble 2011 6 fileadmin/papers/2011/2011-alizai-iscc-ble.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

16th IEEE Symposium on Computers and Communications (ISCC), Kerkyra, Greece Kerkyra, Greece en 978-1-4577-0678-3 10.1109/ISCC.2011.5983839 1 Muhammad HamadAlizai HannoWirtz GeorgKunz BenjaminGrap KlausWehrle inproceedings 2011-ipsn-alizai-pad 2011 4 fileadmin/papers/2011/2011-ipsn-alizai-pad.pdf Online ACM

New York, NY, USA

Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2011), Chicago, IL, USA Chicago, IL, USA en 978-1-60558-988-6 1 Muhammad HamadAlizai TobiasVaegs OlafLandsiedel StefanGötz Jó AgilaBitsch Link KlausWehrle inproceedings 2010-sensys-alizai-tinywifi 2010 11 429-430 We present TinyWifi, a nesC code base extending TinyOS to support Linux powered network nodes. It enables developers to build arbitrary TinyOS applications and protocols and execute them directly on Linux by compiling for the new TinyWifi platform. Using TinyWifi as a TinyOS platform, we expand the applicability and means of evaluation of wireless protocols originally designed for sensornets towards inherently similar Linux driven ad hoc and mesh networks. Received Best Poster Award fileadmin/papers/2010/2010-11-alizai-tinywifi-sensys.pdf http://portal.acm.org/citation.cfm?id=1870058&preflayout=flat 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 10.1145/1869983.1870058 1 Muhammad HamadAlizai BernhardKirchen Jó AgilaBitsch Link HannoWirtz KlausWehrle conference 2010-08-lcn-samad-ASSA 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 conference 2010-08-icccn-samad-PiCAT 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 inproceedings icc2010vpsim 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 201004vaegsieeestudentpad 2010 5 20 5-8 The lack of permanent network infrastructure and often unplanned deployments in many multihop wireless communication scenarios restrict nodes to determine their own addresses based on the underlying connectivity in the network. However, due to unreliable connectivity and rapidly changing link qualities in wireless networks, establishing uniform addressing and stable point-to-point routing is challenging. In this paper, we present Statistical Vector Routing (SVR), a virtual coordinates based addressing and routing mechanism that efficiently deals with dynamic communication links in wireless networks. It assigns stable probabilistic addresses to nodes without the need to pessimistically estimate links over longer periods of time. The routing metric predicts the current location of a node in its address distribution. Our prototype implementation over real testbeds indicates that SVR, when compared to current approaches, achieves 3 times more stable addressing, reduces the magnitude of change in addresses by 2-10 times, and minimizes the hop distance and transmissions in the network by 10-15%. wld https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-vaegs-wehrle-probabilistic_addressing.pdf Print Hamburg University of Technology

Hamburg, Germany

Proceedings of the 2nd IEEE Student Conference, Hamburg University of Technology, Hamburg, Germany Hamburg, Germany 2nd IEEE Student Conference, Hamburg University of Technology May 20-21, 2010 en TobiasVaegs Muhammad HamadAlizai KlausWehrle inproceedings 2010-ipsn-sasnauskas-kleenet 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 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 inbook 2010-aktas-modeling-application-traffic-bookchapter 2010 4 397-426 Springer 18 Modeling and Tools for Network Simulation 978-3-642-12330-6 IsmetAktas CemMengi ThomasKing inproceedings 2010-bitsch-link-iq2s-burrowview 2010 3 29 56 -- 61 For a long time, life sciences were restricted to look at animal habitats only post-factum. Pervasive computing puts us in the novel position to gain live views. In this paper we present BurrowView, an application that tracks the movement of rats in their natural habitat and reconstructs the underground tunnel system. To make reliable statements, special consideration has been taken with regard to the information quality. Our system is able to reconstruct paths up to a resolution of 20 cm, the length of a rat without its tail. RatPack fileadmin/papers/2010/2010-03-IQ2S-link-burrowview.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5470603 Online IEEE

New York City, NY, USA

Proceedings of the Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010), Mannheim, Germany IEEE Mannheim, Germany Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010) March 29 to April 2, 2010 en 978-1-4244-6605-4 10.1109/PERCOMW.2010.5470603 1 Jó AgilaBitsch Link GregorFabritius Muhammad HamadAlizai KlausWehrle inproceedings inproceedingsreference201001221179332027 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 inbook 2010-02-book-alizai-hardware-and-systems 2010 2 1 99-117 http://www.network-simulation.info/ http://www.amazon.com/Modeling-Tools-Network-Simulation-Wehrle/dp/3642123309 Print Springer LNCS Chapter 7 Modeling and Tools for Network Simulation EN 978-3-642-12330-6 Muhammad HamadAlizai LeiGao TorstenKempf OlafLandsiedel inproceedings inproceedingsreference201001227195395138 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 20105munawardynamictinyos 2010 1-6 Long-term deployments of sensor networks in physically inaccessible environments make remote re-programmability of sensor nodes a necessity. Ranging from full image replacement to virtual machines, a variety of mechanisms exist today to deploy new software or to fix bugs in deployed systems. However, TinyOS - the current state of the art sensor node operating system - is still limited to full image replacement as nodes execute a statically-linked system-image generated at compilation time. In this paper we introduce Dynamic TinyOS to enable the dynamic exchange of software components and thus incrementally update the operating system and its applications. The core idea is to preserve the modularity of TinyOS, i.e. its componentization, which is lost during the normal compilation process, and enable runtime composition of TinyOS components on the sensor node. The proposed solution integrates seamlessly into the system architecture of TinyOS: It does not require any changes to the programming model of TinyOS and existing components can be reused transparently. Our evaluation shows that Dynamic TinyOS incurs a low performance overhead while keeping a smaller - upto one third - memory footprint than other comparable solutions. fileadmin/papers/2010/2010-05-icc-munawar-DynamicTinyOS.pdf Online IEEE Proceedings of the IEEE International Conference on Communications (ICC), Cape Town, South Africa en 978-1-4244-6402-9 1550-3607 1 WaqaasMunawar Muhammad HamadAlizai OlafLandsiedel KlausWehrle inproceedings 2010-ARCS-alizai-promotingpower 2010 387-392 Accurate prediction of energy consumption early in the design process is essential to efficiently optimize algorithms and protocols. However, despite energy efficiency gathering significant attention in networking research, limited effort has been invested in providing requisite evaluation tools and models. Hence, developers demand powerful evaluation tools to assist them in comparing new communication paradigms in terms of energy efficiency, and minimizing the energy requirements of algorithms. In this paper, we argue for promoting energy to a first class metric in network simulations. We explore the challenges involved in modelling energy in network simulations and present a detailed analysis of different modelling techniques. Finally, we discuss their applicability in high-level network simulations. fileadmin/papers/2010/2010-2-ARCS-alizai-promoting-power.pdf Print VDE-VERLAG

Berlin, Germany

Proceedings of the Workshop on Energy Aware Systems and Methods, in conjunction with GI/ITG ARCS 2010 Hannover, Feb. 21-23 en 978-3-8007-3222-7 1 Muhammad HamadAlizai GeorgKunz OlafLandsiedel KlausWehrle inproceedings 2009-sensys-alizai-burstytraffic 2009 11 71-84 wld fileadmin/papers/2009/2009-alizai-sensys-bre.pdf ACM

New York, NY, USA

Proceeding of 7th ACM Conference on Embedded Networked Sensor Systems (Sensys 09), Berkeley, CA, USA Berkley, California Sensys 09 November 2009 en 978-1-60558-519-2 1 Muhammad HamadAlizai OlafLandsiedel Jó AgilaBitsch Link StefanGötz KlausWehrle conference 2009-q2swinet-samad-REALISM ACM International Symposium on QoS and Security for Wireless and Mobile Networks 2009 10 26 97-102 Online ACM New York, NY, USA The 5th ACM International Symposium on QoS and Security for Wireless and Mobile Networks (Q2SWinet 2009), Tenerife, The Canary Islands, Spain Tenerife, The Canary Islands, Spain ACM International Symposium on QoS and Security for Wireless and Mobile Networks 26-30 October, 2009 en 978-1-60558-619-9 FahadSamad SadeqAli Makram conference 2009-ngmast-samad-pcwmn 2009 9 15 1 487-493 IEEE Misc IEEE NGMAST 2009 Cardiff, U.K. International Conference and Exhibition on Next Generation Mobil Applications, Services and Technologies en 978-0-7695-3786-3 FahadSamad SadeqAli Makram techreport 200908munawarfgsndynamictinyos 2009 9 9-12 fileadmin/papers/2009/2009-08-munawar-fgsn-dynamic-tinyos.pdf http://doku.b.tu-harburg.de/volltexte/2009/581/pdf/proceedings.pdf Print Technical University Hamburg

Technical University Hamburg

Proceedings of the 8th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Hamburg, Germany Technical University Hamburg en WaqaasMunawar OlafLandsiedel Muhammad HamadAlizai KlausWehrle techreport 200908alizaifgsnburstyrouting 2009 9 63-66 Accurate estimation of link quality is the key to enable efficient routing in wireless sensor networks. Current link estimators focus mainly on identifying long-term stable links for routing, leaving out a potentiality large set of intermediate links offering significant routing progress. Fine-grained analysis of link qualities reveals that such intermediate links are bursty, i.e., stable in the short term. In this paper, we use short-term estimation of wireless links to accurately identify short-term stable periods of transmission on bursty links. Our approach allows a routing protocol to forward packets over bursty links if they offer better routing progress than long-term stable links. We integrate a Short Term Link Estimator and its associated routing strategy with a standard routing protocol for sensor networks. Our evaluation reveals an average of 22% reduction in the overall transmissions when routing over long-range bursty links. Our approach is not tied to any special routing protocol and integrates seamlessly with existing routing protocols and link estimators. wld fileadmin/papers/2009/2009-08-alizai-fgsn-bursty-routing.pdf doku.b.tu-harburg.de/volltexte/2009/581/pdf/proceedings.pdf Print Technical University Hamburg

Technical University Hamburg

Proceedings of the 8th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Hamburg, Germany en 1 Muhammad HamadAlizai OlafLandsiedel Jó AgilaBitsch Link StefanGötz KlausWehrle proceedings 2009-aktas-maple-ModeldrivenSupportforSourceCodeVariabilityinAutomotiveSoftwareEngineering-Workshop 2009 8 44-51 Variability on source code level in automotive soft- ware engineering is handled by C/C++ preprocessing directives. It provides fine-grained definition of variation points, but brings highly complex structures into the source code. The software gets more difficult to understand, to maintain and to integrate changes. Current approaches for modeling and managing vari- ability on source code do not consider the specific requirements of the automotive domain. To close this gap, we propose a model- driven approach to support software engineers in handling source code variability and configuration of software variants. For this purpose, a variability model is developed that is linked with the source code. Using this approach, a software engineer can shift work steps to the variability model in order to model and manage variation points and implement their variants in the source code. automotive software engineering; programming; model-driven engineering; variability modeling; Online CEUR 1st International Workshop on Model-driven Approaches in Software Product Line Engineering (MAPLE), San Francisco, CA, USA 1613-0073 1 CemMengi ChristianFuß RubenZimmermann IsmetAktas conference 2009-iscc-samad-NNCQ 2009 7 5 763-769 Online IEEE IEEE Symposium on Computers and Communications (ISCC 2009), Sousse, Tunisia Sousse, Tunisia IEEE Symposium on Computers and Communications en 978-1-4244-4671-1 SadeqAli Makram FahadSamad MesutGuenes article 2009AlizaiPIKtimingenergy PIK Journal, Special Issue on Energy Aware Systems 2009 2 32 2 127-132 fileadmin/papers/2009/2009-2-alizai-modeling-energy.pdf Print en 0930-5157 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle conference 2008-ntms-samad-RFID 2008 11 5 1-5 Online IEEE 2nd International Conference on New Technologies, Mobility, and Security (NTMS 2008), Tangier, Morocco Tangier, Morocco International Conference on New Technologies, Mobility and Security 5-7 Nov. 2008 en 978-2-9532443-0-4 FahadSamad SadeqAli Makram inproceedings 2008-sensys-sasnauskas-kleenet 2008 11 425--426 We present KleeNet, a Klee based bug hunting tool for sensor network applications before deployment. KleeNet automatically tests code for all possible inputs, ensures memory safety, and integrates well into TinyOS based application development life cycle, making it easy for developers to test their applications. bug finding, memory safety, tinyos, type safety kleenet fileadmin/papers/2008/2008-11-Sasnauskas-SenSys08-KleeNet.pdf Print ACM

New York, NY, USA

Proceedings of the 6th ACM conference on Embedded network sensor systems (SenSys'08), Raleigh, NC, USA en 978-1-59593-990-6 http://doi.acm.org/10.1145/1460412.1460485 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle techreport 2008-fgsn-sasnauskas-kleenet 2008 9 Testing sensor network applications is an essential and a difficult task. Due to their distributed and faulty nature, severe resource constraints, unobservable interactions, and limited human interaction, sensor networks, make monitoring and debugging of applications strenuous and more challenging. In this paper we present KleeNet - a Klee based platform independent bug hunting tool for sensor network applications before deployment - which can automatically test applications for all possible inputs, and hence, ensures memory safety for TinyOS based applications. Upon finding a bug, KleeNet generates a concrete test case with real input values identifying a specific error path in a program. Additionally, we show that KleeNet integrates well into TinyOS application development life cycle with minimum manual effort, making it easy for developers to test their applications. kleenet fileadmin/papers/2008/2008-09-Sasnauskas-FGSN08-BugHunting.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Freie Universität Berlin, Institute of Computer Science

Berlin, Germany

Proceedings of the 7th GI/ITG Fachgespraech Wireless Sensor Networks, Berlin, Germany Chair of Communication and Distributed Systems (ComSys) en 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle techreport 2008-fgsn-alizai-stle 2008 7 27-30 wld fileadmin/papers/2008/2008-08-alizai-fgsn-stle.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Fachbereich Mathematik und Informatik

Berlin, Germany

Proceedings of the 7th GI/ITG Workshop on Wireless Sensor Networks FGSN 08 September 2010 en 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle AlexanderBecher inbook 2008-thissen-LNCS-multimedia 2008 268-299 Print M. Nagl, W. Marquardt Springer Lecture Notes in Computer Science 4970 Collaborative and Distributed Chemical Engineering, From Understanding to Substantial Design Process Support en 978-3-540-70551-2 AndréSchüppen OttoSpaniol DirkThißen IngoAssenmacher EdmundHaberstroh ThorstenKuhlen inproceedings 200804landsiedelIPSN08TimingMatters 2008 344-354 The rising complexity of data processing algorithms in sensor networks combined with their severely limited computing power necessitates an in-depth understanding of their temporal behavior. However, today only cycle accurate emulation and test-beds provide a detailed and accurate insight into the temporal behavior of sensor networks. In this paper we introduce fine grained, automated instrumentation of simulation models with cycle counts derived from sensor nodes and application binaries to provide detailed timing information. The presented approach bridges the gap between scalable but abstracting simulation and cycle accurate emulation for sensor network evaluation. By mapping device-specific code with simulation models, we can derive the time and duration a certain code line takes to get executed on a sensor node. Hence, eliminating the need to use expensive instruction-level emulators with limited speed and restricted scalability. Furthermore, the proposed design is not bound to a specific hardware platform, a major advantage compared to existing emulators. Our evaluation shows that the proposed technique achieves a timing accuracy of 99% compared to emulation while adding only a small overhead. Concluding, it combines essential properties like accuracy, speed and scalability on a single simulation platform. fileadmin/papers/2008/2008-04-IPSN-2008-landsiedel-Timing-Matters.pdf Print IEEE Computer Society

Washington, DC, USA

Proceedings of the 7th ACM International Conference on Information Processing in Sensor Networks (IPSN 2008), St. Louis, MO, USA en 978-0-7695-3157-1 1 OlafLandsiedel Muhammad HamadAlizai KlausWehrle techreport 2007-fgsn-alizai-timetossim 2007 7 fileadmin/papers/2008/2007-07-fgsn-alizai-accurate-timing.pdf https://www.ds-group.info/events/fgsn07/fgsn07proc.pdf Print RWTH Aachen

Aachen, Germany

Proceedings of the 6th GI/ITG KuVS Workshop on Wireless Sensor Networks (FGSN 07) RWTH Aachen Aachen, Germany FGSN 07 July 2007 en Muhammad HamadAlizai OlafLandsiedel KlausWehrle conference 2007-aktas-VTC-ApplicabilityofaMulti-ModeMACProtocol-Conference 2007 4 22 969 - 973 Vehicular Technology Conference, 2007. VTC2007-Spring. IEEE 65th ArifOtyakmaz IsmetAktas MarcSchinnenburg RalfPabst conference 2007-aktas-WCNC2007-AMulti-ModeMACProtocolwithRelaySupport-Conference 2007 3 11 328 - 333 Future mobile radio networks will have the requirement of very high data rates. Typical wireless data communication will not only occur in short range scenarios like hotspots in airports, city centres, exhibition halls, etc., but also in wide area environments, e.g. a moving car in a rural environment. Data services will require a ubiquitous mobile radio system and demand better quality of service, like high data rates and low delays. Two promising concepts for future mobile radio communication are the deployment of relays and the ability to adapt to various deployment strategies by using different radio access technologies, i.e. modes with a common technology basis. The former concept allows enlarging the cell coverage. Relays are not wired connected and consequently a cost-efficient alternative to base stations that work in a decode-and-forward principle. The latter concept provides modes that are tailored solutions for specific environments and thus allow the adaptation to various scenarios by selecting the most adequate one. The aim of this work is to merge the advantages taken from both concepts to one solution. Wireless Communications and Networking Conference, 2007. WCNC 2007 ArifOtyakmaz IsmetAktas MarcSchinnenburg RalfPabst