超宽带：无线数据传输的主力军

最早的无线电技术现在被重新开发,成为移动电子产品快速传递大量数据的无线通讯新方式。

基于GPRS的短信平台的开发

本文介绍了GPRS短信模块MC35i的应用,详细介绍了MC35i的特性及其在短信平台的应用,以及系统的电路及其软件设计。将GPRS应用到短信群发平台中,简化了硬件电路,为用户代来了方便。

Remote wireless transmission and error recovery of log data

Remote transmission of log data is an urgent problem for service companies. Remote transmission technology of log data here refers to both the transmission solution in combination with the CifNet multi-well data management system to automate the transmission, storage, management, and retrieval of log data to reduce turn-over time. It is an applied digital signature technology to implement breakpoint transmission and error recovery and ensure the effectiveness and reliability of log data transmission.

Cooperative Jamming for Enhancing Security of Cognitive Radio Networks with Multiple Primary Users

In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single PU in their frameworks. In this paper, we will consider a more complicated scenario with multiple PUs and try to investigate the cooperative jamming between multiple PUs and a single SU. When there are multiple PUs in CRN, in order to obtain more spectrum for data transmission, SU will cooperate with multiple PUs at the same time. Considering that both PU and SU are rational and selfish individuals, the interaction between PUs and SU is formulated as a multi-leaders and single-follower Stackelberg game, wherein PU is the leader and SU is the follower. And the Stackelberg Equilibrium(SE) is considered as the final decisions accepted by all PUs and SU. Furthermore, we also prove that when a specific condition is satisfied, the existence of SE can be guaranteed. And a Gauss-Jacobi iterative algorithm is proposed to compute a SE. Finally, simulation results are given to verify the performance and demonstrate that both of the PUs' secrecy rate and the SU's transmission rate can be improved through cooperation.

UAV trajectory planning algorithmfor data collection in wireless sensor networks

In order to maximize the value of information(VoI)of collected data in unmanned aerial vehicle(UAV)-aided wireless sensor networks(WSNs),a UAV trajectory planning algorithm named maximum VoI first and successive convex approximation(MVF-SCA)is proposed.First,the Rician channel model is adopted in the system and sensor nodes(SNs)are divided into key nodes and common nodes.Secondly,the data collection problem is formulated as a mixed integer non-linear program(MINLP)problem.The problem is divided into two sub-problems according to the different types of SNs to seek a sub-optimal solution with a low complexity.Finally,the MVF-SCA algorithm for UAV trajectory planning is proposed,which can not only be used for daily data collection in the target area,but also collect time-sensitive abnormal data in time when the exception occurs.Simulation results show that,compared with the existing classic traveling salesman problem(TSP)algorithm and greedy path planning algorithm,the VoI collected by the proposed algorithm can be improved by about 15%to 30%.

Coal mine gas monitoring system based on wireless sensor network

Based on the nowadays＇ condition, it is urgent that the gas detection cable communication system must be replaced by the wireless communication systems. The wireless sensors distributed in the environment can achieve the intelligent gas monitoring system. Apply with multilayer data fuse to design working tactics, and import the artificial neural networks to analyze detecting result. The wireless sensors system communicates with the control center through the optical fiber cable. All the gas sensor nodes distributed in coal mine are combined into an intelligent, flexible structure wireless network system, forming coal mine gas monitoring system based on wireless sensor network.

Two States CBR Modeling of Data Source in Dynamic Traffic Monitoring Sensor Networks

Real traffic information was analyzed in the statistical characteristics and approximated as a Gaussian time series. A data source model, called two states constant bit rate (TSCBR), was proposed in dynamic traffic monitoring sensor networks. Analysis of autocorrelation of the models shows that the proposed TSCBR model matches with the statistical characteristics of real data source closely. To further verify the validity of the TSCBR data source model, the performance metrics of power consumption and network lifetime was studied in the evaluation of sensor media access control (SMAC) algorithm. The simulation results show that compared with traditional data source models, TSCBR model can significantly improve accuracy of the algorithm evaluation.

Top-K Query Framework in Wireless Sensor Networks for Smart Grid

The smart grid has caught great attentions in recent years, which is poised to transform a centralized, producer-controlled network to a decentralized, consumer- interactive network that＇s supported by fine-grained monitoring. Large-scale WSNs （Wireless Sensor Networks） have been considered one of the very promising technologies to support the implementation of smart grid. WSNs are applied in almost every aspect of smart grid, including power generation, power transmission, power distribution, power utilization and power dispatch, and the data query processing of ＇WSNs in power grid＇ become an hotspot issue due to the amount of data of power grid is very large and the requirement of response time is very high. To meet the demands, top-k query processing is a good choice, which performs the cooperative query by aggregating the database objects＇ degree of match for each different query predicate and returning the best k matching objects. In this paper, a framework that can effectively apply top-k query to wireless sensor network in smart grid is proposed, which is based on the cluster-topology sensor network. In the new method, local indices are used to optimize the necessary query routing and process intermediate results inside the cluster to cut down the data traffic, and the hierarchical join query is executed based on the local results.Besides, top-k query results are verified by the clean-up process, and two schemes are taken to deal with the problem of node＇s dynamicity, which further reduce communication cost. Case studies and experimental results show that our algorithm has outperformed the current existing one with higher quality results and better efficiently.

Enabling Energy Efficient Sensory Data Collection Using Multiple Mobile Sink

Mobile sink is the challenging task for wireless sensor networks(WSNs).In this paper we propose to design an efficient routing protocol for single mobile sink and multiple mobile sink for data gathering in WSN.In this process,a biased random walk method is used to determine the next position of the sink.Then,a rendezvous point selection with splitting tree technique is used to find the optimal data transmission path.If the sink moves within the range of the rendezvous point,it receives the gathered data and if moved out,it selects a relay node from its neighbours to relay packets from rendezvous point to the sink.Proposed algorithm reduces the signal overhead and improves the triangular routing problem.Here the sink acts as a vehicle and collect the data from the sensor.The results show that the proposed model effectively supports sink mobility with low overhead and delay when compared with Intelligent Agent-based Routing protocol(IAR) and also increases the reliability and delivery ratio when the number of sources increases.

A neighbor information based false data filtering scheme in wireless sensor networks

In sensor networks,the adversaries can inject false data reports from compromised nodes.Previous approaches to filter false reports,e.g.,SEF,only verify the correctness of the message authentication code (MACs) carried in each data report on intermediate nodes,thus cannot filter out fake reports that are forged in a collaborative manner by a group of compromised nodes,even if these compromised nodes distribute in different geographical areas.Furthermore,if the adversary obtains keys from enough (e.g.,more than t in SEF) distinct key partitions,it then can successfully forge a data report without being detected en-route.A neighbor information based false report filtering scheme (NFFS) in wireless sensor networks was presented.In NFFS,each node distributes its neighbor information to some other nodes after deployment.When a report is generated for an observed event,it must carry the IDs and the MACs from t detecting nodes.Each forwarding node checks not only the correctness of the MACs carried in the report,but also the legitimacy of the relative position of these detecting nodes.Analysis and simulation results demonstrate that NFFS can resist collaborative false data injection attacks efficiently,and thus can tolerate much more compromised nodes than existing schemes.

Stability analysis and stabilization of wireless networked control systems based on deadband control scheduling

The stability analysis and stabilization problems of the wireless networked control systems(WNCSs) with signal transmission deadbands were considered. The deadbands were respectively set up at the sensor to the controller and the controller to the actor sides in the WNCS, which were used to reduce data transmission, furthermore, to decrease the network collision and node energy consumption. Under the consideration of time-varying delays and signal transmission deadbands, the model for the WNCS was presented. A novel Lyapunov functional which took full advantages of the network factors was exploited. Meanwhile, new stability analysis and stabilization conditions for the WNCS were proposed, which described the relationship of the delay bounds, the transmission deadband bounds and the system stability. Two examples were used to demonstrate the effectiveness of the proposed methods. The results show that the proposed approach can guarantee asymptotical stability of the system and reduce the data transmission effectively.

Energy-Efficient Transmission Scheme for Mobile Data Gathering in Wireless Sensor Networks

Energy conservation in Wireless Sensor Networks (WSNs) has always been a crucial issue and has received increased attention in the recent years. A transmission scheme for energy-constrained WSNs is proposed in this paper. The scheme, called MIHOP (MIMO and Multi-hop), combines cluster-based virtual MIMO and multi-hop technologies. The multihop mode is employed in transmitting data when the related sensors are located within a specific number of hops from the sink, and the virtual MIMO mode is used in transmitting data from the remaining sensor nodes. We compare the energy consumption of different transmission schemes and propose an algorithm for determining the optimal hop count in MIHOP. A controllable mobile sink that reduces the energy consumed in sensor transmission is also adopted for data collection. The theoretical analysis and the Monte Carlo simulation demonstrate that the proposed scheme significantly outperforms individual virtual MIMO, multi-hop technologies, and double-string networks in terms of energy conservation. The energy consumption levels under the MIHOP scheme are approximately 12.98%, 47.55% and 48.30% less than that under virtual MIMO schemes, multi-hop networks and doublestring networks, respectively.

Secure Data Aggregation Approach Based on Monitoring in Wireless Sensor Networks

In order to avoid internal attacks during data aggregation in wireless sensor networks, a grid-based network architecture fit for monitoring is designed and the algorithms for network division, initialization and grid tree construction are presented. The characteristics of on-off attacks are first studied and monitoring mechanisms are then designed for sensor nodes. A Fast Detection and Slow Recovery (FDSR) algorithm is proposed to prevent on-off attacks by observing the behaviors of the nodes and computing reputations. A recovery mechanism is designed to isolate malicious nodes by identifying the new roles of nodes and updating the grid tree. In the experiments, some situations of on-off attacks are simulated and the results are compared with other approaches. The experimental results indicate that our approach can detect malicious nodes effectively and guarantee secure data aggregation with acceptable energy consumption.

An Anti-Eavesdrop Transmission Scheduling Scheme Based on Maximizing Secrecy Outage Probability in Ad Hoc Networks

In this paper,we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations,where an eavesdropper attempts to intercept their transmissions.We propose an optimal transmission scheduling scheme to defend against the eavesdropper,where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner.To be specific,the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect.The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks.For comparison purposes,we also consider the conventional round-robin scheduling as a benchmark,where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations.We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments.Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability.Additionally,upon increasing the number of source-destination pairs,the secrecy outage probability of the round-robin scheme keeps unchanged,whereas the secrecy outage performance of the proposed transmission scheduling significantly improves,showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.

Research on stateful public key based secure data aggregation model for wireless sensor networks

Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.

A FUNCTION NODE-BASED MULTIPLE PAIRWISE KEYS MANAGEMENT PROTOCOL FOR WIRELESS SENSOR NETWORKS AND ENERGY CONSUMPTION ANALYSIS

In this letter, a Function node-based Multiple Pairwise Keys Management (MPKMF) protocol for Wireless Sensor Networks (WSNs) is firstly designed, in which ordinary nodes and cluster head nodes are responsible for data collection and transmission, and function nodes are responsible for key management. There are more than one function nodes in the cluster consulting the key generation and other security decision-making. The function nodes are the second-class security center because of the characteristics of the distributed WSNs. Secondly, It is also described that the formation of function nodes and cluster heads under the control of the former, and five kinds of keys, i.e., individual key, pairwise keys, cluster key, management key, and group key. Finally, performance analysis and experiments show that, the protocol is superior in communication and energy consumption. The delay of establishing the cluster key meets the requirements, and a multiple pairwise key which adopts the coordinated security authentication scheme is provided.

Cooperative MIMO MAC Transmission Using Space Codes in Wireless Sensor Network

Wireless sensor network （WSN） requires robust and efficient communication protocols to minimise delay and save energy. The lifetime of WSN can be maximised by selecting proper medium access control （MAC） scheme depending on the contention level of the network. The throughput of WSN however reduces due to channel fading effects even with the proper design of MAC protocol. Hence this paper proposes a new MAC scheme for enabling packet transmission using cooperative multi-input multi-output （MIMO） utilising space time codes（STC） such as space time block code （STBC）, space time trellis code （STTC） to achieve higher energy savings and lower delay by allowing nodes to transmit and receive information jointly. The performance of the proposed MAC protocol is evaluated in terms of transmission error probability, energy consumption and delay. Simulation results show that the proposed cooperative MIMO MAC protocol provides reliable and efficient transmission by leveraging MIMO diversity gains.

Epoch-based Application Collaboration for Sensing Data Analysis

The application collaboration was addressed to provide energy-efficient data services for distributed sensing applications to collaboratively interacting to achieve a desired global objective not detectable by any single cluster. An epoch-based transaction model was proposed by using the concept of sphere of control （SoC）, and a collaborative sensing application can be dynamically formed as a nested architecture composed of time-synchronized applications. By loosening the rigid constraints of ACID to adapt the requirements of sensor networks, the submission, rollback and consistency rules ware educed and a two-phrase submission protocol was designed. Finally, it was illustrated that the model is capable of providing an adaptive formal template for sensing application collaboration. Our performance evaluations show that by applying the two-phrase submission protocol, we can significantly improve the number of reported answers and response time, raise resource utilization, and reduce the energy cansumption and data loss.

Gradient based restoration of coal mine images obtained by underground wireless transmissions

Curvature-driven diffusion (CDD) principles were used to develop a novel gradient based image restora- tion algorithm. The algorithm fills in blocks of missing data in a wireless image after transmission through the network. When images are transmitted over fading channels, especially in the severe circum- stances of a coal mine, blocks of the image may be destroyed by the effects of noise. Instead of using com- mon retransmission query protocols the lost data is reconstructed by using the adaptive curvature-driven diffusion (ACDD) image restoration algorithm in the gradient domain of the destroyed image. Missing blocks are restored by the method in two steps: In step one, the missing blocks are filled in the gradient domain by the ACDD algorithm; in step two, and the image is reconstructed from the reformed gradients by solving a Poisson equation. The proposed method eliminates the staircase effect and accelerates the convergence rate. This is demonstrated by experimental results.

Analysis on WPAN Mechanism Based on 802.15.4 and Data Structure Design

IEEE802.15.4 is the communication protocol meeting the requirements of short distance and low transmission rate, and achieving the objective of low power. The technique is an emerging wireless communication standard. It is a two-way wireless communication technology with short distance, low complexity, low power consumption and low data transmission rate and low cost. The paper analyzes the features, framework, performance indicators and overall hardware platform structure of JN5121 chip which is used in JENNIC Corporation. And the paper researches the characteristics of actual oroducts for project development.