International Journal of Communication Systems

Cover image for Vol. 27 Issue 8

Early View (Online Version of Record published before inclusion in an issue)

Edited By: Professor Mohammad S. Obaidat

Impact Factor: 1.106

ISI Journal Citation Reports © Ranking: 2013: 40/78 (Telecommunications); 139/247 (Engineering Electrical & Electronic)

Online ISSN: 1099-1131

  1. Research Articles

    1. An analytic network process and trapezoidal interval-valued fuzzy technique for order preference by similarity to ideal solution network access selection method

      Emmanouil Skondras, Aggeliki Sgora, Angelos Michalas and Dimitrios D. Vergados

      Article first published online: 12 SEP 2014 | DOI: 10.1002/dac.2833

      Thumbnail image of graphical abstract

      In this paper, a network selection method is proposed by employing two multi attribute decision-making methods algorithms: the analytic network process (ANP), which is an extension of the analytic hierarchy process (AHP) for criteria weights calculation and a fuzzy version of the technique for order preference by similarity to ideal solution (TOPSIS) for accomplishing the ranking of the candidate networks. The proposed method considers network QoS characteristics and policies, application requirements and different types of users SLAs to provide advanced connection services. Performance evaluation shows that the proposed method performs better compared to the original TOPSIS and the Fuzzy AHP - ELECTRE (FAE) method when the user requests only one service while it considers users running multiple services simultaneously on a device.

    2. A weighted kernel possibilistic c-means algorithm based on cloud computing for clustering big data

      Qingchen Zhang and Zhikui Chen

      Article first published online: 8 SEP 2014 | DOI: 10.1002/dac.2844

      Thumbnail image of graphical abstract

      The paper proposes a weighted kernel possibilistic c-means algorithm to cluster data objects in appropriate groups in real time. The proposed algorithm introduces weights to define the relative importance of each object in the kernel clustering solution. In order to improve the real time of the proposed algorithm, cloud computing technology is used to optimize wkPCM to propose a distributed wkPCM algorithm based on MapReduce.

  2. Editorials

    1. You have free access to this content
      Complex communication networks

      Zhikui Chen, Laurence T. Yang and Geyong Min

      Article first published online: 8 SEP 2014 | DOI: 10.1002/dac.2846

  3. Research Articles

    1. Performance analysis of hop-limited epidemic routing in DTN with limited forwarding times

      Yahui Wu, Su Deng and Hongbin Huang

      Article first published online: 7 AUG 2014 | DOI: 10.1002/dac.2845

      Thumbnail image of graphical abstract

      This paper proposes a unifying framework to evaluate the performance of Epidemic routing algorithm when both the message hop count and the maximal forwarding times of each node are limited. It checks the accuracy of the framework through simulations. Numerical results show that both the message hop count and the forwarding times can have certain impact on the performance, but their impact is related with many other factors (e.g., the number of nodes).

    2. Performance analysis of distributed underwater wireless acoustic sensor networks in the presence of internal solitons

      Amit Kumar Mandal, Sudip Misra, Mihir Kumar Dash and Tamoghna Ojha

      Article first published online: 6 AUG 2014 | DOI: 10.1002/dac.2843

      Thumbnail image of graphical abstract

      In UWASNs, the internode communication takes place through acoustic signal. During propagation through internal solitons in the ocean, acoustic signal is attenuated. Therefore, if nodes are deployed in an internal soliton induced region, communication performance of UWASNs is greatly affected. The scenario has been shown in the figure provided. This paper presents the performance analysis of UWASNs in the presence of internal solitons in terms of some metrics, namely, SINR, BER, delay, and average energy consumption per node.

    3. Gradually adaptive recommendation based on semantic mapping of users′ interest correlations

      Jian Chen, Xiaokang Zhou and Qun Jin

      Article first published online: 1 AUG 2014 | DOI: 10.1002/dac.2835

      Thumbnail image of graphical abstract

      A gradually adaptive recommendation model based on semantic mapping of users' interest correlations and a combination of commonalities and individualities was proposed, and users' information access behaviors and histories were analyzed in order to recommend a sequence of information seeking actions to the target users. A set of measures was introduced and defined, and the mechanism to infer the interest focus was developed. The system architecture and experimental evaluation result were described and demonstrated in this paper.

    4. DNS tunneling detection through statistical fingerprints of protocol messages and machine learning

      M. Aiello, M. Mongelli and G. Papaleo

      Article first published online: 28 JUL 2014 | DOI: 10.1002/dac.2836

      Thumbnail image of graphical abstract

      The use of covert-channel methods to bypass security policies has increased considerably in the recent years. The paper discusses several machine learning tools for DNS tunneling detection in the presence of silent intruders and by looking at the entire aggregate of traffic. Neither packet inspection nor socket-by-socket analysis is required. Quick statistical fingerprints generation is also considered. Results are presented for a real network scenario.

    5. Modified quantum superdense coding for distributed communications

      Sándor Imre

      Article first published online: 25 JUL 2014 | DOI: 10.1002/dac.2841

      Thumbnail image of graphical abstract

      In this paper, a new medium access protocol has been introduced for distributed systems. The protocol improves its efficiency by utilising a special quantum mechanical effect, called entanglement. The new approach was compared with the well-known slotted-Aloha.

    6. Noise-based spreading in code division multiple access systems for secure communications

      Stevan M. Berber

      Article first published online: 25 JUL 2014 | DOI: 10.1002/dac.2840

      Thumbnail image of graphical abstract

      This paper presents the theory, simulation, and implementation in digital signal processor technology of a code division multiple access system that uses random spreading sequences. The expressions for probability of bit error are derived for the cases when the additive white Gaussian noise and fading are present in the channel. In contrast to the existing code division multiple access systems, which are based on binary sequences, the complex transmitted signal in the analyzed system is a sum of random signals that can enormously increase the security in signal transmission depending on the goodness of the random sequence generators. The developed theory was confirmed by a prototype of the system that was designed in digital signal processor technology. The main problem in the system is how to synchronize the received spread sequence with the locally generated sequences. Hence, a mathematical model of the synchronization block for the system has been separately designed and developed. The synchronization procedure has been demonstrated on the basis of application of a periodically repeated pilot sequence.

    7. Cooperative beamforming and relay selection in cognitive radio systems

      M. Abbasi-Jannatabad and H. Khoshbin

      Article first published online: 24 JUL 2014 | DOI: 10.1002/dac.2834

      Thumbnail image of graphical abstract

      We suggest an optimal algorithm for relay selection and cooperative beamforming (BF) in an underlay cognitive radio system. The relay selection and BF optimization problem is solved separately by employing convex semidefinite programming through rank-one relaxation.

    8. Security and performance enhancement of AODV routing protocol

      Harris Simaremare, Abdelhafid Abouaissa, Riri Fitri Sari and Pascal Lorenz

      Article first published online: 22 JUL 2014 | DOI: 10.1002/dac.2837

      Thumbnail image of graphical abstract

      We propose a new secure protocol called Trust Ad Hoc On-demand Distance Vector (AODV) using trust mechanism. Next part, we improve the performance of Trust AODV using ant algorithm. The performance Trust AODV+ Ant is compared with simple ant routing algorithm, AODV, and Trust AODV under denial of service/distributed denial of service attacks. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, there is no significant improvement in terms of end-to-end delay.

    9. An analysis of energy consumption for TCP data transfer with burst transmission over a wireless LAN

      Masafumi Hashimoto, Go Hasegawa and Masayuki Murata

      Article first published online: 14 JUL 2014 | DOI: 10.1002/dac.2832

      Thumbnail image of graphical abstract

      This paper analyzes and models the energy consumption of a wireless client during Transmission Control Protocol (TCP) data transfer over an IEEE 802.11-based WLAN, focusing on the behavior of TCP congestion control mechanisms. Through numerical examples, we show that sleep efficiency of a client improves by changing timings of packet transmission and reception by the TCP-level burst transmission.

    10. A robust and efficient dynamic identity-based multi-server authentication scheme using smart cards

      Chin-Chen Chang, Ting-Fang Cheng and Wei-Yuan Hsueh

      Article first published online: 13 JUL 2014 | DOI: 10.1002/dac.2830

      Thumbnail image of graphical abstract

      In this paper, we introduce some weaknesses in the multi-server authentication scheme by Li et al. Then, we propose a new version for the resistance of various malicious attacks and provide a formal proof for confirming the correctness of mutual authentication of our scheme. In the comparisons with related schemes, our proposed scheme is more applicable to real-world environments because of lower computational and communication costs.

    11. Hybrid offset-time and burst assembly algorithm (H-OTBA) for delay sensitive applications over optical burst switching networks

      Abdulsalam A. Yayah, Yahaya Coulibaly, Abdul Samad Ismail and George Rouskas

      Article first published online: 10 JUL 2014 | DOI: 10.1002/dac.2821

      Thumbnail image of graphical abstract

      The paper proposes an efficient hybrid burst assembly algorithm for optical burst switching (OBS) networks to reduce end-to-end delay. The aim is to make OBS suitable for real-time and mission critical applications that have stringent delay requirements.

    12. Impulsive noise estimation and suppression in OFDM systems over in-home power line channels

      Mohammad Reza Ahadiat, Paeiz Azmi and Afrooz Haghbin

      Article first published online: 9 JUL 2014 | DOI: 10.1002/dac.2831

      Thumbnail image of graphical abstract

      This paper proposes a new adaptive iterative method to impulsive noise mitigation in Orthogonal Frequency Division Multiplexing systems over in-home power line channels. The 64-QAM constellation is applied together with Alamouti space time coding to transmit, MIMO in-home power line channel and zero-forcing estimate with continuous loop impulsive noise detection and mitigation together with Maximum-Likelihood Detection are adopted to receive.

    13. Performance analyses of adaptive noncoherent receivers for MC-CDMA communications

      Jun-Da Chen, Fang-Biau Ueng, Ye-Shun Shen and Yuan-Hung Cheng

      Article first published online: 4 JUL 2014 | DOI: 10.1002/dac.2827

      Thumbnail image of graphical abstract

      The proposed noncoherent receivers are composed of a linear equalizer and a decision-feedback differential detector to detect DPSK signals. The performances of the proposed noncoherent receivers can be improved by increasing the number of feedback symbols. For an infinite number of feedback symbols, the optimum weight can be derived analytically, and the performances of the proposed noncoherent receivers approach that of the conventional coherent receiver. Furthermore, the reduced-rank schemes are proposed to simplify the system complexities.

    14. Forgery attacks of an identity-based multi-proxy signature scheme

      Wun-She Yap and Bok-Min Goi

      Article first published online: 1 JUL 2014 | DOI: 10.1002/dac.2828

      Thumbnail image of graphical abstract

      Multi-proxy signature is used to delegate permission of an owner to at least two proxies in the digital world. Recently, Sahu and Padhye gave a new construction of identity-based multi-proxy signature. We demonstrate that any dishonest insider or any malicious outsider can break the security of Sahu and Padhye's scheme by forging either a permission or a multi-proxy signature.

    15. Reducing session establishment delay using timed out packets in SIP signaling network

      Garima Mishra, S. Dharmaraja and Subrat Kar

      Article first published online: 29 JUN 2014 | DOI: 10.1002/dac.2824

      Thumbnail image of graphical abstract

      In this paper, we study the Session Initiation Protocol (SIP) system behavior for two types of SIP signaling traffic (Invites and Non-invites) by creating a cut-off priority queueing model. SIP retransmission mechanism with timeout is modeled as a queueing system with impatient customers. Using this model, the effect of unnecessary retransmissions is studied.

    16. A chaotic map-based anonymous multi-server authenticated key agreement protocol using smart card

      Jia-Lun Tsai and Nai-Wei Lo

      Article first published online: 25 JUN 2014 | DOI: 10.1002/dac.2829

      Thumbnail image of graphical abstract

      In this study, a novel chaotic map-based anonymous multi-server authenticated key agreement protocol using smart card is proposed. In this protocol, a legal user can access multiple servers using only a single secret key obtained from a trusted third party, known as the registration center. Security analysis shows this protocol is secure against well-known attacks.

    17. A practical lottery using oblivious transfer

      Yi-Ning Liu, Chi Cheng, Tao Jiang and Chin-Chen Chang

      Article first published online: 25 JUN 2014 | DOI: 10.1002/dac.2825

      Thumbnail image of graphical abstract

      It is vital to guarantee the fairness of the lottery, especially for the game over Internet. The traceability is a good way to assure the fairness. We present a protocol using oblivious transfer, which is not only secure but also efficient.

    18. Performance modeling of FEC-based unequal error protection for H.264/AVC video streaming over burst-loss channels

      Chun-I Kuo, Ce-Kuen Shieh, Wen-Shyang Hwang and Chih-Heng Ke

      Article first published online: 24 JUN 2014 | DOI: 10.1002/dac.2826

      Thumbnail image of graphical abstract

      This paper proposes a model of forward error correction-based unequal error protection for H.264/AVC over burst-loss networks while simultaneously maintaining a lower computing complexity.

    19. Blind carrier frequency offset mitigation in space–time block-coded multicarrier code division multiple access uplink transmission

      Tung-Chou Chen and Tsui-Tsai Lin

      Article first published online: 19 JUN 2014 | DOI: 10.1002/dac.2823

      Thumbnail image of graphical abstract

      In this paper, a blind carrier frequency offset (CFO) estimation is proposed on the basis of the linearly constrained optimization for the uplink transmission of space-time block-coded multicarrier code-division multiple-access systems. In addition, a space-time averaging technique is designed to enhance the robustness to the finite sample effect. Simulation study confirms that with the proposed CFO estimator used in the preceding, the receiver can nearly achieve the performance of the receiver working in the absence of a CFO.

    20. Effect of imperfect channel state information and co-channel interferences on two-hop fixed gain amplify-and-forward relay networks with beamforming

      Min Lin, Heng Wei, Kang An, Jian Ouyang and Yongming Huang

      Article first published online: 16 JUN 2014 | DOI: 10.1002/dac.2822

      Thumbnail image of graphical abstract

      By taking the joint effect of interference and imperfect channel state information into account, where feedback delay is assumed at the multi-antenna source and channel estimation error is assumed at the multi-antenna destination, this paper has investigated a two-hop fixed gain amplify-and-forward relay network with beamforming. The analytical expressions and the asymptotic results for the outage probability and average symbol error rate of the considered amplify-and-forward relaying are derived. Simulations results have confirmed the validity of our presented analytical results and revealed that interference and imperfect channel state information significantly degrades the system performance by reducing the output signal-to-interference-plus-noise ratio and the diversity order from the minimum number of employed antennas at source and destination to unity, respectively. Moreover, feedback delay poses a greater influence on the system performance than the estimation error.

    21. Towards realistic connectivity restoration in partitioned mobile sensor networks

      I.F. Senturk, K. Akkaya and S. Janansefat

      Article first published online: 16 JUN 2014 | DOI: 10.1002/dac.2819

      Thumbnail image of graphical abstract

      The straight line between two points may not provide the optimal movement path in terms of energy consumption when different terrain features are considered. Further, movement may not be completed due to obstacles or steep elevation. Therefore, the movement trajectory must be determined using a path planning algorithm that considers the risk and elevation of the terrain sections to ensure the success of the movement while minimizing energy consumption.

    22. A short ID-based proxy signature scheme

      Maryam Rajabzadeh Asaar, Mahmoud Salmasizadeh and Willy Susilo

      Article first published online: 10 JUN 2014 | DOI: 10.1002/dac.2820

      Thumbnail image of graphical abstract

      Singh and Verma and Yoon et al. constructions are two schemes for identity-based proxy signatures with message recovery property. Unfortunately, Tian et al. showed that the former is not secure. In this paper, first, we discuss why the latter does not have message recovery property. Second, we propose a short identity-based proxy signature scheme with the help of message recovery property and show that it is secure under computational Diffie-Hellman assumption in the random oracle model.

    23. Enhanced fuzzy logic-based spray and wait routing protocol for delay tolerant networks

      Sweta Jain, Meenu Chawla, Vasco N. G. J. Soares and Joel J. Rodrigues

      Article first published online: 28 MAY 2014 | DOI: 10.1002/dac.2796

      Thumbnail image of graphical abstract

      In this work, Spray and Wait routing protocol, which is a popular controlled replication based for delay tolerant networks, has been enhanced using a new fuzzy-based buffer management strategy (EFSnWR), with the aim to achieve increased delivery ratio and reduced overhead ratio. It aggregates three important message properties, namely number of replicas of a message, its size, remaining time-to-live using fuzzy logic controller to determine the message priority.

    24. An hybrid evolutionary multiobjective algorithm for multiuser margin maximization in DSL

      Ana Gomes, Marcio Monteiro, Boris Dortschy and Aldebaro Klautau

      Article first published online: 28 MAY 2014 | DOI: 10.1002/dac.2812

      Thumbnail image of graphical abstract

      This work describes the application of evolutionary algorithms on the multiuser spectrum and signal-to-noise ratio margin optimization problem for digital subscriber line. The proposed method is designed such that it takes advantage of special characteristics of the well-known power adaptation techniques and uses them to solve the problem of multiuser margin adaptation. Simulations show that the proposed method provides Pareto-optimal and diverse solutions when compared with a previous method to solve the same problem.

    25. Privacy-friendly weighted-reputation aggregation protocols against malicious adversaries in cloud services

      Mingwu Zhang, Yong Xia, Ou Yuan and Kirill Morozov

      Article first published online: 22 MAY 2014 | DOI: 10.1002/dac.2817

      Thumbnail image of graphical abstract

      Reputation systems are used for evaluating trustworthiness of the users based on their feedback (i.e., votes) about each other. In this work, we propose two privacy-friendly weighted-reputation aggregation protocols: one in semi-honest model and another one in malicious model, which uses the cryptographic primitives of homomorphic encryption, verifiable encryption, and the proof of knowledge of a discrete logarithm.

    26. Efficient mobile dynamic ID authentication and key agreement scheme without trusted servers

      Han-Yu Lin

      Article first published online: 20 MAY 2014 | DOI: 10.1002/dac.2818

      Thumbnail image of graphical abstract

      In this paper, the author proposed an efficient mobile dynamic ID authentication and key agreement scheme without trusted servers. Our scheme is optimized for the client-side computation, which helps with the utilization of mobile devices. Compared with related works, ours is better in terms of security and client-side computation efficiency.

    27. Discrete polynary coding immune clonal selection-based joint subcarrier and power allocation in uplink cognitive OFDM network

      Ronghua Shang, Kun Zhang, Licheng Jiao and Jianshe Wu

      Article first published online: 19 MAY 2014 | DOI: 10.1002/dac.2797

      Thumbnail image of graphical abstract

      Cognitive radio has been considered to be one of the main technologies to solve the problem of low spectrum utilization, while the adaptive allocation of network resource is one of the key technologies. A discrete polynary coding immune clonal selection (DPICS)-based joint subcarrier and power allocation algorithm is proposed to solve the resource allocation problem in uplink cognitive OFDM networks. The novelties of DPICS include the following. (1) A unique coding method is adopted to deal with multi-value discrete variables. Compared with the traditional methods, the proposed method can acquire the shortest code. Meanwhile, the constraints of the subcarrier allocation are avoided. (2) A heuristic mutation scheme is used to direct the mutation. Subcarriers are reallocated randomly to the secondary users with larger homotactic noise, which has a large probability to produce the optimal solution and improves the searching process. (3) Subcarriers and power are allocated simultaneously, which is different with the traditional biphasic resource allocation algorithms. The biphasic resource allocation algorithms cannot acquire the subcarrier allocation result and power allocation result simultaneously, which makes the final result imprecise. The proposed algorithm avoids this situation and improves the accuracy of the final result. Compared with the state-of-the-art algorithms, the proposed algorithm is shown as effective by simulation results.

    28. Recognizing and characterizing dynamics of cellular devices in cellular data network through massive data analysis

      Jun Liu, Nan Chang, Sanguo Zhang and Zhenming Lei

      Article first published online: 15 MAY 2014 | DOI: 10.1002/dac.2809

      Thumbnail image of graphical abstract

      This paper proposes a novel Jaccard measurement-based method to recognize cellular device models from network traffic data. This method is implemented as a scalable paralleled MapReduce program and achieves a high accuracy, 91.5%, in the evaluation with 2.9 billion traffic records collected from the real network. Based on the recognition results, this paper conducts a comprehensive study of three characteristics of network traffic from device model perspective, the network access time, the traffic volume, and the diurnal patterns.

    29. Efficient multi-hop wireless broadcast protocol in vehicular networks using automated threshold function design

      Michael Slavik, Imad Mahgoub and Mohammed Alwakeel

      Article first published online: 15 MAY 2014 | DOI: 10.1002/dac.2799

      Thumbnail image of graphical abstract

      Vehicular networking applications often use multi-hop wireless broadcasting as a primary data dissemination mechanism. We present an automated optimization technique for the design of threshold functions in statistical broadcasting methods for these applications, compare and contrast various statistical methods, and propose a new broadcasting protocol derived from these results.

  4. Special Issue - Complex Networks

    1. Sampling from social network to maintain community structure

      Chao Tong, Jianwei Niu, Zhongyu Xie and Fu Peng

      Article first published online: 14 MAY 2014 | DOI: 10.1002/dac.2815

      Thumbnail image of graphical abstract

      This paper defines two concepts, namely ‘community degree’ and ‘center of community’, and proposes an improved forest fires algorithm based on them, which can not only decrease the scale of network data, but also can maintain the previous network community structure well. It has been proved by experimental verification that the improved algorithm is better than the other six sampling algorithms in most of the parameters. This paper also gives the recommended values based on the results of different parameters.

  5. Research Articles

    1. ADS-B aided robust relay selection for cooperative communications in aircraft approach

      Hua Li, Cunqing Hua, Cailian Chen and Xinping Guan

      Article first published online: 14 MAY 2014 | DOI: 10.1002/dac.2803

      Thumbnail image of graphical abstract

      Paper ‘ADS-B aided Robust Relay Selection for Cooperative Communications in Aircraft Approach’ written by Hua Li, Cunqing Hua, Cailian Chen, and Xinping Guan* proposes a heuristic relay selection algorithm of cooperative communications in the aircraft approach stage. The ADS-B and ATP technique have both considered in the problem formulation and algorithm design. Simulation results prove the effectiveness of the algorithm.

    2. Embedding and reconfiguration algorithms for service aggregation in network virtualization

      Yiming Jiang, Julong Lan, Zhiming Wang and Yuanyuan Deng

      Article first published online: 13 MAY 2014 | DOI: 10.1002/dac.2794

      Thumbnail image of graphical abstract

      In this paper, we present a virtual network (VN) embedding scheme that aims at improving the effect of transmission quality optimization. In order to enable more service benefit from optimization, the embedding algorithm presented in this paper tries to embed the VN request onto the infrastructures that host numerous VNs with the same requirement of transmission quality. We also develop a reconfiguration algorithm based on service aggregation and load balance.

    3. Delay constraint multipath routing for wireless multimedia ad hoc networks

      Yanjing Sun, Jianguang Sun, Fangfang Zhao and Zhuoxian Hu

      Article first published online: 12 MAY 2014 | DOI: 10.1002/dac.2814

      Thumbnail image of graphical abstract

      In this paper, a new architecture of improved Dijkstra algorithm based on the metric of delay constraint is presented to perform minimum delay multipath selection by making use of greedy algorithm. We use the multipath optimized link state routing (MOLSR) protocol to implement the M-Dijkstra algorithm. Through the process of topology discovery and route computation, the improved protocol (QoS-MOLSR) can gain the minimum delay multipath route, which is proved to be suitable for multimedia transmission in wireless multimedia ad hoc networks.

    4. Smart antenna-assisted spectrum sensing for robust detection in cognitive radio networks

      Haobo Qing, Yuanan Liu and Gang Xie

      Article first published online: 12 MAY 2014 | DOI: 10.1002/dac.2813

      Thumbnail image of graphical abstract

      The proposed smart antenna-assisted spectrum sensing techniques for multiband detection in cognitive radio networks are robust to noise uncertainty, as they require no prior knowledge of noise variance. To enhance the detection performance, the proposed schemes jointly utilize the information of eigenvalues and eigenvectors, signal and noise subspace components in conjunction with the likelihood functions and Gerschgorin radii. The simulation results demonstrate that our approaches are able to significantly outperform other existing spectrum sensing methods.

    5. Resource allocation in MIMO-OFDM-based cooperative cognitive radio networks: optimal and suboptimal low complexity approaches

      M. G. Adian and H. Aghaeinia

      Article first published online: 9 MAY 2014 | DOI: 10.1002/dac.2804

      Thumbnail image of graphical abstract

      The problem of resources allocation in multiple-input multiple-output-orthogonal frequency division multiplexing-based cooperative cognitive radio networks with decode-and-forward strategy is considered in this paper. The optimal resource allocation is realized subject to transmit and interference power constraints, and because of high computational complexity of the optimal approach, a suboptimal algorithm is further proposed.

    6. A multi-objective optimization model based on immune algorithm in wireless mesh networks

      Jing Chen, Kun He, Ruiying Du, Fajiang Yu, Quan Yuan, Lina Wang and Cai Fu

      Article first published online: 9 MAY 2014 | DOI: 10.1002/dac.2808

      Thumbnail image of graphical abstract

      For optimizing the performance from a whole perspective, we propose a multi-objective optimization model based on immune algorithm (MOM-IA) which provides a paradigm to search optimal solution satisfying some different restriction conditions. Considering the characteristic of dynamic and the discrete integer parameters in wireless mesh network, we design a longtime evolution immune algorithm to solve the MOM. Finally, the analysis of experiments presents that MOM-IA has good performance in solution set diversity and Pareto-front distribution, which means the probability to find the optimal solution in wireless mesh network.

    7. Secured routing in wireless sensor networks using fault-free and trusted nodes

      Geetha D. Devanagavi, N. Nalini and Rajashekhar C. Biradar

      Article first published online: 8 MAY 2014 | DOI: 10.1002/dac.2810

      Thumbnail image of graphical abstract

      This paper proposes fault tolerant-based secured routing scheme in wireless sensor networks through an integrated approach of fault-free and trustworthy nodes. Fault-free nodes are identified by node battery power and interference, and trusted neighbors are identified using agent-based trust model. Secured routes are established through fault-free and trusted nodes.

    8. Implementing virtual platform for global-scale cyber physical system networks

      SungWon Ahn, Chuck Yoo, ShinHyung Lee, HyungSoo Lee and Sung Jo Kim

      Article first published online: 8 MAY 2014 | DOI: 10.1002/dac.2811

      Thumbnail image of graphical abstract

      An example of the global scale cyber physical system (CPS) concept. In our system, several isolated and differing virtual CPS networks can coexist on a physical network while maximizing resource usage and providing diverse CPS services.

    9. A topology preserving cluster-based channel assignment for wireless mesh networks

      Kavitha Athota and Atul Negi

      Article first published online: 8 MAY 2014 | DOI: 10.1002/dac.2807

      Thumbnail image of graphical abstract

      Cluster-based channel assignment (CBCA) is a topology preserving channel assignment. It is easy to understand CBCA through the three steps of wireless mesh network clustering, interface assignment, and finally channel assignment.

    10. Analysis of spectrally efficient two-way relay assisted free space optical systems in atmospheric turbulence with path loss

      Parul Puri, Parul Garg and Mona Aggarwal

      Article first published online: 6 MAY 2014 | DOI: 10.1002/dac.2801

      Thumbnail image of graphical abstract

      We investigate a network-coded, decode-and-forward, two-way relay-assisted free space optical communication system. The relay establishes one round communication between the terminal nodes in two time phases when direct communication is not possible between the terminal nodes because of large distance or in presence of an obstruction. Closed form expressions for system outage, error performance, and achievable capacity have been presented.

    11. Flow-oriented detection of low-rate denial of service attacks

      Zhijun Wu, Ran Hu and Meng Yue

      Article first published online: 30 APR 2014 | DOI: 10.1002/dac.2805

      Thumbnail image of graphical abstract

      An approach of low-rate denial of service (LDos) attacks detection is proposed on the basis of principal component analysis (PCA) algorithm. The proposed approach analyzes LDos attack flows and handles complicated network flows by using PCA algorithm to establish the network traffic matrix model, which is established on the basis of a large number of data acquisitions. The proposed approach can predigest the high dimension vector, which is composed of networks flows, guarantee the detection precision, and reduce the computation consuming.

    12. Optimal resource allocation for heterogeneous traffic in multipath networks

      Shiyong Li, Wei Sun and Changchun Hua

      Article first published online: 28 APR 2014 | DOI: 10.1002/dac.2800

      Thumbnail image of graphical abstract

      We consider resource allocation for heterogeneous traffic in multipath networks and formulate an optimization problem, which is intrinsically difficult nonconvex. In order to address the aforementioned issue and obtain the optimum, we approximate an equivalent problem of the original optimization problem to a strictly convex problem and present a primal-dual resource allocation algorithm for the approximation problem, which converges to an optimal solution satisfying the Karush-Kuhn-Tucker conditions of the original problem.

    13. Design of reduced complexity feedback precoding for MIMO-OFDM

      Tadesse Ghirmai

      Article first published online: 28 APR 2014 | DOI: 10.1002/dac.2806

      Thumbnail image of graphical abstract

      For MIMO-OFDM, per-subcarrier precoding schemes have high feedback overhead and incur huge computational cost to determine the best precoding matrix for each subcarrier. In this paper, we propose a per-band precoding scheme that precodes a group subcarriers by only one precoder and develop reduced complexity precoding selection methods that lead to the design of efficient receivers and reduced feedback overhead.

    14. A wavelet-based expert system for digital subscriber line topology identification

      V.D. Lima, A. Klautau, J. Costa, K. Ericson, A. Fertner and C. Sales

      Article first published online: 28 APR 2014 | DOI: 10.1002/dac.2795

      Thumbnail image of graphical abstract

      This work proposes a method for line topology identification in telephone networks. Basically, an expert system based on wavelet analysis (WES) interprets features resulting from different ‘paths’ taken by the input signal into the line, present both on impulse response and time-domain reflectometry trace. In this way, the method estimates three parameters that completely identify the topology according to the assumed model. We also present a thorough comparison with two state-of-the-art methods using several twisted-pair copper cables.

    15. Paths selection-based resequencing queue length in concurrent multipath transfer

      Fenghua Wang, Dongliang Xie, Jingyu Wang, Peng Zhang and Yan Shi

      Article first published online: 28 APR 2014 | DOI: 10.1002/dac.2792

      Thumbnail image of graphical abstract

      In this paper, we analyze the receiver buffer blocking problem brought by simultaneous data transfer. Then, we propose a new analytical model of reliable delivery to predict the Stream Control Transmission Protocol throughput and the length expectation of the resequencing queue in concurrent multipath transfer. Based on the model, the paths selection problem is formulated as a knapsack problem, which maximizes the overall throughput and limits the resequencing queue length expectation to the fixed receiver buffer size.

    16. Polyphase filter bank based multi-band spectrum sensing in cognitive radio systems

      Haijian Zhang, Didier Le Ruyet, Daniel Roviras and Hong Sun

      Article first published online: 24 APR 2014 | DOI: 10.1002/dac.2798

      Thumbnail image of graphical abstract

      This paper proposes a multi-band sensing architecture based on polyphase filter bank (PFB) for cognitive radio systems, which aims to reliably sense multiple active bands by exploiting the low leakage property of PFB. From the view of computational complexity, the performance gain obtained by PFB does not come with the penalty of increased complexity due to the inherent parallel structure of PFB.

    17. Enhancing secrecy capacity of multi-relay wiretap systems with partial channel state information

      Hang Long, Wei Xiang, Jing Wang, Xiaoli Zhang and Wenbo Wang

      Article first published online: 24 APR 2014 | DOI: 10.1002/dac.2802

      Thumbnail image of graphical abstract

      The secrecy capacity enhancement of the multi-relay wiretap system is investigated. Distributed precoding and channel state information (CSI) sharing schemes are proposed with the partial CSI for the relay-eavesdropper links. Simulation results demonstrate that with the increase of the power ratio of the constant part to the random part of the relay-eavesdropper channels, the proposed scheme with partial CSI performs increasingly close to the one with perfect CSI in secrecy capacity.

    18. Design and analysis of an improved smartcard-based remote user password authentication scheme

      SK Hafizul Islam

      Article first published online: 20 APR 2014 | DOI: 10.1002/dac.2793

      Thumbnail image of graphical abstract

      This paper proposed an enhanced password authentication scheme over Li et al. scheme. The proposed scheme has more low computation costs than others and has more security attributes than the earlier schemes.

  6. Special Issue - Complex Networks

    1. Risk computing based on capacity of risk-absorbing in virtual community environment

      Yang Liu, Zhikui Chen and Xiaoning Lv

      Article first published online: 16 APR 2014 | DOI: 10.1002/dac.2791

      Thumbnail image of graphical abstract

      A concept of capacity of risk-absorbing (CaRA) is introduced as a tolerance of risk, probably caused by the privilege of someone who has advanced identity or hierarchy in virtual community. A shapley value approach is given to compute individual's risk with CaRA involved.

    2. DAMORD: an aggregation algorithm for mobile point source using rate-distortion theory in wireless sensor networks

      Mehdi Aminian, Masoud Sabaei and Mohammad K. Akbari

      Article first published online: 16 APR 2014 | DOI: 10.1002/dac.2790

      Thumbnail image of graphical abstract

      Aggregation is one of the useful methods in WSNs in reducing energy consumption. In this paper, a new method is proposed for aggregating the data received from the mobile point source in a sensor network by using rate-distortion theory and considering spatial and temporal correlation. By this means, we can reduce the load of data transmitted to base station with considering the maximum distortion that can be tolerated by the user and so reducing the energy consumption.

  7. Research Articles

    1. A smartphone-centric platform for remote health monitoring of heart failure

      Igor Bisio, Fabio Lavagetto, Mario Marchese and Andrea Sciarrone

      Article first published online: 14 APR 2014 | DOI: 10.1002/dac.2778

      Thumbnail image of graphical abstract

      The paper introduces a remote health monitoring architecture thought for heart failure patients. The architecture technological core is the smartphone, which plays the role of hub, to convey data received by other sensors; sensor, to measure physical quantities; and processor, to process the measurements. The paper mainly focuses on one processing task: patient activity detection, which is based on the action of the smartphone-embedded accelerometer and is designed to recognize eight different classes of physical activities.

    2. An efficient distributed routing protocol for wireless sensor networks with mobile sinks

      Lei Shi, Zheng Yao, Baoxian Zhang, Cheng Li and Jian Ma

      Article first published online: 13 APR 2014 | DOI: 10.1002/dac.2785

      Thumbnail image of graphical abstract

      The proposed dynamic layered Voronoi scoping-based routing protocol (LVRP) for wireless sensor networks with mobile sinks integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as sinks move in the network. Simulation results show that LVRP can effectively reduce the protocol overhead while ensuring high packet delivery ratio.

    3. SEDP-based detection of low-rate DoS attacks

      Zhijun Wu, Meng Yue, Douzhe Li and Ke Xie

      Article first published online: 10 APR 2014 | DOI: 10.1002/dac.2783

      Thumbnail image of graphical abstract

      An approach of detecting Low-rate Denial of Service (LDoS) attacks is proposed by using the technology of signal processing based on the model of spectral energy distribution probability. This approach explores that the energy of LDoS attack is mostly distributed in the main lobe width while that of normal TCP traffic is just concentrated near zero in frequency domain. The LDoS attack is detected by calculating the energy variances between the incoming traffic of normal TCP and attack flows with preset threshold.

    4. A technique to improve network lifetime in mobile ad hoc networks

      Niranjan Kumar Ray and Ashok Kumar Turuk

      Article first published online: 9 APR 2014 | DOI: 10.1002/dac.2784

      Thumbnail image of graphical abstract

      A cost metric for energy aware routing in mobile ad hoc networks is proposed, which is a function of residual battery power and energy consumption rate of participating nodes. To minimize over utilization of a node, the proposed scheme limits the connection requests that can be established through a node to a particular destination. It also employs variable transmission power to transmit data packets.

    5. QoS mechanism for virtualized wireless networks with software-defined networking

      Jiann-Liang Chen and San-Peng Kao

      Article first published online: 7 APR 2014 | DOI: 10.1002/dac.2775

      Thumbnail image of graphical abstract

      A QoS strategy, rate limiting, was proposed for solving the bandwidth occupation problem in wired-wireless data network, which to obtain a desired QoS from end-to-end traffic flow. A software-defined networking based QoS mechanism, which based on OpenFlow-enabled NetFPGA platform was modified to support the rate limiting function for wired-wireless networks with the characteristic of high reconfigurable, scalability and virtualization. The experimental results show that the mechanism achieves 4.6% improvement in packet loss and 47% improvement in delay.

    6. Dense femtocell networks power self-optimization: an exact potential game approach

      Xidong Wang, Wei Zheng, Zhaoming Lu, Xiangming Wen and Wei Li

      Article first published online: 7 APR 2014 | DOI: 10.1002/dac.2788

      Thumbnail image of graphical abstract

      This paper proposes a distributed power self-optimization scheme to mitigate the serious inter-femtocell interference for the downlink operation of dense femtocell networks. On the basis of the exact potential game theory, the scheme is mathematically modeled as a noncooperative power self-optimization game among femtocells, which is demonstrated to converge to a pure and unique Nash equilibrium. Combined with firefly algorithm, an effective power self-optimization algorithm with guaranteed convergence is proposed to achieve the Nash equilibrium of the proposed game.

    7. Traffic matrix estimation: Advanced-Tomogravity method based on a precise gravity model

      Haifeng Zhou, Liansheng Tan, Fei Ge and Sammy Chan

      Article first published online: 4 APR 2014 | DOI: 10.1002/dac.2787

      Thumbnail image of graphical abstract

      This paper proposes a novel approach of traffic matrix estimation in large-scale IP networks, called Advanced-Tomogravity method. We establish a generalized gravity model refined by the tomography method and by the Moore–Penrose matrix inverse. Theoretical analysis and real data simulation demonstrate the advantages of our approach.

    8. Investigation of phantom circuit benefits for next generation xDSL systems

      Pavel Lafata

      Article first published online: 4 APR 2014 | DOI: 10.1002/dac.2786

      Thumbnail image of graphical abstract

      This paper is focused on measurements and analysis of phantom mode benefits in G.fast and next generation xDSL systems. The investigation is based on real measurements performed for a multi-quad metallic cable together with theoretical evaluations of phantom circuit potentials. The results illustrate that the benefits of phantom virtual circuits in far-end crosstalk (FEXT) dominant environment are very low, whereas on the other hand, their application together with a FEXT elimination technique may significantly improve resulting G.fast transmission performance in practice.

    9. A nodes scheduling model based on Markov chain prediction for big streaming data analysis

      Qingchen Zhang, Zhikui Chen and Laurence T. Yang

      Article first published online: 2 APR 2014 | DOI: 10.1002/dac.2779

      Thumbnail image of graphical abstract

      The paper proposes a nodes scheduling model for analyzing big streaming data in real time by following three steps: (i) construct data state transition graph using Markov chain to predict the varying trend of big streaming data; (ii) choose appropriate cloud nodes depending on the predicted result; and (iii) assign big streaming data to these nodes using the load balancing theory.

    10. Network coding based on hyper-edge decomposition for wireless network with link failures

      Jing Wang, Kaikai Chi, Yang Yang and Xinmei Wang

      Article first published online: 2 APR 2014 | DOI: 10.1002/dac.2781

      Thumbnail image of graphical abstract

      This paper is concerned with the construction of network coding for wireless network with link failures. Based on hyper-edge decomposition, for the wireless network, we first construct the hyper-edge graph, where each node represents one hyper-edge (consisting of multiple adjacent edges transmitting the same information) of the wireless network. Then we present a heuristic coloration method for the hyper-edge graph, and a network coding vector allocation scheme based on maximum distance separable code is proposed to effectively overcome some link failures.

  8. Special Issue - Complex Networks

    1. EEMHR: Energy-efficient multilevel heterogeneous routing protocol for wireless sensor networks

      Sudeep Tanwar, Neeraj Kumar and Jian-Wei Niu

      Article first published online: 31 MAR 2014 | DOI: 10.1002/dac.2780

      Thumbnail image of graphical abstract

      The following are the major contributions of our proposed scheme: to enhance the total initial energy of network field, k levels of nodes energy heterogeneity is used in the proposed scheme; and to increase the system stability, various performance parameters are selected. We have proposed a new method for the selection of CH in an optimized manner.

    2. The effect of hexagonal grid topology on wireless communication networks based on network coding

      Tao Shang, Fu-Hua Huang, Ke-Fei Mao and Jian-Wei Liu

      Article first published online: 25 MAR 2014 | DOI: 10.1002/dac.2782

      Thumbnail image of graphical abstract
      1. We introduced network intensity γ = r ∕ R to characterize the property of topology structure.

      2. We derived the tightest upper bound on the performance benefit of network coding in a single regular hexagon network, and we found that the exact upper bound is 12/7 only if inline image is satisfied.

      3. We derived the tightest upper bound on the performance benefit of network coding in a general hexagonal grid network, and we found that the exact upper bound is 16/7 only if inline image is satisfied.

  9. Research Articles

    1. Distributed topology management for wireless multimedia sensor networks: exploiting connectivity and cooperation

      Sudip Misra, Goutam Mali and Ayan Mondal

      Article first published online: 17 MAR 2014 | DOI: 10.1002/dac.2770

      Thumbnail image of graphical abstract

      Distributed topology management algorithm named T-Must is proposed in wireless multimedia sensor networks, orchestrating coalition formation game between camera sensor (CS) and scalar sensor (SS) nodes, and exploiting connectivity among CSs using relative neighborhood graph. SSs sense the monitored area. CSs start sensing the event when the information sent by SSs crosses the pre-configured threshold. Therefore, introducing heterogeneous sensor nodes in wireless multimedia sensor network helps in delivering more informational video packet compared to scalar packet to the base station avoiding unnecessary sensing by CSs.

  10. Special Issue - Complex Networks

    1. An exploration of cache collaboration in information-centric network

      Bohao Feng, Huachun Zhou, Shuai Gao and Ilsun You

      Article first published online: 17 MAR 2014 | DOI: 10.1002/dac.2773

      Thumbnail image of graphical abstract

      In this paper, we proposed a way of cache collaboration not only for the on-path but also for the off-path routers. Specifically, an interest counter was raised to rank different contents within a period. Then, an interest prune and a steady content advertisement mechanism was introduced to eliminate the duplicated cached content along en-route routers and cache neighbors, so that more cache capacity for different contents can be saved. The simulation results showed that our scheme performs well.

  11. Research Articles

    1. Modeling and performance analysis of information diffusion under information overload in Facebook-like social networks

      Pei Li and Yunchuan Sun

      Article first published online: 14 MAR 2014 | DOI: 10.1002/dac.2774

      Thumbnail image of graphical abstract

      This paper analyzes the process of information diffusion in Facebook-like social networks under information overload and introduces the term type influence to characterize the information diffusion efficiency for users of a given type. Having noticed the inaccuracy of using type influence to estimate the information diffusion efficiency for a given user, we introduce the term individual influence and propose a scalable approach to estimate it. The accuracy of the proposed approach is verified by simulations.

    2. Joint overlay and underlay resource allocation with weighted fairness in OFDM-based cognitive radio systems

      Wenjun Xu, Yan Wang, Kai Niu, Zhiqiang He and Jiaru Lin

      Article first published online: 14 MAR 2014 | DOI: 10.1002/dac.2776

      Thumbnail image of graphical abstract

      This paper investigates the problem of hybrid overlay and underlay spectrum access for OFDM based cognitive radio systems, in which both system capacity and user fairness considerations are integrated into the unified framework of weighted-capacity maximization. Max-capacity subcarrier assignment and optimal power allocation, along with a suboptimal power allocation algorithm, referred to as cap-limited waterfilling, are proposed for flexible spectrum distribution. Simulation results show that joint spectrum access is greatly beneficial to spectrum efficiency improvement in cognitive radio systems.

    3. Multiuser MIMO receivers for space frequency block coded SC-FDMA systems

      Jui-Chi Chang, Fang-Biau Ueng, Hsuan-Fu Wang and Ming-Hsiao Hsu

      Article first published online: 7 MAR 2014 | DOI: 10.1002/dac.2771

      Thumbnail image of graphical abstract

      We propose a turbo multiuser MIMO (MU-MIMO) receiver that utilizes the soft information from MAP decoder to effectively eliminate the multiple access interference (MAI) and fully exploit the channel capacity. By the simulation results in several typical MIMO channels, we find that the proposed minimum mean square error MU-MIMO receiver outperforms the orthogonal SFBC receiver over 1 dB at the cost of higher complexity. However, the proposed turbo MU-MIMO receivers can not only effectively cancel the MAI under overloaded channel conditions, but also achieve the capacity of MU-MIMO channel.

    4. Interference-aware MAC scheduling and admission control for multiple mobile WBANs used in healthcare monitoring

      Judhistir Mahapatro, Sudip Misra, Manjunatha Mahadevappa and Nabiul Islam

      Article first published online: 6 MAR 2014 | DOI: 10.1002/dac.2768

      Thumbnail image of graphical abstract

      In this paper, we address the problem of interference when multiple time division multiple access-based wireless body area networks (WBANs) come in the proximity of one another. We propose a solution that creates common non-conflicting schedule between these interfering WBANs. Our proposed scheme allows the reuse of maximum possible time slots among WBANs that are two-hop neighbors of one another. We show that the exchanges of common schedule are required in order to improve the packet delivery ratio in WBANs.

    5. Ant-based interactive workflow management: a case study on RMI

      Ahmet Sayar

      Article first published online: 3 MAR 2014 | DOI: 10.1002/dac.2766

      Thumbnail image of graphical abstract
      • A web based interactive workflow management tools
      • Using Ant build framework as workflow engine in distributed systems
      • Effectiveness of the system is tested through a case study on RMI jobs
    6. A burst loss probability model with impatient customer feature for optical burst switching networks

      Hoang-Linh To, Suk-Hwan Lee and Won-Joo Hwang

      Article first published online: 3 MAR 2014 | DOI: 10.1002/dac.2772

      Thumbnail image of graphical abstract

      Because the impatient customer phenomenon exists in almost telecommunication systems and optical burst switching (OBS) networks, we propose a model to estimate burst loss probability with impatient customer and verify by simulation with National Science Foundation Network topology using OBS technique. Our model achieves a better performance in high load in comparison with other approaches. We also analyze two architectures in OBS, which are shared and dedicated buffer. Results reveal that the shared buffer reduces loss better than the dedicated buffer.

    7. Cryptanalysis of smart-card-based password authenticated key agreement protocol for session initiation protocol of Zhang et al.

      Qi Jiang, Jianfeng Ma and Youliang Tian

      Article first published online: 27 FEB 2014 | DOI: 10.1002/dac.2767

      Thumbnail image of graphical abstract

      In this paper, we demonstrate that the smart-card-based password authenticated key agreement protocol for SIP of Zhang et al. is insecure against the malicious insider impersonation attack. We then proposed an effective fix to remedy the flaw, which remedies the security flaw without sacrificing efficiency. The lesson learned is that we should prevent the identity from being separated from the authenticators in future designs of two-factor authentication protocols.

    8. Improved IPSec tunnel establishment for 3GPP–WLAN interworking

      S. Samoui, I. El Bouabidi, M. S. Obaidat, F. Zarai, K. F. Hsiao and L. Kamoun

      Article first published online: 27 FEB 2014 | DOI: 10.1002/dac.2769

      Thumbnail image of graphical abstract

      In this article, we propose first a new scheme called (HIP_IKEv2) to secure 3GPP LTE-WLAN interworking by the establishment of an improved IPSec tunnel between them. Second, we benefit from MOBIKE in case of handover, and we extend HIP_IKEv2 to HIP_MOBIKEv2 protocol in order to reduce the authentication signaling traffic. The proposed solution reinforces authentication, eliminates man in the middle attack, reduces denial of service attack, assures the integrity of messages, and secures against reply attack.

    9. Combining network coding and compressed sensing for error correction in wireless sensor networks

      Siguang Chen, Meng Wu, Kun Wang, Zhixin Sun and Weifeng Lu

      Article first published online: 24 FEB 2014 | DOI: 10.1002/dac.2763

      Thumbnail image of graphical abstract

      In this paper, we construct a cooperating coding mechanism by combining the network coding (NC) and compressed sensing (CS). This scheme can reduce the amount of redundant information transmission significantly. Meanwhile, an NC decoding for error control is proposed to correct the errors and erasures. Although the decoding error of NC is existent, this error can be further reduced by the reconstruction process of CS, as a result, the relative recovery error is small enough in the sink.

    10. Data traffic-based analysis of delay and energy consumption in cognitive radio networks with and without resource reservation

      Mouna Elmachkour, Abdellatif Kobbane, Essaid Sabir, Jalel Ben-othman and Mohammed El koutbi

      Article first published online: 20 FEB 2014 | DOI: 10.1002/dac.2764

      Thumbnail image of graphical abstract

      The article proposes a new opportunistic cross-layer media access control protocol involving channel allocation and packet scheduling for cognitive radio networks. We consider secondary user (SU) data traffic characteristics to design the resource reservation scheme in order to improve QoS requirements. We allow successful SU with important data traffic to reserve data channel during x time slots without interfering with the primary users. We develop an analytical model to evaluate delay and energy consumption, and we show that cognitive radio performances improve noticeably.

    11. Power allocation in OFDM cognitive radio relay networks with outdated channel state information

      Shashika Biyanwilage, Upul Gunawardana and Ranjith Liyanapathirana

      Article first published online: 20 FEB 2014 | DOI: 10.1002/dac.2755

      Thumbnail image of graphical abstract

      In this paper, power allocation in OFDM-based cognitive radio (CR) relay networks is investigated assuming outdated channel state information (CSI) between secondary and primary users. Because only the outdated CSI is available between the CRs and primary users, the interference constraints are satisfied in an average manner. New power allocation methods are developed to maximize the capacity of CR relay transmission. Optimal power allocation methods are derived, and less complex suboptimal power allocation methods are also proposed.

  12. Special Issue - Ubiquitous Services

    1. Performance evaluation of IEEE 802.15.4 sensor networks in industrial applications

      Wan Du, David Navarro and Fabien Mieyeville

      Article first published online: 19 FEB 2014 | DOI: 10.1002/dac.2756

      Thumbnail image of graphical abstract

      This paper presents a comprehensive study of both beacon-enabled and nonbeacon-enabled modes under various parameter settings and the beacon tracking synchronization mechanism in the IEEE 802.15.4 standard. Additionally, the in-depth analysis of simulation results enables us to find the best parameter configurations to different traffic loads and application requirements.

  13. Research Articles

    1. Performance impact of JobTracker failure in Hadoop

      Young-Pil Kim, Cheol-Ho Hong and Chuck Yoo

      Article first published online: 18 FEB 2014 | DOI: 10.1002/dac.2759

      Thumbnail image of graphical abstract

      In this paper, we analyze the performance impact of JobTracker failure in Hadoop. We build a job completion time model that reflects failure effects. Our model is based on a stochastic process with a node crash probability. We run a simulation of performance impact with credible failure data available from USENIX computer failure data repository. The results show that the job completion time increases about four times typically, and in a worst case, it increases up to 68 times.

    2. Spectrum leasing based on Nash bargaining solution in cognitive radio networks

      Kai Ma, Jie Yang, Guoqiang Hu and Xinping Guan

      Article first published online: 17 FEB 2014 | DOI: 10.1002/dac.2757

      Thumbnail image of graphical abstract

      The basic idea is to make the primary user lease a fraction of the licensed spectrum to the secondary user, which acts as a relay for the primary user in return. The spectrum leasing problem is formulated as a Nash bargaining game. The cooperative condition and the optimal time allocation can be obtained by solving the game.

  14. Special Issue-Complex Networks

    1. Optimal epidemic broadcasting for vehicular ad hoc networks

      Daxin Tian, Jianshan Zhou, Yunpeng Wang, Haiying Xia, Zhenguo Yi and He Liu

      Article first published online: 17 FEB 2014 | DOI: 10.1002/dac.2758

      Thumbnail image of graphical abstract

      This paper presents a dynamic epidemic broadcasting model based on the ordinary differential equations. The proposed optimal control scheme is analyzed to understand the epidemic broadcasting properties, which include the message delivery probability, the expected delivery latency, and the number of copies.

  15. Research Articles

    1. Modeling and measurement of cross-talk transmission between coupled lines

      Dubravko Sabolić

      Article first published online: 12 FEB 2014 | DOI: 10.1002/dac.2762

      Thumbnail image of graphical abstract

      Experimental verification of the cross-talk propagation model is described in this article. Module of the transfer function for cross-talk transmission in a 15-m-long section of a polyvinyl chloride-isolated three-wire installation cable, with 0.75 mm2 copper conductors, was measured/calculated within the 5–30 MHz band in three different ways, with a good match of the results. For details, refer to Sections and of the article.

    2. A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets

      Yanjun Liu, Lein Harn and Chin-Chen Chang

      Article first published online: 12 FEB 2014 | DOI: 10.1002/dac.2760

      Thumbnail image of graphical abstract

      We proposed a verifiable secret sharing (VSS) mechanism based on Asmuth-Bloom's secret sharing scheme. Our proposed VSS uses adjusting values to recover an integer related to the secret by the Chinese Remainder Theorem. If the integer is in the modified t-threshold range, shareholders can verify that their shares are t-threshold consistent. The security of our proposed VSS is unconditionally secure.

    3. Frequency resource allocation strategy with QoS support in hybrid cellular and Device-to-Device networks

      Zhibo Wang, Hui Tian, Kun Yang and Ziqiang Liu

      Article first published online: 12 FEB 2014 | DOI: 10.1002/dac.2750

      Thumbnail image of graphical abstract

      We propose an orthogonal frequency-division multiple access channel-assignment method for hybrid network. The results show that the proposed scheme has a remarkable improvement on throughput performance compared with the existing schemes and is subjected to a sensible QoS requirement.

    4. Universally composable three-party password-authenticated key exchange with contributiveness

      Xuexian Hu, Zhenfeng Zhang and Qihui Zhang

      Article first published online: 7 FEB 2014 | DOI: 10.1002/dac.2746

      Thumbnail image of graphical abstract

      In this paper, an ideal functionality for three-party password authenticated key exchange (3PAKE) within the universal composability framework is defined, which not only provides security guarantees under arbitrary composition with other protocols but also achieves contributiveness and explicit authentication. Moreover, we propose a generic construction of contributory 3PAKE protocol and prove that it securely realizes the ideal functionality in the static corruption model.

    5. Multi-topology routing based egress selection approach to achieve hybrid intra-AS and inter-AS traffic engineering

      Ke Li, Sheng Wang, Shizhong Xu, Xiong Wang, Jin Ren, Haojun Huang and Bo Zhai

      Article first published online: 7 FEB 2014 | DOI: 10.1002/dac.2733

      Thumbnail image of graphical abstract

      This paper presents a hybrid intra-AS and inter-AS traffic engineering scheme named Egress Selection based upon Hot Potato Routing. This scheme involves link weight optimization and adopts multi-topology routing technique, which can not only minimize the time that Internet protocol packets travel across the network by assigning specified egress router but also balance the load among the internal links of the transit network.

    6. Ultra-wideband multiple-access relay channel with correlated noises and its diversity analysis

      A. Sahebalam, M. Osmani-Bojd and G.A. Hodtani

      Article first published online: 7 FEB 2014 | DOI: 10.1002/dac.2753

      Thumbnail image of graphical abstract

      This paper investigates a new and practical model, ultra-wideband Slepian-Wolf multiple-access relay channel (UWB-SW-MARC) with correlated noises at the relay and receiver. A general rate region and an outer bound for UWB-SW-MARC are derived, and thereby, two certain capacity theorems for two important and different classes of MARC are proved. Also, outage probability and diversity gain as the practically important concepts in wireless communications are analyzed.

    7. End-to-end mobility support in content centric networks

      Do-hyung Kim, Jong-hwan Kim, Yu-sung Kim, Hyun-soo Yoon and Ikjun Yeom

      Article first published online: 5 FEB 2014 | DOI: 10.1002/dac.2752

      Thumbnail image of graphical abstract

      We look at mobility issues in content-centric network, and provide possible solutions for them. Especially for the mobility of both content source and content consumer, various handoff schemes are designed and evaluated. The proposed schemes efficiently minimize handoff latency and realize seamless handoff without much overhead in content centric network.

    8. The new threat to internet: DNP attack with the attacking flows strategizing technology

      Heshuai Li, Junhu Zhu, Han Qiu, Qingxian Wang, Tianyang Zhou and Hang Li

      Article first published online: 4 FEB 2014 | DOI: 10.1002/dac.2748

      Thumbnail image of graphical abstract

      In distributed network paralyzing attack, for instance Coordinated Cross Plane Session Termination, a set of target links should be attacked simultaneously. In this case, how to strategize attacking flows is very important. For example, A and B are target links; link 1 is not a target, but if link 1 is congested, attacking flows from segment 2 cannot reach A and B, the attack may fail. If there are more target, strategizing will be more difficult; distributed network paralyzing attacking flows strategizing technology will solve this problem.

    9. A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

      Jaehyun Hwang and Sang-Seon Byun

      Article first published online: 3 FEB 2014 | DOI: 10.1002/dac.2745

      Thumbnail image of graphical abstract

      The proposed buffer allocation, yielded by the prior-core, achieves completely fair allocation by fully supporting non-aggressive flows whose requirement does not exceed the fair-share, whereas aggressive flows are restricted according to availability of the buffer.

    10. A novel noncooperative game competing model using generalized simple additive weighting method to perform network selection in heterogeneous wireless networks

      Yass K. Salih, Ong Hang See, Rabha W. Ibrahim, Salman Yussof and Azlan Iqbal

      Article first published online: 3 FEB 2014 | DOI: 10.1002/dac.2747

      Thumbnail image of graphical abstract

      This study proposes a new noncooperative competing game-theoretic model and strategy space based on user preference. A generalized simple additive weighting method is integrated into the framework of noncooperative game theory, and the utility function is employed to assess the usefulness of the system. Simulation results and analysis illustrate the efficacy of the suggested model in attaining optimum network utility for heterogeneous wireless networks while optimizing user satisfaction.

    11. A novel grouped multilevel dynamic space–time trellis coding scheme

      Dharmvir Jain and Sanjay Sharma

      Article first published online: 3 FEB 2014 | DOI: 10.1002/dac.2754

      Thumbnail image of graphical abstract

      This paper proposes a new grouped multilevel dynamic space–time trellis coding scheme by combining multilevel coding, space–time trellis coding, antenna grouping and channel state information at transmitter. A code set selection algorithm is proposed to select a code set having different sets of generator sequences for generating grouped multilevel dynamic space–time trellis codes (GMLDSTTCs). The frame error rate of GMLDSTTCS is superior by 1.6 dB to existing GMLSTTCs.

    12. A workflow task scheduling algorithm based on the resources' fuzzy clustering in cloud computing environment

      Fengyu Guo, Long Yu, Shengwei Tian and Jiong Yu

      Article first published online: 3 FEB 2014 | DOI: 10.1002/dac.2743

      Thumbnail image of graphical abstract

      Effective task scheduling is essential for obtaining high performance in cloud environment. In this paper, we present a workflow task scheduling algorithm based on the resources' fuzzy clustering named FCBWTS. The major objective of scheduling is to minimize makespan of the precedence constrained applications, which can be modeled as a directed acyclic graph. In FCBWTS, the resource characteristics in cloud computing are considered, and a group of characteristics, which describe the synthetic performance of processing units in the resource system, are defined in this paper.

  16. Special Issues - Ubiquitous Services

    1. Button-based method for the prevention of near field communication relay attacks

      Sukin Kang, Jonguk Kim and Manpyo Hong

      Article first published online: 3 FEB 2014 | DOI: 10.1002/dac.2751

      Thumbnail image of graphical abstract

      A human user presses simultaneously the buttons of two devices, prover P and verifier V, before the authentication process starts. Each device measures the time from button pressing or releasing event and the prover P sends the set of measured time (Tp) to the verifier as an encrypted form. The verifier V determines whether he/she is a legitimate user based on Tp and Tv measured from itself.

  17. Research Articles

    1. Low complexity timing estimation and resynchronization for asynchronous bidirectional communications with multiple antenna relay

      Zhaoxi Fang, Feng Liang, Zunyi Wang and Danjiang Chen

      Article first published online: 29 JAN 2014 | DOI: 10.1002/dac.2749

      Thumbnail image of graphical abstract

      We propose a low complexity pilot aided timing estimation and resynchronization scheme to combat the fractional asynchronous delay in bidirectional communication system. After timing and channel estimation, a fractionally spaced frequency domain equalizer is used at the relay to resynchronize the received mixed signals. With the proposed resynchronization scheme, the data detection at the two sources is the same as that in a perfect synchronized system because the two asynchronous signals are already resynchronized at the relay node. Simulation results show that the performance gap between the proposed scheme and the perfect synchronized system is within 1 dB when there are four antennas at the relay station.

    2. Research on the memory order of the power-line communication channel

      Ming-Yue Zhai and Ling-Dong Su

      Article first published online: 27 JAN 2014 | DOI: 10.1002/dac.2744

      Thumbnail image of graphical abstract

      As a memory channel, power-line communication channel can be modeled by the finite states Morkov chain with first order based on signal-to-noise ratio.

    3. Orthogonal superimposed training design for block transmission over frequency-selective fading channels

      Gaoqi Dou, Chunquan He, Congying Li and Jun Gao

      Article first published online: 23 JAN 2014 | DOI: 10.1002/dac.2741

      Thumbnail image of graphical abstract

      A novel affine precoding model based on orthogonal polyphase sequence set is designed to decouple channel estimation from symbol detection with less training overheads as compared with time-multiplexed scheme. It exhibits good performance and outperforms another data-dependent superimposed training scheme, especially for compact constellations or channel with long delay-spread.

    4. You have full text access to this OnlineOpen article
      Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

      Youssouf Ould-Cheikh-Mouhamedou

      Article first published online: 22 JAN 2014 | DOI: 10.1002/dac.2735

      The computational complexity associated with the determination of minimum Hamming distance (dmin) and its corresponding codeword multiplicity can be very high, especially for a turbo code that has high dmin value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of dmin and codeword multiplicity values.

    5. Highly reliable wavelength-reuse wavelength-division multiplexing semipassive optical access network architecture with double cover area and high network capacity

      Yan Gong, Chaoqin Gan and Chenwei Wu

      Article first published online: 22 JAN 2014 | DOI: 10.1002/dac.2740

      Thumbnail image of graphical abstract

      Two access rings are controlled by one central office. The system capacity, as well as the network cover area, can be doubled with this proposal.

SEARCH

SEARCH BY CITATION