CALL FOR PAPERS

WORKSHOPS:


Heterogeneous Wireless Ad Hoc and Sensor Networks

Graphs and Networks

Online Optimization and Algorithms



WORKSHOP ON
Heterogeneous Wireless Ad Hoc and Sensor Networks


In Conjunction with the 8th International Symposium on Parallel Architectures, Algorithms, and Networks I-SPAN 2005, Dec. 7-9, 2005,

Las Vegas, Nevada, USA

http://sigact.acm.org/ispan05/

Heterogeneous wireless ad hoc networking covers multi-hop scenarios (network nodes communicating via other network nodes) such as conference, hospital, battlefield, rescue, and monitoring scenarios. They operate in a self-organized and decentralized manner and message communication takes place via multi-hop spreading. Sensor Networks, supported by recent technological advances in low power wireless communications along with silicon integration of various functionalities such as sensing, communications, intelligence and actuation are emerging as a critically important disruptive computer class. In ad hoc and sensor networks, communication and computing techniques impact information routing in the network, and vice versa. In the context of this theme, original contributions are solicited in all relevant areas, including but not limited to:


TOPICS:


  • Scalable architecture for heterogeneous wireless ad hoc and sensor networks

  • Energy and bandwidth-efficient communication techniques for wireless ad hoc networks

  • Multiple access techniques (e.g., TDMA, FDMA, CDMA)

  • Communication technologies (narrowband, wideband and ultra-wideband)

  • Communication protocols for in ad hoc and sensor networks

  • Data compression, association, aggregation

  • Interplay between information processing, communication, and routing

  • Analytical, mobility, and validation models for ad hoc and sensor networks

  • Hybrid networks and wireless Internet

  • Quality of service in medium access control and routing

  • Data management issues, query processing etc.

  • Clustering and cooperative strategies for ad hoc and sensor networks

  • Target tracking and location-based Services

  • Self-configuring and self-healing schemes

  • Coordination, Integration and Synchronization in ad hoc and sensor networks

  • Modeling, performance evaluation, and simulation tools

  • Services and applications (e.g., in the area of automobile, battlefield, bio, construction, disaster, environment, medicine, military, recovery, security, etc.)



Important Dates:

Submission due date: September 15, 2005

Notification of acceptance: September 25, 2005

Camera-ready paper due date: October 5, 2005


Workshop Co-Chairs:


Frank Hsu

Department of Computer & Information Sciences
Fordham University

113 West 60th Street

New York, NY 10023

Phone: (718)-817-4483

Email: hsu @ cis.fordham.edu


Arjan Durresi,

Department of Computer Science,

Louisiana State University,

298 Coates Hall

Baton Rouge, LA 70803, USA

Phone: (225)-578-3902

Email: durresi @ csc.lsu.edu



WORKSHOP ON
Graphs and Networks


In Conjunction with the 8th International Symposium on Parallel Architectures, Algorithms, and Networks I-SPAN 2005, Dec. 7-9, 2005,

Las Vegas, Nevada, USA

http://sigact.acm.org/ispan05


Network interconnection provides fundamental structure for the function of a variety of information networking applications at different levels in all sorts of communication networks as diverse as wireline, wireless, ad-hoc, mobile and sensor networks, satellite networks and the Internet. On the other hand, graph theory and algorithm provide efficient construction and routing protocols for the interconnection networks. In the context of this theme, we solicited original contributions in all relevant areas of Graphs and Networks, including but not limit to:


TOPICS:


  • Network structure and graph property, connectivity, transmission delay (diameter, wide diameter) , and graph container.

  • Reliability and fault tolerance, reconfigurebility, and rearrangebility.

  • Routing and scheduling, graph algorithms, broadcasting and multicasting, multipath and container routing, and load balancing.

  • Network design and optimization.

  • Modeling and measuring the Internet and WWW, and globe networking.


Important Dates:


Submission due date: September 15, 2005

Notification of acceptance: September 25, 2005

Camera-ready paper due date: October 5, 2005


Workshop Co-Chairs:


Jay Bagga

Ball State University, Indiana, USA

jbagga @ bsu.edu



Daniela Ferrero

Texas State University, Texas, USA

dferrero @ txstate.edu



WORKSHOP ON
Online Optimization and Algorithms


In Conjunction with the 8th International Symposium on Parallel Architectures, Algorithms, and Networks I-SPAN 2005, Dec. 7-9, 2005,

Las Vegas, Nevada, USA

http://sigact.acm.org/ispan05/



In Information Technology decisions must typically be made before all inputs are available. Whether it is setting up virtual circuits in order to carry IP traffic over ATM networks, deciding whether to leave a disk spinning in between accesses to data, or keeping cache coherent in a multiprocessor architecture -- online algorithms play
a crucial role in such diverse areas as  machine learning, robotics, operating systems, network routing, distributed systems, databases. Techniques from online algorithms are beneficial in offline situations, when the underlying problems are too hard to be solved optimally. This track thus seeks contributions from both areas. Also interesting offline optimization techniques and algorithmic innovations which can be useful in online settings are considered.





TOPICS:



Areas of interest include:
 

  • Server Problems

  • Task Systems

  • Paging

  • Routing

  • Network Design

  • Scheduling

  • Randomized Approaches

  • Game Theoretic Approaches

  • Optimal Sorting

  • Problems in Computational Geometry

Important Dates:


Submission due date: September 15, 2005

Notification of acceptance: September 25, 2005

Camera-ready paper due date: October 5, 2005


Workshop Co-Chairs:


Wolfgang Bein


bein @ cs.unlv.edu


Frank Hsu

frank @ cis.fordham.edu

 
For further information and feedback contact IPSAN 05 here.