2009 Proceeding- General Chairs:
- Ivan Stojmenovic,
- Ding-Zhu Du,
- Program Chairs:
- Yu Wang,
- Yingshu Li
It is our great pleasure to welcome you to the 2nd ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing (ACM FOWANC'09), which takes place in New Orleans on May 18, 2009. With the success of ACM FOWANC'08 at Hong Kong last year, we are delighted to continue this workshop with ACM MobiHoc 2009 and hope it will become a regular ACM MobiHoc workshop in the following years.
ACM FOWANC'09 is devoted to distributed algorithms and theoretical methods in the context of wireless ad hoc and sensor networking and computing. This workshop is intended to foster cooperation among researchers in wireless ad hoc and sensor networking and theoreticians in algorithm and theory, and push the theoretical research forward for a deeper understanding about ad hoc and sensor networking and computing.
This year, ACM FOWANC received less submissions than last year, however, the overall quality of submissions was excellent. Most of the papers received three peer reviews from our technical program committee (TPC), comprising people from industry, national laboratories, and universities all over the world. After a thorough analysis of the reviews returned, we accepted 10 regular papers for the workshop. The final workshop program includes three technical sessions and one keynote address. We are honored to have Prof. Jie Wu from Florida Atlantic University to give an opening keynote address, titled as "On Self-Organization in MANETs".
Proceeding Downloads
On self-organization in MANETs
The dynamic nature and network complexity of MANETs requires self organization to reduce the administrative need and complexity in network installation, maintenance, and management. We first show several network functions of MANETs that can be designed ...
Wireless link scheduling under a graded SINR interference model
In this paper, we revisit the wireless link scheduling problem under a graded version of the SINR interference model. Unlike the traditional thresholded version of the SINR model, the graded SINR model allows use of "imperfect links", where ...
A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model
Link scheduling is crucial in improving the throughput in wireless networks and it has been widely studied under various interference models. In this paper, we study the link scheduling problem under physical interference model where all senders of the ...
On the multicast throughput capacity of network coding in wireless ad-hoc networks
We study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks. We consider a network with $n$ nodes distributed uniformly in a unit square, with each node acting as a source for independent ...
On a locally minimum cost forwarding game
We consider the problem of all-to-one (reverse multicast) selfish routing in the absence of a payment scheme in wireless networks, where a natural model for cost is the power required to forward. Whereas each node requires a path to the destination, it ...
A 3d-localization and terrain modeling technique for wireless sensor networks
Although sensor networks are usually deployed in complex 3D terrains, the majority of localization techniques proposed in the literature are designed assuming 2D deployments. Furthermore, in general it is not easy to extend these techniques to 3D ...
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
Data aggregation is an efficient primitive in wireless sensor network (WSN) applications. This paper focuses on data aggregation scheduling problem to minimize the latency. We propose an efficient distributed method that produces a collision-free ...
Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?
A protocol, dubbed BeSpoken, steers data transmissions along a straight path called a spoke through a wireless sensor network with many location-unaware nodes. BeSpoken implements a simple, spatially recursive communication process, where a set of ...
Passive localization using rotating anchor pairs in wireless sensor networks
Several range-free and range-based techniques have been proposed to solve the localization problem in wireless adhoc and sensor networks. Although range-based techniques are known to be more accurate than their range-free counterparts, they usually ...
Spatio-temporal monitoring using contours in large-scale wireless sensor networks
This paper presents algorithms for efficiently detecting the variation of a distributed signal over space and time using large scale wireless sensor networks. The proposed algorithms use contours for estimating the spatial distribution of a signal. A ...
Reactive jamming attacks in multi-radio wireless sensor networks: an efficient mitigating measure by identifying trigger nodes
There exist many studies against reactive jamming attacks, however, these methods, i.e. frequency hopping or channel surfing, require excessive computational capabilities on wireless devices which are serious side effects in wireless sensor networks. To ...
- Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing