A_SWAN 2005: AlgorithmS for Wireless And mobile Networks
San Diego, CA, USA, July 17, 2005

Scope

The rapid and continued growth of wireless technology made information accessible anywhere and at any time. At the same time the falling cost of both communication and mobile computing devices has created a great demand for untethered communication and computing. In addition to wireless networks that rely on pre-existing infrastructure, where wireless communications take place only between the end-nodes and the access points, rapidly-deployable self-organizing mobile networks including ad hoc wireless networks and sensor networks are being developed and deployed. To cope with the rapidly increasing number of users and with the increasing demand for mobile services, it is becoming imperious to optimize the management and use of the limited resources inherent to wireless environments. In turn, these specific demands require new "algorithmic" approaches specifically designed to cope with the highly dynamic underlying infrastructure and with the scarce resources available. Old, heavy-duty algorithmic solutions simply do not work! And, oftentimes, Big-O is not the "best" solution -- one needs to be "closer" to reality. The main goal of A_SWAN'2005 is to bring together in a setting conducive of cross-fertilization a number of researchers and contributions that demonstrate the use of the new algorithmics in the context of the following set of representative topics:

• Intrusion detection
• consensus in sensor networks
• unauthorized traversal and monitoring in sensor networks
• graph modeling
• power management
• unit disks generalized coloring algorithms
• content delivery networks
• optimal pricing strategies
• algorithmic mechanism design
• range assignment
• station/sensor placement
• resource management
• bandwidth allocation
• resource discovery
• handover (handoff)
• routing
• location tracking
• user paging
• scheduling
• data access
• data organization
• security and fault tolerance