Earticle

Competitive MAC protocols become a good choice for Wireless Sensor Network because of their have good dynamic adaptability and so on. However, in general, there is a serious problem of data collision in competitive protocols, so a low collision MAC protocol based on broadcast messages is proposed in this paper, SA-MAC (Self-adaption Advertisement MAC). It uses broadcast messages to make the related nodes working in a scheduled time slot, while the unrelated nodes turning to sleep in the time slot, thus reducing the probability of data collision. Additionally, it designs the corresponding adaptive contention window mechanism and fast transmission mechanism according to the usage ratio of data buffer, so the network performance is further improved. The simulation results show that, compared with S-MAC and ADV-MAC, SA-MAC can reduce the energy consumption and delay while improving the packet delivery ratio. Moreover, it maintains a good network performance whether in the single-hop or multi-hop network environment.

Lately, the range of WBSN (Wireless Body Snesor Networks) applicability has expanded due to the support of the advanced wireless technology in the ubiquitous environment. WBSN is a network where various kinds of bio signals of the body are measured and then are processed and transmitted to neighboring monitoring and personal portable devices near human body. Current IEEE 802.15.4 MAC Protocol based on the FIFO (First Input First Output) principle allocates the time slot according to the order of requesting time for each node. However, this process may result in the increase the packet delay and a rate of packet loss when more packets than the available time slot attempt to transmit at the same time. Hence, in order to mitigate this performance degradation, we analyzed four types of the different scheduling scheme for effective controlling between the packet delay and packet loss in the system. The proposed buffer control applies the maximum delay restriction to new and previous data packets simultaneously in order to reduce the rate of the packet loss very effectively. Simulation results show that the proposes scheme attains the much smaller packet delay for the audio transmission and also reduces the packet loss for the audio and video packet transmission compared with the other schemes in view of availability of delayed packets as a effective data.

Basic scientific research achievements management involves multiple knowledge resources. We propose a knowledge supernetwork model to integrate multiple knowledge resources. First, person network, material carrier network, and knowledge element network are established. Subsequently, the knowledge supernetwork is constructed to integrate the above three networks. Second, the characteristics of knowledge supernetwork are investigated from the perspective of the quantitative analysis. Based on the knowledge supernetwork, some methods for solving real problems are developed. Finally, we construct a knowledge supernetwork model using real basic scientific research achievement files. The methods of knowledge representation, basic scientific research proposal grouping, and knowledge classification are proposed to illustrate how to manage basic scientific research achievement from the perspective of knowledge.

This paper studies the optimal linear filtering problem for networked control systems (NCSs) with multiple packet dropouts. When the current measurement is lost, the two popular compensation mechanisms (the hold-input and zero-input mechanism) are used for compensation, respectively. The hold-input strategy means that the latest measurements received is applied directly whereas the zero-input one adopts zero value. Based on the two popular compensators, the optimal linear filters in the linear minimum variance sense are given by innovation analysis approach, and their performances are compared in terms of two simulation examples. The conclusion is that neither of the two compensation mechanisms can be claimed to be superior to the other.

Wireless Sensor Networks (WSNs) is a warm area of research. WSNs consist of large number of sensor nodes deployed randomly in the sensor field. But, it suffers with several shortcomings such as energy imbalance, processing power, storage, transmission range and mitigates energy hole problems. Therefore it’s a tough task to design and develop an optimized routing protocol for WSNs. Hence, this research paper mainly focuses on the energy consumption and network lifespan issues of WSNs and presents an improved version of Distributed Energy-Efficient Clustering (DEEC) protocol. To enhance the network lifetime and reliability of DEEC protocol, three improvements are incorporated in the algorithm and the proposed algorithm named as improved DEEC (IDEEC). From experiment section, it is stated that proposed improvements make protocol more robust and efficient in terms of lifetime of nodes, stability and energy consumption in comparison to other algorithm being compared.

Most of the local community detection algorithms based on node similarity often simply count the number of common neighbors as the basis of selecting members of the community that cannot accurately measure the value of a common neighbor node in the information transmission of nodes. For this, we use the new concept of a common neighbor contribution; borrowed from the idea about the local modularity, put forward a new fast community detection algorithm. The algorithm accurately selects candidate nodes to join the community, according to the contribution of the common neighbor node, also without calculating local modularity for each common neighbor node, and greatly improved the accuracy and efficiency in merging Members. the experimental results of the computer-generated network and the real networks verified reliability and efficiency of the algorithm.

An autonomous emergency braking (AEB) system based on Vehicle to Vehicle (V2V) communication considering road friction at slopes was proposed in this study. Conventional AEB systems have limited performance of effective braking according to road conditions because they mostly consider only particular road conditions on straight roads. To solve this limitation, a new control logic was proposed to calculate the braking timing by considering road condition at slopes. The TTC (time to collision) method, which is the collision risk, was introduced in the proposed AEB system based on information of the host vehicle and a nearby vehicle. To verify the proposed AEB system, various road conditions, vehicle speeds and slopes were reflected in this scenario. The AEB system proposed through this analysis showed enhanced braking and collision avoidance performances compared to conventional AEB systems.

Along with the rapid advancement of Internet technology and machine learning science, the data mining techniques have been widely applied on the web page information pattern analysis issues. To enhance the traditional mining algorithms theoretically and numerically, we propose the novel deep web data mining algorithm based on multi-agent information system and collaborative correlation rule in this manuscript. Firstly, we review the latest web mining methodologies to serve as the comparison objects. Then, we introduce the revised agent based algorithm. MAS consists of more than one agent, MAS using parallel distributed processing technology and modular design thought and the complex system is divided into relatively independent agent subsystem. Later, we combine the AdaBoost method to propose the collaborative correlation rule. As the combination, we use the mentioned two techniques to form the optimized and enhanced deep web data mining algorithm with the implementation of programming languages. The experimental result proves the feasibility of our approach and compared with other contemporary state-of-the-art algorithms, our method outperforms and achieves better accuracy with low time-consuming.

A mobile ad hoc network is a multi-hop, centerless and ad hoc network consisting of a group of mobile terminals with wireless communication transceiver devices, and it does not require the support of fixed facilities, composed of a large number of dispersed wireless nodes. Each node can act as both a terminal and as a router, which means that each node can serve as a terminal to produce or receive data information and also serve as a router to forward the data information from other nodes. As the mobile terminals are mostly battery-operated and extremely sensitive to energy consumption, it is very important to prolong the lifetime of the network by reducing the energy consumption of the node. In this paper, a mobile ad hoc network is introduced briefly first, followed by the analysis of the research status of the AODV protocol for the mobile ad hoc network, with focus placed on the introduction to a routing protocol MTTC-ADOV (Minimum Total Transmission on Cost AODV) that can optimize energy consumption by choosing the routing path involving the minimum total transmission cost from all possible routing sets, with consideration given to power and node energy consumption as the routing selection goal. The total transmission cost includes the energy consumption of nodes on the link during transmission, energy consumption of nodes during the message receiving process and energy consumption of nodes during the message transmission process.The MTTC-AODV protocol required the minimum transmission power of each hop on the multi-hop link consisting of the routing, thereby extending the network lifecycle.

In this paper, we introduce a new dynamic wavelength allocation algorithm for a TWDM PON (time and wavelength division multiplexed passive optical network) having inexpensive ONUs (optical network units). The inexpensive ONU has a cheap and low-speed wavelength tuner. The cheap tuner takes from few milliseconds to few seconds to change its wavelength. Most dynamic wavelength allocation algorithms assume that an ONU has a perfect tuner whose tuning time is zero. Unlike most existing algorithms, the proposed algorithm does not ignore the tuning time of an ONU tuner. In the proposed algorithm, an OLT (optical line termination) uses an average grant amount to predict the average packet arrival rates of all ONUs. The OLT decreases the number of active upstream wavelengths if the average grant amount is less than the bandwidth amount of the upstream wavelengths. Otherwise, the OLT increases the number of active upstream wavelengths. Using computer simulations, we show performance of the proposed algorithm and the average number of active upstream wavelengths.

Wireless sensor network has a rapid growth in both science research and commercial development as well as been widely used in a variety of realms. Facing different kinds of challenging issues of WSNs, the deployment of nodes stands out for it has a critical influence on area or target coverage, network connectivity, network lifetime, etc. This paper explores classifications of node and deployment strategies from different angles, weighing their pros and cons and analyzing its impacts on the performance of a WSN.

The purpose of sensor network node localization is to obtain the information about the absolute or relative locations of various kinds of sensor nodes on the plane or in space. In many sensor network application fields, one important issue that users are concerned about is: in what location or area an inappropriate use or detection situation occurs. Sensor network node technology provides vital node location information for a whole network system's obtaining a large amount of detailed and reliable monitoring information. The obtaining of node location information will directly influence the effectiveness of the whole network system, so study on the node localization mechanism and algorithm involved in a wireless sensor network is the key to realizing node localization technology. In this paper, based on wireless sensor network research, a range-free localization mechanism based on DV-Hop localization algorithm is analyzed, with the optimized processing of this algorithm preliminarily realized, with an intuitive understanding of the relationship between nodes and localization errors realized through MATLAB simulation experiment.

Studies on recognizing different kind of handwritten texts have been conducted and achieved great success for some letters. This paper reviews the segmentation techniques on English handwritten recognition, which is one of the most successful one up to date. Also, considering the very much relations between Arabic and Uyghur which we are aiming to get progress on its handwritten recognition technology, references from Arabic handwritten recognition are very much hoped to get. Characteristics of Uyghur handwriting texts and some of the encountered difficulties are described. Then referencing the successful work on English and Arabic basic unit segmentation, this paper tries to give some suggestions for Uyghur basic unit segmentation research.

Ultrasonic sensor is widely used in robot, automobile, automatic production line and so on, but its detection angle is limited, therefore, multiple ultrasonic sensors are often needed to expand the detection range of distributed structures such as parallel or surround. Multiple ultrasonic probes work at the same time, and very close each other, it will cause crosstalk problems. The chaotic sequence is introduced into the detection signal in the system of ultrasonic receiving and transmitting, it can improve the reliability of detection information and efficiency, realize multi probe synchronously work without crosstalk. Simulation and experimental data show that the system can effectively detect in the range from 0.08 to 4.87 meters, the average error is less than 1.16%, which proves that this method is feasible.

Cloud computing furnishes a unique term of computing and becomes a buzzword to its overwhelming trade prospects. Cloud computing achieved an impetus and is remodeling the internet based computing framework as well as raise the proficiency of mobile systems. Mobile cloud computing or on-demand computing is attaining fame among mobile users and mobile devices can use clouds for various exhaustive applications like storage or information processing. Mobile cloud computing overcomes performance-related difficulties such as battery and storage capacity as well as communication and environment connected affairs like security, availability, and privacy. Still, mobile on-demand computing beneath anticipation because of privacy and security perils. This paper presents an analysis of mobile cloud computing along with its architectural basis and challenges as well as the security considerations. The objective of this paper is to subsidize a superior perceptive on mobile cloud computing and identify further imminent research directions.

In this paper, a modified adaptive sparse channel estimator based on singular value decomposition (SVD) for OFDM systems is proposed. The conventional adaptive sparsity matching pursuit (ASMP) based compressive channel estimation has bad anti-noise performance, although not needing the information of sparsity. Because using the SVD to modify the measurement matrix of CS can improve the robustness to noise. So we use the SVD to modify the measurement matrix of ASMP based compressive channel estimation. The proposed channel estimation has better robustness to noise and low error. The simulation results show that comparing with ASMP based compressive channel estimation, the proposed algorithm has 1 dB gain at MSE and 1.3 dB gain at BER.

Movement of sensor nodes may cause network topology change, communication link fracture and signal propagation delay, while increasing network energy consumption and shortening lifetime of the whole network. This paper proposes an energy-efficient clustering routing algorithm based on mobile wireless sensor networks in three-dimensional space. The algorithm uses multiple-hop routing mechanism, which can effectively balance the node energy consumption in network. The simulation results show that the algorithm has a good effect on node energy saving in the process of moving at different speeds. Thus the network always has more residual energy and longer survival time, which can effectively balance the energy consumption of wireless sensor network and extend the network lifetime.

A mobility management issue is surfacing again as it is expected that mobility requirements will be very essential and vary with application scenarios in the future 5G networks. An important research direction on this area is to design a flat and distributed control architecture to achieve scalability enough to be applied into the wide-scale real networks. In this paper, we propose a distributed mobility management framework for evolving networks toward 5G. The main idea is to separate location management from data traffic control during handling a node's handover. By being divided from location update to be propagated throughout whole network, handover control process can be localized and accelerated in a distributed manner. To apply different control operations according to handover types is another important feature of our approach. Experimental results from our simulation study show that the proposed framework considerably outperforms a well-known MM protocol, Proxy Mobile IPv6, in the aspects of handover latency, packet loss and dispersion of control overhead.

An improved wireless sensor networks effective coverage method based on differential evolution algorithm is proposed in this paper, which using quadratic interpolation method to improve the algorithm performance to further optimize the effective coverage of wireless sensor network nodes. Simulation results show that, compared to DE algorithm, the new algorithm can improve local search capabilities, reduce the computational cost of the algorithm, accelerate standards DE convergence, improve the accuracy of solution, and has some reference value for optimization application of wireless sensor network.

Comparing to other videos, text in news video contains more semantic information which are mostly descript the news event. So, the extraction of text plays an important role for obtaining the high-level semantic information from the video. In this paper, the improved Trajkovic corner detection algorithm has been studied based on the characteristics of text in news video. According to the characteristics of text, the adaptive thresholding method of scale in combination with standard deviation (SCSD) can be applied to determine the corners, which aims to accurately obtain the text-related corners. The breadth-first clustering algorithm was also been used to distinguish and plan the detected corners which are in same range to determine the text area in video frame. The accuracy of recognition and semantic exploration of the extracted text can be used to quickly understand news video that can effectively improve the efficiency to summarize the news videos. The experimental results show this method with high pertinence which can better achieve the targets. The detection accuracy of text-related corners can reach to 82.1% which is higher than other methods. Under the same experimental condition, recall ratio and precision ratio of the text area are also improved dramatically.

RSUs (Road Side Units) that can support seamless communications between vehicles on VANET environment are usually installed in the intersections. However, it cannot be installed on whole intersection because of installation costs. Therefore, it is essential to allocate RSUs on important positions. In this paper, we find RSU candidates by clustering intersections based on the connectivity of them by using influence maximized MCL algorithm, and then finally identify RSU allocation locations according to the size of cluster and the RSU priorities. In our experiment, we showed that our approach had outstanding performance compared to K-Means-based algorithm.

In different environments, there are some differences characteristics of the wireless channel. These differences are called "fingerprint". Extracting the "fingerprint" characteristics of different channels in different environment is very important to the development of wireless communication. This paper is focus on the problem of "fingerprint extraction". Through wireless channel signal inversion and K-means clustering and compressed sensing, establishing an adaptive clustering model. And then establish a reasonable "fingerprint" feature with the existing data and relevant physical background. Use MATLAB to solve the model and verify the accuracy. Computer verification and comparison analysis show that this model can b used to identify the wireless channels sith high accuracy.

In passive bearing-only localization of onboard mono-station, if abnormal error existed in observed value, using extended Kalman filter (EKF) algorithm can lead to biased results. For enhance the robustness of the algorithm, to construct robustness equivalent gain matrix on the basis of standardized predicted residual, and apply the robustness EKF algorithm to passive bearing-only localization of onboard mono-station. According to the characteristics of inefficient robustness EKF algorithm, combined with F distribution statistics, propose the mono-station passive location algorithm based on the improved extended Kalman filtering, and by adding single abnormal error and continuous abnormal error in observed value, test the resistant ability of algorithm to different abnormal errors. Simulation shows that the proposed algorithm can weaken the influence of abnormal error on position estimation, and can improve the efficiency of positioning based on F distribution discriminant algorithm.

Internet of things is a wireless data communications technology, while radio frequency identification (RFID) is an emerging technology in the automatic identification of the Internet of things. In fact, it means the use of RFID system identification technology through the Internet to achieve the application of information interconnection and sharing. In this paper, the author analyzes an improved RFID middleware architecture and optimal algorithm based on internet of things. Through the analysis of RFID middleware technology, we put forward an optimized load balancing algorithm. The results show that the optimization algorithm is superior to the existing algorithms in the average time of load balancing and label processing.

Sensor network has lot applications in the early warning and assistant of disaster environment such as debris flows, floods and forest fires. However, such disaster environment pose an interesting challenge for data collection since sensor nodes may be destroyed unpredictably and centrally, resulting in the decrease of data persistence in the network. Growth Codes Protocol (GCP) first focuses on increase sensor network data persistent in the disaster. However, the completely random data transmission way in GCP may cause a large number of invalid data transmissions and therefore, the efficiency of data collection of the protocol is not ideal in the late stage of data collection. In this paper, we propose an efficient data collection protocol (DGCP) to maximize sensor network data persistence by changing the completely random data transmission way. Packet classification mechanism and a novel dynamic probability model of data transmission in DGCP are proposed to control the effective direction of data flow. Furthermore, we found that the parameter optimization problem of the probabilistic model is a problem of searching the optimal solution in a mathematical view. Based on this property, we propose a genetic algorithm to optimize the dynamic probability model. The performance of the proposed DGCP is shown by a comparative experimental study. When compared with GCP, our DGCP has better performance in a variety of environments

In this article we described the channel capacity of random MIMO channel when CSI is not available at transmitter side. The channel correlation is directly related to capacity of MIMO channel. Also we consider the capacity of MIMO channel when the channel gain between transmitter and receiver is correlated. We compute mathematical equation for calculation of ergodic channel capacity of random MIMO system. MIMO system have very large impact on channel capacity, so it is very necessary to analyze all parameter which are responsible for very high speed data transmission. Because day by day there is very high need of technologies which provide high data transmission. All the simulation in this article are done with the help of MATLAB/Simulink software.

With the improvement of the performance of the embedded processor, the real-time network video monitoring system based on embedded technology becomes a developing direction of the network video with its low price and portability. In this paper, software and hardware co-design method is adopted to design an embedded system. ARM of the Zynq chip is responsible for embedded system structures and high definition video processing, and FPGA is used to design other logic and hardware expansion. Compared with the traditional network video monitoring technology, the embedded network video monitoring technology based on Zynq not only improves the quality of the image, but also has better real-time performance and scalability.

A mobile ad hoc network is a special kind of wireless mobile communication network, featuring equal status of all terminals, ad hoc, no need for prior arrangement of any network facilities or central control nodes, dynamically changing topology and bandwidth and energy restriction. In recent years, research on mobile ad hoc networks, especially research on media access control and routing protocols have research focus. In this paper, the well-known on-demand routing protocol AODV is analyzed and is improved as AODV-CLMP, with a simulation platform used to evaluate its performance, with some meaningful conclusions drawn. In this paper, the origin, characteristics, application and current development of mobile ad hoc networks are introduced briefly, followed by research on two kinds of well-known on-demand routing protocols for mobile ad hoc networks, i.e. AODV and AODV-CLMP. Finally, commonly used network simulation software is compared to conduct evaluation and analysis of the performance of the AODV and AODV-CLMP protocols. Through the analysis of the simulation result of such evaluation indicators as average end-to-end delay, packet delivery fraction and throughput, the following conclusions are drawn: the average delay, packet deliveryfractionand throughput of AODV-CLMP protocol are superior to those ofAODV protocol, indicating thatAODV-CLMP protocol can transmit information more rapidly and steadily.

The effectivivity of test planning in Mobile Application testing improves the quality of Mobile Apps. In the reason of increasing numbers of smart phone applications and their progressive features, mobile phone or smart phone has become a primary resource of communication for worldwide business owners, industrial and office workers.. In fragmented and competitive global market the mobile development cycle is of short period. It is important that one should make sure that the experience every consumer every time they use your application, will be exceptional. Same to functional testing the non-functional testing like Security testing, usability testing also represents an important role effectivivity of test planning. The emergence of mobile applications gives computing environment to number of companies and platforms, but there are a number of companies and platforms that are not much advanced in mobile computing; for those companies and platforms, it has become a challenge to avail the functionality of the mobile application. We use UML diagrams in this represented paper in the form of a tree to extract, test cases to verify/validate the behavior of mobile objects. A new model based approach for automated generation of test cases for object oriented systems in this study is presented. Test cases are derived by analyzing the dynamic behavior of the objects due to internal and external stimuli. The scope of the paper has been limited to the object diagrams taken from the Unified Modeling Language model of the system. The genetic Algorithm’s tree crossover has been proposed to bring out all possible test cases of a given object diagram. Illustrative case study has been presented to create the effectiveness of our methodology coupled with mutation analysis. Mobile application testing presents matchless challenges. For each and every challenge that mobile devices face, there should be a proper mobile testing strategic plan.

In the block encryption algorithm of wireless sensor network, the chaotic map is used as a key generator conform to the application requirements of security and efficiency. Due to the one-dimensional discrete chaotic map would appear the degradation of dynamic characteristics after integer quantization, the cascaded and disturbed integer chaotic key generator were constructed in view of the ideas of cascade and disturbance. The performances of dynamic characteristics and statistical randomness were simulated and analyzed for the cascaded and disturbed integer chaotic sequences, and the disturbed integer chaotic sequence whose disturbance position for 1-8 bits was proved to be more excellent, and it can not only meet the encryption requirements of wireless sensor network, but also reduce the computing power and hardware resources overhead of the processor.