Channel modelling for MIMO systems

Systems equipped with multiple antennas at the transmitter and at the receiver, known as MIMO (Multiple Input Multiple Output) systems, offer higher capacities, allowing an efficient exploitation of the available spectrum and/or the employment of more demanding applications. It is well known that the radio channel is characterized by multipath propagation, a phenomenon deemed problematic and whose mitigation has been achieved through techniques such as diversity, beamforming or adaptive antennas. By exploring conveniently the spatial domain MIMO systems turn the characteristics of the multipath channel into an advantage and allow creating multiple parallel and independent virtual channels. However, the achievable benefits are constrained by the propagation channel’s characteristics, which may not always be ideal. This work focuses on the characterization of the MIMO radio channel. It begins with the presentation of the fundamental results from information theory that triggered the interest on these systems, including the discussion of some of their potential benefits and a review of the existing channel models for MIMO systems. The characterization of the MIMO channel developed in this work is based on experimental measurements of the double-directional channel. The measurement system is based on a vector network analyzer and a two-dimensional positioning platform, both controlled by a computer, allowing the measurement of the channel’s frequency response at the locations of a synthetic array. Data is then processed using the SAGE (Space-Alternating Expectation-Maximization) algorithm to obtain the parameters (delay, direction of arrival and complex amplitude) of the channel’s most relevant multipath components. Afterwards, using a clustering algorithm these data are grouped into clusters. Finally, statistical information is extracted allowing the characterization of the channel’s multipath components. The information about the multipath characteristics of the channel, induced by existing scatterers in the propagation scenario, enables the characterization of MIMO channel and thus to evaluate its performance. The method was finally validated using MIMO measurements.

Data mining contributions to characterize MV consumers and to improve the suppliers-consumers settlements

This paper deals with the establishment of a characterization methodology of electric power profiles of medium voltage (MV) consumers. The characterization is supported on the data base knowledge discovery process (KDD). Data Mining techniques are used with the purpose of obtaining typical load profiles of MV customers and specific knowledge of their customers’ consumption habits. In order to form the different customers’ classes and to find a set of representative consumption patterns, a hierarchical clustering algorithm and a clustering ensemble combination approach (WEACS) are used. Taking into account the typical consumption profile of the class to which the customers belong, new tariff options were defined and new energy coefficients prices were proposed. Finally, and with the results obtained, the consequences that these will have in the interaction between customer and electric power suppliers are analyzed.

Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data

Computational Biology is the research are that contributes to the analysis of biological data through the development of algorithms which will address significant research problems.The data from molecular biology includes DNA,RNA ,Protein and Gene expression data.Gene Expression Data provides the expression level of genes under different conditions.Gene expression is the process of transcribing the DNA sequence of a gene into mRNA sequences which in turn are later translated into proteins.The number of copies of mRNA produced is called the expression level of a gene.Gene expression data is organized in the form of a matrix. Rows in the matrix represent genes and columns in the matrix represent experimental conditions.Experimental conditions can be different tissue types or time points.Entries in the gene expression matrix are real values.Through the analysis of gene expression data it is possible to determine the behavioral patterns of genes such as similarity of their behavior,nature of their interaction,their respective contribution to the same pathways and so on. Similar expression patterns are exhibited by the genes participating in the same biological process.These patterns have immense relevance and application in bioinformatics and clinical research.Theses patterns are used in the medical domain for aid in more accurate diagnosis,prognosis,treatment planning.drug discovery and protein network analysis.To identify various patterns from gene expression data,data mining techniques are essential.Clustering is an important data mining technique for the analysis of gene expression data.To overcome the problems associated with clustering,biclustering is introduced.Biclustering refers to simultaneous clustering of both rows and columns of a data matrix. Clustering is a global whereas biclustering is a local model.Discovering local expression patterns is essential for identfying many genetic pathways that are not apparent otherwise.It is therefore necessary to move beyond the clustering paradigm towards developing approaches which are capable of discovering local patterns in gene expression data.A biclusters is a submatrix of the gene expression data matrix.The rows and columns in the submatrix need not be contiguous as in the gene expression data matrix.Biclusters are not disjoint.Computation of biclusters is costly because one will have to consider all the combinations of columans and rows in order to find out all the biclusters.The search space for the biclustering problem is 2 m+n where m and n are the number of genes and conditions respectively.Usually m+n is more than 3000.The biclustering problem is NP-hard.Biclustering is a powerful analytical tool for the biologist.The research reported in this thesis addresses the problem of biclustering.Ten algorithms are developed for the identification of coherent biclusters from gene expression data.All these algorithms are making use of a measure called mean squared residue to search for biclusters.The objective here is to identify the biclusters of maximum size with the mean squared residue lower than a given threshold. All these algorithms begin the search from tightly coregulated submatrices called the seeds.These seeds are generated by K-Means clustering algorithm.The algorithms developed can be classified as constraint based,greedy and metaheuristic.Constarint based algorithms uses one or more of the various constaints namely the MSR threshold and the MSR difference threshold.The greedy approach makes a locally optimal choice at each stage with the objective of finding the global optimum.In metaheuristic approaches particle Swarm Optimization(PSO) and variants of Greedy Randomized Adaptive Search Procedure(GRASP) are used for the identification of biclusters.These algorithms are implemented on the Yeast and Lymphoma datasets.Biologically relevant and statistically significant biclusters are identified by all these algorithms which are validated by Gene Ontology database.All these algorithms are compared with some other biclustering algorithms.Algorithms developed in this work overcome some of the problems associated with the already existing algorithms.With the help of some of the algorithms which are developed in this work biclusters with very high row variance,which is higher than the row variance of any other algorithm using mean squared residue, are identified from both Yeast and Lymphoma data sets.Such biclusters which make significant change in the expression level are highly relevant biologically.

Biclustering Gene Expression Data using MSR Difference Threshold

Biclustering is simultaneous clustering of both rows and columns of a data matrix. A measure called Mean Squared Residue (MSR) is used to simultaneously evaluate the coherence of rows and columns within a submatrix. In this paper a novel algorithm is developed for biclustering gene expression data using the newly introduced concept of MSR difference threshold. In the first step high quality bicluster seeds are generated using K-Means clustering algorithm. Then more genes and conditions (node) are added to the bicluster. Before adding a node the MSR X of the bicluster is calculated. After adding the node again the MSR Y is calculated. The added node is deleted if Y minus X is greater than MSR difference threshold or if Y is greater than MSR threshold which depends on the dataset. The MSR difference threshold is different for gene list and condition list and it depends on the dataset also. Proper values should be identified through experimentation in order to obtain biclusters of high quality. The results obtained on bench mark dataset clearly indicate that this algorithm is better than many of the existing biclustering algorithms

Brain Tissue Classification from Multispectral MRI by Wavelet based Principal Component Analysis

In this paper, we propose a multispectral analysis system using wavelet based Principal Component Analysis (PCA), to improve the brain tissue classification from MRI images. Global transforms like PCA often neglects significant small abnormality details, while dealing with a massive amount of multispectral data. In order to resolve this issue, input dataset is expanded by detail coefficients from multisignal wavelet analysis. Then, PCA is applied on the new dataset to perform feature analysis. Finally, an unsupervised classification with Fuzzy C-Means clustering algorithm is used to measure the improvement in reproducibility and accuracy of the results. A detailed comparative analysis of classified tissues with those from conventional PCA is also carried out. Proposed method yielded good improvement in classification of small abnormalities with high sensitivity/accuracy values, 98.9/98.3, for clinical analysis. Experimental results from synthetic and clinical data recommend the new method as a promising approach in brain tissue analysis.

Status and Potential of Smallholder Livestock Production Systems in Xishuangbanna, southern P.R. China

With Chinas rapid economic development during the last decades, the national demand for livestock products has quadrupled within the last 20 years. Most of that increase in demand has been answered by subsidized industrialized production systems, while million of smallholders, which still provide the larger share of livestock products in the country, have been neglected. Fostering those systems would help China to lower its strong urban migration streams, enhance the livelihood of poorer rural population and provide environmentally save livestock products which have a good chance to satisfy customers demand for ecological food. Despite their importance, China’s smallholder livestock keepers have not yet gained appropriate attention from governmental authorities and researchers. However, profound analysis of those systems is required so that adequate support can lead to a better resource utilization and productivity in the sector. To this aim, this pilot study analyzes smallholder livestock production systems in Xishuangbanna, located in southern China. The area is bordered by Lao and Myanmar and geographically counts as tropical region. Its climate is characterized by dry and temperate winters and hot summers with monsoon rains from May to October. While the regionis plain, at about 500 m asl above sea level in the south, outliers of the Himalaya mountains reach out into the north of Xishuangbanna, where the highest peak reaches 2400 m asl. Except of one larger city, Jinghong, Xishuangbanna mainly is covered by tropical rainforest, areas under agricultural cultivation and villages. The major income is generated through inner-Chinese tourism and agricultural production. Intensive rubber plantations are distinctive for the lowland plains while small-scaled traditional farms are scattered in the mountane regions. In order to determine the current state and possible future chances of smallholder livestock production in that region, this study analyzed the current status of the smallholder livestock sector in the Naban River National Nature Reserve (NRNNR), an area which is largely representative for the whole prefecture. It covers an area of about 50square kilometer and reaches from 470 up to 2400 m asl. About 5500 habitants of different ethnic origin are situated in 24 villages. All data have been collected between October 2007 and May 2010. Three major objectives have been addressed in the study: 1. Classifying existing pig production systems and exploring respective pathways for development 2. Quantifying the performance of pig breeding systemsto identify bottlenecks for production 3. Analyzing past and current buffalo utilization to determine the chances and opportunities of buffalo keeping in the future In order to classify the different pig production s ystems, a baseline survey (n=204, stratified cluster sampling) was carried out to gain data about livestock species, numbers, management practices, cultivated plant species and field sizes as well associo-economic characteristics. Sampling included two clusters at village level (altitude, ethnic affiliation), resulting in 13 clusters of which 13-17 farms were interviewed respectively. Categorical Principal Component Analysis (CatPCA) and a two-step clustering algorithm have been applied to identify determining farm characteristics and assort recorded households into classes of livestock production types. The variables keep_sow_yes/no, TLU_pig, TLU_buffalo, size_of_corn_fields, altitude_class, size_of_tea_plantationand size_of_rubber_fieldhave been found to be major determinants for the characterization of the recorded farms. All farms have extensive or semi-intensive livestock production, pigs and buffaloes are predominant livestock species while chicken and aquaculture are available but play subordinate roles for livelihoods. All pig raisers rely on a single local breed, which is known as Small Ear Pig (SMEP) in the region. Three major production systemshave been identified: Livestock-corn based LB; 41%), rubber based (RB; 39%) and pig based (PB;20%) systems. RB farms earn high income from rubber and fatten 1.9 ±1.80 pigs per household (HH), often using purchased pig feed at markets. PB farms own similar sized rubber plantations and raise 4.7 ±2.77 pigs per HH, with fodder mainly being cultivated and collected in theforest. LB farms grow corn, rice and tea and keep 4.6 ±3.32 pigs per HH, also fed with collected and cultivated fodder. Only 29% of all pigs were marketed (LB: 20%; RB: 42%; PB: 25%), average annual mortality was 4.0 ±4.52 pigs per farm (LB: 4.6 ±3.68; RB: 1.9 ±2.14; PB: 7.1 ±10.82). Pig feed mainly consists of banana pseudo stem, corn and rice hives and is prepared in batches about two to three times per week. Such fodder might be sufficient in energy content but lacks appropriate content of protein. Pigs therefore suffer from malnutrition, which becomes most critical in the time before harvest season around October. Farmers reported high occurrences of gastrointestinal parasites in carcasses and often pig stables were wet and filled with manure. Deficits in nutritional and hygienic management are major limits for development and should be the first issues addressed to improve productivity. SME pork was found to be known and referred by local customers in town and by richer lowland farmers. However, high prices and lacking availability of SME pork at local wet-markets were the reasons which limited purchase. If major management constraints are overcome, pig breeders (PB and LB farms) could increase the share of marketed pigs for town markets and provide fatteners to richer RB farmers. RB farmers are interested in fattening pigs for home consumption but do not show any motivation for commercial pig raising. To determine the productivity of input factors in pig production, eproductive performance, feed quality and quantity as well as weight development of pigs under current management were recorded. The data collection included a progeny history survey covering 184 sows and 437 farrows, bi-weekly weighing of 114 pigs during a 16-months time-span on 21 farms (10 LB and 11 PB) as well as the daily recording of feed quality and quantity given to a defined number of pigs on the same 21 farms. Feed samples of all recorded ingredients were analyzed for their respective nutrient content. Since no literature values on thedigestibility of banana pseudo stem – which is a major ingredient of traditional pig feed in NRNNR – were found, a cross-sectional digestibility trial with 2x4 pigs has been conducted on a station in the research area. With the aid of PRY Herd Life Model, all data have been utilized to determine thesystems’ current (Status Quo = SQ) output and the productivity of the input factor “feed” in terms of saleable life weight per kg DM feed intake and monetary value of output per kg DM feed intake.Two improvement scenarios were simulated, assuming 1) that farmers adopt a culling managementthat generates the highest output per unit input (Scenario 1; SC I) and 2) that through improved feeding, selected parameters of reproduction are improved by 30% (SC II). Daily weight gain averaged 55 ± 56 g per day between day 200 and 600. The average feed energy content of traditional feed mix was 14.92 MJ ME. Age at first farrowing averaged 14.5 ± 4.34 months, subsequent inter-farrowing interval was 11.4 ± 2.73 months. Littersize was 5.8 piglets and weaning age was 4.3 ± 0.99 months. 18% of piglets died before weaning. Simulating pig production at actualstatus, it has been show that monetary returns on inputs (ROI) is negative (1:0.67), but improved (1:1.2) when culling management was optimized so that highest output is gained per unit feed input. If in addition better feeding, controlled mating and better resale prices at fixed dates were simulated, ROI further increased to 1:2.45, 1:2.69, 1:2.7 and 1:3.15 for four respective grower groups. Those findings show the potential of pork production, if basic measures of improvement are applied. Futureexploration of the environment, including climate, market-season and culture is required before implementing the recommended measures to ensure a sustainable development of a more effective and resource conserving pork production in the future. The two studies have shown that the production of local SME pigs plays an important role in traditional farms in NRNNR but basic constraints are limiting their productivity. However, relatively easy approaches are sufficient for reaching a notable improvement. Also there is a demand for more SME pork on local markets and, if basic constraints have been overcome, pig farmers could turn into more commercial producers and provide pork to local markets. By that, environmentally safe meat can be offered to sensitive consumers while farmers increase their income and lower the risk of external shocks through a more diverse income generating strategy. Buffaloes have been found to be the second important livestock species on NRNNR farms. While they have been a core resource of mixed smallholderfarms in the past, the expansion of rubber tree plantations and agricultural mechanization are reasons for decreased swamp buffalo numbers today. The third study seeks to predict future utilization of buffaloes on different farm types in NRNNR by analyzing the dynamics of its buffalo population and land use changes over time and calculating labor which is required for keeping buffaloes in view of the traction power which can be utilized for field preparation. The use of buffaloes for field work and the recent development of the egional buffalo population were analyzed through interviews with 184 farmers in 2007/2008 and discussions with 62 buffalo keepers in 2009. While pig based farms (PB; n=37) have abandoned buffalo keeping, 11% of the rubber based farms (RB; n=71) and 100% of the livestock-corn based farms (LB; n=76) kept buffaloes in 2008. Herd size was 2.5 ±1.80 (n=84) buffaloes in early 2008 and 2.2 ±1.69 (n=62) in 2009. Field work on own land was the main reason forkeeping buffaloes (87.3%), but lending work buffaloes to neighbors (79.0%) was also important. Other purposes were transport of goods (16.1%), buffalo trade (11.3%) and meat consumption(6.4%). Buffalo care required 6.2 ±3.00 working hours daily, while annual working time of abuffalo was 294 ±216.6 hours. The area ploughed with buffaloes remained constant during the past 10 years despite an expansion of land cropped per farm. Further rapid replacement of buffaloes by tractors is expected in the near future. While the work economy is drastically improved by the use of tractors, buffaloes still can provide cheap work force and serve as buffer for economic shocks on poorer farms. Especially poor farms, which lack alternative assets that could quickly be liquidizedin times of urgent need for cash, should not abandon buffalo keeping. Livestock has been found to be a major part of small mixed farms in NRNNR. The general productivity was low in both analyzed species, buffaloes and pigs. Productivity of pigs can be improved through basic adjustments in feeding, reproductive and hygienic management, and with external support pig production could further be commercialized to provide pork and weaners to local markets and fattening farms. Buffalo production is relatively time intensive, and only will be of importance in the future to very poor farms and such farms that cultivate very small terraces on steep slopes. These should be encouraged to further keep buffaloes. With such measures, livestock production in NRNNR has good chances to stay competitive in the future.

Image Segmentation Using Information Bottleneck Method

In image processing, segmentation algorithms constitute one of the main focuses of research. In this paper, new image segmentation algorithms based on a hard version of the information bottleneck method are presented. The objective of this method is to extract a compact representation of a variable, considered the input, with minimal loss of mutual information with respect to another variable, considered the output. First, we introduce a split-and-merge algorithm based on the definition of an information channel between a set of regions (input) of the image and the intensity histogram bins (output). From this channel, the maximization of the mutual information gain is used to optimize the image partitioning. Then, the merging process of the regions obtained in the previous phase is carried out by minimizing the loss of mutual information. From the inversion of the above channel, we also present a new histogram clustering algorithm based on the minimization of the mutual information loss, where now the input variable represents the histogram bins and the output is given by the set of regions obtained from the above split-and-merge algorithm. Finally, we introduce two new clustering algorithms which show how the information bottleneck method can be applied to the registration channel obtained when two multimodal images are correctly aligned. Different experiments on 2-D and 3-D images show the behavior of the proposed algorithms

Tropospheric planetary wave dynamics and mixture modeling: Two preferred regimes and a regime shift

Investigation of preferred structures of planetary wave dynamics is addressed using multivariate Gaussian mixture models. The number of components in the mixture is obtained using order statistics of the mixing proportions, hence avoiding previous difficulties related to sample sizes and independence issues. The method is first applied to a few low-order stochastic dynamical systems and data from a general circulation model. The method is next applied to winter daily 500-hPa heights from 1949 to 2003 over the Northern Hemisphere. A spatial clustering algorithm is first applied to the leading two principal components (PCs) and shows significant clustering. The clustering is particularly robust for the first half of the record and less for the second half. The mixture model is then used to identify the clusters. Two highly significant extratropical planetary-scale preferred structures are obtained within the first two to four EOF state space. The first pattern shows a Pacific-North American (PNA) pattern and a negative North Atlantic Oscillation (NAO), and the second pattern is nearly opposite to the first one. It is also observed that some subspaces show multivariate Gaussianity, compatible with linearity, whereas others show multivariate non-Gaussianity. The same analysis is also applied to two subperiods, before and after 1978, and shows a similar regime behavior, with a slight stronger support for the first subperiod. In addition a significant regime shift is also observed between the two periods as well as a change in the shape of the distribution. The patterns associated with the regime shifts reflect essentially a PNA pattern and an NAO pattern consistent with the observed global warming effect on climate and the observed shift in sea surface temperature around the mid-1970s.

Scalability of efficient parallel K-Means

Clustering is defined as the grouping of similar items in a set, and is an important process within the field of data mining. As the amount of data for various applications continues to increase, in terms of its size and dimensionality, it is necessary to have efficient clustering methods. A popular clustering algorithm is K-Means, which adopts a greedy approach to produce a set of K-clusters with associated centres of mass, and uses a squared error distortion measure to determine convergence. Methods for improving the efficiency of K-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting a more efficient data structure, notably a multi-dimensional binary search tree (KD-Tree) to store either centroids or data points. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient K-Means techniques in parallel computational environments. In this work, we provide a parallel formulation for the KD-Tree based K-Means algorithm and address its load balancing issues.

Search space pruning and global optimization of multiple gravity assist trajectories with deep space manoeuvres

This paper deals with the design of optimal multiple gravity assist trajectories with deep space manoeuvres. A pruning method which considers the sequential nature of the problem is presented. The method locates feasible vectors using local optimization and applies a clustering algorithm to find reduced bounding boxes which can be used in a subsequent optimization step. Since multiple local minima remain within the pruned search space, the use of a global optimization method, such as Differential Evolution, is suggested for finding solutions which are likely to be close to the global optimum. Two case studies are presented.

An empirical study of process-related attributes in segmented software cost-estimation relationships

Parametric software effort estimation models consisting on a single mathematical relationship suffer from poor adjustment and predictive characteristics in cases in which the historical database considered contains data coming from projects of a heterogeneous nature. The segmentation of the input domain according to clusters obtained from the database of historical projects serves as a tool for more realistic models that use several local estimation relationships. Nonetheless, it may be hypothesized that using clustering algorithms without previous consideration of the influence of well-known project attributes misses the opportunity to obtain more realistic segments. In this paper, we describe the results of an empirical study using the ISBSG-8 database and the EM clustering algorithm that studies the influence of the consideration of two process-related attributes as drivers of the clustering process: the use of engineering methodologies and the use of CASE tools. The results provide evidence that such consideration conditions significantly the final model obtained, even though the resulting predictive quality is of a similar magnitude.

Video activity extraction and reporting with incremental unsupervised learning

The present work presents a new method for activity extraction and reporting from video based on the aggregation of fuzzy relations. Trajectory clustering is first employed mainly to discover the points of entry and exit of mobiles appearing in the scene. In a second step, proximity relations between resulting clusters of detected mobiles and contextual elements from the scene are modeled employing fuzzy relations. These can then be aggregated employing typical soft-computing algebra. A clustering algorithm based on the transitive closure calculation of the fuzzy relations allows building the structure of the scene and characterises the ongoing different activities of the scene. Discovered activity zones can be reported as activity maps with different granularities thanks to the analysis of the transitive closure matrix. Taking advantage of the soft relation properties, activity zones and related activities can be labeled in a more human-like language. We present results obtained on real videos corresponding to apron monitoring in the Toulouse airport in France.

Space partitioning for scalable K-means

K-Means is a popular clustering algorithm which adopts an iterative refinement procedure to determine data partitions and to compute their associated centres of mass, called centroids. The straightforward implementation of the algorithm is often referred to as `brute force' since it computes a proximity measure from each data point to each centroid at every iteration of the K-Means process. Efficient implementations of the K-Means algorithm have been predominantly based on multi-dimensional binary search trees (KD-Trees). A combination of an efficient data structure and geometrical constraints allow to reduce the number of distance computations required at each iteration. In this work we present a general space partitioning approach for improving the efficiency and the scalability of the K-Means algorithm. We propose to adopt approximate hierarchical clustering methods to generate binary space partitioning trees in contrast to KD-Trees. In the experimental analysis, we have tested the performance of the proposed Binary Space Partitioning K-Means (BSP-KM) when a divisive clustering algorithm is used. We have carried out extensive experimental tests to compare the proposed approach to the one based on KD-Trees (KD-KM) in a wide range of the parameters space. BSP-KM is more scalable than KDKM, while keeping the deterministic nature of the `brute force' algorithm. In particular, the proposed space partitioning approach has shown to overcome the well-known limitation of KD-Trees in high-dimensional spaces and can also be adopted to improve the efficiency of other algorithms in which KD-Trees have been used.

Neural network basis function center selection using cluster analysis

This paper deals with the selection of centres for radial basis function (RBF) networks. A novel mean-tracking clustering algorithm is described as a way in which centers can be chosen based on a batch of collected data. A direct comparison is made between the mean-tracking algorithm and k-means clustering and it is shown how mean-tracking clustering is significantly better in terms of achieving an RBF network which performs accurate function modelling.

Mobility based energy efficient and multi-sink algorithms for consumer home networks

With the fast development of the Internet, wireless communications and semiconductor devices, home networking has received significant attention. Consumer products can collect and transmit various types of data in the home environment. Typical consumer sensors are often equipped with tiny, irreplaceable batteries and it therefore of the utmost importance to design energy efficient algorithms to prolong the home network lifetime and reduce devices going to landfill. Sink mobility is an important technique to improve home network performance including energy consumption, lifetime and end-to-end delay. Also, it can largely mitigate the hot spots near the sink node. The selection of optimal moving trajectory for sink node(s) is an NP-hard problem jointly optimizing routing algorithms with the mobile sink moving strategy is a significant and challenging research issue. The influence of multiple static sink nodes on energy consumption under different scale networks is first studied and an Energy-efficient Multi-sink Clustering Algorithm (EMCA) is proposed and tested. Then, the influence of mobile sink velocity, position and number on network performance is studied and a Mobile-sink based Energy-efficient Clustering Algorithm (MECA) is proposed. Simulation results validate the performance of the proposed two algorithms which can be deployed in a consumer home network environment.