Refereed Publications
- Yamin Li, Shietung Peng, and Wanming Chu, "An Efficient
Algorithm for Finding an Almost Connected Dominating Set
of Small Size on Wireless Ad Hoc Networks", Proceedings
of The Third IEEE International Conference on Mobile Ad-hoc
and Sensor Systems (MASS2006), October 9 - 12, 2006 Vancouver,
Canada, pp. 199-205.
Abstract - In this paper,
we propose an efficient, distributed and localized algorithm
for finding an almost connected dominating set of small
size on wireless ad hoc networks. Broadcasting and routing
based on a connected dominating set (CDS) is a promising
approach. A set is dominating if all the nodes of the
network are either in the set or neighbors of nodes in
the set. The efficiency of dominating-set-based broadcasting
or routing mainly depends on the overhead in constructing
the dominating set and the size of the dominating set.
Our algorithm can find a CDS faster and the size of the
found CDS is smaller than the previous algorithms proposed
in the literature. Although our algorithm cannot guarantee
the set found is actually a CDS but from our simulation
results, the probabilities that the found set is a CDS
are higher than 99.96% in all cases.
- Yamin Li, Shietung Peng, and Wanming Chu, "MCore:
A Simple Structure for Effective Overlay Multicast on
Mobile Ad Hoc Networks", Proceedings of The IASTED
International Conference on Parallel and Distributed Computing
and Systems (PDCS-2006), Dallas, USA, Nov. 13-15, 2006,
pp. 341-346.
Abstract - Overlay multicast
protocol constructs a virtual mesh spanning all member
nodes of a multicast group and employs standard unicast
routing to fulfill multicast functionality on application
layer. The advantages of this approach are simplicity
and flexibility. However, efficiency and stability are
the issues that must be addressed as the size of the multicast
group grows in the mobile ad hoc networks (MANETs). In
this paper, we propose an effective structure for overlay
multicast to solve these problems in MANETs. Instead of
using a spanning tree on the virtual mesh, we adopt a
simple structure called MCore for multicast. An MCore
is a path that minimizes the sum of the distances of all
vertices to the path plus the length of the path. The
MCore is more stable and easier to maintain than the spanning
tree in MANETs. The simulation results show that our approach
handles the flexibility and mobility issues in overlay
multicast protocols effectively for large multicast group
size.
- Yamin Li, Shietung Peng, and Wanming Chu, "K-MCore
for Multicasting on Mobile Ad Hoc Networks", Proceedings
of the Seventh International Conference on Parallel and
Distributed Computing, Applications and Technologies (PDCAT'06),
Taipei, Taiwan, Dec. 4-7, 2006, pp. 109-114.
Abstract - A k-cluster
of a tree includes a single path and k-1 subpaths
growing from that path. A k-MCore is a k-cluster
that minimizes the sum of the distances of all vertices
to the cluster plus the size of the cluster. This structure
is motivated by the applications on overlay multicasting.
The overlay multicast protocol constructs a virtual mesh
spanning all member nodes of a multicast group. It employs
standard unicast routing and forwarding to fulfill multicast
functionality. In this paper, we propose effective distributed
algorithms for constructing k-MCore on a tree network.
The k-MCore is more stable and easier to maintain
than the spanning tree in virtual mesh. The simulation
results show that our approach handles the flexibility
and mobility issues in an overlay multicast protocol effectively,
especially when the group size is large.
>PAGE TOP
|
|
|
