University of Ottawa
800 King Edward
Ottawa, Ontario K1N6N5
DVP term expires December 2012
Ivan Stojmenovic received his Ph.D. degree in mathematics in 1985. He held regular or visiting positions in Serbia (Institute of Mathematics, University of Novi Sad, 1980-1987), Japan (Electrotechnical Laboratory, Tsukuba, 1985/6), USA (Washington State University, Pullman, WA, and University of Miami, FL, 1987/88), France (Amiens 1998, Lille 2002-2007, Paris 2008), Mexico (DISCA, IIMAS, Universidad Nacional Autonoma de Mexico, 2000/02), Spain (Murcia, 2005), UK (University of Birmingham, 2007/08), Hong Kong (May 2009), Brazil (Sao Carlos, August 2009), Canada (SITE, University of Ottawa, since 1988).
Stojmenovic published >250 different papers in referred journals and conferences; >90 of them are in journals with an ISI impact factor, >20 are in IEEE or ACM journals. His most significant publications can be seen at www.site.uottawa.ca/~ivan. He co-authored over 30 book chapters, mostly very recent.
He collaborated with about 100 co-authors with Ph.D. and a number of their graduate students from 24 different countries. He (co)supervised >50 completed Ph.D. and master theses, and published over 120 joint articles with supervised students. He also published articles with 27 graduate students outside of their theses, and 4 undergraduate students. His current research interests are mainly in wireless ad hoc, sensor and cellular networks. His research interests also include parallel computing, multiple-valued logic, evolutionary computing, neural networks, combinatorial algorithms, computational geometry, graph theory, computational chemistry, image processing, programming languages, and computer science education.
How to Write Articles in Computer Science and Related Engineering Disciplines
This talk advocates a general way of presenting research articles on any topic and in any field
related to computer science, information technology, and relevant engineering disciplines. Some
examples and implications are given for the case study of wireless sensor networks. The key
advice to a successful presentation is to repeat the description of main contribution four times: in
the title, abstract, introduction (or chapter 1) and in the text. That is, make readable, appealing,
and as complete as possible versions of the work using the order of 10, 100, 1000 and 10.000
words. This corresponds to the decreasing portion of readers for corresponding parts of the
article. To the extent possible, each of these parts should address, in this order: the problem
statement, existing solutions, the new solution(s), assumptions and limitations, analysis,
simulation and comparison with best competing solutions.
Contribution of Applied Algorithms to Applied Computing
There are many attempts to bring together computer scientists, applied mathematician and
engineers to discuss advanced computing for scientific, engineering, and practical problems. This
talk is about the role and contribution of applied algorithms within applied computing. It will
discuss some specific areas where design and analysis of algorithms is believed to be the key
ingredient in solving problems, which are often large and complex and cope with tight timing
schedules. The talk is based on recent Handbook of Applied Algorithms (Wiley, March 2008),
co-edited by the speaker. The featured application areas for algorithms and discrete mathematics
include computational biology, computational chemistry, wireless networks, Internet data
streams, computer vision, and emergent systems. Techniques identified as important include
graph theory, game theory, data mining, evolutionary, combinatorial and cryptographic, routing
and localized algorithms.
Scalable Localized Routing in Wireless Sensor Networks
Sensors need their position information in order to provide useful monitoring information. In a localized routing algorithm, each node forwards the message solely based on the location of itself, its neighbors and destination. Such path based routing provides better fault tolerance than tree maintenance approaches. In this talk we describe a cost to progress ratio framework for designing routing algorithms, and show that a number of existing schemes are special cases of the design. The cost depends on metric selected, such as hop count, power, remaining energy, delay, expected hop count (which considers realistic physical layer), etc. Hop count based methods are divided into greedy and recovery schemes. In greedy schemes, each node forwards the message to a neighbor based on the direction, progress or distance criterion. A memoryless (stateless) GFG (greedy-face-greedy) routing algorithm that guarantees delivery (if destination location is accurate) in unit graphs (where nodes can directly communicate iff they are within fixed transmission radius) is presented. We also give design guidelines for network layer protocols in sensor networks.
Vehicular Ad Hoc Networks and Integrated Intelligent Transportation Systems
This talk reviews the components and algorithmic challenges of intelligent transportation
systems: dynamic route selection, environmentally friendly driving, dynamic traffic light
scheduling problem, reconfiguration of road network and traffic admission control, congestion
modeling and forecast, and effective incentive and enforcement policies. ITS also includes
vehicle-to-vehicle communication, with associated problems such as geocasting for congestion
notification, vehicle to vehicle routing, and enabling application services for user devices. State
of the art protocols for automotive networking and communication are described.