共查询到19条相似文献,搜索用时 421 毫秒
1.
2.
在Ad Hoc网络中传输多媒体数据会受到网络拓扑变化和无线信道干扰的限制.多流实时传输协议MRTP(multi-flow real-time transport protocol)是一种可以分配和传输多个视频数据流的新协议.它结合多描述编码和多径传输,能提高无线对等网络上视频传输的效率和质量. 相似文献
3.
在Ad Hoc网络中传输多媒体数据会受到网络拓扑变化和无线信道干扰的限制。多流实时传输协议MRTP(multi—flow real—time transport protocol)是一种可以分配和传输多个视频数据流的新协议。它结合多描述编码和多径传输。能提高无线对等网络上视频传输的效率和质量。 相似文献
4.
5.
6.
近年来机会路由和网络编码是两种利用无线信道广播特性提高网络性能的新兴技术。相比传统的静态路由决策,机会路由利用动态和机会路由选择减轻无线有损链路带来的影响。网络编码可以提高网络的资源利用率。但编码机会依赖于多个并发流所选路径的相对结构。为了创造更多的网络编码机会和提高网络吞吐量,本文提出了一种基于流间网络编码的机会路由(ORNC)算法。在ORNC中,每个分组转发的机会路径选择是基于网络编码感知的方式进行的。当没有编码机会时,采用背压策略选择下一跳转发路径以平衡网络负载。仿真结果表明本文提出的ORNC算法能够提高无线多跳网络的吞吐量。 相似文献
7.
8.
研究表明基于无线信道的广播特性,网络编码技术能够显著降低多播通信中的传输时延。多源多播模型中,在任一源节点已知其他源节点信息的条件下,现有传输方案能够确保系统时延最小化。本文在其他源节点信息未知时,对现有多源多目的单中继模型应用网络编码后的时延性能进行分析,并将该模型推广到多中继模型,提出了基于网络编码和机会中继选择策略的MR-OPP-NC方案,并在译码转发机制下,利用中断概率量化了应用网络编码前后的时延性能,仿真表明本文所提MR-OPP-NC方案与未使用网络编码的机会中继方案相比较,能获得显著的时延增益。 相似文献
9.
在无线Mesh网络中使用多信道可以减少碰撞和干扰,提高系统吞吐量.本文先介绍无线Mesh网络,然后介绍多信道在无线Mesh网络中的应用,分析了几种常用的多信道MAC协议.接着着重阐述了多信道无线Mesh网络所面临的问题与挑战,对信道分配、路由选择和隐蔽终端这3个主要问题进行分析,并对其研究设计方向进行了展望. 相似文献
10.
在无线Mesh网络中使用多信道可以减少碰撞和干扰,提高系统吞吐量。本文先介绍无线Mesh网络,然后介绍多信道在无线Mesh网络中的应用,分析了几种常用的多信道MAC协议。接着着重阐述了多信道无线Mesh网络所面临的问题与挑战,对信道分配、路由选择和隐蔽终端这3个主要问题进行分析,并对其研究设计方向进行了展望。 相似文献
11.
该文针对D2D无线网络中多终端并发协作重传冲突避免问题,提出一种基于立即可解网络编码的时延最小化重传方案。在重传阶段,充分利用D2D无线网络终端协作传输数据的优势,结合各终端数据包接收状态,综合考虑时延的影响因素,选取单次重传时延增量较小的数据包生成编码包,最小化重传时延。同时,构建终端冲突图,在图中搜索极大独立集,根据各终端的编码包权重值,选择最大加权独立集中的终端作为并发协作重传终端,从而降低重传次数。仿真结果表明,所提方案能够进一步改善D2D无线网络的重传效率。 相似文献
12.
Hang Su Xi Zhang 《Selected Areas in Communications, IEEE Journal on》2009,27(5):593-605
In this paper, we model the network throughput gains of two types of wireless network coding (NC) schemes, including the conventional NC and the analog NC schemes, over the traditional non-NC transmission scheduling schemes in multihop, multi-channel, and multi-radio wireless ad hoc networks. In particular, we first show that the network throughput gains of the conventional NC and analog NC are (2n)/(2n-1) and n/(n-1), respectively, for the n-way relay networks where n ges 2. Second, we propose an analytical framework for deriving the network throughput gain of the wireless NC schemes over general wireless network topologies. By solving the problem of maximizing the network throughput subject to the fairness requirements under our proposed framework, we quantitatively analyze the network throughput gains of these two types of wireless NC schemes for a variety of wireless ad hoc network topologies with different routing strategies. Finally, we develop a heuristic joint link scheduling, channel assignment, and routing algorithm that aims at approaching the optimal solution to the optimization problem under our proposed framework. 相似文献
13.
Guoqiang Mao 《Mobile Networks and Applications》2011,16(1):46-57
In this paper, the maximum end-to-end throughput that can be achieved on a wireless multi-hop path is investigated analytically.
The problem is modeled using the conflict graph, where each link in the multi-hop path is represented uniquely by a vertex
in the conflict graph and two vertices are adjacent if and only if the associated links mutually interfere. Using the conflict
graph and the linear programming formulations of the problem, we analyzed the maximum end-to-end throughput of a wireless
multi-hop path a) in a simple scenario where nodes are optimally placed and each node can only interfere with the transmission
of its adjacent nodes along the path, and b) in a more complicated scenario where nodes are randomly placed and each node
can interfere with the transmission of any number of nearby nodes along the path in both a) an error free radio environment
and b) an erroneous radio environment. The maximum end-to-end throughputs for each of the above four scenarios are obtained
analytically. We show that the maximum achievable end-to-end throughput is determined by the throughput of its bottleneck
clique, where a clique is a maximal set of mutually adjacent vertices in the associated conflict graph. Further our analysis
suggests the optimum scheduling algorithm that can be used to achieve the maximum end-to-end throughput and that it is convenient
to use the (maximal) independent sets as the basic blocks for the design of scheduling algorithms. The findings in this paper
lay guidelines for the design of optimum scheduling algorithms. They can be used to design computationally efficient algorithms
to determine the maximum throughput of a wireless multi-hop path and to design a scheduling algorithm to achieve that throughput. 相似文献
14.
Throughput limitation of wireless networks imposes many practical problems as a result of wireless media broadcast nature. The solutions of the problem are mainly categorized in two groups; the use of multiple orthogonal channels and network coding (NC). The networks with multiple orthogonal channels and possibly multiple interfaces can mitigate co-channel interference among nodes. However, efficient assignment of channels to the available network interfaces is a major problem for network designers. Existing heuristic and theoretical work unanimously focused on joint design of channel assignment with the conventional transport/IP/MAC architecture. Furthermore, NC has been a prominent approach to improve the throughput of unicast traffic in wireless multi-hop networks through opportunistic NC. In this paper we seek a collaboration scheme for NC in multi-channel/interface wireless networks, i.e., the integration of NC, routing and channel assignment problem. First, we extend the NC for multiple unicast sessions to involve both COPE-type and a new proposed scheme named as Star-NC. Then, we propose an analytical framework that jointly optimizes the problem of routing, channel assignment and NC. Our theoretical formulation via a linear programming provides a method for finding source–destination routes and utilizing the best choices of different NC schemes to maximize the aggregate throughput. Through this LP, we propose a novel channel assignment algorithm that is aware of both coding opportunities and co-channel interference. Finally, we evaluate our model for various networks, traffic models, routing and coding strategies over coding-oblivious routing. 相似文献
15.
Guaranteeing quality of service over a multihop wireless network is difficult because end‐to‐end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section‐based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay‐ and energy‐efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay. 相似文献
16.
Network coding (NC) is a technique that allows intermediate nodes to combine the received packets from multiple links and forwarded to subsequent nodes. Compared with pure relaying, using NC in a wireless network, one can potentially improve the network throughput, but it increases the complexity of resource allocations as the quality of one transmission is often affected by the transmission conditions of multiple links. In this paper, we consider an ad hoc network, where all the links have bidirectional communications, and a relay node forwards traffic between the source and the destination nodes using NC. All transmissions share the same frequency channel, and simultaneous transmissions cause interference to each other. We consider both digital NC and analog NC strategies, referred to as DNC and ANC, respectively, and schedule transmission time and power of the nodes in order to maximize the overall network throughput. For DNC, an optimum scheduling is formulated and solved by assuming that a central controller is available to collect all the link gain information and make the scheduling decisions. Distributed scheduling schemes are proposed for networks using DNC and ANC. Our results indicate that the proposed scheduling scheme for DNC achieves higher throughput than pure relaying, and the scheduling scheme for ANC can achieve higher throughput than both DNC and pure relaying under certain conditions. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
17.
The multihop configuration of a large-scale wireless sensor network enables multiple simultaneous transmissions without interference within the network. Existing time division multiple access (TDMA) scheduling schemes exploit gain based on the assumption that the path is optimally determined by a routing protocol. In contrast, our scheme jointly considers routing and scheduling and introduces several new concepts. We model a large-scale wireless sensor network as a tiered graph relative to its distance from the sink, and introduce the notion of relay graph and relay factor to direct the next-hop candidates toward the sink fairly and efficiently. The sink develops a transmission and reception schedule for the sensor nodes based on the tiered graph search for a set of nodes that can simultaneously transmit and receive. The resulting schedule eventually allows data from each sensor node to be delivered to the sink. We analyze our scheduling algorithm both numerically and by simulation, and we discuss the impact of protocol parameters. Further, we prove that our scheme is scalable to the number of nodes, from the perspectives of mean channel capacity and maximum number of concurrent transmission nodes. Compared with the existing TDMA scheduling schemes, our scheme shows better performance in network throughput, path length, end-to-end delay, and fairness index. 相似文献
18.
This paper presents a distributed and localized interference‐aware channel assignment framework for multi‐radio wireless mesh networks in a cognitive network environment. The availability of multiple interfaces and channels in wireless devices is expected to enhance network throughput in wireless mesh networks. A notable design issue in such networks is how to dynamically assign available channels to multiple radio interfaces for maximizing effective network throughput by minimizing interference. The proposed framework uses a novel interference estimation method by utilizing distributed conflict graphs on a per‐interface basis. Presented results obtained via simulation studies in 802.11 based multi‐radio mesh networks indicate that for both homogeneous and heterogeneous primary networks, the proposed protocol can facilitate a large increase in network throughput in comparison with a Common Channel Assignment mechanism that is used as a benchmark in the literature. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
19.
《Networking, IEEE/ACM Transactions on》2008,16(5):1147-1160