% 
% This file was created by the TYPO3 extension
% bib
% --- Timezone: CEST
% Creation date: 2024-04-25
% Creation time: 22-56-12
% --- Number of references
% 7
% 

@Article { 2012-4-alizai-wild-ijdsn,
   title = {Exploiting the Burstiness of Intermediate Quality Wireless Links},
   journal = {International Journal of Distributed Sensor Networks (IJDSN)},
   year = {2012},
   month = {4},
   day = {2},
   tags = {wld},
   url = {fileadmin/papers/2012/2012-ijdsn-wld-alizai.pdf},
   state = {unpublished},
   language = {en},
   ISSN = {1550-1329},
   reviewed = {1},
   author = {Alizai, Muhammad Hamad and Landsiedel, Olaf and Wehrle, Klaus}
}

@Inproceedings { 201004vaegsieeestudentpad,
   title = {Probabilistic Addressing in Wireless Networks},
   year = {2010},
   month = {5},
   day = {20},
   pages = {5-8},
   abstract = {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\%.},
   tags = {wld},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-vaegs-wehrle-probabilistic_addressing.pdf},
   misc2 = {Print},
   publisher = {Hamburg University of Technology},
   address = {Hamburg, Germany},
   booktitle = {Proceedings of the 2nd IEEE Student Conference, Hamburg University of Technology, Hamburg, Germany},
   event_place = {Hamburg, Germany},
   event_name = {2nd IEEE Student Conference, Hamburg University of Technology},
   event_date = {May 20-21, 2010},
   language = {en},
   author = {Vaegs, Tobias and Alizai, Muhammad Hamad and Wehrle, Klaus}
}

@Inproceedings { 20104-IPSN-alizai-svr,
   title = {Poster Abstract: Statistical Vector based Point-to-Point Routing in Wireless Networks},
   year = {2010},
   month = {4},
   day = {12},
   pages = {366-367},
   abstract = {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.},
   tags = {wld},
   url = {https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf},
   web_url = {http://portal.acm.org/citation.cfm?id=1791257},
   misc2 = {Print},
   publisher = {ACM},
   address = {New York, NY, USA},
   booktitle = {Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden},
   event_place = {Stockholm, Sweden},
   event_name = {9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010)},
   event_date = {April 12-16, 2010},
   language = {en},
   ISBN = {978-1-60558-988-6},
   reviewed = {1},
   author = {Alizai, Muhammad Hamad and Vaegs, Tobias and Landsiedel, Olaf and Sasnauskas, Raimondas and Wehrle, Klaus}
}

@Inproceedings { 2009-sensys-alizai-burstytraffic,
   title = {Bursty Traffic over Bursty Links},
   year = {2009},
   month = {11},
   pages = {71-84},
   tags = {wld},
   url = {fileadmin/papers/2009/2009-alizai-sensys-bre.pdf},
   publisher = {ACM},
   address = {New York, NY, USA},
   booktitle = {Proceeding of 7th ACM Conference on Embedded Networked Sensor Systems (Sensys 09), Berkeley, CA, USA},
   event_place = {Berkley, California},
   event_name = {Sensys 09},
   event_date = {November 2009},
   language = {en},
   ISBN = {978-1-60558-519-2},
   reviewed = {1},
   author = {Alizai, Muhammad Hamad and Landsiedel, Olaf and Bitsch Link, J{\'o} Agila and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Techreport { 200908alizaifgsnburstyrouting,
   title = {Routing Over Bursty Wireless Links},
   year = {2009},
   month = {9},
   pages = {63-66},
   abstract = {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.},
   tags = {wld},
   url = {fileadmin/papers/2009/2009-08-alizai-fgsn-bursty-routing.pdf},
   web_url = {doku.b.tu-harburg.de/volltexte/2009/581/pdf/proceedings.pdf},
   misc2 = {Print},
   publisher = {Technical University Hamburg},
   address = {Technical University Hamburg},
   booktitle = {Proceedings of the 8th GI/ITG KuVS Fachgespr{\"a}ch ''Wireless Sensor Networks'', Hamburg, Germany},
   language = {en},
   reviewed = {1},
   author = {Alizai, Muhammad Hamad and Landsiedel, Olaf and Bitsch Link, J{\'o} Agila and G{\"o}tz, Stefan and Wehrle, Klaus}
}

@Techreport { 2008-fgsn-alizai-stle,
   title = {Challenges in Short-term Wireless Link Quality Estimation},
   year = {2008},
   month = {7},
   pages = {27-30},
   tags = {wld},
   url = {fileadmin/papers/2008/2008-08-alizai-fgsn-stle.pdf},
   web_url = {ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf},
   misc2 = {Print},
   publisher = {Fachbereich Mathematik und Informatik},
   address = {Berlin, Germany},
   booktitle = {Proceedings of the 7th GI/ITG Workshop on Wireless Sensor Networks},
   event_name = {FGSN 08},
   event_date = {September 2010},
   language = {en},
   reviewed = {1},
   author = {Alizai, Muhammad Hamad and Landsiedel, Olaf and Wehrle, Klaus and Becher, Alexander}
}

@Inproceedings { 2008-becher-hotemnets-linkestimation,
   title = {Towards Short-Term Wireless Link Quality Estimation},
   year = {2008},
   month = {6},
   day = {3},
   pages = {1--5},
   abstract = {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.},
   tags = {wld},
   url = {fileadmin/papers/2008/2008-becher-hotemnets-linkestimation.pdf},
   misc2 = {Online},
   publisher = {ACM Press},
   address = {New York, NY, USA},
   booktitle = {Proceedings of Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08), Charlottesville, VA, USA},
   event_place = {Chalottesville, USA},
   event_name = {Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08)},
   event_date = {June 2-3, 2008},
   language = {en},
   ISBN = {978-1-60558-209-2},
   reviewed = {1},
   author = {Becher, Alexander and Landsiedel, Olaf and Kunz, Georg and Wehrle, Klaus}
}