International Journal of Information and Communication Technology (64 papers in press)
Sybil Attack Resistant Location Privacy in VANET
by Balaram Allam, Pushpa S
Abstract: Vehicular Ad Hoc Networks (VANETs) are more susceptible to a large number of attacks due to its open medium and anomalous nature. Location privacy is an imperative challenge in VANET, an attacker can easily trace the vehicle activities, if it has the knowledge of the location. In the most of the location privacy preserving mechanisms, each RSU provides secret information to a vehicle entered into the range, and it is known only to the corresponding RSU. However, these are vulnerable to Sybil attack, whereby a malicious vehicle compromises an RSU, and it pretends as multiple vehicles. Thus, an effective mechanism is in need to identify the attacker and compromised RSU in VANET. This paper proposes a Sybil Attack Resistant Location Privacy (SARLP) system to identify the attacker even a compromised RSU present in the VANET. The SARLP system employs a Location Privacy Unit (LPU) to provide an effective authentication mechanism. It hides the real identity of a vehicle by providing temporary key and a trusted certificate to the user, and thus improving the location privacy. The RSU imposes its signature on a generated secret random number of the vehicle entered into the region. Each vehicle and RSU maintain the random number secretly. If two vehicles communicate, sender reveals the sequence of secret random numbers received from different RSUs along its traveling path. The secret maintenance mechanism verifies the secret random number at the interference range of two RSUs, and thus a genuine RSU can successfully detect the compromised RSU. The simulation results show that the SARLP system achieves a higher level of location privacy preservation of vehicles and attack resilience in networks compared to the existing footprint scheme.
Keywords: VANET; Location privacy; Compromised RSU; Sybil attack; Authentication.
Design and Realisation of a Wireless Data Acquisition System for Vibration Measurements
by Surgwon Sohn
Abstract: Nowadays, sensing, processing, and analysing of vibration signals are
key components to structural health monitoring systems. Wireless-based data
acquisition (DAQ) systems for vibration measurements become more and more
important in the sensing and processing field. This paper presents a hardware
and software design of wireless data acquisition system for this purpose. The
DAQ system is based on the TMS320 digital signal processor which enables us
to process real-time vibration signals. Sensitivity is one of the key performance
features in the DAQ system, and we use an integrated circuit piezoelectric (ICP)
accelerometer as a detection sensor for best performance. For faster wireless
transmission of large amount of acceleration signals, a new data link protocol
of Bluetooth interface between wireless DAQ and smartphone is proposed.
An Android smartphone is a good choice of user interface in the mobile data
acquisition system. In order to display vibration signals in real time at the Android
smartphone, a commercial Java graphic library tool is used.
Keywords: Wireless Data Acquisition System; Vibration Signal; Accelerometer; Data Link Protocol; Smartphone Interface.
Weighted Estimation for Texture Analysis based on Fisher Discriminative Analysis
by Xiaoping Jiang, Chuyu Guo, Hua Zhang, Chenghua Li
Abstract: The traditional Texture Analysis methods only use relative contribution of each face area to mark the global similarity. For solving the problem of feature extraction which cause by local instead of global, Weighted Estimation for Texture Analysis method (WETA) based on the Fisher Discriminative Analysis (FDA) is proposed. First, Local Binary Pattern (Local Binary Pattern, LBP) or partial Phase Quantization (Local Phase Quantization, LPQ) is used for image texture encoding. Then, the image is divided into Local small pieces which are all equal and not overlap. The most discrimination axis, which are extracted from similarity space, are applied into texture analysis by FDA method, then the best solution through weight optimization is given. Finally, in the, experiments on two major general face databases (FERET and FEI) verify the effectiveness of the proposed method. The experimental results show that compared with texture methods in other papers, the proposed method in this paper has obtained better recognition performance.
Keywords: Face recognition; Fisher discriminative analysis; Weighted estimation; Texture coding.
A New Lightweight RFID Mutual Authentication Protocol Based on CRC Code
by Xiaohong Zhang, Juan Lu
Abstract: A new lightweight RFID mutual authentication protocol which the security keys updated dynamically is presented by using Cyclic Redundancy Check code (CRC code) operations and some simple logic operations. GNY logic proof and security analysis show that the protocol not only achieve the mutual authentication requirements effectively between the readers and the tags, but also prevent many security privacy problems such as eavesdropping attack, replay attack, replication attack, the problem of tag tracking on the basis of without increasing computation and communication traffic of the RFID system. Especially, the new protocol meets the EPC Class1 Gen2 standard, compared with the same safety degree of other existing protocols, the new protocol is low complexity in the aspect of hardware implementation which accounts for only 18.75% of the reserved space in terms of label storage and it is suitable for low-cost RFID system. Hence, the new protocol can realize the combination of high security and low tag cost.
Keywords: RFID; CRC code; mutual authentication protocol; GNY logic; security analysis.
Application of PatchNet in Image representation
by Hao Cheng, Zhonglin He
Abstract: PatchNet, as a graph model with hierarchical structure, is a new technology of image representation. Its description structure for images can well conform to the cognitive features of human visual system. The semantic information and geometric structural information can be stored and represented compactly. PatchNet can realize abstract representation of an input image. This paper introduces the PatchNet representation of images, describes the detailed structure of PatchNet, and analyses how to apply PatchNet in content searching and editing based on image library.
Keywords: PatchNet; Image representation; Geometric structure.
Experimental study on fibre Bragg grating temperature sensor and its pressure sensitivity
by Deng-pan ZHANG, Jin WANG, Yong-jie WANG
Abstract: At present, ocean temperature almost depends on electric signal inspection, but the sensor is not safe in the water．In order to overcome this shortage and improve measurement veracity and safety, the temperature sensing theory of Bragg grating was analyzed and a new ocean temperature sensor was presented with advantages of all optic elements, underwater safety and feasibility of sensor network, etc. By setting a spring in the metal tube, the temperature was measured with pressure isolation encapsulation. Multiple plus-minus temperature tests were carried out. Results show that the sensor under the condition of no pressure and the temperature of 0~35℃ has an excellent repeatability, hysteresis and linearity. Temperature sensitivity is 29.9pm/℃,which is close to the theoretical value. Pressure sensitivity tests were executed under the condition of 0~5MPa. Results show that the wavelength has no change and is not affected by pressure.
Keywords: FBG; temperature; sensor; pressure; ocean.
Design and Development of Smart fishing Poles using ICT enabled systems
by Zhenghua Xin, Ma Lu, Guolong Chen, Hong Li, Qixiang Song, Meng Xiao
Abstract: Consumers wish fish poles to have high quality, diverse functions and personalization. This intelligent float mainly focuses on its functions. Compared with the existing fish poles products, it can fish at night. Because it has the night light. When the floats are put into the river, lake or the sea, the LED light will flash and the green light is easy to recognize. This fish pole can make fish more accurate. And anglers enjoy themselves.
This fish pole also has the accelerometer sensor. When the float is pulled by the fish in the water suddenly, the acceleration generates. It makes the light turn into the red. It prompts there are fish on a hook. It is especially convenient for us to use in the evening.
Now, the intelligent telephone is very important for people to communicate with others. When the fish bites food on hooks, the SMS will send to the telephone. It tells people to take up the rod line. We deliberately designed the Bluetooth module linked with the floats. So that we play with mobile phones and fish simultaneously. When fish bite the food on the hook, the line triggers the infrared sensor. And then the SMS which content is get fish generates and sends to the angler. The designed alarm works automatically to make anglers enjoy the game. Similarly, the shocked float triggers the infrared sensor and the buzzer works to remind the angler.
Keywords: Keywords: smart fishing poles; the infrared sensors; the Bluetooth.
Detection and Filling of Pseudo-hole in Complex Curved Surface objects
by Mei Zhang
Abstract: The detection and filling of pseudo-hole in complex curved surfaces is always a hot and difficult problem in computer vision field. Aiming at the defect that the traditional method can only detect the small curvature of the pseudo-hole region, this paper proposes a new method to improve the pseudo-hole detection. Firstly, the hole can be classified by the projection method, it is divided into simple holes and complex holes, and then, the method of filling the simple hole is described. For complex holes, it is divided into a number of simple holes, and then filling every simple holes, to complete the filling of a complex pseudo-hole, finally map the results of filling the simple hole back to the object hole area.
Keywords: Laser point cloud; complex curved surfaces object; pseudo-hole detection; pseudo-hole filling.
A variant of Random WayPoint mobility model to improve routing in Wireless Sensor Networks
by Lyamine Guezouli, Kamel Barka, Souheila Bouam, Abdelmadjid Zidani
Abstract: The mobility of nodes in a wireless sensor network is a factor affecting the quality of service offered by this network. We think that the mobility of the nodes presents an opportunity where the nodes move in an appropriate manner. Therefore, the routing algorithms can benefit from this opportunity. Studying a model of mobility and adapt it to ensure an optimal routing in an agitated network is the purpose of our work. We are interested in applying a variant of the mobility model RWP (named Routing-Random WayPoint "R-RWP") on the whole network in order to maximize the coverage radius of the Base Station (which will be fixed in our study) and thus to optimize the data delivery end-to-end delay.
Keywords: WSN; wireless sensor networks; Random Waypoint; Mobility model; Routing; RWP; random waypoint.
A Modified Extended Particle Swarm Optimization Algorithm to Solve the Directing Orbits of Chaotic Systems
by Simin Mo, Jianchao Zeng, Weibin Xu, Chaoli Sun
Abstract: In order to solve the problem of the poor local search capability of the extended particle swarm optimization algorithm (EPSO)，the modify Extended Particle Swarm Optimization algorithm(MEPSO) was proposed, which reduces magnitude of total forces exerting on each particle through decreasing the number of each particle effected by other particles. Meanwhile, the number of the particles removed is analyzed theoretically. And it was proved that MEPSO can converge to the global optimum with the probability 1. Compared with the related algorithms, the presented algorithm can effectively balance the global and local search and improve optimization performances. Finally, MEPSO can better solve the problem of directing orbits of chaotic systems.
Keywords: Extended Particle Swarm Optimization algorithm; magnitude of total forces exerting on each particle; global and local search.
Development and application research of smart distribution district based on IDTT-B new-type transformer terminal unit
by Aidong Xu, Lefeng Cheng, Xiaobin Guo, Ganyang Jian, Tao Yu, Wenxiao Wei, Li Yu
Abstract: Amid at the problems of low automation degree and failed remote monitoring of operation situation in distribution district, an ITDD-B-type of transformer terminal unit (TTU) based smart distribution district (SDD)is designed, which provide scientific and advanced technical methods for operation management units in aspect of achieving fine management in distribution districts. The construction of SDD is stated , i.e. the upgrading and reconstruction work of original distribution district, the construction of new-type SDD based on ITDD-B TTU and the building of communication network and main station. It is focus on design of IDTT-B-type TTU and which can finish transformer monitoring, power quality monitoring, temperature measurement and low voltage switch communication, etc. and has high integration, and supports remote control , communication and software upgrading, and also has low investment and high cost performance. The technical features and total performance and application situation of IDTT-B based SDD are introduced. Finally, an applied example of SDD based on IDTT-B is given and the power quality detection and analysis are made. The construction of new-type distribution district has certain significance for unified building of strong and smart grid, also provides certain guidance and reference for operation and management units.
Keywords: distribution district; transformer terminal unit; distribution automation; operation management; safe protection; main station.
PRIVACY PRESERVING METHOD FOR KNOWLEDGE DISCOVERED BY DATA MINING
by Sara Tedmori
Abstract: In spite of its success in a wide variety of applications, data mining technology raises a variety of ethical concerns which include among others privacy, intellectual property rights, and data security. In this paper, the author focuses on the privacy problem of unauthorized use of information obtained from knowledge discovered by secondary usage of data in clustering analysis. To address this problem, the author proposes the use of a combination of isometric data transformation methods as an approach to guarantee that data mining does not breach privacy. The three transformation methods of reflection, rotation, and translation are used to distort confidential numerical attributes for the purposes of satisfying the privacy requirements, while maintaining the general features of the cluster in clustering analysis. Experimental results show that the proposed algorithm is effective and provide acceptable values for balancing privacy and accuracy.
Keywords: Privacy Preserving; Data Mining; Discovering Knowledge; Data Engineering.
Recognition of the Anti-Collision Algorithm for RFID Systems Based on Tag Grouping
by Zhi Bai, Yigang He
Abstract: In RFID system, one of the problems that we must solve is the collision between tags which is a key technique of the RFID system. An anti-collision algorithm for RFID systems based on tag grouping is put forward. The proposed algorithm compared to conventional ones, when there are a large number of tags in the field, can achieve high system efficiency by restricting the number of unread tags. Simulation results show that the proposed algorithm improves the slot efficiency above 80% at least compared to the conventional algorithms when the number of tags reach 1000.
Keywords: RFID; anti-collision algorithm; tag grouping; adaptive frame slotted.
Towards a robust palmprint representation for person identification
by Meraoumia Abdallah, Bendjenna Hakim, Chitroub Salim
Abstract: Biometrics, which refer to automatic identification of individuals based on their physiological and/or behavioral characteristics, is a widely studied field. This identification technology has rapidly evolving and it has a very strong potential to be widely adopted in many civilian applications such as e-banking, e-commerce, and access control. Among the physiological biometric modalities, those based on palm have received the most attention due to its steady and unique features, which are rich in information with a low resolution. Although there is several palm capture devices, however, no of them is apt to provide the full features of the same palm. By using different capture devices, the palm features can be represented with different formats such as: grayscale images, near-infrared images, color images, multispectral images and 3D shapes. In this context, we present in this paper a study that permits to propose robust palmprint representation for a reliable person identification system. Thus, a comparative study of the used palmprint image representations in the practice is performed. A new scheme for improving the person identification using the palmprint images is proposed. The proposed scheme uses the combination of several classifiers results. The discrete CoNtourlet Transform (2D-CNT) is used as feature extraction technique. At each level, the palm image is decomposed into several bands using the 2D-CNT technique. Subsequently, some of resulting bands are used to create the feature vector. Given this vector of features, two sub-systems can be created. The first one is based directly on this vector of features. While the second one uses the Hidden Markov Model (HMM) in order to modeling the feature vector. For the combination of classifiers results, the matching score level fusion strategy is used. The proposed system is tested and evaluated using several databases of Hong Kong polytechnic university that contain 400 users.
Keywords: Biometrics; Person Identification; Palmprint; Feature extraction; Contourlet transform; Hidden Markov Model; Data fusion.
Robust Adaptive Array Processing based on Modified Multistage Wiener Filter Algorithm
by Peng Wang, Ke Gong, Shuai-bin Lian, Qiu-ju Sun, Wen-xia Huang
Abstract: Multistage Wiener filter (MSWF) is a very efficient algorithm for adaptive array processing because of low-complexity and prominent rank-reduction advantage. However, if training sample data was contaminated by outliers, especially when outliers having the same DOA with target emerge, the MSWF results will be decreased severely. In this paper, MSWFs backward iteration was improved, and median cascaded canceler (MCC) strategy was adopted so that optimal weighting calculation can be obtained via sorting and median processing, meaning impact of outliers were removed effectively. Blocking matrix solving of MSWF forward iteration was completed by Householder transform to enhance fix-point format performance. The new-designed algorithm attained excellent compromise between robustness and complexity. To verify presented algorithms performance, array with 50 elements was established in simulation platform, and the simulated results also proved it can cope with outlier-contaminated applications effectively.
Keywords: Multistage Wiener filter; rank-reduction; Householder transform; outlier; median cascaded canceler;.
Improving Multidimensional Point Query Search using Multiway Peer-to-Peer Tree Network
by Shivangi Surati, Devesh Jinwala, Sanjay Garg
Abstract: Nowadays, Peer-to-Peer (P2P) networks are widely accepted inrnmultidimensional applications like social networking, multiplayer games, P2Prne-learning, P2P mobile ad-hoc networks etc. Various P2P overlay networksrncombining Multidimensional Indexing(MI) methods are preferable for efficientrnmultidimensional point or range search in a distributed environment. However,rnpoint query search in existing P2P has limitations viz. (i) either doesnt givernsupport to MI or uses replications to support MI or (ii) point query search cost is limited to O(log2N). Hence, traditional MI techniques based on the multiway tree structure (having larger fanout) can be employed to enhance the multidimensional point query search capabilities. Based on our observations, a hybrid model combining m-ary (m fanout of the tree, > 2) P2P tree network and MI based on space containment relationships is preferred to reduce point query search performance bound to O(logmN) using single overlay network. The present paper shows how this model improves the search performance of the point queries in O(logmN) steps, independent of the dimensionality of objects.
Keywords: Peer-to-Peer overlay networks; Distributed computing; Multidimensional Indexing; Point query search; Multiway trees.
IoT-based risk monitoring system for safety management in warehouses
by Sourour Trab, Ahmed Zouinkhi, Eddy Bajic, Mohamed Naceur Abdelkrim, Hassen Chekir
Abstract: This paper relies on the concepts and architecture of IoT to design a risk monitoring system for a hazardous product warehouse. The enhancement of product into smart product as a sensor-equipped communicating device allows to control and monitor the product interactions in the objective of risks prevention and avoidance. A generic warehouse safety policy supported by the smart products is presented that relies on a set of parametric safety rules for storage, picking and handling of products. Our proposal aims to provide the benefits of information availability, communication and decision-making, deep in the warehousing physical world, and oriented toward a global safety assurance. We present an implementation case for chemical products warehousing, that uses ZigBee wireless sensor network platform and Labview software. The achievement of smart products and remote monitoring allows dynamic risk assessment by analysis of product's information and status, and ambient condition parameters of warehouse for safety assurance.
Keywords: IoT; Risk monitoring system; WMS; Intelligent product; Safety management.
The Study of Access Point Outdoor Coverage Deployment for Wireless Digital Campus Network
by Augustinus B. Primawan, Nitin K. Tripathi
Abstract: Wireless Local Area Network design needs more development to obtain appropriate and effective results. Site surveys in the design process give realistic results, but require time and effort. Developing ways of predicting signal strength using empirical models can give appropriate results in access point placement to get good signal coverage.
Geospatial analysis, such as Inverse Distance Weighting, Kriging and Global Polynomial Interpolation, has been compared. This study showed that Kriging analysis is an appropriate method to predict value the coverage area. Furthermore, predictive signal strength models such as classical, empirical and COST 231 Hatta models have been studied. The empirical model was shown to do the best predictive calculations.
The empirical model used to predict signal strength combined with Kriging geographical statistical analysis gave usable signal coverage prediction for access point placement. This model will support GIS spatial analysis tools to perform effective planning in access point placement.
Keywords: Access Point Placement; GIS Spatial Analysis; Received Signal Level.
Feature-Opinion Pair Identification Method in Two-Stage based on Dependency Constraints
by Shulong Liu, Xudong Hong, Zhengtao Yu, Hongying Tang, Yulong Wang
Abstract: Feature-opinion pair identification includes opinion words, opinion targets extraction and their relations identification, is important for analysis online reviews. In this paper, we propose a feature-opinion pair identification method in two-stage based on dependency constraints according to the relationship between the identification of feature-opinion pair and dependency constraints. In the first stage, we construct dependency constraints based on the dependency information of words. Then, dependency constraints and seed words are employed to extract opinion words and opinion targets. In the second stage, we use opinion words and opinion targets extracted in the first stage to construct candidate feature-opinion pairs. Thereafter, integrate dependency constraints, location features and part-of-speech features into support vector machine to identify feature-opinion pair. Our experimental result using online reviews demonstrates that the proposed method is effective in the identification of feature-opinion pairs, and the F-score has reached 83.85%.
Keywords: opinion mining; opinion word; opinion target; dependency constraints; feature-opinion pair.
Low-Complexity LDPC-Convolutional Codes based on Cyclically Shifted Identity Matrices
by Fotios Gioulekas, Constantinos Petrou, Athanasios Vgenis, Michael Birbas
Abstract: In this study, a construction methodology for Low-Density Parity-Check Convolutional Codes (LDPC-CCs) ensembles based on cyclically shifted identity matrices is proposed. The proposed method directly generates the syndrome former matrices according to the specified code parameters and constraints i.e. code-rate, degree-distribution, constraint length, period and memory, in contrast to the majority of the available approaches that produce relevant error-correcting codes based on either block ones, protographs or spatially-coupled type of codes. Simulation results show that the constructed ensembles demonstrate advanced error-correcting capability of up to 0.2 dB in terms of frame-error and bit-error rates at the convergence region, when compared with the performance of error-correcting schemes adopted by various communication standards, with equivalent hardware complexity even at short codeword-lengths. Specifically, the constructed LDPC-CCs have been assessed against the corresponding error-correcting codes used in WiMAX and G.hn standards for wireless and wireline telecommunications, respectively.
Keywords: FEC; LDPC-Convolutional Codes; Complexity; error-correction; WiMAX; G.hn; cyclically shifted identity matrices; LDPC-Block Codes; Schedulable memory; syndrome-former.
A Big Data and Cloud Computing Specification, Standards and Architecture: Agricultural and Food Informatics
by N.P. Mahalik, Na Li
Abstract: Big data has gone from emerging to a widely used technology in industrial, commercial, research, and database applications. It is used for processing and analyzing massive sets of data to derive useful patterns, inferences, and relations. The real-time data storage and management architecture plays important role. This paper introduces big data, includes the background and definitions, characteristics, related technologies, and challenges associated with implementing big data-based application technologies. This paper also introduces cloud computing, a related yet independent emerging technology and includes the modern technologies and standards, definitions, service and deployment models, advantages and challenges, and development prospects. The paper considers computing specification, standardized procedure, and system architecture in regard to big data systems and could computing.
Keywords: Big data; KDD; data mining; cloud computing; Virtualization; Architecture.
Wi-Fi Received Signal Strength Based Hyperbolic Location Estimation for Indoor Positioning Systems
by Anvar Narzullaev, MOHD Hasan Selamat, Khaironi Yatim Sharif, Zahriddin Muminov
Abstract: Nowadays, Wi-Fi fingerprinting based positioning systems provide enterprises the ability to track their various resources more efficiently and effectively. Main idea behind fingerprinting is to build signal strength database of target area prior to location estimation. This process is called calibration and the positioning accuracy highly depends on calibration intensity. Unfortunately, calibration procedure requires huge amount of time and effort, and makes large-scale deployments of Wi-Fi based indoor positioning systems non-trivial.
In this research we present a novel location estimation algorithm for Wi-Fi based indoor positioning systems. Proposed algorithm combines signal sampling and hyperbolic location estimation techniques to estimate the location of mobile users. The algorithm achieves cost-efficiency by reducing the number of fingerprint measurements while providing reliable location accuracy. Moreover, it does not require any additional hardware upgrades to the existing network infrastructure. Experimental results show that the proposed algorithm with easy-to-build signal strength database performs more accurate than conventional signal strength based methods.
Keywords: Indoor positioning; hyperbolic location estimation; wi-fi fingerprinting; TDOA; trilateration; received signal strength.
Target coverage algorithm with energy constraint for wireless sensor networks
by Liandong Lin, Chengjun Qiu
Abstract: As wireless sensor networks are made up of low-cost and low-power tiny sensor nodes, it is of great importance to study on how to both cover targets and save energy consumptions. In this paper, we propose a novel target coverage algorithm with energy constraint for wireless sensor networks. Wireless sensor networks can be described as a graph model, in which nodes and edges represent sensors and maximum signal transmission ranges respectively. Particularly, there types of sensor nodes are utilized: 1) base stations, 2) gateways, and 3) sensors. The main innovations of this paper lie in that we organize the network lifetime by a cycle mode, and divide the network lifetime to rounds of equal period. At the beginning of each round, sensors independently determine which sensing units should be turned on in the working step. Afterwards, the status of each sensing unit is determined by integrating the sensing ability and remaining energy together. Finally, we construct a simulation environment to test the performance of our algorithm. Experimental results demonstrate that the proposed algorithm performs better than the Remaining energy first and Max-lifetime target coverage scheme under various number of sensors and attributes, and performance of our proposed algorithm is next only to integer programming. Furthermore, we also find that the proposed algorithm is able to effectively cover target with low energy consumption.
Keywords: Wireless sensor networks; Target coverage; Energy constraint; Network lifetime.
Safety Message Data Transmission Model and Congestion Control Scheme in VANET
by Zhixiang Hou, Jiakun Gao
Abstract: When VANET meets large traffic density, Beacons produced by periodical safety message may occupy the whole bandwidth of channel, resulting in link congestion. In order to ensure the safety in message data transmission and promote the effectiveness of congestion control, in this paper, we propose an actively safe information congestion control framework via analyzing VANET features which contain channel detection, load estimation, congestion control, sending restoration, and so on. Therefore, we propose a novel congestion control mechanism based on adjusting Beacon frequency and Vehicle communication model. Based on the control theory and the features of VANET, an active safety information congestion structure is put forward at first. Then CACP algorithm is adopted to estimate the link bandwidth for congestion prediction. For periodic status messages and security messages a channel assignment algorithm is also proposed to ensure there is enough channel resource to transfer emergency messages. As a consequence of this, the status message accuracy and the system safety can be ensured and the number of accommodating users can be increased, which will avoid network congestion and improve the channel utilization. From the simulation results, it can be observed that the proposed algorithm can effectively and accurately detect link load degree, improve throughput, decrease delay, reduce networked energy consumption and then guarantee data fidelity. Finally, the conclusion can be drawn that the proposed can achieve a safe and efficient transmission mechanism for VANET
Keywords: VANET; Congestion control; Channel; Beacon; D-FPAV.
Design and Implementation of ITS Information Acquisition System under IoS Environment
by Ying Zhang, Jiajun Li, Baofei Xia
Abstract: The problems and efficient in existing intelligent transportation system (ITS) models are studied and the significance of the model and architecture of ITS under Internet of things (IoS) are also discussed. By the research status at home and abroad about the relationship between IoS and ITS, the necessity of IoS technology introduce to ITS is explained first. Then, based on logical structure and physical model of ITS, the ITS structure model under IoS environment is established. Furthermore, the system architecture on a prefect and comprehensive ITS information system acquisition system is formed. The design principles of system demand, overall design, function modules design, database design are described in detail. The parts of key modules in system are introduce and tested. The tests results show the acquisition system can effectively monitor real-time of vehicle speed, real-time traffic of road vehicles, and obtain effective information of vehicle and road environment. It can also send the information acquired via Internet or GPRS network to data processing center, for future process and intelligent decision of ITS.
Keywords: ITS; IoS; information acquisition; GPRS; communication.
Traffic Route Optimization Based on Clouding Computing Parallel ACS
by Changyu Li
Abstract: Intelligent traffic has demand for massive data environment and high performance processing, which needs cloud computing platform to process massive data, and applying distributed parallel guidance algorithms to improve system efficiency. Therefore, this paper proposes an improved scheme based on clouding computing ACS algorithm. It first adopts MapReduce to parallelize traditional ACS, to process the solving problem with distributed parallel mode, and to improve the defects in ACS. The improved ACS applies Map function to parallelize the part which has the most time consuming, that is, the independent solving process of each ant. Then Reduce function is used to describe the processes of pheromone updating and obtaining better solutions. Simultaneously, for the defects of ACS on long searching time, and premature convergence to a non optimal solution, we integrate simulated annealing algorithm to ACS and provide corresponding realization process. The experiments construct Hadoop cloud computing platform and the improved algorithm is operated and tested on this platform. By the analysis on experimental results, we find the parallel ACS designed by us has improved the query efficiency of the shortest path, which also has advantage on the performance of running time and speedup ratio compared to classic algorithms.
Keywords: cloud computing; ACS; MapReduce; Traffic network; Pheromone.
Optimal configuration of M-for-N shared spare-server systems
by Hirokazu Ozaki
Abstract: In this study, we investigate the user-perceived availability of M-for-N shared spare-server systems. We assume that there are N identical working servers, each serving a single user group, and M identical shared spare servers in the system. We also assume that the time to failure of the server is subject to an exponential distribution, and the time needed to repair a failed server is subject to the Erlang type-k distributions. Under these assumptions, our numerical computation shows that there exists an optimal size (M + N) for shared spare-server systems with respect to the availability and cost for a given condition.
Keywords: Cloud computing; user-perceived reliability; shared protection systems; probability distribution; availability.
Image analysis by efficient Gegenbauer Moments Computation for 3D Objects Reconstruction
by Bahaoui Zaineb, Hakim El Fadili, Khalid Zenkouar, Hassan Qjidaa
Abstract: In this paper, we suggest a new technique for fast computation of Gegenbauer orthogonal moments for the reconstruction of 3D images/objects; A typical comparison of the proposed method with the conventional ZOA methods shows significant improvements in term of error reduction, image quality and consumption time . Then we compare our new approach with an existing methods using Legendre and Zernike moments in the case of 3D image/object. The obtained results prove that Legendre and Zernike moments are slightly better than Gegenbauer, they are still very efficient and gives very good results in terms of MSE and PSNR. But, Zernike moments have higher computational cost than Gegenbauer moments.
Keywords: Gegenbauer Moments computation; Legendre Moments; Zernike moments; 3D images/object; Computation time.
Integration of a quantum scheme for key distribution and authentication within EAP-TLS protocol
by GHILEN AYMEN, Mostafa AZIZI
Abstract: The extensive deployment of wireless networks has led to a significant progress in security approaches that aim to protect confidentiality. The current methods for exchanging a secret key within Extensible Authentication Protocol-Transport Layer Security (EAP-TLS) protocol is based on Public Key Infrastructure (PKI). Although this technique remains one of the most widely implemented solution to authenticate users and to ensure secure data transmission, its security is only computational. In other words, by the emergence of the quantum computer, the existing cryptosystems will become completely insecure. Improving the contemporary cryptographic schemes by integrating quantum cryptography becomes a much more attractive prospect since its technology does not rely on difficult mathematical problems such as factoring large integers or computing discrete logarithms. Thus, we propose a quantum extension of EAP-TLS that allows exchanging a cryptographic key and authenticating a remote client with unconditional security, ensured by the laws of quantum physics. PRISM tool is applied as a probabilistic model checker to verify specific security properties for the new scheme.
Keywords: EAP-TLS; Quantum Cryptography; Authentication;Key Agreement; Entanglement; PRISM; Model Checking.
A rapid detection method of earthquake infrasonic wave based on decision-making tree and the BP neural network
by Yun Wu, Zuoxun Zeng
Abstract: In this paper, a rapid detection method of earthquake infrasonic wave combining decision-making tree and neural network is proposed. This method is designed for the automated monitoring system of earthquake occurring and advance forecast. Firstly, different kinds of signal data are collected together and analyzed to find the most meaningful attributes, which is important to describe the features of signal. Then, in the decision part, two decision line are designed to supply a final result. In the first one part, these important attributes are chosen to determine to be the nodes of decision-making tree. In the second part, many previous stored signals are analyzed utilizing the neural network to build the mapping model between attributes of signals and its classification. Lastly, the most suitable nodes sequence and the thresholds are determined in this process according to two experiments. Experiments analysis is also presented in this paper to discuss some important issues in decision tree, and determine the decision system finally.
Keywords: Infrasonic Wave; Earthquake; Decision-making Tree; Neural NetWork.
Data Dissemination on MANET by repeatedly transmission via CDN nodes
by Nattiya Khaitiyakun, Teerapat Sanguankotchakorn, Kanchana Kanchanasut
Abstract: Recently, many researches on MANET (Mobile Ad Hoc network) have been carried out due to its various applications in information exchange. The efficient data dissemination in such an infrastructure-less environment as MANET is considered as one of the challenging issues. This paper proposes to adopt the concept of CDN (Content Delivery Network) Technique, normally used in Internet, for disseminating information in MANET. The source node disseminates data to surrounding nodes by repeatedly transmitting batches of packets via a set of CDN nodes acting as relay nodes. Our proposed data dissemination technique via CDN nodes is developed based on the OLSR (Optimized Link State Routing Protocol) on MANET. The limited number of CDN nodes is selected from MPRs (Multi-Point Relay) in OLSR in order to optimally cover all subscriber nodes and to avoid the interference problem as well. The packets are transmitted from CDN to destination nodes using the broadcasting technique the same technique as the one adopted in MPR, a broadcasting technique. In this work, the performance of our proposed technique is evaluated in terms of probability of successful transmission by simulation using NS3. The performance is compared with the typical OLSR and the recent work called Clustering-based data transmission algorithm in VANET (Vehicular Ad Hoc Network). It is apparent that our proposed algorithm improves drastically the overall probability of successful transmission when comparing with the typical OLSR. Additionally, it achieves higher probability of successful transmission at high nodes density when comparing with Clustering-based data transmission algorithm in VANET. Finally, the closed-form mathematical expression of the probability of successful transmission of our proposed algorithm in multi-hop network environment is derived and verified.
Keywords: Content Delivery Network(CDN); MANET; OLSR.
Suboptimal Joint User Equipment Pairing and Power Control for Device-to-Device Communications Underlaying Cellular Networks
by Chaoping Guo, Xiaoyan Li, Wei Li, Hongyang Li
Abstract: Device-to-device(D2D) communications underlying cellular networks, results in the cellular interference to D2D User Equipment(DUE) which is larger than the D2D interference to Cellular User Equipment(CUE). A joint resource allocation scheme is presented to both perform user equipment pairing and power allocation to minimize total interference of DUE and CUE. The scheme is composed of two parts: in the first one the base station assigns power to each CUE and each D2D transmitter by graphic method, and in the second one it selects the optimal CUE to pair with D2D pair by modified Hungarian algorithm in order to minimize total interference. The simulation results show that the proposed scheme can not only decrease the interference caused by D2D pair and that caused by CUE, but also increase the number of permitted D2D connections.
Keywords: device-to-device communications; power control; resources allocation; Suboptimal Joint; Cellular Networks; User Equipment.
A Cognitive Approach of Collaborative Requirements Validation based on Action Theory
by Sourour MAALEM, Nacereddine ZAROUR
Abstract: The requirements must be validated at an early stage of the analysis. Requirements validation usually involves natural language processing, which is often inaccurate and error-prone, or translated in formal models, which are difficult to understand and use for non-technical stakeholders. The majority of existing approaches for validating requirements are used in a heterogeneous process, using a variety of techniques, relatively independent without any methodological or cognitive approach through in which, mechanisms of human thought or artificial are used. In this work we present a cognitive approach to collaborative requirements validation based on the theory of action, through a set of steps that must increase the involvement of the Client in this stage of the engineering cycle; and to bring the customer mental model to the analyst one. In the proposed process, the analyst starts by extracting needs one by one from requirements documents. Each need goes through a step of formulating the intention, which results in a transformation of needs into requirements. This transformation is performed by respecting a new syntax in any generated a checklist (quality attributes) from the viewpoint of each stakeholder, followed by a step of specification of actions that engenders on the basis of the intentions, actions which the analyst perceives and verifies to build a rapid prototype of software interface, executable on machine. The customer perceives the prototype, interprets it and validates these needs. A valid needs database is created, needs that remain invalid must be negotiated, and if conflicts persist, another error base is created. At the end of this collaborative process of requirements validation, decisions will be made concerning who must participate during needs validation meetings with respect to the Mental Effort metric which will classify according to the mental difficulty of execution of the prototype, the articulatory and semantic problems, and measure commitment and motivation of stakeholders.
Keywords: Requirements engineering; Requirements validation; Action Theory; Prototype; Cognitive Approach.
Approach to Terrain Pretreatment for the Yazidang Reservoir Based on Image Processing
by Lingxiao Huang
Abstract: The terrain pretreatment based on image processing in the Yazidang Reservoir is presented. The image processing is based on the image stitching and the image edge detection. The SURF algorithm is used to extract feature points of reservoir partial images. To match feature points and stitch reservoir partial images, the wide view reservoir image is stitching using KD-tree algorithm and linear gradient fusion algorithm. The improved mathematical morphology is adopted, and five different shapes and four different scales of structural elements is implemented to obtain precise waterfront edge of reservoir image. The *.dxf file is obtained by using CAD software to depict reservoir shore contours. It transforms *.dxf into *.kml to extract latitude and longitude information of reservoir waterfront edge. The satisfied mesh effect is generated by using the Delaunay triangulation algorithm.The result shows that accurate and detailed reservoir terrain can be obtained using the image processing method and the GE software, which provides a prerequisite for the numerical simulation of sedimentation in the Yazidang Reservoir.
Keywords: terrain pretreatment; image processing; SURF algorithm; KD-tree algorithm; linear gradient fusion algorithm; mathematical morphology; Delaunay triangulation.
A novel imbalanced data classification algorithm based on fuzzy rule
by Zhiying Xu, YiJiang Zhang
Abstract: The classification of imbalanced data can increase the comprehensibility and expansibility of data and improve the efficiency of data classification. The accuracy of classification is poor when the data is classified by the current method for imbalanced data analysis of big data. To this end, this paper presents an imbalanced data classification algorithm based on fuzzy rule. The algorithm firstly collects the imbalanced data, selects the features of the imbalanced data, and optimizes the imbalanced data classification algorithm by using the fuzzy rule classification algorithm..The experimental results show that when the classifier maintains a certain size of the weak classifier, the classification accuracy of the proposed algorithm will be gradually improved as the training time increases, and gradually be stable within a certain range of accuracy, this method can improve the accuracy of imbalanced data classification.
Keywords: Imbalanced data; Data feature selection; Data classification.
A Personalized Recommendation Algorithm Based on Probabilistic Neural Networks
by Long Pan, Jiwei Qin, Liejun Wang
Abstract: Collaborative filtering is widely used in recommendation system. Our work is motivated by the observation that users caught in their attention relationship network, and their opinions about items will be directly or indirectly affected by others through such a network. Based on behaviors of users with similar interest, the technique focuses on the use of their opinions to recommend items. Therefore, the quality of similarity measure between users or items has a great impact on the accuracy of recommendation. This paper proposes a new recommendation algorithm with graph-based model. The similarity between two users (or two items) is computed from the connections on graph with nodes of users and items. The computed similarity measure is based on probabilistic neural networks to generate predictions. The model is evaluated on a recommendation task which suggests that which videos users should watch based on what they watched in the past. Our experimental results on the YouKu and Epinions datasets demonstrate the effectiveness of the presented approach in comparison with both collaborative filtering with traditional similarity measures and simplex graph-based methods and further improve user satisfaction, our approach can better improve the overall recommendation performance in precision, recall and coverage.
Keywords: recommendation system; similarities; graphs-based approach; collaborative filtering; probabilistic neural networks.
Temporal Impact Analysis and Adaptation for Service-Based Systems
by Sridevi Saralaya, Rio D'Souza, Vishwas Saralaya
Abstract: Temporality is an influential aspect of Service-Based Systems (SBS). Inability of a service to achieve time requirements may lead to violation of Service-Level Agreements (SLAs) in a SBS. Such non-conformity by a service may introduce temporal inconsistency between dependent services and the composition. The temporal impact of the anomaly on related services and also the composition will need to be identified if SLA violations have to be rectified. Existing studies concentrate on impact analysis due to web service evolution or changes to a web service. There is a huge lacunae regarding studies on impact of time delay on temporal constraints of dependent services and obligations of business process. Although reconfiguration of SBS to overcome failures is extensively addressed, reconfiguration triggered due to temporal delay is not well explored. In this study we try to fill the gap between reconfiguration and impact analysis invoked due to temporal violations. Once the impacted region and the amount of temporal deviation to the business process are known, we try recovery by localizing the reconfiguration of services to the impacted zone.
Keywords: Service-Based Systems; Impact-Analysis; Proactive Adaptation; Reactive Adaptation; Reconfiguration; Cross-Layer Adaptation; SLA violation handling; Anomaly handling; Service-Based Applications.
Considering the environment's characteristics in wireless networks simulations: case of the simulator NS2 and the WSN
by Abdelhak EL MOUAFFAK, Abdelbaki EL BELRHITI EL ALAOUI
Abstract: Recently, the wireless networks, particularly the wireless Sensor Networks (WSN) occupy an important place in several application areas due to the progress in microelectronics and wireless communications domains. Thus, a set of researches had addressed this issue in order to broaden the possibilities offered by these networks and circumvent the encountered problems. The test of any new solution is an essential phase to validate its performances. This phase is done in network simulators; which NS is the most used. The impact of the physical layer and the radio signal propagation environment criteria on the simulations results is indisputable. In this context, and after presenting and classifying the radio propagation models, we study in detail the implemented models in NS-2. The focus is on the ability of these models to consider the characteristics of the wireless networks deployment environment (e.g. nature, position and mobility of the obstacles). And to consider the specificities of WSN, the effect of other parameters (e.g. antenna height) will be discussed.
Keywords: Wireless network; Wireless sensor network; Simulation; Network Simulator; NS-2; Radio propagation model; Deployment environment.
Improved Biometric Identification System Using a New Scheme of 3D Local Binary Pattern
by KORICHI Maarouf, Meraoumia Abdallah, Aiadi Kamal Eddine
Abstract: In any computer vision application, integration of relevant feature extraction module is vital to help in making accurate decision ofrnthe classification. In the literature, several methods that havernachieved promising results and high accuracies are based on texturernanalysis. Thus, there exist various feature extraction techniques torndescribe the texture information, among them; the Local BinaryrnPattern (LBP) is widely used to characterize the image sufficiently.rnGenerally, LBP descriptor and their variants are applied onrngray-scale images. Thus, in this paper, we propose a new methodrnthat can be applied to any type of image either in grayscale, color,rnmultispectral or hyperspectral. It is a new scheme of 3D LocalrnBinary Pattern. We have developed biometric system for personrnidentification and an edge detection technique to evaluate it. Thernobtained results have showed that it has higher performancesrncompared to other methods developed in the literature in terms ofrnidentification rates.
Keywords: Feature extraction;Local Binary Pattern (LBP);Biometrics;Person identification;Palmprint;Data fusion.
An Agricultural Data Storage Mechanism Based on HBase
by Changyun Li, Qingqing Zhang, Pinjie He, Zhibing Wang, Li Chen
Abstract: With the development of agricultural space-time localization, sensor network and cloud computing, the amount of agricultural data is increasing rapidly and the data structure becomes more complicated and changeable. Currently, the widely used agricultural database is the relational database. This database handles a large amount of data with very limited throughput and is not suitable for organization and management of distributed data. Hbase is a non-relational database of distributed file storage built on Hadoop platform. Hbase is suitable for unstructured data storage database and it can handle large volume of data with high scalability. To better store agricultural big data in Hbase, we propose a special agricultural data buffer structure which stores data based on the data category and a two-level indexing memory organization strategy on HBase. The method proposed saves more than a quarter of the time compared to traditional buffering methods. Experimental results show the higher efficiency of the agricultural data buffer structure and memory-organization strategy.
Keywords: agricultural big data; data buffer structure; HBase; two-level indexing strategy.
A Real-time Multi-Agent System for Cryptographic Key Generation using Imaging-based Textural Features
by Jafar Abukhait, Ma'en Saleh
Abstract: Traditional network security protocols depend on exchanging the security keys between the network nodes, and thus opposing the network to different classes of security threats. In this paper, a multi-agent system for cryptographic key generation is proposed for real-time networks. The proposed key generation technique generates a 256-bit security key for the Advanced Encryption Standard (AES) algorithm using the textural features of digital images. By implementing this key generation technique at both the sender and receiver network nodes, the process of exchanging the security keys through the network would be eliminated, and thus making communication between network nodes robust against different security threats. Simulation results over a real-time network show the efficiency of the proposed system in reducing the overhead of the security associations performed by the IPsec protocol. On the other hand, the proposed agent-based system shows a high efficiency in guaranteeing the quality-of-service (QoS) of the real-time requests in terms of miss-ratio and total average delay through applying the best scheduling algorithm.
Keywords: Cryptography; Textural Features; Gray Level Co-occurrence Matrix (GLCM); Advanced Encryption Standard (AES); QoS; Security Key; Network Node.
Modeling of learner behavior in massive open online video-on-demand services
by Ji-Wei Qin, Xiao Liu
Abstract: Video-on-demand service as a popular Internet application provides lively learning resource, learner can freely selects and watches his/her interesting videos in massive open online education. Learner video-on-demand behavior as feedback shows preference among learners is available to help video provider to design, deployment and manage learning video in massive open online VoD services. In this paper, we collected the learner video-on-demand behavior reports in 875 days, on the basis of real-word data, the learner video-on-demand model is presented in massive open online VoD service. Three main findings are proposed. 1) The Educational video popularity matches better with the Stretched Exponential model than the Zipf model. 2) The long-session educational video attends with the less-popularity. 3) The Poisson distribution is considered the best fit for the arrival learner in massive open online vod services. Educational video popularity distribution would be helpful to define the number copy of educational video file for deployment on video-on-demand server. Session and arrvial pattern would be helpful to design the content of educational video in massive open online VoD services.
Keywords: learner behavior; video-on-demand; massive open online.
Research on equalization scheduling algorithm for network channel under the impact of big data
by Zheng Yu, Dangdang Dai, Zhiyong Zha, Yixi Wang, Hao Feng
Abstract: In order to improve the equalization scheduling ability of network channel, an equalization scheduling algorithm for big data network communication based on the baud-spaced equilibration and decision feedback modulation technology is proposed in this paper. With this algorithm, a model for network communication channel under the impact of big data is constructed to analyze the multipath characteristics of network channel; coherent multipath channel modulation method is used to conduct wave filtering to intersymbol interference and adaptive baud-spaced equilibration technology is also used to design channel equalization; the model for tap delay line of channel is used for multipath suppression of network channel, and the decision feedback modulation technology is also used for network channel equalization scheduling to overcome the impact of phase shift caused by big data impact on channel and improve channel equalization. Simulation results show that when the proposed algorithm is used for network channel equalization scheduling, the fidelity of symbols output through network communication is good and the bit error rate is low, and the performance of network channel equalization scheduling under the impact of big data and multipath is good, which improves the robustness of network channel.
Keywords: big data; multipath effect; network channel; equalization scheduling; baud space; modulation \r\n\r\n.
Study on high accurate localization using multipath effects via physical layer information
by Yajun Zhang, Yawei Chen, Hongjun Wang, Meng Liu, Liang Ma
Abstract: Device-free passive localization (DFL) has shown great potentials to localizing target(s) without carrying any device in the area of interests (AoI). It is especially useful for many applications, such as hostage rescuing, wildlife monitoring, elder care, intrusion detection, etc. Current RSS (received signal strength) based DFL approaches, however, can only identify underlying the prerequisite that the signal collected is mainly conveying along a direct line-of-sight (LOS) path, but cannot perform well in a typical indoor building with multipath effects. This paper explains the fine-grained CSI-based localization system that is effective to locate within multipath environment and non-line-of-sight scenarios. The intuition underlying our design is that CSI (Channel State Information) benefits from the multipath effect, because the received signal measurements at different sampling positions will be the combination of different CSI measurements. We adapt the improved maximum likelihood method to pinpoint single target's location. Final, we propose a prototype of our design utilizing commercial IEEE 802.11n NICs. Results from the experimental scenes of a Lobby and a laboratory of our university, comparing to RSS-based and CSI-based scheme, demonstrate that our design can locate best single target with the accuracy of 0.95m.
Keywords: device-free passive localization; channel state information; improved maximum likelihood methodrnrn.
A fast particle filter pedestrian tracking method based on color, texture and corresponding space information
by Yang Zhang, Dongrong Xin
Abstract: A fast particle filter pedestrian tracking method based on color, texture and corresponding space information is proposed. In this algorithm, firstly, we extract space information of object pedestrian and disintegrate it into three local regions. In addition, employ the improved texture and color information extract algorithm to get the joint texture and color information from the corresponding sub-region. Finally, determine the position of object by color-texture similarity indicator based on space division, and get the result of accurately track. In consideration of the multi thread information fusion algorithm need a larger number of particles, this factor could reduce the computational efficiency. Therefore, a wave integral histogram algorithm is proposed for improving arithmetic speed. The experiment carried out on videos, result indicates the effectiveness and efficiency of the proposed method, which can achieve higher accuracy than other tow state of the art algorithms in the actual traffic scene, and the real-time performance also has been improved considerably.
Keywords: pedestrian tracking; particle filter; integral histogram; texture information.
Velocity Monitoring Signal Processing Method of Track Traffic Based on Doppler Effect
by Xiaojuan Hu, Tie Chen, Nan Zhao
Abstract: In order to improve the monitoring efficiency of track traffic speed, a signal processing method based on Doppler effect is purposed to meet the accurate velocity measurement of high speed trains. As a result, the track traffic radar monitoring signal processing method based on the Doppler effect is studied. First of all, the Doppler effect and the Doppler principles are analyzed. Then, the research of signal processing algorithm of rail traffic radar system is focused on, and the improvement method of a real sequence FFT (fast Fourier transform) imaginary part arithmetic algorithm is put forward. The process of FFT algorithm is simplified, and finally, through the Matlab software simulation, the improved FFT algorithm spectrum analysis effect is further verified. The test results showed that the use of improved FFT algorithm ensured the measurement accuracy, and improved the Doppler frequency calculation speed. In addition, it can meet the processing requirements of rail traffic radar velocity measurement system on the rail traffic velocity monitoring signal.
Keywords: Signal processing; Doppler effect; Track traffic; FFT algorithm.
Research and Application on Logistics Distribution Optimization Problem using Big Data Analysis
by Yuming Duan, Hai-tao FU
Abstract: The optimization of logistics distribution center location is discussed under the environment of big data. Then the features of logistics distribution and algorithm design idea are provided using basic platform of MapReduce and integrated with data mining clustering algorithm. A clustering analysis algorithm based on geodesic distance is proposed, combined with the features of logistics, also with the parallel algorithm design and improved scheme based on MapReduce. It is considered in real situation, there is no linear distance between nodes, while Dijkstra distance can measure the actual distance between two points, so GDK-means clustering algorithm is put forward. The improved clustering algorithm gets parallel design to process a lot of unstructured data in big data of logistics. In parallel design, taking into account the complexity of algorithm and time efficiency, the parallelization algorithm is improved. Our clustering algorithm can be implemented on logistics distribution center location problem. It is verified to provide a decision scheme for any logistics route optimization in logistics distribution chain according to the size of the granularity of space division.
Keywords: logistics distribution; center location; k-means; geodesic distance; big data.
Efficient Scheduling of Power Communication Resources Based on Fuzzy Weighted Constraint Equalization
by Jinkun Sun, Kang Yang
Abstract: Resources in the power communication system are affected by crosstalk between power grid subnets during scheduling, resulting in a poor equalization of resource allocation. In order to improve equalization allocation of resources in the power communication system, an efficient scheduling method of power communication system resources based on fuzzy weighted constraint equalization is proposed. In this method, the nonlinear time series analysis method is used to construct an information flow model of power communication system resource data and the channel equalization control is carried out in transmission links of the power communication system; the fuzzy weighted constraint equalization method is used to implement adaptive baud-spaced equalization handling during resource scheduling and the fuzzy mesh-based clustering algorithm is used to carry out pairing of classification attribute weights of power resources, so as to achieve efficient clustering of resources and to improve the link equalization in resource scheduling. Simulation results show that with this method, the average data recall rate during resource scheduling reaches about 90%, and the equalization curve changes very smoothly, which fully indicates that with this method, the data recall rate and scheduling efficiency are high, and the equalization capability of communication channels is strong
Keywords: power communication system; resource scheduling; data clustering; channel equalization.
Mechanical fault diagnosis based on digital image processing technology
by Hengqiang Gao, HongJuan CAI
Abstract: Modern mechanical equipment continues to generate high productivity, at the same time, it has brought many new challenges and new problems. It is of great importance to detect and diagnose mechanical fault diagnosis in time and then provide alarm messages. Therefore, in this paper, we aim to propose a novel mechanical fault diagnosis with the digital image processing technology. Firstly, overall structure of mechanical equipment fault dynamic motion detection system is illustrated, and the infrared image segmentation is the key part this system. Secondly, we convert the infrared image segmentation problem to a cluster problem, and then provide a novel immune neural network cluster algorithm. Finally, experimental results demonstrate that the proposed algorithm can detect mechanical faults with high accuracy.
Keywords: Mechanical fault diagnosis; Infrared image; Image segmentation; Immune neural network; Fitness value.
Performance Analysis of Distributed Transmit Beamforming in Presence of Oscillator Phase Noise
by Ding Yuan, Chuanbao Du, Houde QUAN
Abstract: This paper analyses the performance of distributed transmit beamforming in presence of oscillator phase noise. Average beampattern of arbitrary array is adopted here as performance index. In the analysis, the phase noise process of each node oscillator is described by a stationary model taking into account and shape single-sideband (SSB) spectrum. By using non-parametric kernel method, the average beampattern in presence of phase noise is derived and corresponding beampattern characteristics are evaluated. Theoretical analysis and simulation results show that the accumulated PN can result in the degradation of DTBF performance, which are also reflected in the change of beampattern characteristics, such as 3dB width, 3dB sidelobe region and average directivity. With the increase of time duration, the cumulative phase noise becomes greater, and the degradation is more obvious.
Keywords: distributed transmit beamforming; average beampattern; phase noise; non-parametric kernel method; oscillator; performance analysis.
The Research of Image Super-Resolution Algorithm Using Convolutional Sparse Coding
by Bin Wang, Jun Deng, YanJing Sun
Abstract: According to super-resolution image reconstruction for convolution sparse coding, a novel super-resolution reconstruction algorithm named four-channel convolutional sparse coding method has proposed via improving convolutional sparse coding method. In the proposed method, a testing image was put in four-channel via rotating image ninety degrees in four times. Then, the high-frequent part and low-frequent part were reconstructed by means of convolutional sparse coding method and cubic interpolation method respectively. Finally, the reconstructed high-resolution image has obtained via the process of weighting on four images. The proposed method not only overcomes the problem of consistency for the overlapping patches, but also improves the detail contour for the reconstructed image and enhances its stability. The experimental results have shown that the proposed method has better PSNR, SSIM, noise immunity than some classical super-resolution reconstruction methods.
Keywords: Image Reconstruction; Super-Resolution; Convolutional Sparse Coding; Four-Channel; Stability.
Three-dimensional Dynamic Tracking Learning Algorithm for Pedestrians on Indefinite Shape Base Based on Deep Learning
by Yaomin Hu
Abstract: The dynamic tracking of pedestrians under dynamic walking is easily disturbed by light, difference in pixel imaging and other factors, resulting in poor three-dimensional dynamic tracking performance. In order to improve the three-dimensional dynamic tracking and recognition ability to pedestrians, a three-dimensional dynamic tracking learning algorithm for pedestrians on indefinite shape base based on deep learning is proposed in this paper. First, the indefinite shape base mesh of body imaging is segmented to extract three-dimensional dynamic similarity features of pedestrians, and the three-dimensional feature points are marked; the deep learning method is adopted for fusion of gray pixel value and extraction of difference feature to images during three-dimensional dynamic tracking. Then a motion vector library is constructed based on the extraction results, and the template matching equation of three-dimensional dynamic feature points of pedestrians is obtained; and then the pixel value of each local region is taken as a learning adjust factor to perform deep learning processing for dynamic tracking of images, to obtain the three-dimensional tracking results, which achieves the three-dimensional dynamic tracking and recognition to pedestrians on indefinite shape base. The simulation results show that this method can accurately track moving bodies in three-dimensional dynamic tracking and recognition and can provide good robustness in moving body target extraction with accuracy up to 100% at maximum and detection time of 48.83ms at maximum. Therefore, this proposed method has high real-time performance and significant effect in moving pedestrian detection.
Keywords: indefinite shape base; pedestrian; three-dimensional dynamic tracking; deep learning; image.
A 3D model retrieval method based on multi-feature fusion
by Hong Tu
Abstract: 3D model retrieval is a hot topic in information retrieval, and it is of great importance to fuse multi-feature of 3D models to achieve high quality retrieval. Therefore, in this paper, we propose a novel 3D model retrieval method based on the multi-feature fusion technology. Motivation for the proposed 3D model retrieval method lies in that we convert the 3D model retrieval problem to a discriminative feature space mapping problem. The framework of the multi-feature fusion based 3D model retrieval system contains two main modules: 1) model normalization, and 2) multi-feature fusion. The proposed 3D model retrieval method is designed based on multiple feature fusion and online projection learning. In order to effectively fuse multiple features, we train a model to learn a low dimensional and discriminative feature space from the multiple views of 3D models. Particularly, to effectively retrieve the newly added samples, we propose an online projection learning algorithm, which learns a projection matrix by handling the least square regression model. Experimental results show that the proposed method can achieve higher precision for a given recall than others methods, that is, the proposed method can obtain higher quality 3D model retrieval results than state-of-the-art methods.
Keywords: 3D model retrieval; Multi-feature fusion; Visual feature; Eigenvalue decomposition; Projection matrix.
Dual control algorithms for fault diagnosis of stochastic systems with unknown parameters
by Jinkun Sun, Kang Yang
Abstract: This paper researches the problem of fault diagnosis for stochastic system characterized by slowly changing, unknown parameters. This paper puts forward a conception of logic parameter decay rate based on the threshold, and has designed a rolling control algorithm learning control law based on Kalman filtering theory and lqg control law, while this algorithm can estimate the parameters, on the side of the parameter learning, the system has good fault tolerance ability, thus more accurate fault detection and isolation. The simulation results verify the effectiveness of the proposed method.
Keywords: Dual control; Parameter decay rate; Kalman filter; Lqg control; Rolling control algorithm.
Converged services composition with case-based reasoning
by Hui Na Chua, S.M.F.D. Syed Mustapha
Abstract: In order to achieve the converged service composition in next generation network environment, it is necessary to have an approach that is capable to manage the difficulties of potential complexities due to service unavailability and network failures. In response to these challenges, we propose a converged service composition (CSC) framework having a management function that uses case-based reasoning (CBR) for handling services unavailability and/or network failures during the service composition process.
Keywords: web service composition; case-based reasoning; CBR; next generation network service layer.
Optimised cost considering Huffman code for biological data compression
by Youcef Gheraibia, Sohag Kabir, Abdelouahab Moussaoui, Smaine Mazouzi
Abstract: Classical Huffman code has been widely used to compress biological datasets. Though a considerable reduction of size of data can be obtained by classical Huffman code, a more efficient encoding is possible by treating binary bits differently considering requirement of transmission time, energy consumption, and similar. A number of techniques have already modified the Huffman code algorithm to obtain optimal prefix-codes for unequal letter costs in order to reduce overall transmission cost (time). In this paper, we propose a new approach to improve compression performance of one such extension, the cost considering approach (CCA), by applying a genetic algorithm for optimal allocation of the codewords to the symbols. The idea of the proposed approach is to sacrifice some cost to minimise the total number of bits, hence, the genetic algorithm works by giving penalty on the cost. The performance of the approach is evaluated by using it to compress some standard biological datasets. The experiments show that the proposed approach improves the compression performance of the CCA considerably without increasing the cost significantly.
Keywords: data compression; Huffman code; information coding; genetic algorithm; cost considering approach; CCA; data communication; optimisation.
A trust management based on a cooperative scheme in VANET
by Ahmed Zouinkhi, Amel Ltifi, Chiraz Chouaib, Mohamed Naceur Abdelkrim
Abstract: VANET is a vehicular ad hoc network, which is highly dynamic, self-organised and without a preexisting infrastructure. VANET works properly if the participating vehicles cooperate to ensure the exchange of packets. This special network confronts many constraints, such as attacks of malicious entity and absence of trust between nodes. To solve these problems, we proposed an approach having a decentralised architecture combining two models: the cluster model and the trust management model. Our approach encourages cooperation between vehicles by broadcast packets using the reward concept. It also ensures the detection of selfish nodes using the trust concept. By applying the punishment mechanism, our approach aimed to prevent malicious nodes from disrupting the network by injecting false information. Besides, in our network, we guaranteed authentic forwarding packets which were controlled by the group leader which takes the function of 'watchdog'. Our approach is based on asymmetric cryptography, which used RSA encryption and digital signature to ensure security. The simulation results provided by the NS3 simulator showed that our approach has better performance.
Keywords: vehicular ad-hoc network; VANET; cooperation; security; trust management; NS3.
Visible light communication-based high-speed high-performance multimedia transmission
by Atul Sewaiwar, Samrat Vikramaditya Tiwari, Yeon-Ho Chung
Abstract: A novel scheme for high-speed high-performance multimedia transmission using visible light communication is presented. Initially, the multimedia image is converted to digital data. This digital data is divided into three sub-streams and each sub-stream is then transmitted via three parallel channels. Prior to transmission, each sub-stream data is modulated using on-off keying (OOK) modulation. Three parallel channels corresponding to each colour (red, green and blue) of a RGB LED are utilised for transmission, thus giving a total of nine channels. Colour filters (CFs) and selection combining (SC) are also utilised for performance improvement and high speed transmission. Simulations are performed to evaluate the effectiveness of the proposed scheme. Results show that the proposed scheme is efficient in terms of bit-error-rate (BER) performance and data rate. Thus, it can effectively be used for high speed multimedia transmission.
Keywords: free space optical communications; visible light communication; VLC; multimedia; multiplexer; de-multiplexer.
Analysis of energy aware job offloading in mobile cloud
by Hong Min, Jinman Jung, Junyoung Heo
Abstract: Mobile cloud computing is the combination of cloud computing and mobile computing, and provides rich computational resources to a mobile computer. In mobile cloud computing, computation offloading techniques are used to overcome the limitations of resource-constrained mobile devices. Offloading techniques perform some parts of a job of mobile devices in the cloud in behalf of mobile devices. If the cost of the operation in that part of the job in a mobile device is larger than the cost associated with offloading, the part is executed in the cloud. Traditional cost analysis models for deciding which parts of a job to execute in the cloud or a mobile device were estimated by using only the cost of offloading, which is composed of data transfer and response time required for the function call. In this paper, we propose a novel offloading cost analysis model based on the data synchronisation rate and the data exchange rate for the input of the function to improve the accuracy of offloading cost estimation. We confirm through experiments that the offloading technique with the proposed model can reduce the execution time of a job and consequentially improve the energy efficiency when compared to previous techniques.
Keywords: mobile cloud computing; profiling; offloading; remote procedure call; RPC.
Method of trajectory privacy protection based on restraining trajectory in LBS
by Zemao Zhao, Jiabo Wang, Chuanlin Sun, Youwei Yuan, Bin Li
Abstract: With the development of mobile positioning technology, location-based services are becoming more and more widely used in life, but it has produced the security problem of the user's privacy leakage. In this paper, the problem of user trajectory privacy protection in location-based services is introduced, and a method of trajectory privacy protection based on restraining trajectory in LBS is proposed. The proposed method is done by restraining the release of sensitive position and choosing a non-sensitive position that the user might stay at with the maximum probability to replace the sensitive position. So it will prevent the leakage of sensitive position of user's trajectory, and protect the user's activity trajectory, and give the method of calculating the privacy protection degree of restraining method.
Keywords: location-based service; LBS; privacy preservation; trajectory privacy; restraining trajectory.
An improved design of P4P based on distributed tracker
by Lixin Li, Feng Wang, Wentao Yu, Xiuqing Mao, Mengmeng Yang, Zuohui Li
Abstract: The P4P architecture is mainly composed of appTracker, iTracker and peer. The single appTracker manages sharing resources in the different ISP domains. Every peer registers with appTracker when joining the network, and then requests resources from appTracker. In this architecture, there is too much workload for the single appTracker, thus, the bottleneck problem often appears when the scale of the network is enlarged in this centralised structure. An improved design of P4P based on distributed tracker is proposed to solve the overload problem of single appTracker server. In the improved P4P system, a distributed tracker overlay network replaces the appTracker to manage the resources in the different ISP domains. The functions of iTracker arranged by ISP are extended and the info interfaces of the iTracker are designed in detail in order to realise sharing the resources among the different iTrackers. The experiments prove that the P4P framework based on the distributed tracker can solve the server bottleneck problem and improve the scalability and stability while maintaining the characteristics of locality and transmission capacity.
Keywords: proactive network; P4P; distributed tracker; overlay network; weighted graph.
Chinese-Naxi syntactic statistical machine translation based on tree-to-tree
by Shengxiang Gao, Zhiwen Tang, Zhengtao Yu, Chao Liu, Lin Wu
Abstract: For the purpose of using Naxi syntax information efficiently, we put forward a method of Chinese-Naxi syntactic statistical machine translation based on the tree-to-tree model. Firstly, for using syntax information of source language and target language, collecting Chinese-Naxi aligned parallel corpus and making a syntax parsing on both side, the method obtains corresponding phrase structure trees of Chinese and Naxi. Then, by using GMKH algorithm to extract a large number of translation rules between Chinese treelets and Naxi treelets, inferring their probabilistic relationship from these rules, it obtains the translation templates. Finally, using these translation templates, through a tree-parsing algorithm, to guide the decoding, translating each Chinese phrase treelet in bottom-up, it obtains the final translation text. In comparison with the tree-to-string model, the experiments show that this method improves 1.2 BLEU value. This proves that both Chinese syntactic information and Naxi syntactic information are very helpful in improving the performance of Chinese-Naxi machine translation.
Keywords: machine translation; Chinese-Naxi; syntax; tree-to-tree.
Research on wireless sensor network for mechanical vibration monitoring
by Liang Zong, Wencai Du, Yong Bai
Abstract: The mechanical vibration monitoring system based on the cable connection has characteristics such as the complexity of the cabling layout, high cost and poor maintainability and system flexibility. This paper introduces wireless sensor network (WSN) into the mechanical vibration monitoring. The monitoring data transmission in the wireless sensor network is completed by radio waves. There are significant advantages that low cost, remote monitoring, facilitates the diagnosis and maintenance. The multi-hop function and topological flexibility of WSN can effectively avoid wireless signal attenuation effect of buildings and equipment. This paper presents a wireless sensor network model for the mechanical vibration monitoring, analyses the two kinds of wireless sensor network topology, and sets up a vibration sensor monitoring network system. The system takes vehicle vibration sensors to collect monitoring data, and combines the ADTCP algorithm for multi-hops network, puts forward a scheme that limits the congestion window to reduce the network congestion. In this paper, the scheme can effectively alleviate the sink node's congestion in the mechanical vibration monitoring wireless sensor network, and improve the performance of network monitoring.
Keywords: sensor network; mechanical vibration; vibration monitoring.
Security and robustness of a modified ElGamal encryption scheme
by Karima Djebaili, Lamine Melkemi
Abstract: In this paper, we propose a new and practical variant of ElGamal encryption which is secure against every passive and active adversary. Under the hardiness of the decisional Diffie-Hellman assumption, we can prove that the proposed scheme is secure against an adaptive chosen ciphertext attacks in the standard model. Such security verifies not only the confidentiality but also verifies the integrity and the authentication of communications. We display that the modified scheme furthermore achieves anonymity as well as strong robustness.
Keywords: ElGamal encryption; adaptive chosen ciphertext attacks; decisional Diffie-Hellman assumption; robustness.