Publications (173)83.62 Total impact
 [Show abstract] [Hide abstract]
ABSTRACT: In this paper, we study the connectivity of multihop wireless networks with the lognormal shadowing model by investigating the critical transmission power required by each node for asymptotic vanishing of the isolated nodes, and the precise distribution of the number of isolated nodes. The vanishing of isolated nodes is not only a prerequisite but also a good indication of network connectivity. Most of the known works on network connectivity under such a shadowing model were obtained only based on simulation studies or ignoring the important boundary effect to avoid the challenging technical analysis, and thus hardly applied to practical wireless networks. It is extremely challenging to take the complicated boundary effect into consideration under such a realistic shadowing model because the transmission area of each node is an irregular region other than a circular area. Assume the wireless nodes are represented by a Poisson point process with density \(n\) over a unitarea disk. With the boundary effect taken into consideration, we first obtain an explicit formula for the expected number of isolated nodes, we then derive an upper and a lower bounds of the critical transmission power for asymptotic vanishing of the isolated nodes. The tightness of the upper and lower bounds for the critical transmission power are analyzed via numerical analysis by using the software engineering approach. When a wireless network consists of \(n\) nodes distributed independently and uniformly over a unitarea disk, we derive the precise distribution of the number of the isolated nodes under such a realistic shadowing model with the linear power assignment, taking the boundary effect into consideration.Wireless Networks 02/2015; 21(7). DOI:10.1007/s1127601509152 · 0.96 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: One of the most fundamental tasks of wireless sensor networks is to provide coverage of the deployment region. We study the coverage of a line interval with a set of wireless sensors with adjustable coverage ranges. Each coverage range of a sensor is an interval centered at that sensor whose length is decided by the power the sensor chooses. The objective is to find a range assignment with the minimum cost. There are two variants of the optimization problem. In the discrete variant, each sensor can only choose from a finite set of powers, whereas in the continuous variant, each sensor can choose power from a given interval. For the discrete variant of the problem, a polynomialtime exact algorithm is designed. For the continuous variant of the problem, NPhardness of the problem is proved and followed by an ILP formulation. Then, constantapproximation algorithms are designed when the cost for all sensors is proportional to rκfor some constant κ ≥ 1, where r is the covering radius corresponding to the chosen power. Specifically, if κ = 1, we give a 1.25approximation algorithm and a fully polynomialtime approximation scheme; if κ > 1, we give a 2approximation algorithm. We also show that the approximation analyses are tight.ACM Transactions on Sensor Networks 11/2014; 11(1):120. DOI:10.1145/2629518 · 1.39 Impact Factor 
Article: Capacity maximization in wireless MIMO networks with receiverside interference suppression
[Show abstract] [Hide abstract]
ABSTRACT: Multipleinput multipleoutput (MIMO) technology provides a means of boosting network capacity without requiring additional spectrum. It has received widespread attention over the past decade from both industry and academic researchers, now forming a key component of nearly all emerging wireless standards. Despite the huge promise and considerable attention, a rigorous algorithmtheoretic framework for maximizing network capacity in multihop wireless MIMO\ networks is missing in the state of the art. The existing algorithms and protocols for maximizing network capacity in multihop wireless MIMO networks are purely heuristic without any provable performance guarantees. In this paper we conduct a comprehensive algorithm study for maximizing network capacity in multihop wireless MIMO networks with receiverside interference suppression, including the full characterization of NPhardness and APXhardness, the polynomial time approximation schemes, and the practical approximation algorithms with provable performance guarantees. 
Conference Paper: Fast and simple approximation algorithms for maximum weighted independent set of links
[Show abstract] [Hide abstract]
ABSTRACT: Finding a maximumweighted independent set of links is a fundamental problem in wireless networking and has broad applications in various wireless link scheduling problems. Under protocol interference model, it is NPhard even when all nodes have uniform (and fixed) interference radii and the positions of all nodes are available. On one hand, it admits a polynomialtime approximation scheme (PTAS). In other words, for any fixed ε > 0, it has a polynomialtime (depending on ε) (1 + ε)approximation algorithm. However, such PTAS is of theoretical interest only and is quite infeasible practically. On the other hand, only with the uniform interference radii is a simple (greedy) constantapproximation algorithm known. For the arbitrary interference radii, fast constantapproximation algorithms are still missing. In this paper, we present a number of fast and simple approximation algorithms under the general protocol interference model. When applied to the plane geometric variants of the protocol interference model, these algorithms produce constantapproximate solutions efficiently.IEEE INFOCOM 2014  IEEE Conference on Computer Communications; 04/2014 
Conference Paper: From least interferencecost paths to maximum (Concurrent) multiflow in MCMR wireless networks
[Show abstract] [Hide abstract]
ABSTRACT: Maximum multiflow and maximum concurrent multiflow in multichannel multiradio (MCMR) wireless networks have been wellstudied in the literature. They are NPhard even in singlechannel singleradio (SCSR) wireless networks when all nodes have uniform (and fixed) interference radii and the positions of all nodes are available. While they admit a polynomialtime approximation scheme (PTAS) when the number of channels is bounded by a constant, such PTAS is quite infeasible practically. Other than the PTAS, all other known approximation algorithms, in both SCSR wireless networks and MCMR wireless networks, resorted to solve a polynomialsized linear program (LP) exactly. The scalability of their running time is fundamentally limited by the generalpurposed LP solvers. In this paper, we first introduce the concept of interference costs and prices of a path and explore their relations with the maximum (concurrent) multiflow. Then we develop purely combinatorial approximation algorithms which compute a sequence of least interferencecost routing paths along which the flows are routed. These algorithms are faster and simpler, and achieve nearly the same approximation bounds known in the literature.IEEE INFOCOM 2014  IEEE Conference on Computer Communications; 04/2014  [Show abstract] [Hide abstract]
ABSTRACT: We are in an age where people are paying increasing attention to energy conservation around the world. The heating and airconditioning systems of buildings introduce one of the largest chunks of energy expenses. In this article, we make a key observation that after a meeting or a class ends in a room, the indoor temperature will not immediately increase to the outdoor temperature. We call this phenomenon thermal inertia. Thus, if we arrange subsequent meetings in the same room rather than in a room that has not been used for some time, we can take advantage of such undissipated cool or heated air and conserve energy. Though many existing energy conservation solutions for buildings can intelligently turn off facilities when people are absent, we believe that understanding thermal inertia can lead system designs to go beyond onandoffbased solutions to a wider realm. We propose a framework for exploring thermal inertia in room management. Our framework contains two components. (1) The energytemperature correlation model captures the relation between indoor temperature change and energy consumption. (2) The energyaware scheduling algorithms: given information for the relation between energy and temperature change, energyaware scheduling algorithms arrange meetings not only based on common restrictions, such as meeting time and room capacity requirement, but also energy consumptions. We identify the interface between these components so further works towards same on direction can make efforts on individual components. We develop a system to verify our framework. First, it has a wireless sensor network to collect indoor, outdoor temperature and electricity expenses of the heating or airconditioning devices. Second, we build an energytemperature correlation model for the energy expenses and the corresponding room temperature. Third, we develop room scheduling algorithms. In detail, we first extend the current sensor hardware so that it can record the electricity expenses in reheating or recooling a room. As the sensor network needs to work unattendedly, we develop a hardware board for longrange communications so that the Imote2 can send data to a remote server without a computer relay close by. An efficient twotiered sensor network is developed with our extended Imote2 and TelosB sensors. We apply laws of thermodynamics and build a correlation model of the energy needed to recool a room to a target temperature. Such model requires parameter calibration and uses the data collected from the sensor network for model refinement. Armed with the energytemperature correlation model, we develop an optimal algorithm for a specified case, and we further develop two fast heuristics for different practical scenarios. Our demo system is validated with real deployment of a sensor network for data collection and thermodynamics model calibration. We conduct a comprehensive evaluation with synthetic room and meeting configurations, as well as real class schedules and classroom topologies of The Hong Kong Polytechnic University, academic calendar year of Spring 2011. We observe 20% energy savings as compared with the current schedules.ACM Transactions on Sensor Networks 11/2013; 10(1). DOI:10.1145/2529050 · 1.39 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: This paper studies the problem of selecting a maximum independent set of links with a fixed monotone and sublinear power assignment under the physical interference model. The bestknown approximation bound for this problem is a very large constant. In this paper, we present an approximation algorithm for this problem, which not only has a much smaller approximation bound but also produces an independent set of links with a stronger property, i.e., strong independence.Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications; 08/2013 
Conference Paper: Maximum independent set of links with power control
[Show abstract] [Hide abstract]
ABSTRACT: This paper addresses the joint selection and power assignment of a largest number of given links which can communicate successfully at the same time under the physical interference model. For this optimization problem, we present a constantapproximation algorithm with improved performance over existing approximation algorithms. In addition, both the algorithm design and analysis are applicable to arbitrary pathloss exponent and arbitrary dimension of the deployment space.Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications; 08/2013  [Show abstract] [Hide abstract]
ABSTRACT: Static greedy link schedulings have much simpler implementation than dynamic greedy link schedulings such as Longestqueuefirst (LQF) link scheduling. However, its stability performance in multichannel multiradio (MCMR) wireless networks is largely underexplored. In this paper, we present a stability subregion with closed form of a static greedy link scheduling in MCMR wireless networks under the 802.11 interference model. By adopting some special static link orderings, the stability subregion is within a constant factor of the stable capacity region of the network. We also obtain constant lower bounds on the throughput efficiency ratios of the static greedy link schedulings in some special static link orderings.INFOCOM, 2013 Proceedings IEEE; 04/2013 
Article: The Number of Isolated Nodes in a Wireless Network with a Generic Probabilistic Channel Model
[Show abstract] [Hide abstract]
ABSTRACT: A wireless node is called isolated if it has no links to other nodes. The number of isolated nodes in a wireless network is an important connectivity index. However, most previous works on analytically determining the number of isolated nodes were not based on practical channel models. In this work, we study this problem using a generic probabilistic channel model that can capture the behaviors of the most widely used channel models, including the disk graph model, the Bernoulli link model, the Gaussian white noise model, the Rayleigh fading model, and the Nakagami fading model. We derive the expected number of isolated nodes and further prove that their distribution asymptotically follows a Poisson distribution. We also conjecture that the nonexistence of isolated nodes asymptotically implies the connectivity of the network, and that the probability of connectivity follows the Gumbel function.IEICE Transactions on Communications 02/2013; E96.B(2):595604. DOI:10.1587/transcom.E96.B.595 · 0.23 Impact Factor 
Conference Paper: Scalable algorithms for wireless link schedulings in multichannel multiradio wireless networks
[Show abstract] [Hide abstract]
ABSTRACT: For wireless link scheduling in multichannel multiradio wireless networks aiming at maximizing (concurrent) multiflow, constantapproximation algorithms have recently been developed in [11]. However, the running time of those algorithms grows quickly with the number of radios per node (at least in the sixth order) and the number of channels (at least in the cubic order). Such poor scalability stems intrinsically from the exploding size of the finegrained network representation upon which those algorithms are built. In this paper, we introduce a new structure, termed as concise conflict graph, on the nodelevel links directly. Such structure succinctly captures the essential advantage of multiple radios and multiple channels. By exploring and exploiting the rich structural properties of the concise conflict graphs, we are able to develop fast and scalable link scheduling algorithms for either minimizing the communication latency or maximizing the (concurrent) multiflow. These algorithms have running time growing linearly in both the number of radios per node and the number of channels, while not sacrificing the approximation bounds.INFOCOM, 2013 Proceedings IEEE; 01/2013 
Conference Paper: Maximizing Wireless Network Capacity with Linear Power: Breaking The Logarithmic Barrier
[Show abstract] [Hide abstract]
ABSTRACT: Maximizing the wireless network capacity under physical interference model is notoriously hard due to the nonlocality and the additive nature of the wireless interference under the physical interference model. This problem has been extensively studied recently with the achievable approximation bounds progressively improved from the linear factor to logarithmic factor. It has been a major open problem whether there exists a constantapproximation approximation algorithm for maximizing the wireless network capacity under the physical interference model. In this paper, we improve the status quo for the case of linear transmission power assignment, which is widely adopted due to its advantage of energy conservation. By exploring and exploiting the rich nature of the wireless interference with the linear power assignment, we develop constantapproximation algorithms for maximizing the wireless network capacity with linear transmission power assignment under the physical interference model, in both the unidirectional mode and the bidirectional mode.INFOCOM, 2013 Proceedings IEEE; 01/2013 
Chapter: MinimumLatency Scheduling
[Show abstract] [Hide abstract]
ABSTRACT: Consider a multihop wireless network in which all network nodes V lie in plane and have a unit communication radius. Its communication topology G is the unit disk graph (UDG) of V. Under the protocol interference model, every node has a communication radius normalized to one, and an interference radius ρ for some parameter ρ ≥ 1 (see Fig. 11.1). A node v can receive the message successfully from a transmitting node u if v is within the transmission range of u but is outside the interference range of any other node transmitting simultaneously.Connected Dominating Set: Theory and Applications, 01/2013: pages 169182; 
Chapter: CDS in DiskIntersection Graphs
[Show abstract] [Hide abstract]
ABSTRACT: Consider a finite set V of nodes in the plane and a radius function \(r : V \rightarrow {\rm IR}^{+}\). The diskintersection graph (DIG) of V with the radius function r, denoted by \({G}_{r}\left (V \right )\), is the undirected graph on V in which u and v are adjacent if and only if the disk centered at u of radius \(r\left (u\right )\) and the disk centered at v of radius \(r\left (v\right )\) intersect, or equivalently, $$\left \Vert uv\right \Vert \leq r\left (u\right ) + r\left (v\right ).$$ If \(r\left (v\right ) = 1/2\) for all v ∈ V, then \({G}_{r}\left (V \right )\) is exactly the unit disk graph (UDG) of V.Connected Dominating Set: Theory and Applications, 01/2013: pages 151159; 
 [Show abstract] [Hide abstract]
ABSTRACT: Although MinCDS in general graphs is hard to approximate, the restriction to certain special graph classes admits much better approximation results. MinCDS in planar graphs remains NPhard even for planar graphs that are regular of degree 4 [57]. The related problem, MinDS in planar graphs, is also NPhard even for planar graphs with maximum vertex degree 3 and planar graphs that are regular of degree 4 [57]. It is well known that MinDS in planar graphs possesses a polynomialtime approximation scheme (PTAS) based on the shifting strategy [3]: For any constant ε >0, there is a polynomialtime 1+εapproximation algorithm. Thus, it is immediate to conclude that MinCDS in planar graphs can be approximated within a factor 3+ε for any ε>0 in polynomial time. However, the degree of the polynomial grows with 1∕ε and hence, the approximation scheme is hardly practical.Connected Dominating Set: Theory and Applications, 01/2013: pages 183191; 
Chapter: Coverage
[Show abstract] [Hide abstract]
ABSTRACT: A classic type of resource management problem is as follows: Given a certain amount of resource and a set of users, find an assignment of resource to maximize the number of satisfied users. The maximum lifetime coverage is such a classic type of problem in wireless sensor networks.Connected Dominating Set: Theory and Applications, 01/2013: pages 105118;  [Show abstract] [Hide abstract]
ABSTRACT: This paper presents a theoretical analysis of the maximum throughput of a wireless mesh backhaul network that is achievable over a practical carrier sense multiple access with collision avoidance (CSMA/CA) medium access control (MAC) protocol. We resort to the multicommodity flow (MCF) formulation augmented with the conflictgraph constraints, whereas we use a novel approach to take into account the collision overhead in the distributed CSMA/CA MAC. Such overhead due to random access has been ignored by existing MCFbased capacity studies, which assume impractical centralized scheduling and result in aggressive capacity planning, which is unachievable over the CSMA/CA MAC. This paper makes the following three main contributions: 1) we develop a generic method of integrating the CSMA/CA MAC analysis with the MCF formulation for optimal network capacity analysis, which readily generates an upper bound of the network throughput; 2) we define a new concept of CSMA/CA clique and theoretically study its relationship to a CSMA/CA area in terms of throughput; and 3) using the CSMA/CA clique as a tool, we derive a lower bound of the network throughput achievable over the CSMA/CA MAC by cliquebased MCF formulation. NS2 simulation results are presented to demonstrate the tightness of the upper and lower bounds that are newly developed, compared to those based on the MCF formulation assuming a slotted system and centralized scheduling.IEEE Transactions on Vehicular Technology 09/2012; 61(7):31513165. DOI:10.1109/TVT.2012.2204411 · 1.98 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: A wide range of next generation wireless networks are based on the multiradio multichannel (MRMC) network model. A full exploration of the MRMC wireless network capacity incurs challenging cooperative networking issues including transmission cooperation, resource allocation cooperation, and crosslayer protocol cooperation. In this article, rather than focus on protocol designs for specific cooperative networking issues, we present a generic theoretical framework that could guide the protocol or algorithm development to approach the maximum network capacity. Based on our multidimensional conflict graph (MDCG) tool, we could achieve a crosslayer linear programming framework to study the optimal cooperative networking in two complementary aspects: optimal network dimensioning and throughputoptimal control. While certain NPhard computing issues hindered the MRMC network optimization for a long time, the MDCGbased framework can readily generate simple polynomial and distributed algorithms with guaranteed capacity region.IEEE Wireless Communications 04/2012; 19(2):6673. DOI:10.1109/MWC.2012.6189415 · 5.42 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: Data aggregation, as a primitive communication task in wireless networks, can reduce the communication complexity. However, innetwork aggregation usually brings an unavoidable security defect. Some malicious nodes may control a large percentage of the whole network data and compel the network misbehave in an arbitrary manner. Thus, locating the malicious nodes to prevent them from further disaster is a practical challenge for data aggregation schemes. Based on the grouping and localization techniques, we propose a novel integrated protocol to locate malicious nodes. The proposed protocol does not rely on any special hardware and requests only incomplete information of the network from the security schemes. We also conduct simulation study to evaluate the proposed protocol.Proceedings  IEEE INFOCOM 01/2012; DOI:10.1109/INFCOM.2012.6195758
Publication Stats
5k  Citations  
83.62  Total Impact Points  
Top Journals
Institutions

19972014

Illinois Institute of Technology
 Department of Computer Science
Chicago, Illinois, United States 
University of Minnesota Duluth
 Department of Computer Science
Duluth, Minnesota, United States


20082013

IIT Research Institute (IITRI)
Chicago, Illinois, United States


20082009

University of Illinois at Chicago
 Department of Computer Science
Chicago, Illinois, United States


20062007

City University of Hong Kong
 Department of Computer Science
Chiulung, Kowloon City, Hong Kong


2005

The University of Hong Kong
 Department of Computer Science
Hong Kong, Hong Kong


2000

Pace University
 Program in Computer Science
New York City, NY, United States


1993

Chinese Academy of Sciences
 Institute of Applied Mathematics
Peping, Beijing, China
