Title: Connectivity Problem in Wireless Networks (by Dariusz R. Kowalski, Mariusz A. Rokicki)
This paper studies the complexity of the connectivity problem in wireless networks: For a given placement of n node in a plane, try to compute a channel and power assignment that forms strong connected communication structure spanning all nodes. This paper works with two signal interference mode: GRN and SINR models. It shows a polynomial-time transformation from the separable assignments in GRN to assignments in the SINR model which generates a O(log n) complexity.
Chen Jinbiao will talk about the paper
Title: Ref-DESYNC: Bio-inspired Desynchronization in Wireless Sensor Networks Using Reference
Abstract: Desynchronization is a primitive for a set of smart agents to self-organize a schedule for periodical and continuous access to shared resources. Existing algorithms such as DESYNC pursuit Desynchronization in the time domain by bio-inspired techniques. However, the reference information from the environment or the agents' characteristics is rarely used, which are actually very important factors in the self-organizing process of the smart creatures in the nature. In this paper, we show that Desynchronization using reference can be much more efficient than the solely self-organized evolution. It not only improves the convergence speed, but also can extend bio-inspired Desynchronization into spatial domain to enable self-organized pattern formation. Two kinds of environmental references are considered: 1) absolute reference and 2) relative reference. Ref-DESYNC algorithms of above two types are designed, with analysis on the complexity and extensive simulations on the performances.