#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2003

2017

- This year (3)
- Last 5 years (18)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
- Parallel Processing Letters
- 2008

We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.

- Zhenyu Xu, Pradip K. Srimani
- 19th IEEE International Parallel and Distributed…
- 2005

We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n/sup 4/) time starting from any arbitrary initial state. The protocol can elect either a leaf node or a non-leaf node (starting from the same initial state) depending on the behavior of… (More)

In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph.

- Émile Archambault, Nabih Alloune, +7 authors Michel P. Bélanger
- IEEE/ACM Transactions on Networking
- 2016

Elastic optical networking is considered a promising candidate to improve the spectral efficiency of optical networks. One of the most important planning challenges of elastic optical networks is the NP-hard routing and spectrum assignment RSA problem. In this paper, we investigate offline RSA in elastic filterless optical networks, which use a passive… (More)

- Baojian Qiu, Jihui Wang, Yan Liu, Zhenyu Xu
- 22017 IEEE International Conference on…
- 2017

A total k--coloring c of G is called k-neighbor sum distinguishing if for each edge uv, the sum of color of u and the colors of its incident edges is different from the sum of color of v and the colors of its incident edges. The smallest k is called the neighbor sum distinguishing total chromatic number. and first introduced this coloring and conjectured… (More)

- Xiaodan Jin, Zhenyu Xu, Keigo Hirakawa
- IEEE Transactions on Image Processing
- 2014

Noise is present in all images captured by real-world image sensors. Poisson distribution is said to model the stochastic nature of the photon arrival process and agrees with the distribution of measured pixel values. We propose a method for estimating unknown noise parameters from Poisson corrupted images using properties of variance stabilization. With a… (More)

- Zhenyu Xu, Pradip K. Srimani
- IWDC
- 2005

In this paper, we develop a new self-stabilizing (fault tolerant) protocol for publish/subscribe scheme in a P2P network. We provide a complexity analysis of the recovery (stabilization) time of the protocol after arbitrary failures in the network. The protocol converges in at most n(∆+ 1)m + n − n time in the worst case where n, m, and ∆ denote… (More)

- Zhenyu Xu, Émile Archambault, +4 authors Paul Littlewood
- IEEE Communications Letters
- 2014