Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Zero-configuration networking wikipedia , lookup
Computer network wikipedia , lookup
Recursive InterNetwork Architecture (RINA) wikipedia , lookup
Distributed firewall wikipedia , lookup
Policies promoting wireless broadband in the United States wikipedia , lookup
Distributed operating system wikipedia , lookup
Airborne Networking wikipedia , lookup
Cracking of wireless networks wikipedia , lookup
Wireless security wikipedia , lookup
Theodoros Salonidis Electrical and Computer Engineering Dept. Rice University 2026 Duncan Hall MS-380 Houston, TX 77005, USA Phone: + 1 (713) 348-2899 Fax: +1 (713) 348-5787 E-mail: [email protected] http://www.ece.rice.edu/~thsalon RESEARCH INTERESTS • Protocols and performance evaluation of wireless networks • Routing and resource allocation in mobile ad hoc & sensor networks • Network Quality of Service (QoS) & congestion control • Distributed algorithms for self-organizing networks EDUCATION Ph.D., Electrical and Computer Engineering University of Maryland, College Park, Maryland Thesis: Distributed topology organization and transmission scheduling in wireless ad hoc networks September 2004 M.S., Electrical and Computer Engineering University of Maryland, College Park, Maryland Thesis: Scalable route caching methods in networks with many mobile nodes May 1999 Diploma (B.Eng.), Electronic and Computer Engineering Technical University of Crete, Greece Thesis: Robust speech recognition for multiple topological scenarios of the GSM mobile phone system July 1997 WORK/RESEARCH EXPERIENCE Post-doctoral Research Associate Rice University, Houston, Texas September 2004 - present – Work on resource provisioning and congestion control/medium access protocols for wireless mesh networks. – Introduced a model to accurately predict imbalances in bandwidth distribution induced by CSMA-based distributed random access protocols in wireless networks of arbitrary topology. Research Assistant Institute of Systems Research, University of Maryland, College Park June 1999 - August 2004 – Developed cooperative caching schemes that minimize flooding cost due to route discovery in large memory-limited ad hoc networks, as part of the M.S. thesis. – Developed a distributed scheduling framework for quality of service and fairness guarantees in dynamic wireless ad hoc networks, as part of the Ph.D. dissertation. – Introduced a model for estimating bandwidth loss in TDMA ad hoc networks that do not support global slot synchronization and developed scheduling algorithms for minimization of the associated overhead, as part of the Ph.D. dissertation. Research Intern IBM T.J. Watson Research Center, New York June 1999 - August 2000 – Designed and implemented distributed protocols for link establishment and topology organization of Bluetooth wireless ad hoc networks. Research results led to an IBM International patent. – Developed fast link-level handoff techniques for infrastructure-based Bluetooth networks. Undergraduate Research Assistant Multimedia Systems Institute of Crete, Chania, Greece 1993 - 1996 – Worked on European Union R&D projects related to database management and virtual reality user interfaces. HONORS/AWARDS Research Excellence Award, Hellenic Ministry of Defense Research/Teaching Assistantship, University of Maryland, College Park Academic performance distinction monetary award, Foundation of Greek Government Scholarships (IKY) 2005 1997 - 2004 1993, 1996, 1997 Academic excellence award, Technical University of Crete, Chania, Greece 1997 Fulbright Scholarship, Fulbright Institute (declined) 1997 TEACHING EXPERIENCE Guest Lecturer Electrical and Computer Engineering Department, Rice University ELEC 437: Introduction to Communication Networks (Undergraduate, Senior-level) Gave lectures on special topics in wireless networks. ELEC 537: Design and Control of Computer Networks (Graduate level) Gave lectures on special topics in wireless networks. Graduate Teaching Assistant Electrical Engineering Department, University of Maryland, College Park 2004 - present Fall 2005 Fall 2004 1997 - 2004 ENEE 322H: Signals and Systems (Honors Undergraduate, Junior-level) Spring 2004 Prepared and teaching weekly recitations, homework/exam grading and design of programming projects in MATLAB. ENEE 620: Random Processes in Communications and Control (Graduate level) Fall 2003 Prepared and taught weekly recitations with complementary, out-of-textbook material; graded homework sets. ENEE 324: Engineering Probability (Undergraduate, Junior-level) Spring 1998, Fall 1998 Prepared and taught biweekly recitations (25 students per section). Also graded exercise sets and exams. ENEE 302: Analog Electronic Circuits (Undergraduate, Junior-level) Fall 1997, Spring 1998 Prepared and taught biweekly recitations (20 students per section), answered students’ questions, graded homework sets, quizzes and exams, and led quiz reviews. ENEE 449: Modern Digital System Design Laboratory (Undergraduate, Senior-level) Fall 1997 Developed, assigned, and graded lab projects related to the implementation of digital systems using hardware languages. PROFESSIONAL ACTIVITIES/MEMBERSHIPS Technical Program Committee (TPC) Member, International Conference on Wired/Wireless Internet Communications (WWIC) 2005 and 2006, IEEE Vehicular Technology Conference (VTC) 2005, International Conference on Parallel and Distributed Systems (ICPADS) 2006. Referee, IEEE Journal Selected Areas in Communications (JSAC), IEEE Transactions on Networking (TON), IEEE Transactions on Mobile Computing, IEEE Transactions in Wireless Communications, Journal of Wireless Networks (WINET), IEEE INFOCOM 1999-2006, ACM MOBICOM 1999-2005, ACM MOBIHOC 2000-2005, ACM SIGMETRICS 2000-2002 Student Member, ACM and the IEEE Communications Society Member, Technical Chamber of Greece Member, Electrical and Computer Engineering Graduate Student Association (ECEGSA), University of Maryland, College Park Alumni member, B.E.S.T. (Board of European Students of Technology) President, Hellenic Students Association, University of Maryland, College Park (1999-2000) LANGUAGES Greek (native), English (fluent), French (good), Portuguese (moderate) SKILLS Software: Unix/Linux, DOS/Windows, x86/8051 Assembly, C/C++, Java, Fortran, Pascal, TCL, Visual Basic, Asymetrix Multimedia Toolbook Hardware: MAGIC, VHDL, Verilog HDL, SFL (an HDL from Japan) Modeling and Simulation Tools: NS, OPNET, MATLAB, IRSIM, PSPICE Protocols: TCP/IP, MobileIP, MANET IP routing (DSR, AODV, TORA, etc) Wireless standards: GSM, IS-54/136, IS-95, 802.11, Bluetooth, HIPERLAN/1 & /2 PATENTS Theodoros Salonidis and Leandros Tassiulas, “A distributed bandwidth allocation and transmission coordination method for Quality of Service provision in wireless ad hoc networks”, patent pending. Theodoros Salonidis, Pravin Bhagwat, Richard LaMaire, “Method and apparatus for connecting devices via an ad hoc wireless communication network”, IBM International Patent, US patent 6,865,371. PUBLICATIONS Refereed publications Michele Garetto, Theodoros Salonidis, and Edward Knightly, "Modeling Per-flow Throughput and Capturing Starvation in CSMA Multi-hop Wireless Networks," Proceedings of IEEE INFOCOM 2006, Barcelona, Spain. Theodoros Salonidis and Leandros Tassiulas, “Distributed Dynamic Scheduling For End-to-end Rate Guarantees in Wireless Ad hoc Networks”, Proceedings of ACM MOBIHOC 2005, Urbana-Champaign, IL, USA. Theodoros Salonidis, Pravin Bhagwat, Leandros Tassiulas and Richard LaMaire, “Distributed Topology Construction of Bluetooth Wireless Personal Area Networks”, Proceedings of IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Wireless Ad Hoc Networks, March 2005. Theodoros Salonidis and Leandros Tassiulas, “Asynchronous TDMA ad hoc networks: Scheduling and Performance”, Proceedings of European Transactions in Telecommunications (ETT), Spring 2004 (Invited paper). Theodoros Salonidis and Leandros Tassiulas, “Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks”, Proceedings of IEEE IWQoS 2004, Montreal, Canada. Theodoros Salonidis and Leandros Tassiulas, “On optimal cooperative route caching in large, memory limited wireless ad hoc networks”, Proceedings of International Conference on Computer Communications (ICC) 2004, Paris, France. Theodoros Salonidis and Leandros Tassiulas, “Performance issues of Bluetooth scatternets and other asynchronous TDMA ad hoc networks”, Proceeedings of 8th International Workshop in Mobile Multimedia Communications (MoMuC) 2003, Munich, Germany. Theodoros Salonidis, Pravin Bhagwat, Leandros Tassiulas, Richard LaMaire, “Distributed Topology Construction of Bluetooth Personal Area Networks”, Proceedings of IEEE INFOCOM 2001, Anchorage, AK. Theodoros Salonidis, Pravin Bhagwat, Leandros Tassiulas, “Proximity Awareness and fast connection establishment in Bluetooth”, Proceedings of ACM MOBIHOC 2000, Boston, MA. Theodoros Salonidis and Vassilios Digalakis, “Robust speech recognition for multiple topological scenarios of the GSM mobile phone system.”, Proceedings of the International Conference in Acoustics and Signal Processing (ICASSP) 1998, Seattle, WA. Dissertations Theodoros Salonidis, “Distributed topology organization and transmission scheduling in wireless ad hoc networks.”, Ph.D. Dissertation. Theodoros Salonidis, “Scalable Route Caching Methods in Networks with many mobile nodes”, Master’s Thesis, University of Maryland, College Park, May 1999. Theodoros Salonidis, “Robust speech Recognition for multiple topological scenarios of the GSM mobile phone system”, Diploma Thesis, Technical University of Crete, July 1997. Technical reports Theodoros Salonidis and Leandros Tassiulas, “Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks”, Technical Report TR 2004-7, Institute of Systems Research, University of Maryland, 2004. Theodoros Salonidis and Leandros Tassiulas, “Asynchronous TDMA ad hoc networks: Scheduling and Performance”, Technical Report TR 2002-52, Institute of Systems Research, University of Maryland, 2002. Theodoros Salonidis and Leandros Tassiulas, “Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks”, Technical Report TR 2002-24, Institute of Systems Research, University of Maryland, 2002. Theodoros Salonidis, Leandros Tassiulas, Chatschik Bisdikian, Mahmoud Naghsineh: “BlueRoam: Supporting seamless mobility in Bluetooth”, IBM Technical Report, September 2000. Theodoros Salonidis, Pravin Bhagwat, Leandros Tassiulas, Richard LaMaire: “Proximity Awareness and Ad Hoc Network Establishment in Bluetooth”, Technical Report TR 2001-10, Institute of Systems Research, University of Maryland, 2001. PRESENTATIONS “Starvation in CSMA-based mesh networks”, Microsoft Research, Cambridge, September 2005. “Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks”, ACM MOBIHOC, UrbanaChampaign, IL, USA, May 2005. “On optimal cooperative route caching in large, memory-limited wireless ad hoc networks”, IEEE ICC, Paris, France, June 2004. “Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks”, IEEE IWQoS, Montreal, Canada, June 2004. ”Distributed transmission scheduling in wireless ad hoc networks”, NEC Research Labs, February 2004. “Distributed topology organization and resource allocation in wireless ad hoc networks”, MIT, November 2003. “Distributed topology organization and resource allocation in wireless ad hoc networks”, Qualcomm Inc., August 2003. “Distributed Topology Construction of Bluetooth Personal Area Networks”, IEEE INFOCOM, Anchorage, AK, 2001. CITATIONS • Google Scholar (300 citations) • CiteSeer (91 citations) • ISI Web of Science (37 journal citations) RESEARCH/PROJECT SUMMARY Electrical and Computer Engineering Department, Rice University • Starvation in CSMA-Based Multi-Hop Wireless Networks: Model and Solutions 2005-present Multi-hop wireless networks employing random access protocols have been shown to incur large discrepancies in the throughputs achieved by the flows sharing the network. Demonstrated that the fundamental cause of this disparity is not merely differences in the number of contending neighbors but a generic coordination problem of CSMA-based random access in a multi-hop environment. Developed a new analytical model that incorporates this lack of coordination, identifies dominating and starving flows, and accurately predicts the throughputs for all flows in a large-scale network. Also, in addition to traditional performance measures such as total utility, utilized measures from economics that evaluates a society’s wealth distribution, to evaluate the network’s throughput distribution and distinguish starvation effects due to lack of coordination from inherent throughput imbalances due to differences in the number of contending neighbors. Institute of Systems Research, University of Maryland Ph.D. Dissertation Advisor: Prof. Leandros Tassiulas 2001-2004 • Link-level QoS provision in wireless ad hoc networks Introduced a novel fully distributed TDMA protocol for QoS provisioning in an ad hoc network. The protocol provides perfectly coordinated access and incrementally modifies the network TDMA schedule on-line, targeting for a desired set of link rates in the network (the QoS objective). Emphasis is placed on max-min fairness but the technique can also be applied to more general objectives. The incremental approach allows for adaptation to changes in network topology or traffic requirements. The protocol uses only one-hop information and has very low communication overhead for maintaining conflict-free transmissions in the network. It is also free of the usual restrictive implementation assumptions of TDMA approaches: it does not require any a-priori knowledge on the number of users in the network nor even network-wide slot synchronization. • Asynchronous TDMA ad hoc networks: Scheduling and performance A common assumption of TDMA-based ad hoc networks is the existence of network-wide slot synchronization. However, in practice, such a mechanism is difficult to support. In asynchronous TDMA systems, the hardware clocks of the nodes are not synchronized; rather, each link uses a different local time slot reference provided by the clock tick of a node endpoint. First introduced a framework of conflict-free scheduling and bandwidth allocation for such systems. Inevitably, slots will be wasted when nodes switch time slot references. This restricts the rate allocations that can be supported had the ad hoc network been perfectly synchronized. Showed that the performance degradation due to lack of synchronization can be significant and proposed scheduling algorithms for overhead minimization that also have guaranteed upper bounds on the generated overhead. Master’s Thesis Advisor: Prof. Leandros Tassiulas 1998-1999 • Route caching in memory-constrained ad hoc networks Introduced and addressed the problem of route caching in very large ad hoc networks with memory limited nodes. In this setting, a node cannot cache the entire network and uses flooding to discover routing information for non-cached destinations. To constrain flooding, the network used a cooperative caching model where every node provides its cache contents to others when they flood. This led to a resource allocation and optimization problem where nodes allocate caches subject to the cache sizes in order to minimize the overall network flooding cost. Extensive simulations on large topologies demonstrated the effectiveness and scalability of the proposed schemes. IBM T.J. Watson Research Center • Distributed Topology construction of Bluetooth ad hoc networks 1999-2000 Investigated link establishment and topology construction in ad hoc networks where multiple channels are available and defined by distinct frequency hopping sequences. Multi-channel systems can increase throughput by assigning simultaneous co-located transmissions to different channels. However, hosts must first synchronize their frequency hopping and transmission/reception patterns before any communication channel can be established. Due to this lack of initial synchronization, neighborhood discovery and distributed network formation become both non-trivial and time- consuming processes. These general issues were addressed in the context of Bluetooth technology. First devised a symmetric technique where two Bluetooth nodes use a randomized schedule to synchronize and form a link in minimum time. This method forms the basis of distributed topology construction methods that start with a set of non-synchronized nodes and attempt to form a multi-channel network, satisfying certain connectivity or throughput requirements. • BlueRoam: Supporting seamless mobility in Bluetooth 2000 The BlueRoam project involved the design of an infrastructure-based wireless network where base stations and mobile units are equipped with Bluetooth transceivers. In similar networks implemented by the WLAN (802.11) technology, base stations and mobiles use a single broadcast channel for data transmissions and exchange of control information. This facilitates mobile host registration, mobility tracking, and hand-off mechanisms. These network control functions become tedious for Bluetooth because, as a technology, it uses multiple non-broadcast channels for communication and device discovery. Designed coordination techniques for fast link-layer hand-off that enabled seamless connectivity for Bluetooth-enabled mobile hosts. Technical University of Crete • Robust speech Recognition for GSM Advisor: Prof. Vassilios Digalakis 1997 In the undergraduate thesis, studied the impact of GSM voice coder degradation to the accuracy of a speech recognizer operating at the receiving end. It was shown that the approach of directly adapting the model parameters of the recognizer to the incoming noisy samples (speaker adaptation) is superior to the one of first passing the noisy samples through a trained mapping algorithm and then recognizing the estimated clean samples (Probabilistic Optimum Filtering technique). Multimedia Systems Institute of Crete (M.U.S.I.C.) • Panoramic views 1995 This project entailed navigation in 3-D scenes. The idea was to use a “Panoramic Camera” rotating about itself, shooting multiple photos of the scene. Using special filters for smoothing the photos’ abrupt changes, the illusion of video could be created for a user at a very low storage cost. Tasks included the development of a software tool for maintaining the photos in a database, an interactive tool for creating ”Panoramic Sites”, and a tool for navigating in a previously created Panoramic Site. SELECTED COURSE PROJECTS • Distributed system for stock market applications, University of Maryland Spring 1999 ENEE647–Distributed Systems: developed a distributed system for the provision of data consistency and fault tolerance among stock exchange servers (SESs) sharing massive stock market data. In such applications, quotes are independently generated at the SESs and require delivery to the clients of all SESs in absolute time order. Using BSD UNIX TCP/IP sockets and multi-threading, designed and implemented a distributed group communication protocol that satisfied this hard consistency constraint and a distributed fault-tolerance protocol that ensured smooth system operation in the presence of server crashes. System performed excellent on data traces of real-life stock quotes. • A 10-ns full-custom pipelined binary multiplier, University of Maryland Fall 1997 ENEE640–VLSI Architecture: developed a circuit realizing a fast algorithm that multiplies two binary numbers using redundant binary representation. The full-custom circuit was designed using the MAGIC layout tool and fabricated for 2.0µ technology. It runs at a maximum clock rate of 100MHz. REFERENCES Available upon request