AlAamri, H, Abolhasan, M, Franklin, D & Lipman, J 2013, 'Optimised relay selection for route discovery in reactive routing', AD HOC NETWORKS, vol. 11, no. 1, pp. 70-88.
View/Download from: Publisher's site
View description>>
On-demand routing protocols have the potential to provide scalable information delivery in large ad hoc networks. The novelty of these protocols is in their approach to route discovery, where a route is determined only when it is required by initiating a route discovery procedure. Much of the research in this area has focused on reducing the route discovery overhead when prior knowledge of the destination is available at the source or by routing through stable links. Hence, many of the protocols proposed to date still resort to flooding the network when prior knowledge about the destination is un-available. This paper proposes a novel routing protocol for ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing (as used by AODV) with an efficient route discovery algorithm called Tree-based Optimised Flooding (TOF) to improve scalability of ad hoc networks when there is no prior knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimised by selectively flooding the network through a limited set of nodes, referred to as branching nodes. The key factors governing the performance of OTRP are theoretically analysed and evaluated, including the number of branch nodes, location of branching nodes and number of Route REQuest (RREQ) retries. It was found that the performance of OTRP (evaluated using a variety of well-known metrics) improves as the number of branching nodes increases and the number of consumed RREQ retries is reduced. Additionally, theoretical analysis and simulation results shows that OTRP outperforms AODV, DYMO, and OLSR with reduced overheads as the number of nodes and traffic load increases. © 2012 Elsevier B.V. All rights reserved.
Borzeshi, EZ, Perez Concha, O, Xu, RYD & Piccardi, M 2013, 'Joint Action Segmentation and Classification by an Extended Hidden Markov Model', IEEE Signal Processing Letters, vol. 20, no. 12, pp. 1207-1210.
View/Download from: Publisher's site
View description>>
Hidden Markov models (HMMs) provide joint segmentation and classification of sequential data by efficient inference algorithms and have therefore been employed in fields as diverse as speech recognition, document processing, and genomics. However, conventional HMMs do not suit action segmentation in video due to the nature of the measurements which are often irregular in space and time, high dimensional and affected by outliers. For this reason, in this paper we present a joint action segmentation and classification approach based on an extended model: the hidden Markov model for multiple, irregular observations (HMM-MIO). Experiments performed over a concatenated version of the popular KTH action dataset and the challenging CMU multi-modal activity dataset (CMU-MMAC) report accuracies comparable to or higher than those of a bag-of-features approach, showing the usefulness of improved sequential models for joint action segmentation and classification tasks. © 1994-2012 IEEE.
Cheng, P, Chen, Z, Rui, Y, Guo, YJ, Gui, L, Tao, M & Zhang, QT 2013, 'Channel Estimation for OFDM Systems over Doubly Selective Channels: A Distributed Compressive Sensing Based Approach', IEEE Transactions on Communications, vol. 61, no. 10, pp. 4173-4185.
View/Download from: Publisher's site
View description>>
Channel estimation for an orthogonal frequency-division multiplexing (OFDM) broadband system over a doubly selective channel is very challenging. This is mainly due to the significant Doppler shift, which results in a time-frequency doubly-selective (DS) channel. The DS channel features a large number of channel coefficients, which introduces inter-carrier interference (ICI) and forces the need for allocating a large number of pilot subcarriers. To tackle this problem, in this paper we propose a novel channel estimation scheme based on distributed compressive sensing (DCS) theory. Taking advantage of the basis expansion model (BEM) and the channel sparsity in the delay domain, we transform the original DS channel into a novel two-dimensional channel model, where several jointly sparse BEM coefficient vectors become the estimation goal. Then a special decoupling form originating from a novel sparse pilot pattern is designed for such estimation, which results in an ICI-free structure and enables the DCS application to make joint estimation of these vectors accurately. Combined with a smoothing treatment process, the proposed scheme can achieve significantly higher estimation accuracy than the existing ones, although with a much smaller number of pilot subcarriers. Theoretical analysis and simulation results both confirm its performance merits. © 2013 IEEE.
Chiu, C & Chaczko, Z 2013, 'Enhancement of Surgical Training Practice with the Spring Tensor Heuristic Model', International Journal of Electronics and Telecommunications, vol. 59, no. 3, pp. 237-244.
View/Download from: Publisher's site
View description>>
Abstract The enhancement of surgical simulation tools is an important research study, to assist in the assessment and feedback of medical training practice. In this research, the Spring Tensor Model (STEM) has been used for laparoscopic end-effector navigation through obstacles and high-risk areas. The modelling of the surgical trainer as part of the laparoscopic simulator seeks to emulate the physical environment as a virtualised representation in the integrated infrastructure. Combining sensor network framework paradigms to a surgical knowledge-based construct demonstrates how STEMcan enhance medical practice. The architectural hybridisation of the training framework has enabled the adaptation of STEM modelling techniques for a simulated laparoscopic training methodology. The primary benefit of the architecture is that this integration strategy has resulted in a seamless transition of the heuristic framework to be applied to surgical training.
Chu, Q-X, Mao, C-X & Zhu, H 2013, 'A Compact Notched Band UWB Slot Antenna With Sharp Selectivity and Controllable Bandwidth', IEEE Transactions on Antennas and Propagation, vol. 61, no. 8, pp. 3961-3966.
View/Download from: Publisher's site
Dinh, HT, Lee, C, Niyato, D & Wang, P 2013, 'A survey of mobile cloud computing: architecture, applications, and approaches', Wireless Communications and Mobile Computing, vol. 13, no. 18, pp. 1587-1611.
View/Download from: Publisher's site
View description>>
ABSTRACTTogether with an explosive growth of the mobile applications and emerging of cloud computing concept, mobile cloud computing (MCC) has been introduced to be a potential technology for mobile services. MCC integrates the cloud computing into the mobile environment and overcomes obstacles related to the performance (e.g., battery life, storage, and bandwidth), environment (e.g., heterogeneity, scalability, and availability), and security (e.g., reliability and privacy) discussed in mobile computing. This paper gives a survey of MCC, which helps general readers have an overview of the MCC including the definition, architecture, and applications. The issues, existing solutions, and approaches are presented. In addition, the future research directions of MCC are discussed. Copyright © 2011 John Wiley & Sons, Ltd.
Dong, X, Liu, E, Yang, J & Wu, Q 2013, 'MEGH: A New Affine Invariant Descriptor', KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, vol. 7, no. 7, pp. 1690-1704.
View/Download from: Publisher's site
View description>>
An affine invariant descriptor is proposed, which is able to well represent the affine covariant regions. Estimating main orientation is still problematic in many existing method, such as SIFT (scale invariant feature transform) and SURF (speeded up robust features). Instead of aligning the estimated main orientation, in this paper ellipse orientation is directly used. According to ellipse orientation, affine covariant regions are firstly divided into 4 sub-regions with equal angles. Since affine covariant regions are divided from the ellipse orientation, the divided sub-regions are rotation invariant regardless the rotation, if any, of ellipse. Meanwhile, the affine covariant regions are normalized into a circular region. In the end, the gradients of pixels in the circular region are calculated and the partition-based descriptor is created by using the gradients. Compared with the existing descriptors including MROGH, SIFT, GLOH, PCA-SIFT and spin images, the proposed descriptor demonstrates superior performance according to extensive experiments. © 2013 KSII.
Du, R, Wu, Q, He, X & Yang, J 2013, 'MIL-SKDE: Multiple-instance learning with supervised kernel density estimation', Signal Processing, vol. 93, no. 6, pp. 1471-1484.
View/Download from: Publisher's site
View description>>
Multiple-instance learning (MIL) is a variation on supervised learning. Instead of receiving a set of labeled instances, the learner receives a set of bags that are labeled. Each bag contains many instances. The aim of MIL is to classify new bags or instances. In this work, we propose a novel algorithm, MIL-SKDE (multiple-instance learning with supervised kernel density estimation), which addresses MIL problem through an extended framework of KDE (kernel density estimation)+mean shift. Since the KDE+mean shift framework is an unsupervised learning method, we extend KDE to its supervised version, called supervised KDE (SKDE), by considering class labels of samples. To seek the modes (local maxima) of SKDE, we also extend mean shift to a supervised version by taking into account sample labels. SKDE is an alternative of the well-known diverse density estimation (DDE) whose modes are called concepts. Comparing to DDE, SKDE is more convenient to learn multi-modal concepts and robust to labeling noise (mistakenly labeled bags). Finally, each bag is mapped into a concept space where the multi-class SVM classifiers are learned. Experimental results demonstrate that our approach outperforms the state-of-the-art MIL approaches. © 2012 Elsevier B.V.
Ge, Y, Chen, M, Sun, Y, Li, Z, Wang, Y & Dutkiewicz, E 2013, 'QoS provisioning wireless multimedia transmission over cognitive radio networks', Multimedia Tools and Applications, vol. 67, no. 1, pp. 213-229.
View/Download from: Publisher's site
View description>>
The rapid growing of wireless multimedia applications increases the needs of spectrum resources, but today's spectrum resources have become more and more scarce and large part of the assigned spectrum is in an inefficiency usage. Cognitive Radio (CR) technologies are proposed to solve current spectrum inefficiency problems and offer users a ubiquitous wireless accessing environment, relying on dynamic spectrum allocation. However, there are two unsolved problems in previous work: 1) based on the simplified Quality of Service (QoS) uniform assumption, specific requirements of different wireless multimedia applications cannot be sati sfied; 2) aiming at single-objective optimization of spectrum utilization or handoff rate, the co-optimization of these two necessary objectives in CR networks has not been achieved. In this paper, we propose a Two-tier Cooperative Spectrum Allocation method (TCSA) to solve these two problems. TCSA consists of two functional parts: one is a Spectrum Adjacency Ranking algorithm implemented at the secondary users' terminals to satisfy the QoS requirements for different wireless multimedia applications; and the other is a Max Hyper-weight Matching algorithm implemented at the cognitive engines of CR networks to co-optimize spectrum utilization and secondary users' spectrum handoff rate. Simulation results show that, compared with the other Random matching algorithm and Cost minimized algorithm, TCSA can significantly improve the performance of CR networks in terms of secondary users' throughput and spectrum handoff rate. © 2011 Springer Science+Business Media, LLC.
Hagelstein, B, Abolhasan, M, Franklin, D & Safaei, F 2013, 'Improving fairness in IEEE 802.11 networks using MAC layer opportunistic retransmission', COMPUTER NETWORKS, vol. 57, no. 17, pp. 3410-3427.
View/Download from: Publisher's site
View description>>
This paper introduces DAFMAC (Decode And Forward MAC), a scalable opportunistic cooperative retransmission enhancement for the IEEE 802.11 MAC protocol which operates without the need for additional explicit control signalling. Distributed opportunistic retransmission algorithms rely on selecting a single suitable relay without direct arbitration between nodes. Simulations show that DAFMAC offers a significant improvement in fairness for both throughput and jitter, giving multiple parallel data flows a more equal opportunity to utilise the channel. DAFMAC cooperative retransmissions are shown to reduce node energy consumption for a given throughput. Further, the DAFMAC relay selection algorithm is shown to scale very well in terms of complexity and memory requirements in comparison to other cooperative retransmission schemes. © 2013 Elsevier B.V. All rights reserved.
Huang, Y & Huang, X 2013, 'Detection of Temporally Correlated Signals over Multipath Fading Channels', IEEE Transactions on Wireless Communications, vol. 12, no. 3, pp. 1290-1299.
View/Download from: Publisher's site
View description>>
An optimal detection method along with two reduced-complexity methods, modified energy detection (MED) and equal gain detection (EGD), under low signal-to-noise ratio (SNR) condition are proposed in this paper for detection of temporally correlated signals over multipath fading channels. By incorporating resolvable multipaths and multiple antennas into system model, these detection methods are derived based on maximum log-likelihood ratio (LLR) test principal and using the same low SNR LLR approximation. Analytical performance expressions for MED and EGD are also given. Simulation results show that, when signal exhibits temporal correlation, the proposed optimal detection and EGD achieve better performance than conventional generalized likelihood ratio test through utilizing multipath propagation. Further, the proposed MED is superior to conventional energy detection if it a priori signal temporal correlation information is exploited. It is also revealed that multipath tap correlation can have either constructive or destructive effect to spectrum sensing. The proposed EGD is proven to be a practical technique for reliable spectrum sensing over multipath fading channels as it approaches optimal performance with low complexity. © 2002-2012 IEEE.
Jamdagni, A, Tan, Z, He, X, Nanda, P & Liu, RP 2013, 'RePIDS: A multi tier Real-time Payload-based Intrusion Detection System', Computer Networks, vol. 57, no. 3, pp. 811-824.
View/Download from: Publisher's site
View description>>
Intrusion Detection System (IDS) deals with huge amount of network traffic and uses large feature set to discriminate normal pattern and intrusive pattern. However, most of existing systems lack the ability to process data for real-time anomaly detection. In this paper, we propose a 3-Tier Iterative Feature Selection Engine (IFSEng) for feature subspace selection. Principal Component Analysis (PCA) technique is used for the pre-processing of data. Mahalanobis Distance Map (MDM) is used to discover hidden correlations between the features and between the packets. We also propose a novel Real-time Payload-based Intrusion Detection System (RePIDS) that integrates a 3-Tier IFSEng and the MDM approach. Mahalanobis Distance (MD) dissimilarity criterion is used to classify each packet as either a normal or an attack packet. The effectiveness of the proposed RePIDS is evaluated using DARPA 99 dataset and Georgia Institute of Technology attack dataset. The traffic for Web-based application is considered for validating our model. F-value, a criterion, is used to evaluate the detection performance of RePIDS. Experimental results show that RePIDS achieves better performance (high F-values, 0.9958 for DARPA 99 dataset and 0.976 for Georgia Institute of Technology attack dataset respectively, with only 0.85% false alarm rate) and lower computational complexity when compared against two state-of-the-art payload-based intrusion detection systems. Additionally, it has 1.3 time higher throughput in comparison with real scenario of medium sized enterprise network. © 2012 Elsevier B.V. All rights reserved.
Kale, A, Chaczko, Z & Rudas, I 2013, 'Managing Dynamism of Multimodal Detection in Machine Vision Using Selection of Phenotypes', Computer Aided Systems Theory -- EUROCAST 2013, vol. 8112, no. 1, pp. 483-490.
View/Download from: Publisher's site
View description>>
Multimodal Sensor Vision is a technique for detecting objects in dynamic and uncertain environmental conditions. In this research, a new approach for automated feature subset selection-mechanism is proposed that combines a set of features acquired from multiple sensors. Based on changing environmental conditions, the merits of respective sensory data can be assessed and the feature subset optimized, using genetic operators. Genetic Algorithms (GAs) with problem specific modifications improve reliability and adaptability of the detection process. In the new approach, a traditional GA is customized by combining the problem profiled encoding with a specialized operator. Application of an additional operator prioritizes and switches within the feature subsets of the algorithm, allowing a feature level aggregation that uses the most prominent features. The approach offers a more robust and a better performing Machine Vision processing.
Krunz, M, Siam, MZ & Nguyen, DN 2013, 'Clustering and power management for virtual MIMO communications in wireless sensor networks', Ad Hoc Networks, vol. 11, no. 5, pp. 1571-1587.
View/Download from: Publisher's site
View description>>
Multi-input multi-output (MIMO) is a well-established technique for increasing the link throughput, extending the transmission range, and/or reducing energy consumption. In the context of wireless sensor networks (WSNs), even if each node is equipped with a single antenna, it is possible to group several nodes to form a virtual antenna array, which can act as the transmitting or receiving end of a virtual MIMO (VMIMO) link. In this paper, we propose energy-efficient clustering and power management schemes for virtual MIMO operation in a multi-hop WSN. Our schemes are integrated into a comprehensive protocol, called cooperative MIMO (CMIMO), which involves clustering the WSN into several clusters, each managed by up to two cluster heads (CHs); a master CH (MCH) and a slave CH (SCH). The MCH and SCH collect data from their cluster members during the intra-cluster communications phase and communicate these data to neighboring MCHs/SCHs via an inter-cluster VMIMO link. CMIMO achieves energy efficiency by proper selection of the MCHs and SCHs, adaptation of the antenna elements and powers in the inter-cluster communications phase, and using a cross-layer MIMO-aware route selection algorithm for multi-hop operation. We formally establish the conditions on the transmission powers of CHs and non-CHs that ensure the connectivity of the inter-cluster topology. Simulations are used to study the performance of CMIMO. The simulation results indicate that our proposed protocol achieves significant reduction in energy consumption and longer network life time, compared with non-adaptive clustered WSNs. © 2013 Elsevier B.V.
Kusakunniran, W, Wu, Q, Zhang, J, Ma, Y & Li, H 2013, 'A New View-Invariant Feature for Cross-View Gait Recognition', IEEE Transactions on Information Forensics and Security, vol. 8, no. 10, pp. 1642-1653.
View/Download from: Publisher's site
View description>>
Human gait is an important biometric feature which is able to identify a person remotely. However, change of view causes significant difficulties for recognizing gaits. This paper proposes a new framework to construct a new view-invariant feature for cross-view gait recognition. Our view-normalization process is performed in the input layer (i.e., on gait silhouettes) to normalize gaits from arbitrary views. That is, each sequence of gait silhouettes recorded from a certain view is transformed onto the common canonical view by using corresponding domain transformation obtained through invariant low-rank textures (TILTs). Then, an improved scheme of procrustes shape analysis (PSA) is proposed and applied on a sequence of the normalized gait silhouettes to extract a novel view-invariant gait feature based on procrustes mean shape (PMS) and consecutively measure a gait similarity based on procrustes distance (PD). Comprehensive experiments were carried out on widely adopted gait databases. It has been shown that the performance of the proposed method is promising when compared with other existing methods in the literature.
Le, LB, Niyato, D, Hossain, E, Kim, DI & Hoang, DT 2013, 'QoS-Aware and Energy-Efficient Resource Management in OFDMA Femtocells', IEEE Transactions on Wireless Communications, vol. 12, no. 1, pp. 180-194.
View/Download from: Publisher's site
Li, Y, Jia, W, Shen, C & Hengel, AVD 2013, 'Characterness: An Indicator of Text in the Wild', IEEE Transactions on Image Processing, vol. 23, no. 4, pp. 1666-1677.
View/Download from: Publisher's site
View description>>
Text in an image provides vital information for interpreting its contents,and text in a scene can aide with a variety of tasks from navigation, toobstacle avoidance, and odometry. Despite its value, however, identifyinggeneral text in images remains a challenging research problem. Motivated by theneed to consider the widely varying forms of natural text, we propose abottom-up approach to the problem which reflects the `characterness' of animage region. In this sense our approach mirrors the move from saliencydetection methods to measures of `objectness'. In order to measure thecharacterness we develop three novel cues that are tailored for characterdetection, and a Bayesian method for their integration. Because text is made upof sets of characters, we then design a Markov random field (MRF) model so asto exploit the inherent dependencies between characters. We experimentally demonstrate the effectiveness of our characterness cues aswell as the advantage of Bayesian multi-cue integration. The proposed textdetector outperforms state-of-the-art methods on a few benchmark scene textdetection datasets. We also show that our measurement of `characterness' issuperior than state-of-the-art saliency detection models when applied to thesame task.
Liu, RP, Hedley, M & Yang, X 2013, 'WLAN Location Service with TXOP', IEEE Transactions on Computers, vol. 62, no. 3, pp. 589-598.
View/Download from: Publisher's site
View description>>
The provision of location-based services with high positional accuracy requires the use of Time of Arrival (TOA)-based techniques. However, existing TOA-based WLAN location service schemes are inefficient due to the individual query and response ranging method employed. We present a highly efficient WLAN location service architecture which includes a modification to the Transmit Opportunity (TXOP) technique in the IEEE 802.11e standard. Our Location Service with TXOP (LSOP) scheme achieves high efficiency by minimizing the number of TOA transmissions and eliminating the contention overhead for TOA messages. The adaptation of TXOP technique also improves location accuracy by protecting TOA messages from collision and by grouping the TOA messages into one compact burst. Our analysis shows that the LSOP scheme achieves the highest location update rate compared to previous schemes. Our simulation results show that the LSOP scheme has minimum impact on data traffic and achieves higher accuracy than the previous schemes. Experimental results demonstrate the degradation in localization performance caused by packet collisions. These results validate that our LSOP scheme, which implements contention-free broadcast of TOA messages with a modified TXOP, provides the best combination of high location update rate, low network load, and high location accuracy compared to other schemes. © 1968-2012 IEEE.
Liu, RP, Sutton, GJ & Collings, IB 2013, 'Errata to the paper 'A New Queueing Model for QoS Analysis of IEEE 802.11 DCF with Finite Buffer and Load' [Aug 10 2664-2675]', IEEE Transactions on Wireless Communications, vol. 12, no. 10, pp. 5374-5374.
View/Download from: Publisher's site
Lu, S, Zhang, J, Wang, Z & Feng, DD 2013, 'Fast human action classification and VOI localization with enhanced sparse coding', Journal of Visual Communication and Image Representation, vol. 24, no. 2, pp. 127-136.
View/Download from: Publisher's site
View description>>
Sparse coding which encodes the natural visual signal into a sparse space for visual codebook generation and feature quantization, has been successfully utilized for many image classification applications. However, it has been seldom explored for many video analysis tasks. In particular, the increased complexity in characterizing the visual patterns of diverse human actions with both the spatial and temporal variations imposes more challenges to the conventional sparse coding scheme. In this paper, we propose an enhanced sparse coding scheme through learning discriminative dictionary and optimizing the local pooling strategy. Localizing when and where a specific action happens in realistic videos is another challenging task. By utilizing the sparse coding based representations of human actions, this paper further presents a novel coarse-to-fine framework to localize the Volumes of Interest (VOIs) for the actions. Firstly, local visual features are transformed into the sparse signal domain through our enhanced sparse coding scheme. Secondly, in order to avoid exhaustive scan of entire videos for the VOI localization, we extend the Spatial Pyramid Matching into temporal domain, namely Spatial Temporal Pyramid Matching, to obtain the VOI candidates. Finally, a multi-level branch-and-bound approach is developed to refine the VOI candidates. The proposed framework is also able to avoid prohibitive computations in local similarity matching (e.g., nearest neighbors voting). Experimental results on both two popular benchmark datasets (KTH and YouTube UCF) and the widely used localization dataset (MSR) demonstrate that our approach reduces computational cost significantly while maintaining comparable classification accuracy to that of the state-of-the-art methods. © 2012 Elsevier Inc. All rights reserved.
Masihpour, M, Franklin, DR & Abolhasan, M 2013, 'Multihop Relay Techniques for Communication Range Extension in Near-Field Magnetic Induction Communication Systems.', J. Networks, vol. 8, no. 5, pp. 999-1011.
View/Download from: Publisher's site
View description>>
In this paper, multihop relaying in RF-based communications and near field magnetic induction communication (NFMIC) is discussed. Three multihop relay strategies for NFMIC are proposed: Non Line of Sight Magnetic Induction Relay (NLoS-MI Relay), Non Line of Sight Master/Assistant Magnetic Induction Relay1 (NLoS-MAMI Relay1) and Non Line of Sight Master/Assistant Magnetic Induction Relay2 (NLoSMAMI Relay2). In the first approach only one node contributes to the communication, while in the other two techniques (which are based on a master-assistant strategy), two relaying nodes are employed. This paper shows that these three techniques can be used to overcome the problem of dead spots within a body area network and extend the communication range without increasing the transmission power and the antenna size or decreasing receiver sensitivity. The impact of the separation distance between the nodes on the achievable RSS and channel data rate is evaluated for the three techniques. It is demonstrated that the technique which is most effective depends on the specific network topology. Optimum selection of nodes as relay master and assistant based on the location of the nodes is discussed. The paper also studies the impact of the quality factor on achievable data rate. It is shown that to obtain the highest data rate, the optimum quality factor needs to be determined for each proposed cooperative communication method.
Movassaghi, S, Abolhasan, M & Lipman, J 2013, 'A Review of Routing Protocols in Wireless Body Area Networks', Journal of Networks, vol. 8, no. 3, pp. 559-575.
View/Download from: Publisher's site
View description>>
Recent technological advancements in wireless communication, integrated circuits and Micro-Electro-Mechanical Systems (MEMs) has enabled miniaturized, low-power, intelligent, invasive/ non-invasive micro and nano-technology sensor nodes placed in or on the human body for use in monitoring body function and its immediate environment referred to as Body Area Networks (BANs). BANs face many stringent requirements in terms of delay, power, temperature and network lifetime which need to be taken into serious consideration in the design of different protocols. Since routing protocols play an important role in the overall system performance in terms of delay, power consumption, temperature and so on, a thorough study on existing routing protocols in BANs is necessary. Also, the specific challenges of BANs necessitates the design of new routing protocols specifically designed for BANs. This paper provides a survey of existing routing protocols mainly proposed for BANs. These protocols are further classified into five main categories namely, temperature based, cross-layer, cluster based, cost-effective and QoS-based routing, where each protocol is described under its specified category. Also, comparison among routing protocols in each category is given. © 2013 ACADEMY PUBLISHER.
Nguyen, DN & Krunz, M 2013, 'Cooperative MIMO in wireless networks: recent developments and challenges', IEEE Network, vol. 27, no. 4, pp. 48-54.
View/Download from: Publisher's site
View description>>
Cooperative multiple-input multiple-output (CMIMO) is a form of cooperative communications. CMIMO emulates the functionality of multi-antenna systems by grouping wireless devices to operate as virtual multi-antenna nodes. Its main objectives are to boost network throughput, conserve energy, and improve network coverage. In this article, we discuss recent applications of CMIMO in contemporary wireless networks, including wireless sensor, mobile ad hoc, wireless LAN, cognitive, and cellular networks. We first review CMIMO techniques at the physical layer. We then focus on state-of-the-art approaches for realizing CMIMO at the network layer, and classify these approaches based on their objectives and application scenarios, and how they exploit CMIMO gains. We highlight several open issues that present challenges to practical deployment of CMIMO. © 1986-2012 IEEE.
Ni, W, Collings, IB & Liu, RP 2013, 'Decentralized User-Centric Scheduling with Low Rate Feedback for Mobile Small Cells', IEEE Transactions on Wireless Communications, vol. 12, no. 12, pp. 6106-6120.
View/Download from: Publisher's site
View description>>
Small cells with wireless backhaul are promising, whereas challenges of severe overlapping coverage and strong interference are yet to be addressed. Coordinating small cells could resolve the challenges; however, existing multicell coordinated beamforming techniques involve high cost of communication overhead, synchronization and backhaul. Such problems may deteriorate in practical cellular applications, where there could be many users, each generating high channel feedback overhead to compete for an opportunity of being scheduled, and the downlink data signals of the coordinated cells need to be precisely synchronized at each of the users. We propose a new scheme, which cuts the overhead by 80% and enables the coordination to be practically implemented in a decentralized manner. Our scheme is a user-centric downlink scheduling approach, where mobile terminals trigger and participate in the scheduling decisions of small cells. We also develop a new recursive algorithm to optimize the quantization levels of mobile terminals' feedback, minimizing the feedback requirement. Analysis, confirmed by simulations, shows that our scheme is able to achieve 94.4% of the sum-rate upper-bound which can only be approached by idealized centralized coordination. In terms of throughput, given the 80% reduced overhead, our scheme is 139.5% better than the idealized centralized coordination approach. © 2013 IEEE.
Niazi, M, Ikram, N, Gill, AQ & Ul Hassan, MR 2013, 'Special Issue on 'Empirical Studies in Software Engineering'', IET SOFTWARE, vol. 7, no. 6, pp. 295-297.
View/Download from: Publisher's site
Qin, P-Y, Guo, YJ & Ding, C 2013, 'A Beam Switching Quasi-Yagi Dipole Antenna', IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, vol. 61, no. 10, pp. 4891-4899.
View/Download from: Publisher's site
View description>>
A high gain beam switching pattern reconfigurable quasi-Yagi dipole antenna is presented for wireless local area network (WLAN) systems at 5.2 GHz. The antenna consists of a microstrip-to-coplanar stripline (CPS) balun, the length of which can be controlled by using PIN diodes. The change of the length of the balun allows the currents on the two arms of the dipole to have different phase differences, thereby making the antenna operate at three states with the E-plane maximum beam direction towards 20°, -20°, and 0°, respectively. In order to validate the design method, a prototype of the proposed antenna with a practical biasing network was fabricated and measured. Measured results on the reflection coefficients, radiation patterns, and realized gains for three operating states are provided, which agree well with the numerical simulations. © 1963-2012 IEEE.
Qin, P-Y, Guo, YJ & Ding, C 2013, 'A Dual-Band Polarization Reconfigurable Antenna for WLAN Systems', IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, vol. 61, no. 11, pp. 5706-5713.
View/Download from: Publisher's site
View description>>
A new microstrip dual-band polarization reconfigurable antenna is presented for wireless local area network (WLAN) systems operating at 2.4 and 5.8 GHz. The antenna consists of a square microstrip patch that is aperture coupled to a microstrip line located along the diagonal line of the patch. The dual-band operation is realized by employing the TM10 and TM30 modes of the patch antenna. Four shorting posts are inserted into the patch to adjust the frequency ratio of the two modes. The center of each edge of the patch is connected to ground via a PIN diode for polarization switching. By switching between the different states of PIN diodes, the proposed antenna can radiate either horizontal, vertical, or 45° linear polarization in the two frequency bands. Measured results on reflection coefficients and radiation patterns agree well with numerical simulations. © 1963-2012 IEEE.
Qu, Z, Wang, J, Xu, M & Lu, H 2013, 'Context-Aware Video Retargeting via Graph Model', IEEE Transactions on Multimedia, vol. 15, no. 7, pp. 1677-1687.
View/Download from: Publisher's site
View description>>
Video retargeting is a crowded but challenging research area. In order to maximally comfort the viewers' watching experience, the most challenging issue is how to retain the spatial shape of important objects while ensure temporal smoothness and coherence. Existing retargeting techniques deal with these spatialoral requirements individually, which preserve the spatial geometry and temporal coherence for each region. However, the spatialoral property of the video content should be context-relevant, i.e., the regions belonging to the same object are supposed to undergo uniform spatialoral transformation. Regardless of the contextual information, the divide-and-rule strategy of existing techniques usually incurs various spatialoral artifacts. In order to achieve satisfactory spatialoral coherent video retargeting, in this paper, a novel context-aware solution is proposed via graph model. First, we employ a grid-based warping framework to preserve the spatial structure and temporal motion trend at the unit of grid cell. Second, we propose a graph-based motion layer partition algorithm to estimate motions of different regions, which simultaneously provides the evaluation of contextual relationship between grid cells while estimating the motions of regions. Third, complementing the salience-based spatialoral information preservation, two novel context constraints are encoded for encouraging the grid cells of the same object to undergo uniform spatial and temporal transformation, respectively. Finally, we formulate the objective function as a quadratic programming problem. Our method achieves a satisfactory spatialoral coherence while maximally avoiding the influence of artifacts. In addition, the grid-cell-wise motion estimation could be calculated every few frames, which obviously improves the speed. Experimental results and comparisons with state-of-the-art methods demonstrate the effectiveness and efficiency of our approach. © 2013 IEEE.
Qumer Gill, A & Bunker, D 2013, 'Towards the development of a cloud‐based communication technologies assessment tool', VINE, vol. 43, no. 1, pp. 57-77.
View/Download from: Publisher's site
View description>>
PurposeIn distributed adaptive development environments (DADE), a primary concern is that of human communication and knowledge sharing among developers. Developers' task performance will be enhanced when their task needs are aligned with the communication media or technology capabilities of the development environment. What are actual communication needs of developers; and how do we enable developers to self‐assess and select appropriate communication technology for their tasks in the DADE. The purpose of this paper is to investigate and present research based on the developers' needs for communication technologies in the context of DADE.Design/methodology/approachThe authors applied an exploratory qualitative research method to investigate, analyze and integrate survey information sourced from 40 developers, to identify their communication technology needs and, based on this information, the authors then set up a practical tool – communication technologies assessment tool (CTAT) to assist developers in the self‐assessment and selection of appropriate communication technologies for their DADE; and also to share this assessment knowledge with other developers or teams located in various DADEs.FindingsThe results of this research suggest that an effective CTAT should be an integral part of the DADE; and a DADE should have a “single source of information” in order to avoid possible communication inconsistencies and ambiguities.Originality/valueThe study results and the resultant CTAT may help developers to make...
Sun, Y, Guo, Y, Ge, Y, Lu, S, Zhou, J & Dutkiewicz, E 2013, 'Improving the Transmission Efficiency by Considering Non-Cooperation in Ad Hoc Networks', The Computer Journal, vol. 56, no. 8, pp. 1034-1042.
View/Download from: Publisher's site
Sutton, GJ, Liu, RP & Collings, IB 2013, 'Modelling IEEE 802.11 DCF Heterogeneous Networks with Rayleigh Fading and Capture', IEEE Transactions on Communications, vol. 61, no. 8, pp. 3336-3348.
View/Download from: Publisher's site
View description>>
In practical radio transmissions, bit error and channel capture are two dominating factors that affect wireless network performance. Previous models have omitted the interaction between bit error and channel capture. We present a homogeneous-network performance-prediction model for a Rayleigh fading channel that incorporates both the capture effect and transmission error into a 3-D Markov Chain. We accurately characterise the interaction between packet error and capture by incorporating them both into the model of the receiver operations. We show how the model can be solved efficiently. The model provides quality of service measures, including packet delay and loss, which are difficult to achieve with other models. Simulation results confirm that our 3-D model accurately predicts the performance for practical SNRs and receiver sensitivities. We demonstrate that our model can be directly applied to call admission control of Voice over IP service with a QoS guarantee in a WiFi network. The model is then extended to heterogeneous networks, where different stations have different packet arrival rates and packet sizes. © 1972-2012 IEEE.
Tao, X-F, Hou, Y-Z, Wang, K-D, He, H-Y & Guo, YJ 2013, 'GPP-Based Soft Base Station Designing and Optimization', Journal of Computer Science and Technology, vol. 28, no. 3, pp. 420-428.
View/Download from: Publisher's site
View description>>
It is generally acknowledged that mobile communication base stations are composed of hardware components such as Field Programming Gate Array (FPGA), Digital Signal Processor (DSP), which promise reliable and fluent services for the mobile users. However, with the increasing demand for energy-efficiency, approaches of low power-consumption and high-flexibility are needed urgently. In this circumstance, General Purpose Processor (GPP) attracts people’s attention for its low-cost and flexibility. Benefited from the development of modern GPP in multi-core, Single Instruction Multiple Data (SIMD) instructions, larger cache, etc., GPPs are capable of performing high-density digital processing. In this paper, we compare several software-defined radio (SDR) prototypes and propose the general architecture of GPP-based soft base stations. Then, the schematic design of resource allocation and algorithm optimization in soft base station implementation are studied. As an application example, a prototype of GPP-based soft base station referring to the 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) is realized and evaluated. To the best of our knowledge, it is the first Soft-LTE prototype ever reported. In the end, we evaluate the timing performance of the LTE soft base station and a packet loss ratio of less than 0.003 is obtained. © 2013 Springer Science+Business Media New York & Science Press, China.
VEITCH, D, GORST-RASMUSSEN, A & GEFFERTH, A 2013, 'WHY FARIMA MODELS ARE BRITTLE', Fractals, vol. 21, no. 02, pp. 1350012-1350012.
View/Download from: Publisher's site
View description>>
The FARIMA models, which have long-range-dependence (LRD), are widely used in many areas. Through the derivation of a precise characterization of the spectrum and variance time function, we show that this family is very atypical among LRD processes, being extremely close to the fractional Gaussian noise in a precise sense which results in ultra-fast convergence to fGn under rescaling. Furthermore, we show that this closeness property is not robust to additive noise. We argue that the use of FARIMA, and more generally fractionally differenced time series, should be reassessed in some contexts, in particular when convergence rate under rescaling is important and noise is expected.
Wei Ni, Ren Ping Liu, Collings, IB & Xin Wang 2013, 'Indoor cooperative small cells over ethernet', IEEE Communications Magazine, vol. 51, no. 9, pp. 100-107.
View/Download from: Publisher's site
View description>>
The ubiquitous Ethernet has great potential to become an easy-to-install cost-effective backhaul solution for mobile small cells. However, limited Ethernet bandwidth is a practical constraint. Not only is small cell capacity limited by Ethernet bandwidth, but also the synchronization between cells can be substantially compromised. In this article we discuss small cells with Ethernet backhaul, focusing on two practical and important aspects: backhaul bandwidth requirements and tolerance to synchronization errors. The aspects become challenging in indoor small cell applications where the cells need to cooperatively suppress strong interference, producing a large amount of backhaul traffic. To address the challenges, we introduce a new distributed scheme of cooperative small cells over Ethernet. Exploiting a soft information combining technique, the scheme allows the signals of cooperative cells to be combined at aggregate switches along their backhaul paths, reducing backhaul traffic in Ethernet and distributing computational complexity. Our case study shows that the distributed scheme can reduce small cell backhaul traffic by 64 percent, compared to a conventional centralized approach. It is also tolerant to a large frequency error of ±4.6 ppm in a ¿freerun¿ state where synchronization is lost. Given the substantially reduced backhaul traffic, the new distributed scheme is able to support three times the cooperative small cells of the conventional centralized approach. © 1979-2012 IEEE. © 2013 IEEE.
Xin, J, Chen, K, Bai, L, Liu, D & Zhang, J 2013, 'Depth Adaptive Zooming Visual Servoing for a Robot with a Zooming Camera', International Journal of Advanced Robotic Systems, vol. 10, no. 2, pp. 120-120.
View/Download from: Publisher's site
View description>>
To solve the view visibility problem and keep the observed object in the field of view (FOV) during the visual servoing, a depth adaptive zooming visual servoing strategy for a manipulator robot with a zooming camera is proposed. Firstly, a zoom control mechanism is introduced into the robot visual servoing system. It can dynamically adjust the camera's field of view to keep all the feature points on the object in the field of view of the camera and get high object local resolution at the end of visual servoing. Secondly, an invariant visual servoing method is employed to control the robot to the desired position under the changing intrinsic parameters of the camera. Finally, a nonlinear depth adaptive estimation scheme in the invariant space using Lyapunov stability theory is proposed to estimate adaptively the depth of the image features on the object. Three kinds of robot 4DOF visual positioning simulation experiments are conducted. The simulation experiment results show that the proposed approach has higher positioning precision. © 2013 Xin et al.
Xinwang Liu, Jianping Yin, Lei Wang, Lingqiao Liu, Jun Liu, Chenping Hou & Jian Zhang 2013, 'An Adaptive Approach to Learning Optimal Neighborhood Kernels', IEEE Transactions on Cybernetics, vol. 43, no. 1, pp. 371-384.
View/Download from: Publisher's site
View description>>
Learning an optimal kernel plays a pivotal role in kernel-based methods. Recently, an approach called optimal neighborhood kernel learning (ONKL) has been proposed, showing promising classification performance. It assumes that the optimal kernel will reside in the neighborhood of a 'pre-specified' kernel. Nevertheless, how to specify such a kernel in a principled way remains unclear. To solve this issue, this paper treats the pre-specified kernel as an extra variable and jointly learns it with the optimal neighborhood kernel and the structure parameters of support vector machines. To avoid trivial solutions, we constrain the pre-specified kernel with a parameterized model. We first discuss the characteristics of our approach and in particular highlight its adaptivity. After that, two instantiations are demonstrated by modeling the pre-specified kernel as a common Gaussian radial basis function kernel and a linear combination of a set of base kernels in the way of multiple kernel learning (MKL), respectively. We show that the optimization in our approach is a min-max problem and can be efficiently solved by employing the extended level method and Nesterov's method. Also, we give the probabilistic interpretation for our approach and apply it to explain the existing kernel learning methods, providing another perspective for their commonness and differences. Comprehensive experimental results on 13 UCI data sets and another two real-world data sets show that via the joint learning process, our approach not only adaptively identifies the pre-specified kernel, but also achieves superior classification performance to the original ONKL and the related MKL algorithms. © 2012 IEEE.
Xinwang Liu, Lei Wang, Jianping Yin, En Zhu & Jian Zhang 2013, 'An Efficient Approach to Integrating Radius Information into Multiple Kernel Learning', IEEE Transactions on Cybernetics, vol. 43, no. 2, pp. 557-569.
View/Download from: Publisher's site
View description>>
Integrating radius information has been demonstrated by recent work on multiple kernel learning (MKL) as a promising way to improve kernel learning performance. Directly integrating the radius of the minimum enclosing ball (MEB) into MKL as it is, however, not only incurs significant computational overhead but also possibly adversely affects the kernel learning performance due to the notorious sensitivity of this radius to outliers. Inspired by the relationship between the radius of the MEB and the trace of total data scattering matrix, this paper proposes to incorporate the latter into MKL to improve the situation. In particular, in order to well justify the incorporation of radius information, we strictly comply with the radius-margin bound of support vector machines (SVMs) and thus focus on the ℓ2-norm soft-margin SVM classifier. Detailed theoretical analysis is conducted to show how the proposed approach effectively preserves the merits of incorporating the radius of the MEB and how the resulting optimization is efficiently solved. Moreover, the proposed approach achieves the following advantages over its counterparts: 1) more robust in the presence of outliers or noisy training samples; 2) more computationally efficient by avoiding the quadratic optimization for computing the radius at each iteration; and 3) readily solvable by the existing off-the-shelf MKL packages. Comprehensive experiments are conducted on University of California, Irvine, protein subcellular localization, and Caltech-101 data sets, and the results well demonstrate the effectiveness and efficiency of our approach. © 2012 IEEE.
Xu, D-Y, Yang, S-L & Liu, R-P 2013, 'A mixture of HMM, GA, and Elman network for load prediction in cloud-oriented data centers', Journal of Zhejiang University SCIENCE C, vol. 14, no. 11, pp. 845-858.
View/Download from: Publisher's site
View description>>
The rapid growth of computational power demand from scientific, business, and Web applications has led to the emergence of cloud-oriented data centers. These centers use pay-as-you-go execution environments that scale transparently to the user. Load prediction is a significant cost-optimal resource allocation and energy saving approach for a cloud computing environment. Traditional linear or nonlinear prediction models that forecast future load directly from historical information appear less effective. Load classification before prediction is necessary to improve prediction accuracy. In this paper, a novel approach is proposed to forecast the future load for cloud-oriented data centers. First, a hidden Markov model (HMM) based data clustering method is adopted to classify the cloud load. The Bayesian information criterion and Akaike information criterion are employed to automatically determine the optimal HMM model size and cluster numbers. Trained HMMs are then used to identify the most appropriate cluster that possesses the maximum likelihood for current load. With the data from this cluster, a genetic algorithm optimized Elman network is used to forecast future load. Experimental results show that our algorithm outperforms other approaches reported in previous works. © 2013 Journal of Zhejiang University Science Editorial Office and Springer-Verlag Berlin Heidelberg.
Xu, M, Xu, C, He, X, Jin, JS, Luo, S & Rui, Y 2013, 'Hierarchical affective content analysis in arousal and valence dimensions', Signal Processing, vol. 93, no. 8, pp. 2140-2150.
View/Download from: Publisher's site
View description>>
Different from the existing work focusing on emotion type detection, the proposed approach in this paper provides flexibility for users to pick up their favorite affective content by choosing either emotion intensity levels or emotion types. Specifically, we propose a hierarchical structure for movie emotions and analyze emotion intensity and emotion type by using arousal and valence related features hierarchically. Firstly, three emotion intensity levels are detected by using fuzzy c-mean clustering on arousal features. Fuzzy clustering provides a mathematical model to represent vagueness, which is close to human perception. Then, valence related features are used to detect five emotion types. Considering video is continuous time series data and the occurrence of a certain emotion is affected by recent emotional history, conditional random fields (CRFs) are used to capture the context information. Outperforming Hidden Markov Model, CRF relaxes the independence assumption for states required by HMM and avoids bias problem. Experimental results show that CRF-based hierarchical method outperforms the one-step method on emotion type detection. User study shows that majority of the viewers prefer to have option of accessing movie content by emotion intensity levels. Majority of the users are satisfied with the proposed emotion detection. © 2012 Elsevier B.V.
Yang, X, Tao, X, Dutkiewicz, E, Huang, X, Guo, YJ & Cui, Q 2013, 'Energy-Efficient Distributed Data Storage for Wireless Sensor Networks Based on Compressed Sensing and Network Coding', IEEE Transactions on Wireless Communications, vol. 12, no. 10, pp. 5087-5099.
View/Download from: Publisher's site
View description>>
Recently, distributed data storage (DDS) for Wireless Sensor Networks (WSNs) has attracted great attention, especially in catastrophic scenarios. Since power consumption is one of the most critical factors that affect the lifetime of WSNs, the energy efficiency of DDS in WSNs is investigated in this paper. Based on Compressed Sensing (CS) and network coding theories, we propose a Compressed Network Coding based Distributed data Storage (CNCDS) scheme by exploiting the correlation of sensor readings. The CNCDS scheme achieves high energy efficiency by reducing the total number of transmissions Nttot and receptions Nrtot during the data dissemination process. Theoretical analysis proves that the CNCDS scheme guarantees good CS recovery performance. In order to theoretically verify the efficiency of the CNCDS scheme, the expressions for Nttot and Nrtot are derived based on random geometric graphs (RGG) theory. Furthermore, based on the derived expressions, an adaptive CNCDS scheme is proposed to further reduce N ttot and Nrtot. Simulation results validate that, compared with the conventional ICStorage scheme, the proposed CNCDS scheme reduces Nttot, Nrtot, and the CS recovery mean squared error (MSE) by up to 55%, 74%, and 76% respectively. In addition, compared with the CNCDS scheme, the adaptive CNCDS scheme further reduces Nttot and N rtot by up to 63% and 32% respectively. © 2002-2012 IEEE.
Ye, S, Liang, X, Wang, W, Geng, J, Jin, R, Guo, YJ & Bird, TS 2013, 'Design of Arbitrarily Shaped Planar Microstrip Antenna Arrays with Improved Efficiency', International Journal of Antennas and Propagation, vol. 2013, pp. 1-10.
View/Download from: Publisher's site
View description>>
A design technique is described for an arbitrarily shaped planar microstrip antenna array with improved radiation efficiency. In order to fully utilize the limited antenna aperture, several basic modules are proposed from which we construct the array. A consideration of the aperture shape shows that with several practical examples a proper combination of these basic modules not only allows the convenient design of arbitrarily-shaped microstrip array, but also helps to improve the aperture radiation efficiency. To confirm the feasibility of the approach, a circular array with 256 elements was constructed and fabricated. Both computed and measured aperture radiation results are compared and these demonstrate that the design technique is effective for arbitrarily-shaped planar microstrip arrays.
Yiwei Yu, Dutkiewicz, E, Xiaojing Huang & Mueck, M 2013, 'Downlink Resource Allocation for Next Generation Wireless Networks with Inter-Cell Interference', IEEE Transactions on Wireless Communications, vol. 12, no. 4, pp. 1783-1793.
View/Download from: Publisher's site
View description>>
This paper presents a novel downlink resource allocation scheme for OFDMA-based next generation wireless networks subject to inter-cell interference (ICI). The scheme consists of radio resource and power allocations, which are implemented separately. Low-complexity heuristic algorithms are first proposed to achieve the radio resource allocation, where graph-based framework and fine physical resource block (PRB) assignment are performed to mitigate major ICI and hence improve the network performance. Given the solution of radio resource allocation, a novel distributed power allocation is then performed to optimize the performance of cell-edge users under the condition that desirable performance for cell-center users must be maintained. The power optimization is formulated as an iterative barrier-constrained water-filling problem and solved by using the Lagrange method. Simulation results indicate that our proposed scheme can achieve significantly balanced performance improvement between cell-edge and cell-center users in multi-cell networks compared with other schemes, and therefore realize the goal of future wireless networks in terms of providing high performance to anyone from anywhere. © 2002-2012 IEEE.
Yu, K & Dutkiewicz, E 2013, 'NLOS Identification and Mitigation for Mobile Tracking', IEEE Transactions on Aerospace and Electronic Systems, vol. 49, no. 3, pp. 1438-1452.
View/Download from: Publisher's site
View description>>
A non-line-of-sight (NLOS) mitigation approach is presented for network-based mobile tracking. A distance smoothing method is proposed, which uses online line-of-sight (LOS) and NLOS identification. A technique is proposed to integrate distance, mobile velocity, and heading estimates for position determination through Kalman filtering. Hypothesis testing analysis is performed to provide a guideline for selecting the threshold values. Simulation results demonstrate that the proposed approach significantly improves position accuracy as compared with the existing algorithms. © 1965-2011 IEEE.
Zare Borzeshi, E, Piccardi, M, Riesen, K & Bunke, H 2013, 'Discriminative prototype selection methods for graph embedding', Pattern Recognition, vol. 46, no. 6, pp. 1648-1657.
View/Download from: Publisher's site
View description>>
Graphs possess a strong representational power for many types of patterns. However, a main limitation in their use for pattern analysis derives from their difficult mathematical treatment. One way of circumventing this problem is that of transforming the graphs into a vector space by means of graph embedding. Such an embedding can be conveniently obtained by using a set of prototype graphs and a dissimilarity measure. However, when we apply this approach to a set of class-labelled graphs, it is challenging to select prototypes capturing both the salient structure within each class and inter-class separation. In this paper, we introduce a novel framework for selecting a set of prototypes from a labelled graph set taking their discriminative power into account. Experimental results showed that such a discriminative prototype selection framework can achieve superior results in classification compared to other well-established prototype selection approaches. © 2012 Elsevier Ltd.
Zhang, JA 2013, 'Response to 'On Mathematical Equivalence Between Vector OFDM and Quadrature OFDMA'', IEEE Transactions on Communications, vol. 61, no. 2, pp. 815-815.
View/Download from: Publisher's site
Zhang, JA, Collings, IB, Chen, CS, Roullet, L, Luo, L, Ho, S-W & Yuan, J 2013, 'Evolving small-cell communications towards mobile-over-FTTx networks', IEEE Communications Magazine, vol. 51, no. 12, pp. 92-101.
View/Download from: Publisher's site
View description>>
Small cell techniques are recognized as the best way to deliver high capacity for broadband cellular communications. Femtocell and distributed antenna systems (DASs) are important components in the overall small cell story, but are not the complete solution. They have major disadvantages of very limited cooperation capability and expensive deployment cost, respectively. In this article, we propose a novel mobile-over-FTTx (MoF) network architecture, where an FTTx network is enhanced as an integrated rather than a simple backhauling component of a new mobile network delivering low-cost and powerful small cell solutions. In part, the MoF architecture combines the advantages of femtocells and DASs, while overcoming their disadvantages. Implementation challenges and potential solutions are discussed. Simulation results are presented and demonstrate the strong potential of the MoF in boosting the capacity of mobile networks. © 1979-2012 IEEE.
Zhang, JA, Huang, X, Suzuki, H & Chen, Z 2013, 'Gaussian Approximation Based Interpolation for Channel Matrix Inversion in MIMO-OFDM Systems', IEEE Transactions on Wireless Communications, vol. 12, no. 3, pp. 1407-1417.
View/Download from: Publisher's site
View description>>
Channel matrix inversion, which requires significant hardware resource and computational power, is a very challenging problem in MIMO-OFDM systems. Casting the frequency-domain channel matrix into a polynomial matrix, interpolation-based matrix inversion provides a promising solution to this problem. In this paper, we propose novel algorithms for interpolation based matrix inversion, which require little prior information of the channel matrix and enable the use of simple low-complexity interpolators such as spline and low pass filter interpolators. By invoking the central limit theorem, we show that a Gaussian approximation function well characterizes the power of the polynomial coefficients. Some low-complexity and efficient schemes are then proposed to estimate the parameters of the Gaussian function. With these estimated parameters, we introduce phase shifted interpolation and propose two algorithms which can achieve good interpolation accuracy using general low-complexity interpolators. Simulation results show that up to 85% complexity saving can be achieved with small performance degradation. © 2002-2012 IEEE.
Zhang, JA, Lin Luo & Xiaojing Huang 2013, 'Multicarrier Systems Based on Multistage Layered IFFT Structure', IEEE Signal Processing Letters, vol. 20, no. 7, pp. 665-668.
View/Download from: Publisher's site
View description>>
This letter extends our previous work on layered inverse Fast Fourier Transform (IFFT) structure to a multistage layered IFFT structure where data symbols can input at different stages of the IFFT. We first show that part of the IFFT in the transmitter of an OFDM system can be shifted to the receiver, while a conventional one-tap frequency-domain equalizer is still applicable. We then propose two IFFT split schemes based on decimation-in-time and decimation-in-frequency IFFT algorithms to enable interference-free symbol recovery with simple linear equalizers. Applications of the proposed schemes in multiple access communications are investigated. Simulation results demonstrate the effectiveness of the proposed schemes in improving bit-error-rate performance. © 1994-2012 IEEE.
Zhang, JA, Yang, TT & Chen, Z 2013, 'Under-determined Training and Estimation for Distributed Transmit Beamforming Systems', IEEE Transactions on Wireless Communications, vol. 12, no. 4, pp. 1936-1946.
View/Download from: Publisher's site
View description>>
Distributed transmit beamforming (DTB) can significantly boost the signal-to-noise ratio (SNR) of a wireless communication system. To realize the benefits of DTB, generating and feeding back beamforming vector are very challenging tasks. Existing schemes have either enormous overhead or weak robustness in noisy channels. In this paper, we investigate the design of training sequences and beamforming vector estimators in DTB systems. We consider an under-determined case, where the length of training sequence N sent from each node is smaller than the number of source nodes M. We derive the optimal estimation of the beamforming vector that maximizes the beamforming gain and show that it can be well approximated as the linear minimum mean square error (LMMSE) estimator. Based on the LMMSE estimator, we investigate the optimal design of training sequences and propose efficient DTB schemes. We analytically show that these schemes can achieve approximately N times increased SNR in uncorrelated channels, and even higher gain in correlated ones. We also propose a concatenated training scheme which optimally combines the training signals over multiple frames to obtain the beamforming vector. Simulation results demonstrate that the proposed DTB schemes can yield significant gains even at very low SNRs, with total feedback bits much less than those required in the existing schemes. © 2002-2012 IEEE.
Zhu, H & Chu, Q-X 2013, 'Compact Ultra-Wideband (UWB) Bandpass Filter Using Dual-Stub-Loaded Resonator (DSLR)', IEEE Microwave and Wireless Components Letters, vol. 23, no. 10, pp. 527-529.
View/Download from: Publisher's site
Zhu, H & Chu, Q-X 2013, 'Ultra-Wideband Bandpass Filter With a Notch-Band Using Stub-Loaded Ring Resonator', IEEE Microwave and Wireless Components Letters, vol. 23, no. 7, pp. 341-343.
View/Download from: Publisher's site
Al-Jaafreh, AO, Gill, A, Al-Ani, A, Al-adaileh, R & Alzoubi, Y 1970, 'Factors influencing customer's initial trust of internet banking services in the Jordanian context: A review', Creating Global Competitive Economies: 2020 Vision Planning and Implementation - Proceedings of the 22nd International Business Information Management Association Conference, IBIMA 2013, International Business Information Management, IBIM, Rome, Italy, pp. 281-288.
View description>>
Internet banking services (IBS) offer customers and banks many benefits. IBS have been widely adopted and used in developed countries; however IBS adoption in developing countries such as Jordan is still low. Lack of customer' trust is considered the most important impediment to the use of IBS in developing countries. The aim of this study is to investigate and identify the factors that influence customer's initial trust of IBS in the Jordanian context. This paper adopts the qualitative literature survey approach and reports two main categories: Human category and Information Technology category. Human category includes: personality-based trust, cognition-based trust (Reputation), Institutional-based trust (structural assurance), social factors (culture) and supporting factors (relative advantages). Information Technology category includes: website factors (security, privacy, and general online experiences)). We argue that these factors can be useful for organisations in understanding and addressing customer's initial trust about IBS in the Jordanian context.
Almarwani, A, Alqarni, L, Hakami, H, Chaczko, Z & Min Xu 1970, 'Door wave home automation system', IET International Conference on Smart and Sustainable City 2013 (ICSSC 2013), IET International Conference on Smart and Sustainable City 2013 (ICSSC 2013), Institution of Engineering and Technology, Shanghai, China, pp. 98-103.
View/Download from: Publisher's site
View description>>
The technological developments are focused on automation of control systems. Technology is used in homes to create a digital environment such as controlling room temperature, sundry devices, security and lighting. The design of home automation systems is geared towards the automation of processes like remote control of the home environment appliances. The use of Wireless Sensor and Actuators Networks (WSANs) in home automation is a growing trend. WSANs are based on network architecture and protocols in order to enable a network of integrated devices which monitor and control household apparatus.
Al-Turjman, F, Refai, H, Alsalih, W, Ben-Othman, J, Beraldi, R, Braun, R, Filali, F, Karim, L, Lee, Y, Leung, V, Lu, R, Mišić, J, Moradi, H, Ozturk, S, Radwan, A, Shi, Z, Sulyman, AI, Taha, AE, Zeadally, S, Al-Awami, L, Iftikhar, M, Imran, M, TalebiFard, P & Vijay, G 1970, 'Welcome message from the WLN chairs', 38th Annual IEEE Conference on Local Computer Networks, 38th Annual IEEE Conference on Local Computer Networks (LCN 2013), IEEE, p. 60.
View/Download from: Publisher's site
Arab, P, Heimlich, M & Dutkiewicz, E 1970, 'Investigation of radar localization system accuracy for human gastro intestine (GI) tract', 2013 7th International Symposium on Medical Information and Communication Technology (ISMICT), 2013 7th International Symposium on Medical Information and Communication Technology (ISMICT 2013), IEEE, Japan, pp. 144-148.
View/Download from: Publisher's site
View description>>
Recent developments in capsule endoscopy have highlighted the need for accurate techniques to estimate the location of a capsule endoscope. A high accuracy localization of the order of millimeters is required for endoscopic applications. Location estimation of a capsule endoscope in the gastrointestinal (GI) tract is a challenging problem, as radio frequency signals encounter a high loss and highly dynamic channel propagation environment. In this paper, the characteristics of radio frequency signal absorption inside the human body are investigated with the aim of developing an accurate propagation model. Furthermore, the possibility of using a radar system for capsule localization is investigated and compared to its operation in the 2.4G Hz ISM band. © 2013 IEEE.
Barua, B, Abolhasan, M, Franklin, DR, Safaei, F & IEEE 1970, 'Outage Probability of Multihop Relay Networks', 2013 9TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, IEEE, Sardinia, Italy, pp. 456-460.
View/Download from: Publisher's site
View description>>
In this paper we analyze the outage performance of a multihop cooperative relay network where relays in the system can change positions dynamically and use all possible links to forward the message to the next hop over Rayleigh fading channels. We derive the general closed form expression of outage probability and asymptotic coding gain of the network.
Barua, B, Abolhasan, M, Franklin, DR, Safaei, F & IEEE 1970, 'SEP of Multihop Relay Networks in Nakagami-m Fading Channels', 2013 IEEE 78TH VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), IEEE Vehicular Technology Conference, IEEE, Las Vegas, NV, USA, pp. 1-5.
View/Download from: Publisher's site
View description>>
In this paper we analyze the error performance of a cooperative multihop parallel relay network over Nakagamim fading channels using M-ary Phase-shift keying (MPSK) modulation. We derive the general closed form expression of the symbol error probability (SEP) and present numerical results on the performance of the network. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.
Biswas, J, Ren Ping Liu, Wei Ni, Collings, IB & Jha, SK 1970, 'Joint channel and delay aware user scheduling for multiuser MIMO system over LTE-A network', 2013 IEEE/ACM 21st International Symposium on Quality of Service (IWQoS), 2013 IEEE/ACM 21st International Symposium on Quality of Service (IWQoS), IEEE, Montreal, QC, Canada, pp. 129-136.
View/Download from: Publisher's site
View description>>
Existing mobile video applications are continuously driving up the demand for throughput and better quality of service (QoS) for future Long Term Evolution-Advanced (LTE-A) networks. Multi-User Multiple-Input Multiple-Output (MU-MIMO) is one of the most promising technologies that would meet the throughput demand. Unfortunately, existing MU-MIMO schemes do not consider metrics such as delay, and therefore, cannot meet the QoS requirement of delay sensitive applications, such as mobile video. We propose a new cross-layer MU-MIMO scheduling algorithm, which is referred to as joint channel and delay aware user scheduling (CDAUS), satisfies both the throughput and delay requirements. The key idea of the CDAUS algorithm is to select users to form MU-MIMO based on the delay requirements of individual users, as well as their channel correlations. The priority of the users is carefully designed to leverage their delay and throughput. Simulation results show that the proposed CDAUS algorithm is able to reduce the average delay by up to 30% with a marginal 2% sacrifice of throughput, compared to previous work. It also reduces delay variations and improves fairness among the users. © 2013 IEEE.
Bojovschi, A, Shariati, N, Ghorbani, K & IEEE 1970, 'Analysis of a carbon fibre reinforced polymer slotted waveguide array fed by a loop type end launcher', 2013 ASIA-PACIFIC MICROWAVE CONFERENCE PROCEEDINGS (APMC 2013), Asia-Pacific Microwave Conference, IEEE, Seoul, South Korea, pp. 476-478.
View/Download from: Publisher's site
View description>>
The investigations of an end-launcher transition in Carbon Fibre Reinforced Plastic (CFRP) WR90 waveguides is presented. The applicability of the feed for CFRP slotted waveguide antenna is addressed. Some of the aspects pertaining to the efficiency of CFRP slotted waveguide antenna and its use for radar applications are discussed. The results are presented in comparison with those obtained from the same concepts implemented in aluminium waveguides. A recently implemented anisotropic model for CFRP laminates, which describes the electrical anisotropy of the composite material, was used. The data obtained provide promising indicators for the potential use of slotted waveguide antennas made of CFRP for radar applications. © 2013 IEEE.
Cantoni, A, Zhang, J, Huang, X & Guo, YJ 1970, 'Impact of sampling rate on PSD of OFDM signal with SSOP sidelobe suppression', 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC 2013), IEEE, Darmstadt, Germany, pp. 629-633.
View/Download from: Publisher's site
View description>>
We recently proposed an efficient 'sidelobe suppression with orthogonal projection' (SSOP) scheme for reduction of out-of-band emission of OFDM signals. The SSOP scheme uses a preceding matrix to generate zeros at prescribed frequencies in the sidelobe region and it is numerically observed that its suppression effect is affected by the sampling rate. In this paper, we analytically characterize this effect by considering analog and digital implementations of the SSOP scheme, which correspond to a zero sampling rate and an IFFT implementation with non-zero sampling rates, respectively. Both implementations are modeled and analytical expressions for the corresponding spectra are developed. It is shown that the analytical results match the simulation results very well and the suppression performance is generally proportional to the sampling rate. The analog SSOP-OFDM has true zeros at prescribed frequencies and thus results in significant reduction of out-of-band emissions. The digital implementation does not result in true zeros in the spectrum but nevertheless results in significant sidelobe reduction if the frequency resolution associated with the IFFT is sufficiently high. © 2013 IEEE.
Chaczko, Z & Braun, R 1970, 'Teaching and learning perspective on system development in large teams', 2013 12th International Conference on Information Technology Based Higher Education and Training (ITHET), 2013 12th International Conference on Information Technology Based Higher Education and Training (ITHET), IEEE, Antalya, Turkey, pp. 1-7.
View/Download from: Publisher's site
View description>>
This paper covers aims and objectives, the approaches, shared experiences and issues faced in teaching and learning of the ICT Analysis and ICT Design pair of subjects within the core block of ICT Engineering courses at the Faculty of Engineering and IT, University of Technology, Sydney (UTS) in Australia. Both practice based subjects, synthesize into a coherent whole, teaching and learning components of all subjects in the ICT Engineering curriculum. One of the main goals of the ICTA and ICTD pair is to close the gap between the students' individualistic tendencies, unplanned and unbudgeted efforts, as well as uncoordinated actions that often characterize teaching and learning approaches to engineering subjects. Additionally, modern industry expects from engineering graduates both leadership skills and team based skills in the development of complex systems. This includes the ability to work in well-planned, process driven, budgeted and coordinated environment. Fundamentally, the course's subjects are adaptive and evolutionary; however, the key challenge is to keep a fine balance between academic concerns and fast changing
Chaczko, Z, Braun, R & Jizan, A 1970, 'A virtual stock exchange simulator for education and training', 2013 12th International Conference on Information Technology Based Higher Education and Training (ITHET), 2013 12th International Conference on Information Technology Based Higher Education and Training (ITHET), IEEE, Antalya, Turkey, pp. 1-6.
View/Download from: Publisher's site
View description>>
The use of an open-source, virtual stock exchange simulators can be seen as a viable alternative for various learners to train trading practice without risking loses of real funds. At present, there is a shortage of suitable tools that could allow entry level users to engage in a real market trading after gaining a certain degree of confidence from practicing in a both very practical and safe environment. Topics covered in this paper, include shared experiences, challenges as well as common issues related to the design and development of a StockET simulation tool for training and education. The developed open source simulation tool is a robust and highly usable solution that can be used for multiple purposes.
Chaczko, Z, Kirkpatrick, S & Braun, R 1970, 'A web-based solution to collect, manage and analyse Auditory Brainstem Response data', 2013 12th International Conference on Information Technology Based Higher Education and Training (ITHET), 2013 12th International Conference on Information Technology Based Higher Education and Training (ITHET), IEEE, Antalya, Turkey, pp. 1-4.
View/Download from: Publisher's site
View description>>
Auditory neuroscience often involves the collection of experiment data from test subjects in the form of non-invasive Auditory Brainstem Responses (ABR). These ABRs are most often used to gauge a subjects hearing threshold. Although rarely; they can be analysed further. Research into ABRs has shown that the presence of brain damage or tumours may be detectable. This can be achieved if large amounts of ABRs are collected and compared. However many laboratories around the world do not keep the data as it is difficult to store and analyse, and sometimes only used for threshold analysis. This results in a huge amount of wasted data and opportunity. The goal of this project was to develop and build a web-based system to collect, manage and analyse ABR data for hearing research. The project was run as an iterative process based on the eXtreme-Programming (XP) methodology. It involved very close contact with the client laboratory. Onsite weekly meetings, demonstrations and experiments were attended to help understand the problem domain. A continuous analysis, design and integration cycle coupled with automated testing and deployment was used throughout the project. Where possible all key aspects of XP development were adhered to and the project managed in this fashion. The final OpenABR system was deployed to a cloud server and is being used by the client laboratory. It has several unique features that no other system of its type possesses. Its dynamic database interface allows scientists the flexibility and reliability they cannot get from standard databases. Future work would focus on expanding the dynamic database interface, integrating more analysis including heuristics and trying to include new data types such as imaging results. © 2013 IEEE.
Chan, KY, Ramer, R & Guo, YJ 1970, 'Switchable waveguide iris filter using planar dipoles', 2013 IEEE MTT-S International Microwave Symposium Digest (MTT), 2013 IEEE/MTT-S International Microwave Symposium - MTT 2013, IEEE, Seattle, WA, USA.
View/Download from: Publisher's site
View description>>
A new concept of switching on and off high Q-factor bandpass filters is presented. Cheap, planar, low Q-factor circuits are proposed to disable 3D filters Reconfigurable dipoles are used to disable resonance and turn the filter off, rather than adjusting the resonance frequency or coupling. Here wire bonded dipoles on quartz substrates inside the waveguide structure are used for switching the bandpass filters. 3-pole bandpass filters are proposed for concept demonstration The dipoles are inserted in each cavity of the iris waveguide filter. Central frequency is 24GHz and bandwidth 500MHz. Simulation results show good performance. The fabricated filter shows good correlation between the measured and simulated performance. The bandpass response is completely off, when the dipoles are "switched on"/connected with bondwires, confirming the introduced concept. The insertion loss is expected to be significantly reduced by choosing a superior fabrication method of the waveguide. © 2013 IEEE.
Chan, KYE, Ramer, R & Guo, YJ 1970, 'RF MEMS millimeter-wave switchable bandpass filter', 2013 IEEE International Wireless Symposium (IWS), 2013 IEEE International Wireless Symposium (IWS), IEEE, Dresden, Germany.
View/Download from: Publisher's site
View description>>
A switchable bandpass filter that can operate between 60 GHz and E-band spectrum, capable of providing good channel isolation is presented. A RF MEMS SPDT is designed for the switching element between the two bands. Back-to-back cantilever switches are used for maximum isolation. New circuit models for the inductively coupled inverters and short circuit stubs are proposed. Measurement results show good correlation to our simulations. Better than 15 dB return loss and 5 dB insertion loss in both 60 GHz and Eband are measured. With the introduction of transmission zero, rejection between the two operational bands is better than 20 dB. © 2013 IEEE.
Changliang Zheng, Dutkiewicz, E, Ren Ping Liu, Vesilo, R & Zheng Zhou 1970, 'Efficient data transmission with random linear coding in multi-channel cognitive radio networks', 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, Shanghai, China, pp. 77-82.
View/Download from: Publisher's site
View description>>
Efficient data transmission in cognitive radio networks (CRNs) is critical for cognitive radio (CR) users to communicate with each other in an opportunistic manner. Even with successful access to required channels, the transmission could still suffer from failures due to channel fading. In this paper, we propose a random linear coded scheme for efficient data transmission in multi-channel CRNs under practical fading channel conditions. We develop theoretical analysis and derive general form solutions for the batch delay associated with the proposed scheme. We also use our theoretical model to analyze the performances of two multi-channel automatic repeat request (ARQ) based schemes. Simulation results validate the analysis and show that the coded scheme outperforms the ARQ based schemes in terms of batch transmission delay. Additionally, the coded scheme is less dependent on feedback channels than the other schemes. © 2013 IEEE.
Cheng, P, Chen, Z, Qiu, C, Gui, L, Guo, YJ & Rui, Y 1970, 'Stream Maximization Transmission for MIMO Systems with Limited Feedback Unitary Precoding', 2013 IEEE 77th Vehicular Technology Conference (VTC Spring), 2013 IEEE 77th Vehicular Technology Conference (VTC Spring), IEEE.
View/Download from: Publisher's site
View description>>
Limited feedback precoding (LFP) significantly improves multiple-input multiple-output (MIMO) spatial multiplexing link reliability with a small amount of feedback from the receiver back to the transmitter. One of the key problems linked to LFP is how to select an optimal precoder from a predetermined unitary codebook. We find that the conventional precoder selection criteria are not applicable to the stream maximization transmission (SMT) mode with linear receivers, including zero forcing (ZF) and minimum mean square error (MMSE) decoders. To solve this issue, a novel singular value decomposition (SVD) based precoder selection criterion is proposed in this paper. This criterion features a unified structure for all the linear receivers such as ZF and MMSE decoders, and is shown by simulation to provide significant coding gains in various SMT systems. With the same complexity as the conventional one, the proposed criterion could find its applications in next generation systems employing SMT spatial multiplexing, significantly improving system performance with affordable feedback requirement. © 2013 IEEE.
Chye, YH, Dutkiewicz, E, Vesilo, R & Liu, RP 1970, 'A QoS-aware cross-layer scheduling scheme for multiuser mixed-traffic cognitive radio networks', 2013 13th International Symposium on Communications and Information Technologies (ISCIT), 2013 13th International Symposium on Communications and Information Technologies (ISCIT), IEEE, Surat Thani, Thailand, pp. 615-620.
View/Download from: Publisher's site
View description>>
The emerging technology of cognitive radio (CR) allows secondary users (SUs) to gain access to radio spectrum which is licensed to but temporarily unoccupied by primary users (PUs). Apart from spectrum sensing, dynamic spectrum access (DSA) is an important processing task for CR networks (CRNs). Its aim is to allocate spectrum for SUs dynamically without causing any harm to PUs. CRNs may support different traffic types that may have different quality of service (QoS) requirements. In order to meet these QoS requirements, channel states, queue states and traffic types should be taken into account in designing DSA schemes. However, traffic types handled by SUs are treated equally in most existing DSA schemes. We propose a cross-layer scheduling scheme by incorporating DSA, packet scheduling and a channel sharing policy to achieve efficient QoS support for SUs with different traffic types. QoS performance of the proposed scheduling scheme is evaluated in terms of average throughput, average packet delay and packet dropping probability for SUs with different traffic types. Simulation results show that the proposed scheduling scheme outperforms the conventional scheduling scheme by providing more efficient QoS support for SUs and higher throughput fairness among SUs as the PU's activity factor increases. © 2013 IEEE.
Chye, YH, Dutkiewicz, E, Vesilo, R & Liu, RP 1970, 'QoS-aware cross-layer scheduling for cognitive radio networks with heterogeneous data traffic', 2013 Australasian Telecommunication Networks and Applications Conference (ATNAC), 2013 Australasian Telecommunication Networks and Applications Conference (ATNAC), IEEE, Christchurch, New Zealand, pp. 213-218.
View/Download from: Publisher's site
View description>>
Cognitive radio (CR) has been an enabling technology for secondary users (SUs) to efficiently exploit radio spectrum underutilized by primary users (PUs). To avoid downgrading PUs' performance, dynamic spectrum access (DSA) plays an important role in CR networks (CRNs) for adaptively assigning spectrum to SUs. During spectrum handover to PUs, quality of service (QoS) of SUs may not be satisfied due to high competition among SUs with different traffic types. However, in most existing DSA schemes, traffic types handled by SUs are treated equally. To achieve QoS satisfaction for SUs with heterogeneous traffic, this paper proposes a new cross-layer scheduling that jointly considers DSA, packet scheduling and a channel sharing policy. QoS performance of the cross-layer scheduling is measured in terms of average throughput, average packet delay and dropping probability for SUs with different traffic types. QoS support for SUs provided by the proposed scheduling scheme incorporating the channel sharing policy is shown to be more efficient and balanced compared to existing scheduling schemes. © 2013 IEEE.
Ding, C, Guo, YJ, Qin, PY, Bird, TS & Yang, Y 1970, 'A novel phase shifter based on reconfigurable defected microstrip structure (RDMS) for beam-steering antennas', ISAP 2013 - Proceedings of the 2013 International Symposium on Antennas and Propagation, IEEE International Symposium on Antennas and Propagation, IEEE, Nanjing, China, pp. 993-996.
View description>>
A low cost phase shifter based on a cascaded reconfigurable defected microstrip structure (RDMS) is proposed. This RDMS unit is produced by etching a slot to introduce a defect on a microstrip line and then PIN diodes are inserted in the defected area. By switching the PIN diodes, the RDMS unit is able to operate in two different states with a phase shift of 17° at 5.2 GHz. The RDMS units can be cascaded for higher phase shift values that may be determined by array design requirements. Phase shifters cascading three and six RDMS units were designed, fabricated, and measured. The measured results show that the two phase shifters introduce 45° and 90° phase shifts, respectively, with low insertion loss. Finally, a four element patch array is proposed with a beamforming network employing the phase shifters and Wilkinson power dividers. The array is able to switch its main beam direction to 0° and ±20° in the H plane and the impedance bandwidth covers the overlapping wireless local area network (WLAN) bands in the vicinity of 5.2 GHz. © 2013 Antenna Society of the Chinese Institute of Electronics.
ding, J, Dutkiewicz, E & Huang, X 1970, 'Energy Efficient Cooperative Communication for UWB Based In-Body Area Networks', Proceedings of the 8th International Conference on Body Area Networks, 8th International Conference on Body Area Networks, ACM, Boston, Massachusetts, pp. 29-34.
View/Download from: Publisher's site
View description>>
© 2013 ICST 978-1-936968-89-3. In this paper, we study the energy efficiency of single relay cooperative transmission for ultra-wideband (UWB) based in-body area networks (IBANs). A simple relay-based cooperative IBAN system model is introduced first. With a target threshold of the received signal-to-noise ratio (SNR), outage probabilities for direct and cooperative transmissions are derived respectively. Afterwards, the average energy consumption per bit is given for both transmission schemes. The optimal relay location for cooperation is also derived and analyzed to minimize the average bit energy consumption. Simulation verifies the analysis and shows that cooperative transmission can achieve a satisfactory improvement on energy efficiency compared with direct transmission over a range of relay locations for UWB based IBANs. The improvement is more significant with a higher SNR threshold or with the implanted sensor having a deeper depth inside the body.
Ding, J, Dutkiewicz, E, Huang, X & Fang, G 1970, 'Energy-efficient cooperative relay selection for UWB based body area networks', 2013 IEEE International Conference on Ultra-Wideband (ICUWB), 2013 IEEE International Conference on Ultra-Wideband (ICUWB), IEEE, Sydney, NSW, Australia, pp. 97-102.
View/Download from: Publisher's site
View description>>
In this paper, an energy-efficient cooperative relay selection scheme is investigated for ultra-wideband (UWB) based wireless body area networks (WBANs). With a realistic nonlinear energy consumption model, the energy consumption for single-relay cooperation is established and the optimal power allocation for cooperation is derived accordingly to minimize the total energy consumption at a given relay location. Afterwards, an energy efficient relay selection criterion is described in detail. Simulation results verify the suitability of the criterion and show that, with the same desired spectral efficiency (SE), direct transmission is preferable for energy saving when the transmitter and receiver are located on the same side of the human body. However, at a suitable relay location and with large transmission distance, cooperative transmission can achieve a significant improvement on energy efficiency compared with direct transmission when the transmitter and receiver are located on the different sides of the human body. © 2013 IEEE.
Fu, J, Wang, J, Li, Z, Xu, M & Lu, H 1970, 'Efficient Clothing Retrieval with Semantic-Preserving Visual Phrases', Lecture Notes in Computer Science, Asian Conference on Computer Vision, Springer Berlin Heidelberg, Singapore, Singapore, pp. 420-431.
View/Download from: Publisher's site
View description>>
In this paper, we address the problem of large scale cross-scenario clothing retrieval with semantic-preserving visual phrases (SPVP). Since the human parts are important cues for clothing detection and segmentation, we firstly detect human parts as the
Gay, V, Leijdekkers, P, Agcanas, J, Wong, F & Wu, Q 1970, 'CaptureMyEmotion: Helping autistic children understand their emotions using facial expression recognition and mobile technologies', 26th Bled eConference - eInnovations: Challenges and Impacts for Individuals, Organizations and Society, Proceedings, Bled eConference - eInnovations: Challenges and Impacts for Individuals, Organizations and Society, Proceedings, AIS Electronic Library (AISeL), Bled, Slovenia, pp. 409-420.
View description>>
One of the main challenges for autistic children is to identify and express emotions. Many emotion-learning apps are available for smartphones and tablets to assist autistic children and their carers. However, they do not use the full potential offered by mobile technology, such as using facial expression recognition and wireless biosensors to recognise and sense emotions. To fill this gap we developed CaptureMyEmotion, an Android App that uses wireless sensors to capture physiological data together with facial expression recognition to provide a very personalised way to help autistic children learn about their emotions. The App enables children to capture photos, videos or sounds, and simultaneously attach emotion data and a self-portrait photo. The material can then be reviewed and discussed together with a carer at a later stage. CaptureMyEmotion has the potential to help autistic children integrate better in the society by providing a new way for them to understand their emotions.
Gay, VC, Leijdekkers, P & Wu, Q 1970, 'Helping Autistic Children Understand Their Emotions Using Facial Expression Recognition and Mobile Technologies', Proceedings of the 26th Bled eConference eInnovations, Bled eConference, AISeL, Bled, Slovenia, pp. 409-420.
View description>>
One of the main challenges for autistic children is to identify and express emotions. Many emotion-learning apps are available for smartphones and tablets to assist autistic children and their carers. However, they do not use the full potential offered by mobile technology, such as using facial expression recognition and wireless biosensors to recognise and sense emotions. To fill this gap we developed CaptureMyEmotion, an Android App that uses wireless sensors to capture physiological data together with facial expression recognition to provide a very personalised way to help autistic children learn about their emotions. The App enables children to capture photos, videos or sounds, and simultaneously attach emotion data and a self-portrait photo. The material can then be reviewed and discussed together with a carer at a later stage. CaptureMyEmotion has the potential to help autistic children integrate better in the society by providing a new way for them to understand their emotions.
Gill, AQ 1970, 'Towards the Development of an Adaptive Enterprise Service System Model Completed Research Paper', AMCIS 2013 PROCEEDINGS, 19th Americas Conference on Information Systems (AMCIS) - Hyperconnected World - Anything, Anywhere, Anytime, ASSOC INFORMATION SYSTEMS, IL, Chicago.
Gill, AQ 1970, 'Towards the Development of an Adaptive Enterprise Service System Model.', AMCIS, Americas Conference on Information Systems, Association for Information Systems, Chicago, IL, USA, pp. 1-9.
View description>>
The continuous adaptation of modern enterprises is largely dependent on their underlying adaptive enterprise architecture capability. However, the establishment of an adaptive enterprise architecture capability requires defining the enterprise context before actually commissioning any enterprise architecture or adaptation work. This paper presents the adaptive enterprise service system (AESS) model based on the Design Science research method and Theory Triangulation approach. The AESS integrates the enterprise context perspectives from three well-known theories of agility, (agent) system, and service science. The AESS model, as a part of the large adaptive enterprise architecture toolkit, defines a modern enterprise as an adaptive enterprise service system. The adaptive enterprise service system is a multi-agent system of service systems that exhibits agility and focuses on the emerging service-centric view as opposed to a traditional product-centric view. The service-centric view of an enterprise is critical for establishing the adaptive enterprise architecture capability for handling complex enterprise transformations.
Gomez-Tornero, JL, Goussetis, G & Guo, J 1970, 'Metasurfing substrate integrated waveguides to mold the radiation from Leaky Waves', Progress in Electromagnetics Research Symposium, Progress in Electromagnetics Research Symposium (PIERS), pp. 206-211.
View description>>
We show our latest developments in the application of the meta surfing concept to Substrate Integrated Waveguide (SIW) technology. It is described how this simple and versatile guiding medium can be conveniently modified and modulated to control the conversion from the conventional TE10 propagating mode to surface or leaky wave with tailored propagation and radiation features. Theoretical aspects and practical designs are described with the general objective of wavefront control (both in amplitude and phase), showing results at Ku band (12-18 GHz) and W band (75-111 GHz), and illustrating a wide range of physical phenomena and interesting potential applications.
Guo, YJ & Gomez-Tornero, JL 1970, 'Reconfigurable Fabry-Pérot Leaky-Wave Antennas', 2013 International Workshop on Antenna Technology (iWAT), 2013 International Workshop on Antenna Technology (iWAT), IEEE, Karlsruhe, Germany, pp. 390-393.
View/Download from: Publisher's site
View description>>
Beam scanning is an inherent property of Leaky-Wave Antennas (LWAs). It is usually achieved by sweeping the operating frequency. For wireless communications, however, it is necessary for the antenna to operate at a fixed frequency while scanning. With one dimensional LWAs, this can be done by electronically reconfiguring the leaky-line boundary condition. By altering the leaky-mode complex propagation constant, one can produce a desired scanning beam. To this end, a number of ideas have been investigated and reported in recent years, including the use of PIN diodes and photosensitive switches. The most used active device for electronically controlling 1D LWAs in microwave frequencies is the varactor diode, which has been applied to a multitude of leaky lines such as the slotline, the coplanar waveguide, the microstrip log-periodic line, the half-mode microstrip line , and the half-mode substrate-integrated waveguide. © 2013 IEEE.
Guo, YJ, Qin, P-Y, Bird, TS & IEEE 1970, 'Reconfigurable Antennas for Wireless Communications', 2013 7TH EUROPEAN CONFERENCE ON ANTENNAS AND PROPAGATION (EUCAP), European Conference on Antennas and Propagation, IEEE, Gothenburg, Sweden, pp. 165-168.
View description>>
An overview of CSIRO's research on frequency, polarization and pattern reconfigurable antennas for wireless communications is presented. We report the latest progress in antennas that can reconfigure several characteristics simultaneously as well as reconfigurable leaky-wave antennas.
Guzman-Quiros, R, Gomez-Tornero, JL, Garcia-Vigueras, M, Weily, AR & Guo, YJ 1970, 'Advances in electronically reconfigurable LWAs in Fabry-Pérot and SIW technologies', 2013 7th European Conference on Antennas and Propagation, EuCAP 2013, pp. 2001-2005.
View description>>
This paper gives an overview of our most recent research results on reconfigurable leaky-wave antennas (LWAs), which have been developed at Universidad Politécnica de Cartagena (Spain) and CSIRO ICT Centre (Australia). Fabry-Pérot and Substrate Integrated Waveguide (SIW) technologies are studied to propose new reconfigurable leaky-wave topologies for beamforming applications. © 2013 EurAAP.
Hagelstein, B, Abolhasan, M, Franklin, D, Safaei, F & IEEE 1970, 'A General Performance Model for MAC Layer Cooperative Retransmission Contention Protocols', 2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), IEEE Global Telecommunications Conference, IEEE, Atlanta, USA, pp. 1584-1589.
View/Download from: Publisher's site
View description>>
Cooperative retransmission schemes can significantly improve transmission reliability and performance over high loss and time-varying links. However, analytically comparing performance between retransmission strategies is challenging and generally requires simplistic assumptions. This paper presents a general model for the performance of distributed, slot-based contention algorithms for opportunistic decode and forward retransmission algorithms. The model is independent of specific modulation or coding schemes and may be adapted to suit statebased transmission probability models. The model is validated through QualNet simulations.
Hasan, MA, Xu, M & He, X 1970, 'A Comprehensive Approach to Automatic Image Browsing for Small Display Devices', The Era of Interactive Media - Pacific-Rim Conference on Multimedia, Pacific-Rim Conference on Multimedia, Springer New York, Sydney, Australia, pp. 267-276.
View/Download from: Publisher's site
View description>>
© 2013 Springer Science+Business Media, LLC. All rights reserved. Recently, small displays are widely used to browse digital images. While using a small display device, the content of the image appears very small. Users have to use manual zooming and panning in order to see the detail of the image on a small display. Hence, an automatic image browsing solution is desired for user convenience. In this chapter, a novel comprehensive and efficient system is proposed to browse high resolution images using small display devices by automatically panning and zooming on Region-of-Interests (ROIs). The challenge is to provide a better user experience on heterogeneous small display sizes. First of all, an input image is classified into one of the three different classes: close-up, landscape and other. Then the ROIs of image are extracted. Finally, ROIs are browsed based on different intuitive and study based strategies. Our proposed system is evaluated by subjective test. Experimental results indicate that the proposed system is an effective large image displaying technique on small display devices.
Homayounfard, H, Kennedy, PJ & Braun, R 1970, 'NARGES: Prediction Model for Informed Routing in a Communications Network', Lecture Notes in Computer Science, Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer Berlin Heidelberg, Gold Coast, Australia, pp. 327-338.
View/Download from: Publisher's site
View description>>
There is a dependency between packet-loss and the delay and jitter time-series derived from a telecommunication link. Multimedia applications such as Voice over IP (VoIP) are sensitive to loss and packet recovery is not a merely efficient solution with the increasing number of Internet users. Predicting packet-loss from network dynamics of past transmissions is crucial to inform the next generation of routers in making smart decisions. This paper proposes a hybrid data mining model for routing management in a communications network, called NARGES. The proposed model is designed and implemented for predicting packet-loss based on the forecasted delays and jitters. The model consists of two parts: a historical symbolic time-series approximation module, called HDAX, and a Multilayer Perceptron (MLP). It is validated with heterogeneous quality of service (QoS) datasets, namely delay, jitter and packet-loss time-series. The results show improved precision and quality of prediction compared to autoregressive moving average, ARMA.
Huang, X, Joseph, J, Zhang, JA & Guo, YJ 1970, 'Sample rate conversion with parallel processing for high speed multiband OFDM systems', 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, Shanghai, China, pp. 2754-2759.
View/Download from: Publisher's site
View description>>
Based on the sequential sample rate conversion (SRC) structure using B-spline interpolation for orthogonal frequency division multiplexing (OFDM) based software defined radios, a parallel processing SRC structure is proposed in this paper to achieve high speed data transmission for multiband OFDM systems. By deriving an impulse response matrix from the sequential SRC structure, the state vectors of the SRC structure can be calculated from a block of input samples with less complexity than conventional Farrow structure. Real-time SRC implementation combined with local feedback and stuffing is also presented. Performance in terms of state buffer pointer offset caused by clock variation and finite precision in digital hardware is analyzed to provide guidance for practical system design such as determining clock stability and word-length requirements. © 2013 IEEE.
Jan, MA, Nanda, P, He, X, Liu, RP & IEEE 1970, 'Enhancing Lifetime and Quality of Data in Cluster-based Hierarchical Routing Protocol for Wireless Sensor Network', 2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC), IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, IEEE, Zhangjiajie, Hunan Province, P.R. China, pp. 1400-1407.
View/Download from: Publisher's site
View description>>
Wireless Sensor Network (WSN) performs energy extensive tasks and it is essential to rotate sensor nodes frequently so that Cluster Head selections can be made efficiently. In this paper, we aim to improve the lifetime of sensor network by using LEACH based protocols and efficiently utilizing the limited energy available in these sensor nodes. In sensor network, the amount of data delivered at the base station is not important but it is the quality of the data which is of utmost importance. Our proposed approach significantly improves the life time and quality of data being delivered at the base station in sensor network. We evaluate our proposed approach using different sets of node energy levels and in each case our approach shows significant improvement over existing cluster-based hierarchical routing protocols. We evaluate our scheme in terms of energy consumption, life time and quality of data delivered at the base station. © 2013 IEEE.
Jayawickrama, BA, Dutkiewicz, E, Fang, G, Oppermann, I, Mueck, M & IEEE 1970, 'Downlink Power Allocation Algorithm for Licence-exempt LTE Systems Using Kriging and Compressive Sensing Based Spectrum Cartography', 2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), IEEE Global Telecommunications Conference, IEEE, Atlanta, GA, USA, pp. 3766-3771.
View/Download from: Publisher's site
View description>>
Licence-exempt secondary Long Term Evolution systems have been proposed recently, in attempt to meet the needs of rapidly growing wireless mobile applications. However, where the secondary network is spread over a large geographical area, traditional detect-and-avoid algorithms are less effective in providing interference protection to Primary Users while maximising the secondary throughput. Spectrum cartography is an emerging technique that can be used to discover spectrum holes in space. We propose a downlink power allocation algorithm using Kriging Spatial Interpolation and Compressive Sensing based spectrum cartography in an environment where large scale shadow fading is prominent. We evaluate the performance of our approach by simulating a secondary Urban Microcell network operating in TV White Space. Simulation results show a significant improvement in interference and throughput, in comparison to traditional detect-and-avoid algorithms. © 2013 IEEE.
Jayawickrama, BA, Dutkiewicz, E, Oppermann, I, Fang, G, Ding, J & IEEE 1970, 'Improved Performance of Spectrum Cartography Based on Compressive Sensing in Cognitive Radio Networks', 2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), IEEE International Conference on Communications, IEEE, Budapest, Hungary, pp. 5657-5661.
View/Download from: Publisher's site
View description>>
Spectrum cartography is the process of constructing a map showing Radio Frequency signal strength over a finite geographical area. Multiple research groups have recently proposed to use spectrum cartography in the context of discovering spectrum holes in space that can be exploited locally in cognitive radio networks. In our novel approach, we exploit the sparsity of primary users in space to formulate the cartography process as a compressive sensing problem. Further, we present a novel algorithm for solving the cartography problem that builds on the well-known Orthogonal Matching Pursuit algorithm. We evaluate the performance of our approach by simulating a cognitive radio network where primary users are low power wireless microphones. Our simulation results show a significant improvement in reconstruction error, in comparison to two existing compressive sensing based methods. © 2013 IEEE.
Jian Zhang, Tao Yang & Zhuo Chen 1970, 'Concatenated training in distibuted transmit beamforming sysems', 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, Shanghai, China, pp. 3915-3920.
View/Download from: Publisher's site
View description>>
Generating and feeding back beamforming vector are very challenging tasks in distributed transmit beamforming (DTB) systems. Phases of DTB nodes may vary rapidly due to residual carrier frequency offset and hence frequent updating of beamforming vector is required. Existing iterative training schemes that only require one bit training and one or two bits feedback in each iteration have low convergence speed and are nor robust in noisy channels due to the lack of structure in the training sequences. In this paper, we consider a DTB system where the number of training bits N sent from each node is no more than the number of source nodes M, and propose a concatenated training scheme based on optimal design of training sequence in this case. For spatially uncorrelated channels, we show that the concatenated training scheme can optimally combine the N latest training signals and achieve beamforming gain approximately proportional to N/M. An algorithm which can adaptively determine the length of the combination in time-varying channels is also proposed. Simulation results demonstrate the proposed scheme can work efficiently even at very low signal-to-noise ratio, with the total feedback bits much less than those required in the iterative schemes. © 2013 IEEE.
Jie Ding, Dutkiewicz, E & Xiaojing Huang 1970, 'Performance evaluation of virtual MIMO for UWB based body area networks', 2013 7th International Symposium on Medical Information and Communication Technology (ISMICT), 2013 7th International Symposium on Medical Information and Communication Technology (ISMICT 2013), IEEE, Tokyo, Japan, pp. 28-32.
View/Download from: Publisher's site
View description>>
For impulse radio ultra wideband (IR-UWB) based wireless body area network (WBAN) systems, one of the significant challenges is to guarantee a reliable link for data transmission. For this purpose, in this paper, we develop a simple but effective virtual MIMO (VMIMO) based cooperative diversity scheme for a single antenna transmitter being aided by an amplify-and-forward (AF) relay. To the best of our knowledge, this is the first paper where performance of VMIMO is evaluated in IR-UWB based WBAN systems. The theoretical analysis reveals that VMIMO not only offers a full spatial diversity, but also can collect the multipath diversity contained in the dense WBAN channels. Preliminary simulation results show that VMIMO can provide a considerable improvement on bit error rate (BER) performance compared with the single-input single-output (SISO) WBAN systems. © 2013 IEEE.
Jie Ding, Dutkiewicz, E, Xiaojing Huang, Daiming Qu & Tao Jiang 1970, 'Carrier frequency offset estimation for non-contiguous OFDM receiver in cognitive radio systems', 2013 IEEE Global Communications Conference (GLOBECOM), 2013 IEEE Global Communications Conference (GLOBECOM 2013), IEEE, Atlanta, GA, USA, pp. 4192-4197.
View/Download from: Publisher's site
View description>>
For non-contiguous (NC) OFDM based cognitive radio (CR) systems, schemes have been developed in literature to acquire spectrum synchronization information (SSI) with perfect carrier frequency offset (CFO) synchronization. However, OFDM is extremely sensitive to the CFO in practice, which leads to inter-carrier interference (ICI), hence degrading the spectrum synchronization performance for existing schemes. An accurate CFO estimation is therefore required before setting up the SSI. In this paper, we present a novel scheme based on the maximum likelihood (ML) algorithm to estimate the CFO for the NC-OFDM receiver when the SSI is unknown. A corresponding Cramér-Rao lower bound (CRB) with the ideal SSI is derived to demonstrate the efficiency of the proposed scheme. Simulation results show that the proposed scheme is robust against interference and achieves a satisfactory accuracy of estimation, which is close to the relevant CRB. © 2013 IEEE.
Jin Lai, Dutkiewicz, E, Ren Ping Liu & Vesilo, R 1970, 'Performance optimization of cooperative spectrum sensing in cognitive radio networks', 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, Shanghai, China, pp. 631-636.
View/Download from: Publisher's site
View description>>
Cooperative spectrum sensing has been proposed to significantly improve spectrum sensing accuracy by taking advantage of the cooperation among multiple secondary users (SUs). Most of existing work assumes that all SUs have the same SNR values of primary users' signal while the difference of SNR values among SUs, although it is very common in practice, is largely ignored. In this paper, we investigate two cooperative spectrum sensing scenarios where multiple geographically diverse SUs may have different SNR values. In the first scenario a cognitive radio network (CRN) with a single primary channel is considered. We aim to optimize the individual thresholds of SUs to maximize SU throughput subject to the constraint of missed detection probability. In the second scenario where there are multiple channels in a CRN, we jointly optimize the allocation of SUs to sense different channels and the individual detection thresholds of SUs. Our objective is to maximize total SU throughput over multiple channels while guaranteeing the missed detection probability below a given threshold. Simulation results demonstrate that our proposed schemes achieve significant improvements in SU throughput over the existing schemes. © 2013 IEEE.
Jozi, BJ, Dackermann, U, Braun, RB, Li, JL & Samali, BS 1970, 'Separation of bi-directional stress waves for the non-destructive condition assessment of in-service timber utility', 6th International Conference on Structural Health Monitoring of Intelligent Infrastructure (SHMII-6), International Conference on Structural Health Monitoring of Intelligent Infrastructure, Hong Kong.
View description>>
Timber utility poles represent a significant part of Australia’s infrastructure for power distribution and communicationnetworks. Due to the advanced age of Australia’s timber pole infrastructure, significant efforts are undertaken by stateauthorities on maintenance and asset management to prevent utility lines from failure. However, the lack of reliabletools for assessing the condition of in-service poles seriously jeopardizes the maintenance and asset management. Forexample, each year approximately 300,000 poles are replaced in the Eastern States of Australia with up to 80% of themstill being in a very good serviceable condition, resulting in significant waste of natural resources and money.
Kunarak, S, Sulessathira, R & Dutkiewicz, E 1970, 'Vertical handoff with predictive RSS and dwell time', 2013 IEEE International Conference of IEEE Region 10 (TENCON 2013), TENCON 2013 - 2013 IEEE Region 10 Conference, IEEE, Xi'an, China.
View/Download from: Publisher's site
View description>>
In this paper, multiple handoff decision criteria to permit connectivity across UMTS and WLAN/WiMAX under the mobile IP regional registration (MIP-RR) are presented. Handoff decision is based on the predicted received signal strength (RSS) of neighbor networks and dwell time. The merit values of candidate networks are compared to select an optimal network. RSS prediction and handoff decision performances are evaluated. The results illustrate that the proposed vertical handoff decision algorithm and network selection outperforms the other two approaches in reducing voice and data packet delay and increasing the throughput of WLAN/WiMAX. © 2013 IEEE.
Kusakunniran, W, Satoh, S, Jian Zhang & Qiang Wu 1970, 'Attribute-based learning for large scale object classification', 2013 IEEE International Conference on Multimedia and Expo (ICME), 2013 IEEE International Conference on Multimedia and Expo (ICME), IEEE, San Jose, California, USA, pp. 1-6.
View/Download from: Publisher's site
View description>>
Scalability to large numbers of classes is an important challenge for multi-class classification. It can often be computationally infeasible at test phase when class prediction is performed by using every possible classifier trained for each individual class. This paper proposes an attribute-based learning method to overcome this limitation. First is to define attributes and their associations with object classes automatically and simultaneously. Such associations are learned based on greedy strategy under certain conditions. Second is to learn a classifier for each attribute instead of each class. Then, these trained classifiers are used to predict classes based on their attribute representations. The proposed method also allows trade-off between test-time complexity (which grows linearly with the number of attributes) and accuracy. Experiments based on Animals-with-Attributes and ILSVRC2010 datasets have shown that the performance of our method is promising when compared with the state-of-the-art. © 2013 IEEE.
Lei Shi, Kodagoda, S & Piccardi, M 1970, 'Towards simultaneous place classification and object detection based on conditional random field with multiple cues', 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013), IEEE, Tokyo, Japan, pp. 2806-2811.
View/Download from: Publisher's site
Li, B, Hu, B, Liu, RP & Chen, S 1970, 'Modeling and QoS analysis of IEEE 802.11 broadcast scheme in Vehicular Ad Hoc Networks', 2013 IEEE International Conference on Communications (ICC), ICC 2013 - 2013 IEEE International Conference on Communications, IEEE, Budapest, Hungary, pp. 6444-6448.
View/Download from: Publisher's site
View description>>
Quality of Service (QoS) and queue management are critical issues for broadcast scheme of IEEE 802.11 systems in Vehicular Ad hoc Networks (VANETs). However, existing 1-dimensional models of broadcast scheme in VANETs are unable to capture the complete QoS performance and queueing behavior due to the lack of an adequate finite buffer model. We present a 2-dimensional Markov chain that integrates the broadcast scheme of the 802.11 system and queueing processes into one model. The extra dimension, that models the queue length, accurately capture important QoS measures for realistic 802.11 broadcast systems with finite buffer under finite load. We derive an simplified method for solving the steady state probabilities of the Markov chain. The solutions are validated by extensive simulations. Based on this model, we also show numerical results to analyze the performance of the broadcast scheme in VANETs in terms of collision probability, throughput, queue length, and QoS measures, including blocking probability and queueing delay. © 2013 IEEE.
Li, Y, Shen, C, Jia, W & van den Hengel, A 1970, 'Leveraging surrounding context for scene text detection', 2013 IEEE International Conference on Image Processing, 2013 20th IEEE International Conference on Image Processing (ICIP), IEEE, Melbourne, Australia, pp. 2264-2268.
View/Download from: Publisher's site
View description>>
Finding text in natural images has been a challenging task in vision. At the core of state-of-the-art scene text detection algorithms are a set of text-specific features within extracted regions. In this paper, we attempt to solve this problem from a different prospective. We show that characters and non-character interferences are separable by leveraging the surrounding context. Surrounding context, in our work, is composed of two components which are computed in an information-theoretic fashion. Minimization of an energy cost function yields a binary label for each region, which indicates the category it belongs to. The proposed algorithm is fast, discriminative and tolerant to character variations and involves minimal parameter tuning. © 2013 IEEE.
Liu, H, Xu, D, Huang, Q, Li, W, Xu, M & Lin, S 1970, 'Semantically-Based Human Scanpath Estimation with HMMs', 2013 IEEE International Conference on Computer Vision, 2013 IEEE International Conference on Computer Vision (ICCV), IEEE, Sydney, Australia, pp. 3232-3239.
View/Download from: Publisher's site
View description>>
We present a method for estimating human scan paths, which are sequences of gaze shifts that follow visual attention over an image. In this work, scan paths are modeled based on three principal factors that influence human attention, namely low-level feature saliency, spatial position, and semantic content. Low-level feature saliency is formulated as transition probabilities between different image regions based on feature differences. The effect of spatial position on gaze shifts is modeled as a Levy flight with the shifts following a 2D Cauchy distribution. To account for semantic content, we propose to use a Hidden Markov Model (HMM) with a Bag-of-Visual-Words descriptor of image regions. An HMM is well-suited for this purpose in that 1) the hidden states, obtained by unsupervised learning, can represent latent semantic concepts, 2) the prior distribution of the hidden states describes visual attraction to the semantic concepts, and 3) the transition probabilities represent human gaze shift patterns. The proposed method is applied to task-driven viewing processes. Experiments and analysis performed on human eye gaze data verify the effectiveness of this method. © 2013 IEEE.
Liu, RP, Sutton, GJ & Collings, IB 1970, 'Power save with Offset Listen Interval for IEEE 802.11ah Smart Grid communications', 2013 IEEE International Conference on Communications (ICC), ICC 2013 - 2013 IEEE International Conference on Communications, IEEE, Budapest, Hungary, pp. 4488-4492.
View/Download from: Publisher's site
View description>>
Communication is an enabling technology for the efficient control and management of next-generation Smart Grids. Energy conservation of the communication devices is essential for future large scale deployment of Smart Grid communication networks. However, existing power save protocols experience high contention in Smart Grid communication networks that have a large number of nodes and periodic traffic. We design a new energy conservation protocol, Power Save with Offset Listen Interval (PS-OLi), to address such contention problems. PS-OLi avoids message collisions by controlling the station wake up time with a calculated offset. A new analytical model is developed to characterize the power save performance of networks with periodic traffic. Simulation results show that our analytical model accurately predicts the collision probability and packet delay. We use our model to evaluate the energy efficiency of PS-OLi and standard power save protocols. Our results show that PS-OLi extends the lifetime of a Smart Grid communication network by more than 10%. © 2013 IEEE.
Mao, R, Wu, Q, Qiao, Y, Bai, L & Yang, J 1970, 'Multi-view urban scene reconstruction in non-uniform volume', SPIE Proceedings, Sixth International Conference on Machine Vision (ICMV 13), SPIE, London, United Kingdom.
View/Download from: Publisher's site
View description>>
This paper presents a new fully automatic approach for multi-view urban scene reconstruction. Our algorithm is based on the Manhattan-World assumption, which can provide compact models while preserving fidelity of synthetic architectures. Starting from a dense point cloud, we extract its main axes by global optimization, and construct a nonuniform volume based on them. A graph model is created from volume facets rather than voxels. Appropriate edge weights are defined to ensure the validity and quality of the surface reconstruction. Compared with the common pointcloud- to-model methods, the proposed methodology exploits image information to unveil the real structures of holes in the point cloud. Experiments demonstrate the encouraging performance of the algorithm. © 2013 SPIE.
Movassaghi, S, Abolhasan, M & Smith, D 1970, 'Interference Mitigation in WBANS: Challenges and Existing Solutions', Workshop on Advances in Real-time Information Networks, Samaneh Movassaghi, University of Technology, Sydney, Australia, pp. 1-4.
View/Download from: Publisher's site
View description>>
Wireless Body Area Networks (WBANs) are an exciting new networking technology developed in the recent years with advancements in wireless communication, integrated circuits and Micro-Electro- Mechanical Systems (MEMs). They consist of a number of sensor nodes that are placed in or around the human body. However, their practical deployment requires addressing numerous challenges. WBANs face many stringent requirements in power, bandwidth, and network lifetime which need to be taken into serious consideration in the design of different protocols. In this paper, we investigate the importance of interference mitigation amongst coexisting Wireless Body Area Networks (WBANs). Since, a WBAN is most likely to encounter other WBANs, inter-WBAN interference and scheduling is of utmost importance.
Movassaghi, S, Shirvanimoghaddam, M, Abolhasan, M & IEEE 1970, 'A Cooperative Network Coding Approach to Reliable Wireless Body Area Networks with Demodulate-and-Forward', 2013 9TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), International Wireless Communications and Mobile Computing Conference, IEEE, Italy, pp. 394-399.
View/Download from: Publisher's site
View description>>
In this paper, a novel cooperative transmission scheme via network coding has been proposed for Wireless Body Area Networks (WBANs) to enhance reliability and throughput. In the proposed scheme, namely Random XOR Network Coding (RXNC), each relay demodulates the received signal from each sensor node and then selects d different coded symbols amongst them and XORs them to generate a network coded symbol. We have found the optimum value of d through an analytical approach by minimizing the probability that an XOR network coded symbol is incorrectly generated. Simulation results show that the proposed RXNC scheme outperforms the no-cooperation and conventional bitwise network coding schemes in all channel signal to noise ratios (SNRs) from 0 dB to 18 dB.
Movassaghi, S, Shirvanimoghaddam, M, Abolhasan, M & Smith, D 1970, 'An energy efficient network coding approach for Wireless Body Area Networks', 38th Annual IEEE Conference on Local Computer Networks, 38th Annual IEEE Conference on Local Computer Networks (LCN 2013), IEEE, Sydney, NSW, Australia, pp. 468-475.
View/Download from: Publisher's site
View description>>
In this paper, we propose a practical network coding approach for wireless body are networks (WBANs) using decode-and-forward relays. In this scheme, namely decode and forward-network coding (DF-NC), each relay linearly combines different messages from different sources to generate one message, and then transmits that message to the destination. Each relay node in DF-NC requires only one transmission time slot to forward its message. Thus, in this approach, energy usage at each relay is minimized compared to existing cooperative schemes without network coding, which require Ns time slots per relay for relay transmissions; where Ns is the number of source nodes. Simulation results show that the proposed DF-NC scheme can achieve near optimal outage probability while minimizing the number of transmissions per node, maximizing the energy efficiency of WBANs, and minimizing the delay
Mukunthan, A, Cooper, C, Safaei, F, Franklin, D, Abolhasan, M, Ros, M & IEEE 1970, 'Experimental Validation of the CORNER Urban Propagation Model based on Signal Power Measurements in a Vehicular Environment', 2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), IEEE Wireless Communications and Networking Conference, IEEE, Shanghai, China, pp. 2626-2631.
View/Download from: Publisher's site
View description>>
CORNER is an urban propagation model which simulates the presence of buildings in city scenarios and models radio propagation as a series of reflections and diffractions around buildings. CORNER was validated in the original publication with a series of packet-delivery-ratio measurements. However, the accuracy of these measurements is limited by interference from nearby networks. This paper independently evaluates the CORNER model using signal strength measurements across three separate sites in Sydney and Wollongong. The measurements are analysed and compared with the predicted analytical estimates. The fading model is also analysed with direct measurements. A new CORNER link classification algorithm is also proposed in this paper
Nguyen, DN & Krunz, M 1970, 'Distributed bargaining mechanisms for multi-antenna dynamic spectrum access systems', 2013 IEEE Global Communications Conference (GLOBECOM), GLOBECOM 2013 - 2013 IEEE Global Communications Conference, IEEE, Atlanta, GA, pp. 4775-4780.
View/Download from: Publisher's site
View description>>
Dynamic spectrum access and MIMO technologies are among the most promising solutions to address the ever increasing wireless traffic demand. An integration that successfully embraces the two is far from trivial due to the dynamics of spectrum opportunities as well as the requirement to jointly optimize both spectrum and spatial/antenna dimensions. Our objective in this paper is to jointly allocate opportunistic channels to various links such that no channel is allocated to more than one link, and to simultaneously optimize the MIMO precoding matrices under the Nash bargaining (NB) framework. We design a low-complexity distributed scheme that allows links to propose their minimum rate requirements, negotiate the channel allocation, and configure their precoding matrices. Simulations confirm the convergence of the distributed algorithm under timesharing to the globally optimal solution of the NB-based problem. They also show that the NB-based algorithm achieves much better fairness than purely maximizing network throughput.
Nguyen, DN & Krunz, M 1970, 'Heterogeneous spectrum sharing with rate demands in cognitive MIMO networks', 2013 IEEE Global Communications Conference (GLOBECOM), 2013 IEEE Global Communications Conference (GLOBECOM 2013), IEEE, Atlanta, GA, USA, pp. 3054-3059.
View/Download from: Publisher's site
View description>>
We are interested in addressing a fundamental question: what are conditions under which an ad hoc cognitive radio MIMO (CMIMO) network can support a given rate-demand profile, defined as the set of rates requested by individual links? From an information theoretic view, a rate profile can be supported if it is within the network capacity region. However, the network capacity region of interfering MIMO networks is essentially unknown. In dynamic spectrum access, the problem is even more challenging due to the dynamics of primary/legacy users (PUs), resource constraints, and the heterogeneity of opportunistic spectrum (i.e., the set of available channels varies from one to another). Considering a non-centralized setup, we address the above question in a noncooperative game framework where each CMIMO link independently optimizes its spectrum, power allocation, and MIMO precoders to meet its rate demand. We derive sufficient conditions for the existence of a NE are derived. These conditions establish an explicit relationship between the rate-demand profile and interference from PUs, CMIMO network's interference, and CMIMO nodes' power budget. We also show that a NE, if exists, is unique. Our results help to characterize the network capacity region of CMIMO networks. © 2013 IEEE.
Niazi, M, Mahmood, S, Alshayeb, M, Baqais, AAB & Gill, AQ 1970, 'Motivators of Adopting Social Computing in Global Software Development: Initial Results', WORLD CONGRESS ON ENGINEERING - WCE 2013, VOL I, World Congress on Engineering, IAENG, London, U.K, pp. 409-413.
View/Download from: Publisher's site
View description>>
context: Real-time collaboration is critical for developing high quality software systems at low cost in a geographically distributed Global Software Development (GSD) environment. It is anticipated that emerging Social Computing tools can play an important role in facilitating realtime effective collaboration among teams working in the GSD. Objective: The objective of this research paper is to identify motivators for adopting social computing in GSD organizations. Method: We adopted a Systematic Literature Review (SLR) approach by applying customized search strings derived from our research questions. Results: We have identified factors such as real-time communication and coordination, information sharing, knowledge acquisition and expert feedback as key motivators for adoption of social computing in GSD. Conclusion: Based on the SLR results, we suggest that GSD organizations should embrace social computing as a tool for real-time collaboration between distributed GSD teams. The results of this initial study also suggest the need for developing the social computing strategies and policies to guide the effective social computing adoption by GSD teams.
Nuwanpriya, A, Zhang, J, Grant, A, Ho, S-W & Luo, L 1970, 'Single carrier frequency domain equalization based on on-off-keying for optical wireless communications', 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, Shanghai, China, pp. 4272-4277.
View/Download from: Publisher's site
View description>>
Single carrier systems with frequency domain equalization (SC-FDE) have been recently proposed for optical wireless systems as alternatives to optical orthogonal frequency division multiplexing (OFDM) to reduce the peak-to-average power ratio (PAPR) of the transmitted signal and improve the system performance. However, these SC-FDE systems have either higher complexity or lower spectrum efficiency. In this paper a low complexity SC-FDE system based on on-off-keying (OOK) modulation is proposed. Theoretical bit-error-rate (BER) analysis is provided based on minimum mean square error (MMSE) equalization for the proposed system and typical optical SCFDE and OFDM systems. Both analytical and numerical results show that the proposed system significantly outperforms existing SC-FDE and OFDM systems in terms of PAPR, BER and implementation complexity. © 2013 IEEE.
Peng Cheng, Zhuo Chen, Guo, YJ & Lin Gui 1970, 'Distributed Bayesian compressive sensing based blind carrier-frequency offset estimation for interleaved OFDMA uplink', 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), 2013 IEEE 24th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), IEEE, London, UK, pp. 801-806.
View/Download from: Publisher's site
View description>>
Carrier-frequency offset (CFO) estimation for orthogonal frequency-division multiplexing access (OFDMA) systems operating in multiuser uplink transmission is very challenging due to the presence of a multiple-parameter estimation problem. In this paper, we propose a novel blind CFO estimation method for interleaved OFDMA uplink based on distributed Bayesian compressive sensing (DBCS) theory. Considering the received signal structure, the new method first constructs a measurement matrix associated with a sparse signal matrix weight, which sets up the stage for the application of CS theory in tackling the original estimation problem. Then, the DBCS theory that exploits a common sparse profile of the sparse signal matrix weight is employed to distributively estimate a sparse hyperparameter vector, whose significant peaks are linked to the correct estimation of the multiple CFOs. Compared with the existing subspace theory based methods, the proposed scheme offers a significant enhancement in estimation accuracy, in specific in the low signal-to-noise ratio (SNR) region. The numerical results validate the effectiveness of the proposed scheme. © 2013 IEEE.
Peng, Y, Jin, JS, Luo, S, Xu, M, Au, S, Zhang, Z & Cui, Y 1970, 'Vehicle Type Classification Using Data Mining Techniques', The Era of Interactive Media, Pacific-Rim Conference on Multimedia, Springer New York, Sydney, Australia, pp. 325-335.
View/Download from: Publisher's site
View description>>
© 2013 Springer Science+Business Media, LLC. All rights reserved. In this paper, we proposed a novel and accurate visual-based vehicle type classification system. The system builts up a classifier through applying Support Vector Machine with various features of vehicle image. We made three contributions here: first, we originally incorporated color of license plate in the classification system. Moreover, the vehicle front was measured accurately based on license plate localization and background-subtraction technique. Finally, type probabilities for every vehicle image were derived from eigenvectors rather than deciding vehicle type directly. Instead of calculating eigenvectors from the whole body images of vehicle in existing methods, our eigenvectors are calculated from vehicle front images. These improvements make our system more applicable and accurate. The experiments demonstrated our system performed well with very promising classification rate under different weather or lighting conditions.
Pupatwibul, P, Banjar, A & Braun, R 1970, 'Using DAIM as a reactive interpreter for openflow networks to enable autonomic functionality', Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM, SIGCOMM'13: ACM SIGCOMM 2013 Conference, ACM.
View/Download from: Publisher's site
Pupatwibul, P, Banjar, A & Braun, R 1970, 'Using DAIM as a Reactive Interpreter for OpenFlow Networks to Enable Autonomic Functionality', ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, ACM SIGCOMM 2013, ACM, Hong Kong, pp. 523-524.
View/Download from: Publisher's site
View description>>
OpenFlow is the first standardization of Software Defined Networks. OpenFlow approach, however, has number of limitations: it restricts its use within a single-domain, it is not scalable, and it does not adapt well to changes in local environments. We evaluate the number of approaches to solve these limitations, and propose DAIM model (Distributed Active information Model) which can be integrated into the OpenFlow structure at the level of the switches to provide a reactive interpreter that will manage the flow tables autonomically.
Pupatwibul, P, Banjar, A, Sabbagh, AAL & Braun, R 1970, 'Developing an Application Based on OpenFlow to Enhance Mobile IP Networks', PROCEEDINGS OF THE 2013 38TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS WORKSHOPS (LCN WORKSHOPS), IEEE Conference on Local Computer Networks, IEEE, Sydney, Australia, pp. 936-940.
View/Download from: Publisher's site
View description>>
Mobile Internet Protocol (IP) has been developed to maintain permanent IP addresses for mobile users while they are moving from one point to another where the Mobile Terminal (MT) device will have two IP addresses: a static home address and a care-of address which will be changed and re-attached at each point of the movement of the MT. However, a location update message is required to be sent to the home agent for each new connection. This will potentially increase the handoff latency and leads to high load on the global Internet. This paper presents the concepts and the challenges of Mobile IP networks and then proposes the use of OpenFlow approach as an alternate transport mechanism to perform routing and to provide network connectivity for Mobile IP networks. The proposed application determines calculations and reroutes the subsequent packets. OpenFlow aims to optimize routing path and handoff performance by using controller's application and exchanges controllers' information. © 2013 IEEE.
Qin, P-Y, Guo, YJ, Ding, C & Soc, IEEEAP 1970, 'A Microstrip Dual-band Polarization Reconfigurable Antenna', 2013 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM (APSURSI), IEEE Antennas-and-Propagation-Society International Symposium (APSURSI), IEEE, Orlando, FL, USA, pp. 1640-1641.
View/Download from: Publisher's site
View description>>
A new microstrip dual-band polarization reconfigurable antenna is presented for WLANs operating at 2.4 GHz and 5.8 GHz The antenna consists of a square microstrip patch that is aperture coupled to a microstrip line located along the diagonal line of the patch. The dual-band operation is realized by employing the TM10 and TM30 modes of the patch antenna. Four shorting posts are inserted into the patch to adjust the frequency ratio of the two modes. The center of each edge of the patch is connected to ground via a PIN diode for polarization switching. By switching between the different states of PIN diodes, the proposed antenna can have horizontal, vertical, or 45° linear polarizations for the two frequency bands. © 2013 IEEE.
Qu, Z, Wang, J, Xu, M & Lu, H 1970, 'Fusing Warping, Cropping, and Scaling for Optimal Image Thumbnail Generation', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Asian Conference on Computer Vision, Springer Berlin Heidelberg, Singapore, Singapore, pp. 445-456.
View/Download from: Publisher's site
View description>>
Image retargeting, as a content aware technique, is regarded as a logical tool for generating image thumbnails. However, the enormous difference between the size of source and target usually hinders single retargeting method from obtaining satisfactory results. In this paper, an unified framework is proposed to fuse three popular retargeting strategies, i.e. warping, cropping, and scaling, for thumbnail generation. Complementing each other, three retargeting strategies work together efficiently. Firstly, cropping selectively discards the unimportant regions in order to free up more space for displaying important content aesthetically. Next, warping helps to incorporate as much as possible visual information into thumbnails by rearranging important content more compactly through non-uniform deformation. Finally, scaling retrains the important content at an optimal size rather than undergoing an improper shrinkage. In our solution, warping, cropping and scaling are encoded as three energy terms of the objective function respectively, which can be solved efficiently by numerical optimization. Both qualitative and quantitative comparison results demonstrate that the proposed method achieves an excellent trade-off among smoothness, completeness and distinguishableness in thumbnail generation. Through these results, our method shows obvious superiority over state-of-the-art techniques. © 2013 Springer-Verlag.
Raduescu, C & Gill, AQ 1970, 'Towards the Development of a Complex Adaptive Project Environment Assessment Tool.', ISD, International Conference on Information Systems Development, Springer, Sevilla, Spain, pp. 487-498.
View/Download from: Publisher's site
Rafiei, A, Maali, Y, Abolhasan, M, Franklin, D, Safaei, F, Smith, S & IEEE 1970, 'A Tuned Fuzzy Logic Relocation Model in WSNs Using Particle Swarm Optimization', 2013 IEEE 78TH VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), IEEE Vehicular Technology Conference, IEEE-VTS, Las Vegas, USA, pp. 1-5.
View/Download from: Publisher's site
View description>>
In harsh and hostile environments, swift relocation of currently deployed nodes in the absence of centralized paradigm is a challenging issue in WSNs. Reducing the burden of centralized relocation paradigms by the distributed movement models comes at the price of unpleasant oscillations and excessive movements due to nodes' local and limited interactions. If the nodes' careless movements in the distributed relocation models are not properly addressed, their power will be exhausted. Therefore, in order to exert proper amount of virtual radial/angular push/pull forces among the nodes, a fuzzy logic relocation model is proposed and by considering linear combination of the presented performance metric(s)(i.e. coverage, uniformity, and average movement), its parameters are locally and globally tuned by particle swarm optimization(PSO). In order to tune fuzzy parameters locally and globally, PSO benefits respectively from nodes' neighbours within different ranges and all the given deployed area. Performance of locally and globally tuned fuzzy relocation models is compared with one another in addition to the distributed self-spreading algorithm (DSSA). It is shown that by applying PSO to the linear combinations of desired metric(s) to obtain tuned fuzzy parameters, the relocation model outperforms and/or is comparable to DSSA in one or more performance metric(s). Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.
Rafiei, A, Maali, Y, Abolhasan, M, Franklin, DR & Smith, S 1970, 'An iteratively tuned fuzzy logic movement model in WSN using particle swarm optimization.', ICSPCS, International Conference on Signal Processing and Communication Systems, IEEE, Carrara, VIC, Australia, pp. 1-7.
View/Download from: Publisher's site
View description>>
In contrast to adding new nodes, relocation of deployed nodes in mobile wireless sensor networks seems to be an effective solution to cope with undesirable, unpredictable and uncontrolled network topology changes due to nodes' drift and failure. At the price of less global control, there is a trend in recent years towards giving nodes more autonomy and devising localized relocation algorithms to address challenges of network topology control in harsh and hostile environments in the absence of centralized control. Inspired by laws of nature, a large variety of distributed node relocation algorithms have been designed to alleviate undesirable oscillations caused by local interactions and uncertainties among autonomous nodes as they reach their desired formations. Force-based distributed relocation algorithms governed by virtual push-pull forces among autonomous nodes are among such aforesaid algorithms. Adapting fuzzy logic model in exerting proper amount of forces to reduce node movement oscillation seems to be promising as its conforms well with uncertainties and interactions of autonomous nodes. However, parameters of fuzzy logic relocation model should be tuned so to enable nodes to exert proper amount of forces among their in-range neighbours. In this paper, by using particle swarm optimization, parameters of fuzzy relocation model are obtained based on the desired combinations of performance metrics within nodes' range in each movement iteration. The result shows that our model either outperforms or matches DSSA movement model. © 2013 IEEE.
Resconi, G, Braun, R & Chaczko, Z 1970, 'Geometry of a sensor networks', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Conference on Computer Aided Systems Theory (EUROCAST), Springer, Las Palmas, SPAIN, pp. 507-512.
View/Download from: Publisher's site
View description>>
Given a set of sensors or cluster of sensors S located at different points or nodes in the ordinary space. Any sensor measures one or more values, such as Temperature. We assume that the information from all sensors at different positions in the space is transmitted to a Gateway node as a probabilistic phenomena, not in a deterministic way. The measured value X at the Gateway sensor node is a random value. Noise in the network randomly changes the original measurements. Information at the gateway is given by a distribution of the probability at the gateway sensor. We can show that given the values at the sensor node the distribution of the probability at the gateway changes. So the sensor measurements are parameters that define the distribution of the values at the gateway. The probability at the gateway is conditioned by the original measures at the sensor node. The probability approach cannot take care of the topology of the network but only of the conditional probability at the gateway conditioned by the sensors. Now we compute the derivative of the conditional Boltzmann entropy for any variation of the sensor value and for any value at the gateway X. This matrix gives us the sensor situation so we can compute the Fisher information of the sensor. It is the Hessian of the entropy average function in the space of the sensors S. The Fisher information gives us the geometry or form of the sensor space S. Sensor information is very important to obtain the form of the phenomena that we want to measure with the different sensors. Networks of sensors with their geometry go beyond the individual sensor that measures only one value and cannot discover the field or form of the physical phenomena. © 2013 Springer-Verlag Berlin Heidelberg.
Sabbagh, AAL, Pupatwibul, P, Banjar, A & Braun, R 1970, 'Optimization of the OpenFlow Controller in Wireless Environments for Enhancing Mobility', PROCEEDINGS OF THE 2013 38TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS WORKSHOPS (LCN WORKSHOPS), IEEE Conference on Local Computer Networks, IEEE, Sydney, Australia, pp. 930-935.
View/Download from: Publisher's site
View description>>
OpenRoads or OpenFlow Wireless is an open-source platform for deploying an innovative and realistic strategy for different services in wireless networks. It provides a wireless extension for OpenFlow. It is developed to support existing Wireless Local Area Networks (WLANs) and Worldwide Interoperability for Microwave Access (WiMAX) networks. It can provide several mobility managers and run them concurrently in the network including hard handover, informed handover, n-casting and Hoolock. However, the provided mobility support for flow-based routing, where flows of one source taking different paths through multiple wireless access points or base stations, is not simple and hard to be deployed in the traditional routing algorithms. This paper proposes an intelligent mobility enhancement control and then develops an algorithm to decide which neighbor switches need to be selected for the installation of new flow entries and to allocate the appropriate idle-timeout for the selected switches. The proposed approach provides a simple solution to solve the user mobility problem in wireless OpenFlow environments which can handle the fast migration of user addresses (e.g. IP addresses) between several wireless access points and base stations. This approach leads to improvement in the end users' experience.
Shu Wang, Zhenjiang Miao & Jian Zhang 1970, 'Simultaneously detect and segment pedestrian', 2013 IEEE International Conference on Multimedia and Expo Workshops (ICMEW), 2013 IEEE International Conference on Multimedia and Expo Workshops (ICMEW), IEEE, San Jose, USA, pp. 1-4.
View/Download from: Publisher's site
View description>>
We present a framework to simultaneously detect and segment pedestrian in images. Our work is based on part-based method. We first segment the image into superpixels, then assemble superpixels into body part candidates by comparing the assembled shape with pre-built template library. A structure-based shape matching algorithm is developed to measure the shape similarity. All the body part candidates are input into our modified AND/OR graph to generate the most reasonable combination. The graph describes the possible variation of body configuration and model the constrain relationship between body parts. We perform comparison experiments on the public database and the results show the effectiveness of our framework.
Smith, S, Gill, AQ, Hasan, H & Ghobadi, S 1970, 'An Enterprise Architecture Driven Approach to Virtualisation.', PACIS, Pacific Asia Conference on Information Systems, AIS, Seogwipo City, Jeju-do, Korea, pp. 50-50.
View description>>
Organisations have shown a significant interest in the adoption of virtualisation technology for improving the efficiency of their Data Centres (DC) from both the resource performance and cost efficiency viewpoints. By improving the efficiency of data centres we can sustainably manage their impact on the environment by controlling their energy consumption. The intentions are clear but how best to approach to Data Centre virtualisation is not. This paper proposes an integrated Enterprise Architecture and Information Infrastructure (EAII) driven approach to guide the Data Centre virtualisation. The EAII approach has been developed based on the review and analysis of wellknown The Open Group Architecture Framework (TOGAF) and Information Infrastructure (II) model. The proposed integrated EAII approach seems appropriate to guide and align business strategy and virtualisation implementation for data centres of any size in any industry vertical.
Song, Y, Zhang, J, Cao, L & Sangeux, M 1970, 'On Discovering the Correlated Relationship between Static and Dynamic Data in Clinical Gait Analysis', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer Berlin Heidelberg, Prague, Czech Republic, pp. 563-578.
View/Download from: Publisher's site
View description>>
'Gait' is a person's manner of walking. Patients may have an abnormal gait due to a range of physical impairment or brain damage. Clinical gait analysis (CGA) is a technique for identifying the underlying impairments that affect a patient's gait pattern. The CGA is critical for treatment planning. Essentially, CGA tries to use patients' physical examination results, known as static data, to interpret the dynamic characteristics in an abnormal gait, known as dynamic data. This process is carried out by gait analysis experts, mainly based on their experience which may lead to subjective diagnoses. To facilitate the automation of this process and form a relatively objective diagnosis, this paper proposes a new probabilistic correlated static-dynamic model (CSDM) to discover correlated relationships between the dynamic characteristics of gait and their root cause in the static data space. We propose an EM-based algorithm to learn the parameters of the CSDM. One of the main advantages of the CSDM is its ability to provide intuitive knowledge. For example, the CSDM can describe what kinds of static data will lead to what kinds of hidden gait patterns in the form of a decision tree, which helps us to infer dynamic characteristics based on static data. Our initial experiments indicate that the CSDM is promising for discovering the correlated relationship between physical examination (static) and gait (dynamic) data. © 2013 Springer-Verlag.
Tushar, W, Zhang, JA, Smith, DB, Thiebaux, S & Poor, HV 1970, 'Prioritizing Consumers in Smart Grid: Energy Management Using Game Theory', IEEE International Conference on Communications, IEEE International Conference on Communications, IEEE, IEEE, pp. 4239-4243.
View/Download from: Publisher's site
View description>>
This paper explores an idea of demand-supply balance for smart grids in whichconsumers are expected to play a significant role. The main objective is tomotivate the consumer, by maximizing their benefit both as a seller and abuyer, to trade their surplus energy with the grid so as to balance the demandat the peak hour. To that end, a Stackelberg game is proposed to capture theinteractions between the grid and consumers, and it is shown analytically thatoptimal energy trading parameters that maximize customers utilities areobtained at the solution of the game. A novel distributed algorithm is proposedto reach the optimal solution of the game, and numerical examples are used toassess the properties and effectiveness of the proposed approach.
ul Huque, MTI, Munasinghe, KS, Abolhasan, M & Jamalipour, A 1970, 'EAR-BAN: Energy efficient adaptive routing in Wireless Body Area Networks', 2013, 7th International Conference on Signal Processing and Communication Systems (ICSPCS), 2013 7th International Conference on Signal Processing and Communication Systems (ICSPCS), IEEE, Gold Coast, Australia, pp. 1-10.
View/Download from: Publisher's site
View description>>
Wireless Body Area Network (WBAN), a neoteric intelligent monitoring system, is envisaged to unleash a wave of personalized, advanced and integrated applications in the field of medical, fitness, sports, entertainment, military and consumer electronics. In WBAN, network longevity is a major challenge due to the limitation in the availability of energy supply and routing protocol plays a key role towards making such networks energy efficient. In this paper, we propose an energy efficient cluster based routing protocol for WBANs, named as energy efficient adaptive routing in wireless body area network (EAR-BAN). Although EAR-BAN is a cluster based routing protocol, it also combines the benefits of direct and multi hop transmission methods, depending on the energy level and spatial information of body nodes, to formalize an energy efficient, adaptive and opportunistic routing. Moreover, its centralized operation reduces the computational burden of body nodes.
ul Huque, MTI, Munasinghe, KS, Abolhasan, M & Jamalipour, A 1970, 'SEA-BAN: Semi-autonomous adaptive routing in wireless body area networks', 2013, 7th International Conference on Signal Processing and Communication Systems (ICSPCS), 2013 7th International Conference on Signal Processing and Communication Systems (ICSPCS), IEEE, Australia, pp. 1-7.
View/Download from: Publisher's site
View description>>
Wireless Body Area Network (WBAN), an intelligent health monitoring system, is introduced advanced and integrated applications in the field of medical, fitness, sports, entertainment, military and consumer electronics. In WBAN, due to the limitation in the availability of energy supply, network longevity is a major challenge. Since 80% of total energy is consumed only because of communication purpose in WBAN, routing protocols play a key role towards making such networks energy efficient. In this paper, we propose an energy efficient cluster-based routing protocol for WBANs, named as semiautonomous adaptive routing in wireless body area network (SEA-BAN). SEA-BAN distributes the energy dissipation evenly among the body nodes and enhances the network lifetime. It is not simply a cluster-based routing protocol; it also combines the benefits of direct transmission and multi-hop transmission methods, depending on the energy level and spatial information of the body nodes, to formalize an adaptive routing. Moreover, its centralized operation reduces the computational burden of body nodes. The comparative analysis of our simulation results show that SEA-BAN enhances the network lifetime by more than 2 times when compared to the multi-hop transmission model and about 8.5 times than the direct transmission model.
Wang, H, Cui, Q, Tao, X, Valkama, M & Guo, YJ 1970, 'Optimal cooperative water-filling power allocation for OFDM system', 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, Shanghai, China, pp. 3742-3747.
View/Download from: Publisher's site
View description>>
It is well known that traditional water-filling provides a closed form solution for capacity maximization in orthogonal frequency division multiplex (OFDM) system. In this paper, cooperative power allocation is investigated in a two-transmitter multi-receiver model for OFDM systems. The local full channel state information (CSI) is available at the two transmitters respectively, where each transmitter has an individual power constrain. The transmitters first cooperate by sharing CSI, and then jointly optimize power allocation in the metric of sum throughput, which can be modeled as a convex optimization problem. Through an application of Karush-Kuhn-Tucker (KKT) conditions, the convex optimization problem is reformulated as a simplified convex one. Then the closed form solution is derived, which takes a form similar to classic water-filling principle. Based on the solution, the optimal cooperative power allocation algorithm is constructed, the structure of which can be explained as a cooperative water-filling relative to the traditional water-filling. Finally, numerical simulation is given to evaluate and demonstrate the performance of the optimal cooperative water-filling scheme. © 2013 IEEE.
Wang, S, He, X, Wu, Q & Yang, J 1970, 'Generalized local N-ary patterns for texture classification', 2013 10th IEEE International Conference on Advanced Video and Signal Based Surveillance, 2013 10th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS), IEEE, Krakow, Poland, pp. 324-329.
View/Download from: Publisher's site
View description>>
Local Binary Pattern (LBP) has been well recognised and widely used in various texture analysis applications of computer vision and image processing. It integrates properties of texture structural and statistical texture analysis. LBP is invariant to monotonic gray-scale variations and has also extensions to rotation invariant texture analysis. In recent years, various improvements have been achieved based on LBP. One of extensive developments was replacing binary representation with ternary representation and proposed Local Ternary Pattern (LTP). This paper further generalises the local pattern representation by formulating it as a generalised weight problem of Bachet de Meziriac and proposes Local N-ary Pattern (LNP). The encouraging performance is achieved based on three benchmark datasets when compared with its predecessors. © 2013 IEEE.
Wang, S, Zhang, J & Miao, Z 1970, 'A new edge feature for head-shoulder detection', 2013 IEEE International Conference on Image Processing, 2013 20th IEEE International Conference on Image Processing (ICIP), IEEE, Melbourne, Australia, pp. 2822-2826.
View/Download from: Publisher's site
View description>>
In this work, we introduce a new edge feature to improve the head-shoulder detection performance. Since Head-shoulder detection is much vulnerable to vague contour, our new edge feature is designed to extract and enhance the head-shoulder contour and suppress the other contours. The basic idea is that head-shoulder contour can be predicted by filtering edge image with edge patterns, which are generated from edge fragments through a learning process. This edge feature can significantly enhance the object contour such as human head and shoulder known as En-Contour. To evaluate the performance of the new En-Contour, we combine it with HOG+LBP [1] as HOG+LBP+En-Contour. The HOG+LBP is the state-of-the-art feature in pedestrian detection. Because the human head-shoulder detection is a special case of pedestrian detection, we also use it as our baseline. Our experiments have indicated that this new feature significantly improve the HOG+LBP.
Xiangling Li, Qimei Cui, Xiaofeng Tao, Xianjun Yang, Rehman, WU & Jay Guo, Y 1970, 'Performance bounds of compressed sensing recovery algorithms for sparse noisy signals', 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, Shanghai, China, pp. 2884-2889.
View/Download from: Publisher's site
View description>>
Recently, the performance bounds of the compressed sensing (CS) recovery algorithms have been investigated in the noisy setting. However, most of the papers only focus on the noisy measurement model where the signal is noiseless and the noise enters after the CS operation. The noisy signal model where both the signal and the compressed measurements are contaminated by the different noises is not considered. This paper works on the noisy signal model and provides the performance bounds for the following popular recovery algorithms: thresholding and orthogonal matching pursuit (OMP), Dantzig selector (DS) and basis pursuit denoising (BPDN). The performance of the recovery algorithms is quantified as the ℓ 2 distance between the reconstructed signal and the true noisy signal. Next, the impacts of the noise are analyzed on the basis of the quantified performance. The analysis results show that the effective way to restrain the impact of the noise is to choose the measurement matrix with low correlation between the columns or the rows. Finally, the theoretical bounds are verified with numerical simulations by calculating the mean-squared-error for the different noise variances. The simulation results show that OMP owns the better performance than the other three recovery algorithms under the noisy signal model. © 2013 IEEE.
Xu, J, Wu, Q, Zhang, J, Shen, F & Tang, Z 1970, 'Training boosting-like algorithms with semi-supervised subspace learning', 2013 IEEE International Conference on Image Processing, 2013 20th IEEE International Conference on Image Processing (ICIP), IEEE, Melbourne, Australia, pp. 4302-4306.
View/Download from: Publisher's site
View description>>
Boosting algorithms have attracted great attention since the first real-time face detector by Viola & Jones through feature selection and strong classifier learning simultaneously. On the other hand, researchers have proposed to decouple such two procedures to improve the performance of Boosting algorithms. Motivated by this, we propose a boosting-like algorithm framework by embedding semi-supervised subspace learning methods. It selects weak classifiers based on class-separability. Combination weights of selected weak classifiers can be obtained by subspace learning. Three typical algorithms are proposed under this framework and evaluated on public data sets. As shown by our experimental results, the proposed methods obtain superior performances over their supervised counterparts and AdaBoost. © 2013 IEEE.
Xu, W, Miao, Z, Zhang, J, Zhang, Q & Wu, H 1970, 'Spatial-Temporal Context for Action Recognition Combined with Confidence and Contribution Weight', 2013 2nd IAPR Asian Conference on Pattern Recognition, 2013 2nd IAPR Asian Conference on Pattern Recognition (ACPR), IEEE, Naha, JAPAN, pp. 576-580.
View/Download from: Publisher's site
Yang, X, Dutkiewicz, E, Cui, Q, Huang, X, Tao, X & Fang, G 1970, 'Analog compressed sensing for multiband signals with non-modulated Slepian basis', 2013 IEEE International Conference on Communications (ICC), ICC 2013 - 2013 IEEE International Conference on Communications, IEEE, Budapest, Hungary, pp. 4941-4945.
View/Download from: Publisher's site
View description>>
Recently, the recovery performance of analog Compressed Sensing (CS) has been significantly improved by representing multiband signals with the modulated and merged Slepian basis (MM-Slepian dictionary), which avoids the frequency leakage effect of the Discrete Fourier Transform (DFT) basis. However, the MM-Slepian dictionary has a very large scale and corresponds to a large-scale measurement matrix, which leads to high recovery computational complexity. This paper resolves the above problem by modulating and band-limiting the multiband signal rather than modulating the Slepian basis. Specifically, instead of using the MM-Slepian dictionary to represent the whole multiband signal, we propose to use the non-modulated Slepian basis to represent the modulated and band-limited version of the multiband signal based on the recently proposed Modulated Wideband Converter (MWC). Furthermore, based on the analytical derivation with the non-modulated Slepian basis, we propose an Interpolation Recovery (IR) algorithm to take full advantage of the Slepian basis, whereas the Direct Recovery (DR) algorithm using the Moore-Penrose pseudo-inverse cannot achieve this. Simulation results verify that, with low recovery computational load, the non-modulated Slepian basis combined with the IR algorithm improves the recovery SNR by up to 35 dB compared with the DFT basis in noise-free environment. © 2013 IEEE.
Yang, X, Zhang, T, Xu, C & Xu, M 1970, 'Graph-Guided Fusion Penalty Based Sparse Coding for Image Classification', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Pacific-Rim Conference on Multimedia, Springer International Publishing, Nanjing, China, pp. 475-484.
View/Download from: Publisher's site
View description>>
In image classification, conventional sparse coding only encodes local features independently. As a result, the similar local features may be encoded into code vectors with large discrepancy. This sensitiveness has became the bottleneck of the traditional sparse coding based image classification methods. In this paper, we propose a novel graph-guided fusion penalty based sparse coding method. To alleviate the sensitiveness of the traditional sparse coding, our approach constrains that the similar local features are encoded into similar code vectors. To achieve this goal, we add the popular graph-guided fusion penalty term into the traditional l1-regularized sparse coding formulation. Finally, we adopt the multi-task form of the smoothing proximal gradient method to solve our optimization problem efficiently. Experimental results on 3 benchmark datasets demonstrate the effectiveness of our improved sparse coding method in image classification. © Springer International Publishing Switzerland 2013.