LOCAN 2006

Tentative program available here

Subject and Purpose of the Workshop

This workshop covers comprehensively the algorithmic issues in the hot area of ad hoc and sensor networking. The design of data communication techniques in multi-hop ad hoc networks has challenges at all layers of communication: physical, medium access control (MAC), network, transport and application layers. This workshop concentrates on the network layer. Network layer problems can be divided into two groups: data communication, and topology control.

In data communication problems, such as routing, quality-of-service routing, geocasting, multicasting, and broadcasting, the primary goal is to successfully fulfill a given communication task between nodes in an ad hoc network. The secondary task is to minimize the communication overhead (since bandwidth in wireless communication is typically limited) and power consumption by battery operated nodes. In service access problem, which also can be treated as a data communication problem, the primary goal is to provide or receive service from a fixed infrastructure with other hosts serving as relays if necessary. An example is wireless Internet access where packets are allowed to make multiple hops from machine to machine to get to/from the Internet.

Topology control problems are further subdivided into neighbour discovery and network organization problems. In the neighbour discovery problem, the problem is to detect neighboring nodes located within transmission radius. For example, sensors thrown into the field may be pre-programmed to start functioning at certain time, and their first task is then to detect neighboring sensors. In the network organization problem, each node should decide what communication links to establish with neighbouring nodes (an example is Bluetooth scatternet formation problem), and what power management schemes to adopt (examples are sleep period operations and adjusting transmission radii).

Sensor networks are currently recognized as one of the priority research areas (for example, a multi-disciplinary program on sensors and sensor networks was launched in 2003 at the US National Science Foundation) and research activities are booming recently. The applications of sensor networks are envisioned primarily for monitoring the environment (e.g. motion detection, chemicals, temperature) or as embedded systems (e.g. biomedical sensor engineering). This workshop will address ongoing research on this hot topic, including problems such as: physical properties, sensor training, security through intelligent node cooperation, medium access, sensor area coverage with random and deterministic placement, object location, sensor position determination, energy efficient broadcasting and activity scheduling, routing, connectivity, data dissemination and gathering, sensor centric quality of routing, temporal message ordering, path exposure, tree reconfiguration, topology construction, and transport layer.

The main paradigm shift is to apply localized (or greedy) schemes as opposed to existing protocols requiring global information. Localized algorithms are distributed algorithms where simple local node behaviour achieves a desired global objective. Localized protocols provide scalable solutions, that is, solutions for wireless networks with an arbitrary number of nodes, which is the main goal of this plan. Sensor and rooftop/mesh networks, for instance, have hundreds or thousands of nodes.

Topics of Interest

We are seeking papers that describe original and unpublished contributions addressing various aspects of ad hoc networking. Possible topics of interest include, but are not limited to:

• Medium access control

• Analytical, mobility and validation models for ad hoc networks

• Hybrid networks and wireless Internet

• Security in ad hoc networks

• Data management issues, query processing, and data delivery

• Routing, broadcasting and multicasting in ad hoc networks

• Energy-efficient protocols for ad hoc networks

• Quality of service in medium access control and routing

• Topology construction and maintenance in ad hoc networks

• Neighborhood discovery and mobility management

Camera Ready Submission

Authors should prepare a PDF file following the IEEE single-space, two-column format using at least 10 point size type. The paper must be correctly formatted to fit on U.S. "letter" size page (8.5" by 11") with at least 1" margins on all edges. Full-length papers must not exceed 6 pages. For each additional page (maximumm 2) there is a $150 charge. Please make sure your PDF file complies with the IEEE PFD specification. Mention the workshop abbreviation in the subject line. Papers which do not comply with the format, will not be included in the proceedings.

In addition, authors are required to send a copyright form, indicating the LOCAN 2006 workshop to which the paper belongs, according to the instructions in http://www.cse.fau.edu/mass2006/submission.html

The deadline for submission is 08/10/2006. The IEEE LaTeX and Microsoft Word templates, as well as related information can be found here.

The authors of accepted papers must guarantee that their paper will be presented at the conference. At least one author of each accepted paper must be registered for the workshop in order for that paper to appear in the proceedings and to be scheduled for presentation. Information about registration can be found in http://www.cse.fau.edu/mass2006/registration.html

Authors are requested to submit their final papers (PDF format), contact addresses, telephone number, fax number, and e-mail addresses (text format) to both program co-chairs, Pedro M. Ruiz (pedrom@dif.um.es) and Fei Dai (fei.dai@gmail.com).

Important Dates

• Manuscript Submission: June 19, 2006
• Acceptance Notification: July 19, 2006
• Camera Ready Manuscript Due: August 10, 2006

General Co-Chairs

David Symplot-Ryl, Univ. Lille 1, INRIA Futurs, France
Ivan Stojmenovic, Univ. of Ottawa, Canada

Program Co-Chairs

Pedro M. Ruiz, University of Murcia, Spain
Fei Dai, North Dakota State University, USA

Program Committee

Call for Papers PDF Version | Technical program 

Last update: Wednesday, 2-Aug-06