In this paper, a robust optimization problem is formulated for decode-and-forward relay network via game *** uncertainty of channel gain is considered to overcome the performance degradation in practical environment. ...
详细信息
ISBN:
(纸本)9781467374439
In this paper, a robust optimization problem is formulated for decode-and-forward relay network via game *** uncertainty of channel gain is considered to overcome the performance degradation in practical environment. In this study,a probability threshold method is used to suppress the channel fluctuation. Besides, a seller-buyer game is formulated to jointly consider the maximum utility of source node and relay node. To reduce the overhead information exchanging, a distributed iteration algorithm is applied. Numerical results show the effectiveness of the proposed schemes, and also present the robustness of the relay network. Moreover, the proposed game is proved to converge to the unique equilibrium point.
Interference coordination between high-power macros and low-power picos deeply impacts the performance of heterogeneous networks (HetNets). It should deal with three challenges: user association with macros and picos,...
详细信息
ISBN:
(纸本)9781479935130
Interference coordination between high-power macros and low-power picos deeply impacts the performance of heterogeneous networks (HetNets). It should deal with three challenges: user association with macros and picos, the amount of almost blank subframe (ABS) that macros should reserve for picos, and resource block (RB) allocation strategy in each eNB. We formulate the three issues jointly for sum weighted logarithmic utility maximization while maintaining proportional fairness of users. A class of distributed algorithms are developed to solve the joint optimization problem. Our framework can be deployed for enhanced inter-cell interference coordination (eICIC) in existing LTE-A protocols. Extensive evaluation are performed to verify the effectiveness of our algorithms.
A critical aspect of wireless sensor networks is network lifetime. Power-constrained wireless sensor networks are usable as long as they can communicate sensed data to the base station. Multi-hop data gathering consum...
详细信息
ISBN:
(纸本)9781538668092;9781538668085
A critical aspect of wireless sensor networks is network lifetime. Power-constrained wireless sensor networks are usable as long as they can communicate sensed data to the base station. Multi-hop data gathering consumes increased energy, especially for data-intensive applications. In this paper we propose a UAV-enabled data gathering mechanism for wireless sensor networks which prolongs network lifetime compared to a traditional data gathering mechanism. Some of the aspects that we address are UAV path planning, scheduled and opportunistic data gathering, and integration of the data gathering with a node scheduling mechanism. Simulations using ns3 show that our algorithm is more efficient in terms of energy consumed and packet delivery ratio compared to traditional data gathering.
The main idea in CSCW is that an application involvesmulti-person work as a group. They may lie in differentsites which are connected via network. When theapplication asks a real-time cooperation, an underlyingscheme ...
详细信息
ISBN:
(纸本)0780379411
The main idea in CSCW is that an application involvesmulti-person work as a group. They may lie in differentsites which are connected via network. When theapplication asks a real-time cooperation, an underlyingscheme should perform the necessary synchronization toensure the application semantics. We present adistributed algorithm which generates a share treecovering all group members. Each member only knows itslocal routing information. By the exchange of messagebetween members, the spanning tree is establishedcooperatively. When the transmit delay is not the crucialmetric for the application and each member have equalprobability to send data, the resulting overlay generatedby our method is optimal.
In this paper we consider the problem of transmitting packets through multiple unicast sessions when inter-session linear network coding is permitted. We propose and formulate two new capacity regions for this problem...
详细信息
ISBN:
(纸本)9789639799127
In this paper we consider the problem of transmitting packets through multiple unicast sessions when inter-session linear network coding is permitted. We propose and formulate two new capacity regions for this problem. distributed rate allocation algorithms and coding schemes are also provided for these capacity regions. The two capacity regions are compared with other known capacity regions in the literature to represent their benefits in terms of throughput, fairness, complexity, and ease of implementation.
In this paper,the design of adaptive FIR digital filter is studied and a novel implementations of adaptive FIR filter based on multiplier-free structure is *** implementation scheme based on the distributed algorithm ...
详细信息
In this paper,the design of adaptive FIR digital filter is studied and a novel implementations of adaptive FIR filter based on multiplier-free structure is *** implementation scheme based on the distributed algorithm uses access to a range of look-up table(LUT)to replace the traditional method of multiply-accumulate *** update of the adaptive filter weights is based on the quantization error least mean square algorithm(QE-LMS).To reduce the time,the update process of the LUT which stored filter weights is realized by a novel LUT update using a matched auxiliary *** filter is described with VHDL,and realized on Cyclone series *** system simulation and timing analysis show that the proposed method can implement FIR filters with the smaller resource usage and higher speed
When a sensor network is deployed for monitoring a protected region, topology control is usually used to save energy consumption, especially in a dense deployment. In this paper, we propose a new and simple topology c...
详细信息
ISBN:
(纸本)9781595937575
When a sensor network is deployed for monitoring a protected region, topology control is usually used to save energy consumption, especially in a dense deployment. In this paper, we propose a new and simple topology control protocol, Convergent SparseDT, which controls the network density pretty well, and disposes of some important faults of classical topology control protocols while working with dense sensor network. It is a compromise between the energy consumption, network congestion and the area coverage. It guarantees the coverage of most of the monitored area with almost negligible communication and computing overhead. The performance of this protocol is thoroughly analyzed and simulated in NS2 simulator.
We consider the problem of gossiping when dynamic node crashes are controlled by adaptive adversaries. We develop gossiping algorithms which are efficient with respect to both the time and communication measured as th...
详细信息
ISBN:
(纸本)9781581135299
We consider the problem of gossiping when dynamic node crashes are controlled by adaptive adversaries. We develop gossiping algorithms which are efficient with respect to both the time and communication measured as the number of point-to-point messages. If the adversary is allowed to fail up to $t$ nodes, among the total of $n$, where additionally $n-t=\Omega(n/\textpolylog n)$, then one among our algorithms completes gossiping in time $\cO(\log^2 t)$ and with $\cO(n\text polylog t)$ messages. We prove a lower bound which states that the time has to be at least $\Omega\Big(\frac\log n\log(n\log n)-\log t\Big)$ if the communication is restricted to be $\cO(n\text polylog n)$.We also show that one can solve efficiently a more demanding consensus problem with crash failures by resorting to one of our gossiping algorithms. If the adversary is allowed to fail $t$ nodes, where $n-t=\Omega(n/\textpolylog n)$, we obtain a time-optimal solution that is away from the communication optimality by at most a polylogarithmic factor.
This paper studies the distributed computation of a linear matrix equation in the form of i=1 Ai X Bi =i=1 Ci,over multi-agent networks from an optimization perspective, with some nonsmooth requirements of the optimiz...
详细信息
This paper studies the distributed computation of a linear matrix equation in the form of i=1 Ai X Bi =i=1 Ci,over multi-agent networks from an optimization perspective, with some nonsmooth requirements of the optimization variable X at the same time. In this multi-agent network, agent i can only get access to Ai, Bi, Ci and communicate with its ***, a distributed continuous-time algorithm, from a distributed constrained optimization viewpoint, is proposed to obtain the solution with balance between its least squares bias and requirements of the nonsmooth convex function, where the saddle point method and derivative feedback technique are employed to deal with complicated problem. With help of the Lyapunov stability and semi-stability analysis, we prove the convergence of the algorithm for any initial condition.
Traditionally,Dynamic Spectrum Management (DSM) is an effective method for mitigating crosstalk and improving the data rate in multi-user DSL *** for efficient energy consumption is discussed in this ***,we propose ...
详细信息
Traditionally,Dynamic Spectrum Management (DSM) is an effective method for mitigating crosstalk and improving the data rate in multi-user DSL *** for efficient energy consumption is discussed in this ***,we propose a novel DSM model of maximizing data rate object by adding a constraint factor on all allocated power to the traditional DSM formulation,and then provide a distributed feasibility algorithm for solving this *** results show that the consumed power can be reduced by higher percentage with just smaller sacrifice of data rate in VDSL ***,this sacrifice is smaller especially in higher crosstalk environment.
暂无评论