Xiang-yang Li, Peng-jun Wan, Wen-zhan Song, Yanwei Wu, Zhao Jizhong
Reprints available directly from the publisher
Nearly Constant Approximation for Data Aggregation Scheduling (2008)
Peng-jun Wan, Chinh T. Vu, Yingshu Li, Frances Yao
Abstract — Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of...
Low-Latency Broadcast Scheduling in Ad Hoc Networks (2008)
Peng-jun Wan, Xiaohua Jia, Hongwei Du
Abstract. Broadcast is a fundamental operation in wireless network, and naïve flooding is simply not practical. Previous results showed that although broadcast scheduling can achieve constant...
Abstract Sparse Power Efficient Topology for Wireless Networks (2008)
Xiang-yang Li, Peng-jun Wan, Yu Wang, Ophir Frieder
We consider how to construct power efficient wireless ad hoc networks. We propose two different methods combin-ing several well-known proximity graphs including Gabriel graph and Yao graph, which can...
Maximizing Lifetime of Sensor Surveillance Systems (2008)
Hai Liu, Xiaohua Jia, Peng-jun Wan, Chih-wei Yi, S. Kami Makki, Niki Pissinou
Abstract—This paper addresses the maximal lifetime scheduling problem in sensor surveillance systems. Given a set of sensors and targets in an area, a sensor can watch only one target at a time,...
ABSTRACT OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks ∗ (2008)
Orthogonal Variable Spreading Factor (OVSF) CDMA code provides a means of support of variable rate data service at low hardware cost. In contrast to the conventional orthogonal fixed-spreading-factor...
Fault-tolerant relay node placement in wireless sensor networks (2008)
Hai Liu, Peng-jun Wan, Xiaohua Jia
Abstract. The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum number of...
Nearly Constant Approximation for Data Aggregation Scheduling (2008)
Peng-jun Wan, Chinh T. Vu, Yingshu Li, Frances Yao
Abstract — Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of...
Load-balanced routing in counter rotated sonet rings (2008)
Load-balanced routing in SONET rings has attracted much attention recently. Most prior works modeled the SONET rings as undirected rings and the traffic as undirected chords. While this model fits...
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks (2008)
Peng-jun Wan, Xiaohua Jia, Hongwei Du, Weiping Shang
Abstract—A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimum-Latency...
Channel Alternation And Rotation For Trisectorized Cellular Systems (2008)
Vincent A. Nguyen, Peng-jun Wan, Ophir Frieder
Abstract- Conventional trisectored cellular systems have not taken full advantages of antenna directivities to enhance frequency reuse efficiency. A novel Channel Alternation and Rotation (CAR)...
Abdur Chowdhury, Paul Luse, Peng-jun Wan
Abstract. With the ever-increasing demands on server applications, many new server services are distributed in nature. We evaluated one hundred deployed systems and found that over a one-year period,...
Generate Good Mesh Respecting to Control Spacing (2007)
Xiang-yang Li, Peng-jun Wan, Shang-Hua Teng, Alper Ungor
This paper presents an efficient algorithm to generate a well-shaped and a well-conformed mesh respecting to a given control spacing
Splitable Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs (2007)
SONET ADMs are the dominant cost factor in the WDM/SONET rings. Recently several articles [2, 3, 6, 10, 14] proposed a number of heuristics for trac partition so as to use as few SONET ADMs as...
Generate Good Mesh Efficiently (2007)
Xiang-yang Li, Peng-jun Wan, Shang-Hua Teng, Alper Ungor
this paper, we show
1 Introduction A Radio Coloring of a Hypercube (2007)
Ophir Frieder, Frank Harary, Peng-jun Wan
A radio coloring of a graph G is an assignment of nonnegative
Abstract Optimal Placement of Wavelength Converters in Trees and Trees of Rings* (2007)
Peng-jun Wan, Liwu Liu, Ophir Frieder
In wavelength routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. The problem of placing a minimum number of wavelength converters in a...
Gruia C Alinescu, Peng-jun Wan, Alexander Zelikovsky
Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as ooding, is to let every node retransmit the message to all its 1-hop...
Gruia C Alinescu, Peng-jun Wan, Alexander Zelikovsky
Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as ooding, is to let every node retransmit the message to all its 1-hop...
Selecting Forwarding Neighbors in (2007)
Wireless Ad Hoc, Gruia Calinescu, Peng-jun Wan, Alexander Z. Zelikovsky
Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as flooding, is to let every node retransmit the message to all its 1-hop...
Power assignment for k-connectivity in wireless ad hoc networks (2005)
Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-jun Wan, Chih-wei Yi
Abstract — The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the total power...
Localized low weight graph and its applications in wireless ad hoc networks (2004)
Xiang-yang Li, Peng-jun Wan, Wen-zhan Song, Ophir Frieder
Abstract — We propose a new localized structure, namely, Incident MST and RNG Graph (IMRG), for topology control and broadcasting in wireless ad hoc networks. In the construction algorithm, each...
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other’s transmission range....
OVSF-CDMA code assignment for wireless ad hoc networks (2004)
Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreadingfactor CDMA code....
Localized low weight graph and its applications in wireless ad hoc networks (2004)
Xiang-yang Li, Yu Wang, Peng-jun Wan, Wen-zhan Song, Ophir Frieder
Abstract — We propose a new localized structure, namely, Incident MST and RNG Graph (IMRG), for topology control and broadcasting in wireless ad hoc networks. In the construction algorithm, each...
On greedy construction of connected dominating sets in wireless networks (2004)
Yingshu Li, My T. Thai, Feng Wang, Chih-wei Yi, Peng-jun Wan, Ding-zhu Du
Since no fixed infrastructure and no cen-tralized management present in wireless net-works, a Connected Dominating Set (CDS) of the graph representing the network is widely used as a virtual...
Minimum-Power Multicast Routing in Static Ad Hoc Wireless Networks (2004)
Peng-jun Wan, Gruia Călinescu, Chih-wei Yi
Wan et al. [15] proved that SPT has an approximation ratio of at least n 2 where n is the total number of nodes, and both MST and BIP have constant approximation ratios. Based on the approach of...
Fault tolerant deployment and topology control in wireless networks (2003)
Xiang-yang Li, Peng-jun Wan, Yu Wang, Chih-wei Yi
This paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. Given n wireless...
Chih-wei Yi, Peng-jun Wan, Xiang-yang Li, Ophir Frieder
Abstract—Nodes in wireless ad hoc networks may become inactive or unavailable due to, for example, internal breakdown or being in the sleeping state. The inactive nodes cannot take part in...
Geometric spanners for wireless ad hoc networks (2003)
Khaled Alzoubi, Xiang-yang Li, Yu Wang, Peng-jun Wan, Ophir Frieder
Abstract—We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local...
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks (2003)
Xiang-yang Li, Gruia Calinescu, Peng-jun Wan, Yu Wang, Student Member
Abstract—Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RNG) or Gabriel...
Geometric spanners for wireless ad hoc networks (2003)
Khaled Alzoubi, Xiang-yang Li, Yu Wang, Peng-jun Wan, Ophir Frieder
Abstract—We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local...
Coverage in wireless ad-hoc sensor networks (2003)
Xiang-yang Li, Peng-jun Wan, Ophir Frieder
Abstract—Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking [1]. One of the fundamental problems in sensor networks is the...
Fault Tolerant Deployment and Topology Control in Wireless Networks (2003)
Xiang-yang Li, Peng-jun Wan, Yu Wang
This paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. Given n wireless...
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks (2003)
Xiang-yang Li, Gruia Calinescu, Peng-jun Wan, Yu Wang
Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RNG) or Gabriel graph (GG) is...
Range Assignment for High Connectivity in Wireless Ad Hoc Networks (2003)
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the...
Fault Tolerant Sensor Networks with Bernoulli Nodes (2003)
Chih-wei Yi, Peng-jun Wan, Xiang-yang Li, Ophir Frieder
Connectivity, power consuming and fault tolerance are three critical issues in sensor networks. In this paper, sensor networks are modeled by the unit disc graph, random point process and Bernoulli...
Fault tolerant deployment and topology control in wireless networks (2003)
Xiang-yang Li, Peng-jun Wan, Yu Wang, Chih-wei Yi
We consider a large-scale of wireless ad hoc networks whose nodes are distributed randomly in a two-dimensional region ª (more specifically, a unit square). Given Ò wireless nodes Î, each with...
New distributed algorithm for connected dominating set in wireless ad hoc networks (2002)
Khaled M. Alzoubi, Peng-jun Wan, Ophir Frieder
Abstract—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature...
Distributed heuristics for connected dominating sets in wireless ad hoc networks (2002)
Khaled M. Alzoubi, Peng-jun Wan, Ophir Frieder
Abstract: A connected dominating set (CDS) for a graph ¢¡¤£¦¥¨§�© is a subset £� � of £, such that each node in £���£�� is adjacent induces a connected subgraph. CDSs...
Distributed construction of connected dominating set in wireless ad hoc networks (2002)
Peng-jun Wan, Khaled M. Alzoubi, Ophir Frieder
Abstract—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature...
Sparse power efficient topology for wireless networks (2002)
Xiang-yang Li, Peng-jun Wan, Yu Wang, Ophir Frieder
Abstract dimensional plane. Each wireless node has an omnidirectional antenna. This is attractive for a single trans-We consider how to construct power eficient wireless ad mission of a node can be...
G. Calinescu, Ophir Frieder, Senior Member, Peng-jun Wan
Abstract—Automatic ring protection provides simple and rapid fault protection and restoration in telecommunication networks. To implement the automatic ring protection in general wavelengthdivision...
Distributed construction of connected dominating set in wireless ad hoc networks (2002)
Peng-jun Wan, Khaled M. Alzoubi, Ophir Frieder
Abstract—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature...
Distributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks (2002)
Xiang-yang Li, Gruia Calinescu, Peng-jun Wan
Several localized routing protocols [1] guarantee the delivery of the packets when the underlying network topology is the Delaunay triangulation of all wireless nodes. However, it is expensive to...
Distributed construction of connected dominating set in wireless ad hoc networks (2002)
Khaled M. Alzoubi, Peng-jun Wan, Ophir Frieder
Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum...
Coverage in Wireless Ad-hoc Sensor Networks (2002)
Xiang-yang Li, Peng-jun Wan, Ophir Frieder
Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking [1]. One of the fundamental problems in sensor networks is the calculation...
Sparse Power Efficient Topology for Wireless Networks (2002)
Xiang-yang Li, Peng-jun Wan, Yu Wang, Ophir Frieder
Due to the nodes' limited ressource in the wireless ad hoc networks, it is important to maintain only a linear number of links...
Constructing Minimum Energy Mobile Wireless Networks (2001)
Energy conservation is a critical issue in designing wireless ad hoc networks, as the nodes are powered by batteries only. Given a set of wireless network nodes, the directed weighted transmission...
Minimizing drop cost for SONET/WDM networks with 8 wavelength requirements (2001)
Charles J. Colbourn, Peng-jun Wan, Theory John Wiley
SONET/WDM networks using wavelength add–drop multiplexing can be constructed using certain graph decompositions used to form a “grooming, ” consisting of unions of certain primitive rings. The...
Wavelength Assignment in WDM Rings to Minimize SONET ADMs (2000)
Liwu Liu, Xiangyang Li, Peng-jun Wan, Ophir Frieder
Abstract — We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation complexity...
Grooming of arbitrary traffic in SONET/WDM BLSRs (2000)
Peng-jun Wan, Gruia Călinescu, Liwu Liu, Ophir Frieder
Abstract—SONET add–drop multiplexers (ADMs) are the dominant cost factor in the SONET/WDM rings. They can potentially be reduced by optical bypass via optical add–drop multiplexers (OADMs) and...
Wavelength Assignment in WDM Rings to Minimize SONET ADMs (2000)
Liwu Liu, Xiangyang Li, Peng-jun Wan, Ophir Frieder
Abstract — We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation complexity...
Network Survivability Simulation of the Commercially Deployed Dynamic Routing System Protocol (2000)
Abdur Chowdhury, Ophir Frieder, Paul Luse, Peng-jun Wan
Abstract. With the ever-increasing demands on server applications, many new server services are distributed in nature. We evaluated one hundred deployed systems and found that over a one-year period,...
Select Line Speeds for Single-Hub SONET/WDM Ring Networks (2000)
Minimizing SONET ADM costs in single-hub SONET/WDM ring networks via traffic grooming has been discussed in a number of recent works. Recent work [12] gives the exact minimum costs of uniform traffic...
Practical Traffic Grooming Scheme for Single-Hub SONET/WDM Rings (2000)
Xiang-yang Li, Liwu Liu, Peng-jun Wan, Ophir Frieder
In SONET/WDM networks, one fiber supports multiple wavelengths and each wavelength supports several low rate tributary streams. "Traffic grooming" then is defined as properly using SONET...
Practical traffic grooming scheme for single-hub SONET/WDM rings (2000)
Xiang-yang Li, Peng-jun Wan, Liwu Liu
In SONET/WDM networks, one fiber supports multiple wavelengths and each wavelength supports several low rate tributary streams. Traffic grooming is then defined as properly using SONET Add/Drop...
Wavelength Assignment in WDM Rings to Minimize SONET ADMs (1999)
Liwu Liu, Xiangyang Li, Peng-jun Wan, Ophir Frieder
We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation complexity remains unknown,...
Minimizing Drop Cost for SONET/WDM Networks with 1/8 Wavelength Requirements (1999)
Charles J. Colbourn, Peng-jun Wan
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a `grooming', consisting of unions of certain primitive rings. The...