This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-19 Creation time: 17-11-56 --- Number of references 7 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 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 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 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 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 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 inproceedings 2008-becher-hotemnets-linkestimation 2008 6 3 1--5 Commonly, routing in sensor networks is limited to longterm stable links. Unstable links, although often promising to be of large routing progress, are not considered for packet forwarding as link estimators typically cannot handle their dynamics. In this paper we introduce short-term link estimation to capture link dynamics at a high resolution in time and to identify when these render a link temporarily reliable or unreliable. We identify such dynamics based on packet overhearing, predict short-term availability and unavailability, and adapt neighbor tables, thereby enlarging the set of links useable by any routing algorithm. Additionally, we show that short-term link estimation integrates seamlessly into today's sensor network link estimators and routing protocols. wld fileadmin/papers/2008/2008-becher-hotemnets-linkestimation.pdf Online ACM Press

New York, NY, USA

Proceedings of Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08), Charlottesville, VA, USA Chalottesville, USA Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08) June 2-3, 2008 en 978-1-60558-209-2 1 AlexanderBecher OlafLandsiedel GeorgKunz KlausWehrle