An efficient data dissemination model for wireless sensor networks

Wireless Networks - In a wireless sensor network, one of the most important constraints on sensor nodes is their power source, which is a battery. Sensor nodes carry a limited and generally...     

An efficient data collection and load balance algorithm in wireless sensor networks

The nature of multi-hop data transmission in wireless sensor network will cause serious load unbalance which will produce great restrains in related applications considering the limited energy resource. Relative load balance algorithms are usually performed inside the clusters without considering about the energy consumption of the whole network. A cluster-based balanced energy consumption algorithm (BECA) is proposed by introducing in multiple inter-cluster links to distribute the load, so as to achieve global load balance. Moreover, an efficient data collecting mechanism is proposed based on BECA to improve the traffic balance further. Simulating results based on NS2 show that BECA can obtain better balance properties and prolong the network lifetime effectively.

     

An efficient channel assignment algorithm for multicast wireless mesh networks

Multicast can enhance the performance of wireless mesh networks (WMNs) effectively, which has attracted great attentions in recent years. However, multicast communication in WMNs requires efficient channel assignment strategy to reduce the total network interference and maximize the network throughput. In this paper, the concept of local multicast is proposed to measure interference and solve hidden channel problem in multicast communication. Basing on the concept, we propose a channel assignment algorithm considering the interference of local multicast and forwarding weight of each node (LMFW). The algorithm fully considers partially overlapped channels and orthogonal channels to improve the network performance. Simulations show that the proposed algorithm can reduce interference and improve network capacity of WMNs.     

An energy efficient clustering routing algorithm for wireless sensor networks

~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A…     

一种基于OFDM系统的无线图像的有效传输方法

本文提出一种基于OFDM多载波系统的无线图像传输的方法。该方法将基于FFT／IFFT变换的OFDM多载波调制与基于小波变换的SPIHT嵌入式零树编码相结合，首先将SPIHT输出码流分成若干数据块，然后根据各数据块视觉重要性的不同，给其分配相应的子信道和发送功率，使视觉重要性高的码流在较低的误比特率下进行传输，实现对视觉重要性不同的码流的不等错误保护。本文在瑞利平坦衰落信道下的仿真结果表明：在低信噪比下，采用本文提出的不等错误保护方法比等错误保护方法的峰值信噪比增益要高出15dB以上。     

基于虚拟突发的OBS数据信道重调度算法研究

基于虚拟突发的概念,提出了一种新的光突发交换(OBS)数据信道重调度算法,即(WCRA-VB).新算法一方面有效地克服了传统OBS网络中数据突发(DB)与控制分组(BHP)到达顺序不一致带来的问题,另一方面极大地增强了数据块重调度的灵活性.仿真结果表明:与传统OBS重调度算法(其重调度粒度为常规突发)和原虚拟突发调度方案相比较,本文的WCRA-VB算法具有以下优势:既能有效改善网络总的丢包率,也能提高链路利用率,同时具有很强的灵活性.     

A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks

We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The distributed co-operation of such nodes may lead to the accomplishment of large sensing tasks, having useful applications in practice. We present a new protocol for data propagation towards a control center (“sink”) that avoids flooding by probabilistically favoring certain (“close to optimal”) data transmissions. Motivated by certain applications (see [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Journal of Computer Networks 38 (2002) 393–422], [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 2000), 2000, pp. 56–67]) and also as a starting point for a rigorous analysis, we study here lattice-shaped sensor networks. We however show that this lattice shape emerges even in randomly deployed sensor networks of sufficient sensor density. Our work is inspired and builds upon the directed diffusion paradigm of [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: 6th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 2000), 2000, pp. 56–67].This protocol is very simple to implement in sensor devices, uses only local information and operates under total absence of co-ordination between sensors. We consider a network model of randomly deployed sensors of sufficient density. As shown by a geometry analysis, the protocol is correct, since it always propagates data to the sink, under ideal network conditions (no failures). Using stochastic processes, we show that the protocol is very energy efficient. Also, when part of the network is inoperative, the protocol manages to propagate data very close to the sink, thus in this sense it is robust. We finally present and discuss large-scale simulation findings validating the analytical results.     

无线供能网络中数据收集的能量效率最大化方案

研究提出由多个射频能量源和汇聚节点组成的无线供能网络,通过联合最优化能量源的发送功率、能量发送时长和节点的数据发送时间,最大化数据收集的能量效率。首先对能量效率最大化问题进行建模。接着,分析得到发送功率的最优取值,并进一步推导出能量效率函数的单调性和吞吐量函数的凹凸性。最后,基于这些属性设计出联合使用黄金分割法和二分法的高效最优算法的快速得到最优解。仿真结果表明,相比于基准方法,所提出的最优算法能显著提高能量效率。     

An efficient routing protocol for wireless networks

We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and secondto-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.This work was supported in part by the Advanced Research Projects Agency (ARPA) under contract F19628-93-C-0175 and by the Office of Naval Research under Contract No. N-00014-92-J-1807.     

An adaptive-weighted two-dimensional data aggregation algorithm for clustered wireless sensor networks

In this paper, an Adaptive-Weighted Time-Dimensional and Space-Dimensional （AWTDSD） data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving the accuracy of the data gathered in the network. AWTDSD contains three phases： （1） the time-dimensional aggregation phase for eliminating the data redundancy; （2） the adaptive-weighted aggregation phase for further aggregating the data as well as improving the accuracy of the aggregated data; and （3） the space-dimensional aggregation phase for reducing the size and the amount of the data transmission to the base station. AWTDSD utilizes the correlations between the sensed data for reducing the data transmission and increasing the data accuracy as well. Experimental result shows that AWTDSD can not only save almost a half of the total energy consumption but also greatly increase the accuracy of the data monitored by the sensors in the clustered network.     

一种改进的社交网络影响力最大化算法

社交网络影响力最大化即是在社交网络中如何挑选包含K个节点的种子节点集,去激活整个网络,使网络中最终被激活的节点数最大化。基于IC模型研究了社交网络影响力最大化问题。Diffusion degree算法提出了节点潜在影响力的概念,即一个节点的邻居节点的影响力也可以作为当前节点的影响力的一部分。基于Diffusion degree算法做出了改进,在考虑潜在影响力的时候进一步考虑了节点潜在影响力的有效性,更加准确地判断节点的影响力,再综合了算法Single Discount中的核心思想,从而选出更加优质的种子节点。仿真结果表明,该算法在影响范围上接近KK贪婪算法的影响范围,同时在时效性上优于Diffusion degree算法,较适合大型社交网络。     

Clustered OFDM with channel estimation for high rate wireless data

Clustered OFDM can provide in-band diversity gain for wideband wireless communication systems. It is a promising technique for high rate packet data access over wideband mobile wireless channels. Due to the smaller size of each cluster for clustered OFDM than for classical (nonclustered) OFDM, edge effects can be very large. In this letter, we present new transforms for channel estimators in clustered OFDM systems. The new transforms are independent of the channel delay profiles and can effectively mitigate the edge effects. It is shown by computer simulation that the performance of clustered OFDM with the estimator using the new transforms is very close to the performance with the optimum estimator that is determined by the individual channel delay profile. Furthermore, clustered OFDM with the new estimator is almost as good as classical OFDM with transmit diversity     

AN EFFICIENT DISTRIBUTED ALGORITHM FOR CONNECTED DOMINATING SET CONSTRUCTION IN WIRELESS SENSOR NETWORKS

Efficient broadcasting protocols based on Connected Dominating Set （CDS） are frequently used; hence the entire broadcast domain is restricted to nodes in the CDS. This letter proves that a node must be a CDS node, if its neighbors with larger keys cannot cover it together. Then a simple distributed CDS construction algorithm is proposed, which is more effective than the existing algorithms in reducing the dominating set size and the computation complexity at the same time. Simulation results also confirm this, especially in relatively dense networks.     

Power efficient range-free localization algorithm for wireless sensor networks

Considering energy consumption, hardware requirements, and the need of high localization accuracy, we proposed a power efficient range-free localization algorithm for wireless sensor networks. In the proposed algorithm, anchor node communicates to unknown nodes only one time by which anchor nodes inform about their coordinates to unknown nodes. By calculating hop-size of anchor nodes at unknown nodes one complete communication between anchor node and unknown node is eliminated which drastically reduce the energy consumption of nodes. Further, unknown node refines estimated hop-size for better estimation of distance from the anchor nodes. Moreover, using average hop-size of anchor nodes, unknown node calculates distance from all anchor nodes. To reduce error propagation, involved in solving for location of unknown node, a new procedure is adopted. Further, unknown node upgrades its location by exploiting the obtained information in solving the system of equations. In mathematical analysis we prove that proposed algorithm has lesser propagation error than distance vector-hop (DV-Hop) and other considered improved DV-Hop algorithms. Simulation experiments show that our proposed algorithm has better localization performance, and is more computationally efficient than DV-Hop and other compared improved DV-Hop algorithms.     

An energy efficient channel assignment and routing algorithm for multi-radio wireless mesh networks

Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks. Solving the problem how to assign channels to radios has attracted a lot of attention in the recent years, partly because of the hardness of solving the channel assignment problem jointly with the routing problem. However, the approaches proposed in the literature so far have mainly focused on reducing interference or maximizing the throughput. Little attention has been paid to the energy consumption of wireless mesh networks, given that mesh nodes are usually connected to a power source. However, with the rising concerns about the energy consumed by communication infrastructures, it makes sense to consider the minimization of the energy consumption as an objective of the channel assignment and routing problem. Our work stems from the observation that an idle radio simply overhearing a frame consumes nearly the same power as the radio actually receiving the frame. Hence, energy may be saved by turning off a number of radios, if the performance of the network is not impaired. In this paper, we define the energy efficient channel assignment and routing problem, show that it is NP-hard and propose a heuristic algorithm. For the purpose of comparing the solution found by the proposed algorithm to the optimal solution, we also present two Mixed Integer Linear Programs (MILPs) that optimally solve the problem we address. Finally, we show the results of extensive simulation studies we conducted to assess the effectiveness of the proposed algorithm.     

An efficient mesh router nodes placement in wireless mesh networks based on moth-flame optimization algorithm

One of the most challenging tasks is deploying a wireless mesh network backbone to achieve optimum client coverage. Previous research proposed a bi-objective function and used a hierarchical or aggregate weighted sum method to find the best mesh router placement. In this work, to avoid the fragmented network scenarios generated by previous formulations, we suggest and evaluate a new objective function to maximize client coverage while simultaneously optimizing and maximizing network connectivity for optimal efficiency without requiring knowledge of the aggregation coefficient. In addition, we compare the performance of several recent meta-heuristic algorithms: Moth-Flame Optimization (MFO), Marine Predators Algorithm (MPA), Multi-Verse Optimizer (MVO), Improved Grey Wolf Optimizer (IGWO), Salp Swarm Algorithm (SSA), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Harris Hawks Optimization (HHO), Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), and Slime Mould Algorithm (SMA). We empirically examined the performance of the proposed function using different settings. The results show that our proposed function provides higher client coverage and optimal network connectivity with less computation power. Also, compared to other optimization algorithms, the MFO algorithm gives higher coverage to clients while maintaining a fully connected network.     

An efficient space-frequency coded OFDM system for broadband wireless communications

We propose an efficient space-frequency coded orthogonal frequency-division multiplexing (OFDM) system for high-speed transmission over wireless links. The analytical expression for the pairwise probability of the proposed space-frequency coded OFDM system is derived in slow, space- and frequency-selective fading channels. The design criteria of trellis codes used in the proposed system are then developed and discussed. It is shown that the proposed space-frequency coded OFDM can efficiently achieve the full diversity provided by the fading channel with low trellis complexity, while for traditional space-frequency coded OFDM systems, we need to design space-time trellis codes with high trellis complexity to exploit the maximum achievable diversity order. The capacity properties of space-frequency coded OFDM over multipath fading channels are also studied. Numerical results are provided to demonstrate the significant performance improvement obtained by the proposed space-frequency coded OFDM scheme, as well as the excellent outage capacity properties.     

A novel learning based solution for efficient data transport in heterogeneous wireless networks

There has been a spectacular growth in the use of wireless networks in recent times and consequently, adapting TCP to the wireless networks is a hot topic of current research. However, most of the existing works proposed for this problem have been designed for specific wireless networks, or they necessitate changes at either the receiver or the intermediate nodes, or at both, because of which their deployment becomes difficult. In this work, we propose a TCP variant which works over both multi-hop ad hoc wireless networks as well as single-hop (last-hop) wireless networks, like Wireless LANs, cellular, and satellite networks. We use a learning based method to dynamically change the congestion window size according to the network conditions. Our protocol does not rely on any explicit feedback from the network and requires only sender-side modifications. Through extensive simulations we show that our protocol achieves the desired goals of performance improvement in goodput, reduction in packet loss, and fairness to the competing flows. To the best of our knowledge, this is the first unified solution for both single-hop and multi-hop wireless networks.     

一种高效的短波高速数传迭代合并均衡算法

针对电离层信道深衰落导致的短波高速率数据通信误码率急剧升高的问题,利用最小均方误差准则提出一种迭代合并均衡快速算法.算法根据串行高速数据波形的传输特点,构造了基于块处理的合并均衡器,通过增加软信息转换模块,实现了与译码器的软信息迭代.由于充分利用了时域和空域信息,算法获得了较大的性能增益.仿真结果表明:所提算法的误码率比原有均衡算法相比明显下降而计算量与之相当,因而能更好地适用于实际系统.     

An efficient detection technique for synchronous CDMA communicationsystems based on the expectation maximization algorithm

Maximum likelihood detection of superimposed signals in code-division multiple access (CDMA) communication systems has a computational complexity that is exponential in the number of users, and its implementation is practically prohibitive even for a moderate number of users. Applying the expectation maximization algorithm to this problem, we decompose the multiuser detection problem into a series of single-user problems, and thus present an iterative computationally efficient algorithm for detection of superimposed signals in synchronous direct-sequence CDMA communication systems. The resulting structure includes the well-known multistage detector as one of its special cases. With a proper choice of its parameters, the new detector can achieve the advantages of both the multistage and conventional detector and have good performance for both strong and weak users