A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

Distributed link scheduling method with physical interference model in wireless multi-hop networks

To further increase the throughput of wireless multi-hop networks,a distributed scheduling method is proposed,which takes physical interference model into account.It is assumed that nodes in the network can perform physical carrier sensing,and the carrier sensing range can be set to different values.In the traditional carrier sensing mechanism,the carrier sensing range is computed under the protocol interference model,which is not accurate.Here the optimal carrier sensing range with physical interference model is achieved.Each sending node implements the distributed approach in three phases at each time slot,and all the concurrent transmissions are interference free.Good performance can be achieved under this scheduling approach.The approximation ratio of the distributed method to the optimal one is also proved.

Distributed wireless quantum communication networks with partially entangled pairs

Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible.

Improved control of distributed parameter systems using wireless sensor and actuator networks:An observer-based method

In this paper,the control problem of distributed parameter systems is investigated by using wireless sensor and actuator networks with the observer-based method.Firstly,a centralized observer which makes use of the measurement information provided by the fixed sensors is designed to estimate the distributed parameter systems.The mobile agents,each of which is affixed with a controller and an actuator,can provide the observer-based control for the target systems.By using Lyapunov stability arguments,the stability for the estimation error system and distributed parameter control system is proved,meanwhile a guidance scheme for each mobile actuator is provided to improve the control performance.A numerical example is finally used to demonstrate the effectiveness and the advantages of the proposed approaches.

Distributed event region fault-tolerance based on weighted distance for wireless sensor networks

Event region detection is the important application for wireless sensor networks（WSNs）, where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance（DFWD） is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.

Distributed wireless quantum communication networks

The distributed wireless quantum communication network （DWQCN） ha~ a distributed network topology and trans- mits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum tele- portation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entan- glement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay.

Collaborative Multiple Access And Energy-Efficient Resource Allocation in Distributed Maritime Wireless Networks

With the rapid increasing of maritime activities, maritime wireless networks(MWNs) with high reliability, high energy efficiency, and low delay are required. However, the centralized networking with fixed resource scheduling is not suitable for MWNs due to the special environment. In this paper,we introduce the collaborative relay communication in distributed MWNs to improve the link reliability, and propose an orthogonal time-frequency resource block reservation based multiple access(RRMA) scheme for both one-hop direct link and two-hop collaborative relay link to reduce the interference. To further improve the network performance, we formulate an energy efficiency(EE) maximization resource allocation problem and solve it by an iterative algorithm based on the Dinkelbach method. Finally, numerical results are provided to investigate the proposed RRMA scheme and resource allocation algorithm, showing that the low outage probability and transmission delay can be attained by the proposed RRMA scheme. Moreover,the proposed resource allocation algorithm is capable of achieving high EE in distributed MWNs.

An Approach of Distributed Joint Optimization for Cluster-based Wireless Sensor Networks

Wireless sensor networks (WSNs) are energyconstrained, so energy saving is one of the most important issues in typical applications. The clustered WSN topology is considered in this paper. To achieve the balance of energy consumption and utility of network resources, we explicitly model and factor the effect of power and rate. A novel joint optimization model is proposed with the protection for cluster head. By the mean of a choice of two appropriate sub-utility functions, the distributed iterative algorithm is obtained. The convergence of the proposed iterative algorithm is proved analytically. We consider general dual decomposition method to realize variable separation and distributed computation, which is practical in large-scale sensor networks. Numerical results show that the proposed joint optimal algorithm converges to the optimal power allocation and rate transmission, and validate the performance in terms of prolonging of network lifetime and improvement of throughput. © 2014 Chinese Association of Automation.

ENERGY EFFICIENT DISTRIBUTED STEGANOGRAPHY FOR SECURE COMMUNICATION IN WIRELESS MULTIMEDIA SENSOR NETWORKS

A secure communication mechanism is necessary in the applications of Wireless Multimedia Sensor Networks (WMSNs), which is more vulnerable to security attacks due to the presence of multimedia data. Additionally, given the limited technological resources (in term of energy, computation, bandwidth, and storage) of sensor nodes, security and privacy policies have to be combined with energy-aware algorithms and distributed processing of multimedia contents in WMSNs. To solve these problems in this paper, an energy efficient distributed steganography scheme, which combines steganography technique with the concept of distributed computing, is proposed for secure communication in WMSNs. The simulation results show that the proposed method can achieve considerable energy efficiency while assuring the communication security simultaneously.

A Distributed Dynamic Clustering Algorithm for Wireless Sensor Networks

This paper proposes a distributed dynamic k-medoid clustering algorithm for wireless sensor networks （WSNs）, DDKCAWSN. Different from node-clustering algorithms and protocols for WSNs, the algorithm focuses on clustering data in the network. By sending the sink clustered data instead of practical ones, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. Moreover, the algorithm improves the accuracy of the clustered data dynamically by updating the clusters periodically such as each day. Simulation results demonstrate the effectiveness of our approach for different metrics.

A New MAC Protocol for Moving Target in Distributed Wireless Sensor Networks

A wireless sensor network (WSN) is composed of many nodes with limited power supply;most nodes are stationary in the network which could probably involve a few mobile nodes. Various medium access control (MAC) protocols specially aimed at a target locating application for WSNs have been proposed. However, most of these protocols based on the problem of energy-limited does not consider the mobility of nodes. Therefore, in order to solve such problem, this paper proposes a MAC protocol—Distribute Moving-MAC (DM-MAC). Under the condition of keeping high network coverage, the protocol utilizes the redundancy of nodes to strengthen the robustness and energy efficiency of network, and decreases the packet loss rate of the mobile node’s communication links for realizing reliable communication of two nodes. Simulation indicates that the new protocol has higher energy efficiency, lower packet loss rate and higher network coverage which suit for wireless sensor network with mobile nodes well.

Distributed Algorithms for Maximizing Lifetime in Clustered Wireless Sensor Networks Using Energy-harvesting Relay Nodes

Motivated by recent developments in wireless sensor networks(WSNs),we present distributed clustering algorithms for maximizing the lifetime of WSNs,that is,the duration until the first node dies.We study the joint problem of prolonging network lifetime by introducing clustering techniques and energy-harvesting(EH)nodes.First,we propose a distributed clustering algorithm for maximizing the lifetime of clustered WSN,which includes EH nodes,serving as relay nodes for cluster heads(CHs).Second,graph-based and LP-based EH-CH matching algorithms are proposed which serve as benchmark algorithms.Extensive simulation results show that the proposed algorithms can achieve optimal or suboptimal solutions efficiently.

Distribution algorithm of entangled particles for wireless quantum communication mesh networks

With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree（ MST）-based quantum distribution algorithm（ QDMST） is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios.

Optimal distributed resource allocation in a wireless sensor network for control systems

Wireless technology is applied increasingly in networked control systems. A new form of wireless network called wireless sensor network can bring control systems some advantages, such as flexibility and feasibility of network deployment at low costs, while it also raises some new challenges. First, the communication resources shared by all the control loops are limited. Second, the wireless and multi-hop character of sensor network makes the resources scheduling more difficult. Thus, how to effectively allocate the limited communication resources for those control loops is an important problem. In this paper, this problem is formulated as an optimal sampling frequency assignment problem, where the objective function is to maximize the utility of control systems, subject to channel capacity constraints. Then an iterative distributed algorithm based on local buffer information is proposed. Finally, the simulation results show that the proposed algorithm can effectively allocate the limited communication resource in a distributed way. It can achieve the optimal quality of the control system and adapt to the network load changes.

A Novel Negative Multinomial Distribution Based Energy-Efficient Reputation Modeling for Wireless Sensor Networks(WSNs)

In wireless sensor networks(WSNs),nodes are usually powered by batteries.Since the energy consumption directly impacts the network lifespan,energy saving is a vital issue in WSNs,especially in the designing phase of cryptographic algorithms.As a complementary mechanism,reputation has been applied to WSNs.Different from most reputation schemes that were based on beta distribution,negative multinomial distribution was deduced and its feasibility in the reputation modeling was proved.Through comparison tests with beta distribution based reputation in terms of the update computation,results show that the proposed method in this research is more energy-efficient for the reputation update and thus can better prolong the lifespan of WSNs.

Practical network coding-aware routing protocol for multi-hop wireless networks

Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.

Adaptive Optimal Capacity Perception and Control for Wireless Multi-Hop Networks

In wireless multimedia communications, it is extremely difficult to derive general end-to-end capacity results because of decentralized packet scheduling and the interference between communicating nodes. In this paper, we present a state-based channel capacity perception scheme to provide statistical Quality-of-Service (QoS) guarantees under a medium or high traffic load for IEEE 802.11 wireless multi-hop networks. The proposed scheme first perceives the state of the wireless link from the MAC retransmission information and extends this information to calculate the wireless channel capacity, particularly under a saturated traffic load, on the basis of the interference among flows and the link state in the wireless multi-hop networks. Finally, the adaptive optimal control algorithm allocates a network resource and forwards the data packet by taking into consideration the channel capacity deployments in multi-terminal or multi-hop mesh networks. Extensive computer simulations demonstrate that the proposed scheme can achieve better performance in terms of packet delivery ratio and network throughput compared to the existing capacity prediction schemes.

Load balancing strategy of heterogeneous wireless networks based on multi-hop routing algorithm of ad hoc network

Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.

Distributed Plume Source Localization Using Hierarchical Sensor Networks

A hierarchical wireless sensor networks(WSN) was proposed to estimate the plume source location.Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident.The entire surveillant field is divided into several small sub-regions.In each sub-region,the localization algorithm based on the improved particle filter(IPF) was performed to estimate the location.Some improved methods such as weighted centroid,residual resampling were introduced to the IPF algorithm to increase the localization performance.This distributed estimation method eliminates many drawbacks inherent with the traditional centralized optimization method.Simulation results show that localization algorithm is efficient for estimating the plume source location.

Negative Binomial Distribution Based Reputation Direct Update for Wireless Sensor Networks

In the reputation modeling of wireless sensor networks（WSNs） many literatures have proposed creative reputation indirect update methods,such as reputation integration,discounting,aging to eliminate,and filtering malicious reputation information. However,few have discussed the reputation direct update. In this paper,based on sound statistical theories,a negative binominal distribution method in the reputation direct update for WSNs is proposed. Results show that the proposed method is more suitable and time-saving for the reputation update of the resource constraint WSNs and can improve the computation power efficiency as well.