Description: 随着无线mesh网络的普及，其规模和复杂程度持续发展。然而多跳的mesh网络遇到越来越多的难题，比如带宽降低，无线干扰以及网络时延等。譬如，在网络中的每一跳吞吐量会下降多达50％，连续多跳情况下吞吐量下降得更迅速，其结果将导致网络性能的严重降低。在语音和视频应用大量运行的极端情况下，时延和RF干扰将达到不可接受的程度，而导致连接完全中断-wireless mesh network with the popularity of its size and complexity of sustainable development. However, multi-hop mesh networks encountered more and more problems, such as lower bandwidth, wireless interference and network delay, and so on. For example, in each of the network throughput would drop jump up to 50%, for a number of cases jumped more rapid decline in throughput, The results will lead to serious network performance lower. In voice and video applications running of a large number of extreme cases, delay and RF interference will reach an unacceptable level. which led to the link severed Platform: |
Size: 208896 |
Author:wolfguy |
Hits:
Description: 随着无线mesh网络的普及，其规模和复杂程度持续发展。然而多跳的mesh网络遇到越来越多的难题，比如带宽降低，无线干扰以及网络时延等。譬如，在网络中的每一跳吞吐量会下降多达50％，连续多跳情况下吞吐量下降得更迅速，其结果将导致网络性能的严重降低。在语音和视频应用大量运行的极端情况下，时延和RF干扰将达到不可接受的程度，而导致连接完全中断-wireless mesh network with the popularity of its size and complexity of sustainable development. However, multi-hop mesh networks encountered more and more problems, such as lower bandwidth, wireless interference and network delay, and so on. For example, in each of the network throughput would drop jump up to 50%, for a number of cases jumped more rapid decline in throughput, The results will lead to serious network performance lower. In voice and video applications running of a large number of extreme cases, delay and RF interference will reach an unacceptable level. which led to the link severed Platform: |
Size: 225280 |
Author:wolfguy |
Hits:
Description: (书)现代通信系统使用MATLAB第一章-ALLIANCES is a recently proposed cooperative random access
protocol for wireless networks. In this paper we modify the
original model to include user location information. We also
derive pair-wise error probability (PEP) under Rayleigh flat
fading channel and a power-law attenuation environment.
Based on the PEP analysis we propose an optimal relay
selection scheme, which achieves significant throughput gains as
compared to the random relay selection scheme in the original
ALLIANCES. Platform: |
Size: 8192 |
Author:史志举 |
Hits:
Description: (书)现代通信系统使用MATLAB第二章-ALLIANCES is a recently proposed cooperative random access
protocol for wireless networks. In this paper we modify the
original model to include user location information. We also
derive pair-wise error probability (PEP) under Rayleigh flat
fading channel and a power-law attenuation environment.
Based on the PEP analysis we propose an optimal relay
selection scheme, which achieves significant throughput gains as
compared to the random relay selection scheme in the original
ALLIANCES. Platform: |
Size: 6144 |
Author:史志举 |
Hits:
Description: (书)现代通信系统使用MATLAB第三章-ALLIANCES is a recently proposed cooperative random access
protocol for wireless networks. In this paper we modify the
original model to include user location information. We also
derive pair-wise error probability (PEP) under Rayleigh flat
fading channel and a power-law attenuation environment.
Based on the PEP analysis we propose an optimal relay
selection scheme, which achieves significant throughput gains as
compared to the random relay selection scheme in the original
ALLIANCES. Platform: |
Size: 20480 |
Author:史志举 |
Hits:
Description: (书)现代通信系统使用MATLAB第四章-ALLIANCES is a recently proposed cooperative random access
protocol for wireless networks. In this paper we modify the
original model to include user location information. We also
derive pair-wise error probability (PEP) under Rayleigh flat
fading channel and a power-law attenuation environment.
Based on the PEP analysis we propose an optimal relay
selection scheme, which achieves significant throughput gains as
compared to the random relay selection scheme in the original
ALLIANCES. Platform: |
Size: 10240 |
Author:史志举 |
Hits:
Description: LDPC码在AWGN信道下的译码程序（c语言）-ALLIANCES is a recently proposed cooperative random access
protocol for wireless networks. In this paper we modify the
original model to include user location information. We also
derive pair-wise error probability (PEP) under Rayleigh flat
fading channel and a power-law attenuation environment.
Based on the PEP analysis we propose an optimal relay
selection scheme, which achieves significant throughput gains as
compared to the random relay selection scheme in the original
ALLIANCES. Platform: |
Size: 7168 |
Author:史志举 |
Hits:
Description: matlab实现16QAM调制解调 matlab实现16QAM调制解调-ALLIANCES is a recently proposed cooperative random access
protocol for wireless networks. In this paper we modify the
original model to include user location information. We also
derive pair-wise error probability (PEP) under Rayleigh flat
fading channel and a power-law attenuation environment.
Based on the PEP analysis we propose an optimal relay
selection scheme, which achieves significant throughput gains as
compared to the random relay selection scheme in the original
ALLIANCES. Platform: |
Size: 1024 |
Author:史志举 |
Hits:
Description: Improving the Performance of wireless Mobile Ad-hoc Networks through Cross Layer Optimization using TCP-ATCP-DSR-802.11/CFPSM" we mainly consider the issues of power saving by replacing 802.11b standard MAC with CFPSM protocol and enhancing the throughput by inserting the Ad-hoc TCP layer between TCP and DSR layers. We have used OPNET simulator for this project. Platform: |
Size: 78848 |
Author:satya |
Hits:
Description: Relaying and orthogonal frequency division multiple
access (OFDMA) are the accepted technologies for emerging
wireless communications standards. The activities in many
wireless standardization bodies and forums, for example IEEE
802.16 j/m and LTE-Advanced, attest to this fact. The availability
or lack thereof of efficient radio resource management (RRM)
could make or mar the opportunities in these networks. This
paper therefore provides a comprehensive RRM algorithm for
OFDMA-based multi-cellular fixed relay networks in a way to
ensure fairness among users with minimal impact on the network
throughput (in contrast, pure opportunistic RRM techniques
always favor users with good channel conditions Platform: |
Size: 88064 |
Author:kumar |
Hits:
Description: Relaying and orthogonal frequency division multiple
access (OFDMA) are the accepted technologies for emerging
wireless communications standards. The activities in many
wireless standardization bodies and forums, for example IEEE
802.16 j/m and LTE-Advanced, attest to this fact. The availability
or lack thereof of efficient radio resource management (RRM)
could make or mar the opportunities in these networks. This
paper therefore provides a comprehensive RRM algorithm for
OFDMA-based multi-cellular fixed relay networks in a way to
ensure fairness among users with minimal impact on the network
throughput (in contrast, pure opportunistic RRM techniques
always favor users with good channel conditions Platform: |
Size: 116736 |
Author:kumar |
Hits:
Description:
In today’s most of the Adhoc networks needs the reliable connection to transfer the data. Most number of
data packets loss is experienced in the Adhoc networks due to Transfer control protocol(TCP)’s high channel
error rate and link failure. To improve TCP performance in Adhoc networks a number of schemes have been
proposed, where Adhoc networks use the multi-hop wireless connectivity, where the network has quickly
changing network topology. ELFN (Explicit Link Failure Notification) is one mechanism to manage link
failures with dynamic cache update scheme to improve the TCP performance considerably. In this paper, we
propose a mechanism which significantly increases the throughput of TCP’s performance with ELFN based
Dynamic cache update scheme using Dynamic source routing protocol. Our simulation results using ns-2
simulator, mentions that our scheme can handle link failures in effective way, and improves TCP’s
performance considerably -
In today’s most of the Adhoc networks needs the reliable connection to transfer the data. Most number of
data packets loss is experienced in the Adhoc networks due to Transfer control protocol(TCP)’s high channel
error rate and link failure. To improve TCP performance in Adhoc networks a number of schemes have been
proposed, where Adhoc networks use the multi-hop wireless connectivity, where the network has quickly
changing network topology. ELFN (Explicit Link Failure Notification) is one mechanism to manage link
failures with dynamic cache update scheme to improve the TCP performance considerably. In this paper, we
propose a mechanism which significantly increases the throughput of TCP’s performance with ELFN based
Dynamic cache update scheme using Dynamic source routing protocol. Our simulation results using ns-2
simulator, mentions that our scheme can handle link failures in effective way, and improves TCP’s
performance considerably Platform: |
Size: 556032 |
Author:payal |
Hits:
Description: We address the problem of downlink multiuser
scheduling in practical wireless networks under a desired fairness
constraint. Wireless networks such as LTE, WiMAX and WiFi
provide partial channel knowledge at the base station/access point
by means of quantized user equipment feedback. Platform: |
Size: 223232 |
Author:gau |
Hits:
Description: We compare the energy efficiency of some transmission
schemes in wireless sensor networks. By constraining
the system to end-to-end throughput requirements, we assume
that the nodes in multi-hop and cooperative schemes operate
at a spectral efficiency which is twice that of the single-hop
transmission. By taking into account the energy consumption of
the RF circuitry, we show that cooperation may be considerably
more energy efficient than non-cooperative schemes even in small
transmission ranges, specially if a feedback channel is available. Platform: |
Size: 600064 |
Author:Deepesh |
Hits:
Description: Opportunistic routing is an emerging technology that takes advantage of the broadcast nature of wireless networks. In opportunistic networks, mobile nodes communicate even if a connecting route doesn’t exist. In Traditional routing protocols fixed routes are selected for transmission and packets are forwarded for each hop. In dynamic wireless environment, transmission failures occur frequently due to path breaks and demands retransmissions. This unreliable transmission causes additional traffic in the network and waste of network resources and bandwidth. Opportunistic routing promises to be an efficient routing protocol to improve the performance of wireless networks providing increased network throughput and transmission reliability. This paper discusses the concept behind opportunistic routing, its classification, metrics used, and efficiency of these protocols. Platform: |
Size: 61440 |
Author:rathi |
Hits:
Description: This thesis presents a scheme for scheduling of wireless adhoc networks by using directional antennas using the concept of frequency reuse. The idea of wireless adhoc network communication is taken one step further by adding directional antennas for both wider coverage and can also be used for maximizing the throughput by using the concept of frequency reuse.
This system can be applied to any adhoc network and can be scaled for dense networks. Most wireless adhoc networks use the same channel and try to send information by using an old protocol of CSMA/CA. Throughput remains a major hindrance in the case of adhoc networks which have to compete for the same channel. Platform: |
Size: 693248 |
Author:fahim68 |
Hits:
Description: The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can’t be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust based solutions have proved to be more effective to address nodes’ misbehavior attacks. Apart isolating misbehaving nodes, the existing trust based schemes lacks the capability to minimize link failure notifications due to transient transmission disruption which consequently give rise to frequent route breakages thereby undermining throughput and route stability. Moreover, the existing solutions give rise to high energy consumption and control overhead in pursuit of trust estimation and network-wide dissemination which not only adds to network congestion but also undermines network lifetime. In this paper, we present a Trust and Energy aware Routing Protocol (TERP) that -The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can’t be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust based solutions have proved to be more effective to address nodes’ misbehavior attacks. Apart isolating misbehaving nodes, the existing trust based schemes lacks the capability to minimize link failure notifications due to transient transmission disruption which consequently give rise to frequent route breakages thereby undermining throughput and route stability. Moreover, the existing solutions give rise to high energy consumption and control overhead in pursuit of trust estimation and network-wide dissemination which not only adds to network congestion but also undermines network lifetime. In this paper, we present a Trust and Energy aware Routing Protocol (TERP) that Platform: |
Size: 1024 |
Author:Dharmesh |
Hits:
Description: 分析延迟/ns2/可以用在在多个节点间无线网络的仿真，分析延迟、吞吐量、丢包率(Analysis of delay /ns2/ can be used in the simulation of wireless networks between multiple nodes, analyzing delay, throughput, packet loss rate) Platform: |
Size: 1024 |
Author:wangdong
|
Hits:
Description: Intelligent reflecting surface (IRS) is a promising
technology to enhance the coverage and performance of wireless
networks. We consider the application of IRS to non-orthogonal
multiple access (NOMA), where a base station transmits superposed signals to multiple users by the virtue of an IRS. The
performance of an IRS-assisted NOMA networks with imperfect
successive interference cancellation (ipSIC) and perfect successive
interference cancellation (pSIC) is investigated by invoking 1-
bit coding scheme. In particular, we derive new exact and
asymptotic expressions for both outage probability and ergodic
rate of the m-th user with ipSIC/pSIC. Based on analytical
results, the diversity order of the m-th user with pSIC is in
connection with the number of reflecting elements and channel
ordering. The high signal-to-noise radio (SNR) slope of ergodic
rate for the m-th user is obtained. The throughput and energy
efficiency of IRS-NOMA networks are discussed both in delaylimited and delay-tolerant transmission modes. Additionally, we
derive new exact expressions of outage probability and ergodic
rate for IRS-assisted orthogonal multiple access (IRS-OMA).
Numerical results are presented to substantiate our analyses and
demonstrate that: i) The outage behaviors of IRS-NOMA are
superior to that of IRS-OMA and relaying schemes; ii) The M-th
user has a larger ergodic rate than IRS-OMA and benchmarks.
However, the ergodic performance of the m-th user exceeds
relaying schemes in the low SNR regime; and iii) The IRS-assisted
NOMA networks have ability to achieve the enhanced energy
efficiency compared to conventional cooperative communications Platform: |
Size: 340469 |
Author:dipfr@yahoo.fr |
Hits:
Search - throughput in wireless networks