Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188039
A. Safwat, H. Hassanein, H. Mouftah
The intricate problem of energy conservation in wireless ad hoc networks is of great significance due to the limited battery capacity of the participating mobile devices. However, the simulation studies carried out for table-driven, on-demand, and cluster-based ad hoc routing protocols fall short of examining essential power-based performance metrics, such as average node and network lifetime, energy-based protocol fairness, average dissipated energy per protocol, and standard deviation of the energy dissipated by each individual node. In this paper, we present a thorough energy-based performance study of power-aware routing schemes for wireless mobile ad hoc networks. Our energy consumption model is based on a detailed implementation of the IEEE 802.11 physical layer convergence protocol (PLCP) and medium access control (MAC) sublayers. To our best knowledge, this is the first such detailed performance study. Some implications for power-efficient protocol design In ad hoc wireless networks are also discussed.
{"title":"A MAC-based performance study of energy-aware routing schemes in wireless ad hoc networks","authors":"A. Safwat, H. Hassanein, H. Mouftah","doi":"10.1109/GLOCOM.2002.1188039","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188039","url":null,"abstract":"The intricate problem of energy conservation in wireless ad hoc networks is of great significance due to the limited battery capacity of the participating mobile devices. However, the simulation studies carried out for table-driven, on-demand, and cluster-based ad hoc routing protocols fall short of examining essential power-based performance metrics, such as average node and network lifetime, energy-based protocol fairness, average dissipated energy per protocol, and standard deviation of the energy dissipated by each individual node. In this paper, we present a thorough energy-based performance study of power-aware routing schemes for wireless mobile ad hoc networks. Our energy consumption model is based on a detailed implementation of the IEEE 802.11 physical layer convergence protocol (PLCP) and medium access control (MAC) sublayers. To our best knowledge, this is the first such detailed performance study. Some implications for power-efficient protocol design In ad hoc wireless networks are also discussed.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124193744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188399
Jungwon Lee, R. Sonalkar, J. Cioffi
This paper investigates the multiuser bit and power allocation problem in discrete multi-tone digital subscriber line modems. A spectrum-management center with knowledge of direct and crosstalk-coupled channel gains allocates the bits and the available power to the subchannels for all users in a common binder. The center uses a multiuser discrete bit-loading algorithm that attempts to minimize the total transmit power given a target sum-rate. This algorithm extends the greedy algorithm for the single-user channel to the multi-user channel. Simulation results for the upstream transmission in very high-speed digital subscriber line show that the total power can be reduced using the multi-user discrete bit-loading algorithm instead of applying. the single-user greedy algorithm iteratively.
{"title":"Multi-user discrete bit-loading for DMT-based DSL systems","authors":"Jungwon Lee, R. Sonalkar, J. Cioffi","doi":"10.1109/GLOCOM.2002.1188399","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188399","url":null,"abstract":"This paper investigates the multiuser bit and power allocation problem in discrete multi-tone digital subscriber line modems. A spectrum-management center with knowledge of direct and crosstalk-coupled channel gains allocates the bits and the available power to the subchannels for all users in a common binder. The center uses a multiuser discrete bit-loading algorithm that attempts to minimize the total transmit power given a target sum-rate. This algorithm extends the greedy algorithm for the single-user channel to the multi-user channel. Simulation results for the upstream transmission in very high-speed digital subscriber line show that the total power can be reduced using the multi-user discrete bit-loading algorithm instead of applying. the single-user greedy algorithm iteratively.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121442001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188431
M. Chiani, M. Win, A. Zanella, J. Winters
In this paper, we derive an exact expression for the symbol error probability (SEP) for coherent detection of M-ary PSK signals using array of antennas with optimum combining in a Rayleigh fading environment. The proposed analytical framework is based on the theory of orthogonal polynomials and we give an effective technique to derive the SEP involving only one integral with finite integration limits. The result is general and valid for an arbitrary number of receiving antennas or co-channel interferers.
{"title":"Efficient evaluation of exact error probability for optimum combining of M-ary PSK signals","authors":"M. Chiani, M. Win, A. Zanella, J. Winters","doi":"10.1109/GLOCOM.2002.1188431","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188431","url":null,"abstract":"In this paper, we derive an exact expression for the symbol error probability (SEP) for coherent detection of M-ary PSK signals using array of antennas with optimum combining in a Rayleigh fading environment. The proposed analytical framework is based on the theory of orthogonal polynomials and we give an effective technique to derive the SEP involving only one integral with finite integration limits. The result is general and valid for an arbitrary number of receiving antennas or co-channel interferers.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114697637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1189137
Xiaowen Chu, Bo Li, K. Sohraby, Zhensheng Zhang
Existing research demonstrates that an effective routing and wavelength assignment (RWA) strategy and a proper wavelength converter placement algorithm are the two primary vehicles for improving the blocking performance of wavelength-routed network. However, these two issues have largely been investigated, separately in that the existing RWA algorithms seldom consider the presence of wavelength conversion. We argue in this paper that any RWA algorithm needs to take into account the underlying wavelength conversion for two reasons: (1) wavelength converter placement is usually done at a much earlier stage during capacity planning; and (2) one of the key advantages of an all-optical network is its reconfigurability in that the network topology can be changed through routing and wavelength assignment. We propose a weighted least-congestion routing and first-fit wavelength assignment (WLCR-FF) RWA algorithm in conjunction with a heuristic wavelength converter placement algorithm called minimum blocking probability first (MBPF) that considers both the distribution of free wavelengths and the lengths of each route jointly. Using both analysis and simulation, we carry out extensive studies to compare the performance of the proposed algorithms over a variety of topologies. The results demonstrate that the proposed WLCR-FF algorithm can achieve much better blocking performance than static routing, fixed-alternate routing and least-loaded routing algorithms, in the environment of sparse or/and full wavelength conversion.
{"title":"Routing and wavelength assignment issues in the presence of wavelength conversion for all-optical networks","authors":"Xiaowen Chu, Bo Li, K. Sohraby, Zhensheng Zhang","doi":"10.1109/GLOCOM.2002.1189137","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189137","url":null,"abstract":"Existing research demonstrates that an effective routing and wavelength assignment (RWA) strategy and a proper wavelength converter placement algorithm are the two primary vehicles for improving the blocking performance of wavelength-routed network. However, these two issues have largely been investigated, separately in that the existing RWA algorithms seldom consider the presence of wavelength conversion. We argue in this paper that any RWA algorithm needs to take into account the underlying wavelength conversion for two reasons: (1) wavelength converter placement is usually done at a much earlier stage during capacity planning; and (2) one of the key advantages of an all-optical network is its reconfigurability in that the network topology can be changed through routing and wavelength assignment. We propose a weighted least-congestion routing and first-fit wavelength assignment (WLCR-FF) RWA algorithm in conjunction with a heuristic wavelength converter placement algorithm called minimum blocking probability first (MBPF) that considers both the distribution of free wavelengths and the lengths of each route jointly. Using both analysis and simulation, we carry out extensive studies to compare the performance of the proposed algorithms over a variety of topologies. The results demonstrate that the proposed WLCR-FF algorithm can achieve much better blocking performance than static routing, fixed-alternate routing and least-loaded routing algorithms, in the environment of sparse or/and full wavelength conversion.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124521317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1189009
Chen-Hung Chu, C. Weng
Widespread use of the Internet at an explosive pace and progress in the operation and deployment of networks have increased the number of people whose lives are tightly involved with this global medium. In wide area deployment, heavy signaling traffic and the handoff latencies due to mobile IP registration could be high if the distance between the visited network and the home network of a Mobile Node is large. Also, base stations with small cells yield frequent handoffs, and requiring a registration with a distant Home Agent and Corresponding Nodes for each such local handoff increases overheads and further aggravates packet loss. This paper, proposes an approach to allowing Mobile Nodes to use a cascaded tunneling scheme in a mobile IP network, called Pointer Forwarding MIPv6 Mobility Management (PFMIPv6) strategy. This approach reduces the cost of updating distant Home Agent and Corresponding Nodes, which greatly reduces the number of signaling messages in the network Furthermore, the Tunneling Chain of a Mobile Node is determined dynamically with no need for preliminary definitions of static anchors or regions. The results of this work demonstrate that the new strategy yields lower average costs than the MIFv6 method, when MNs move fast, but packets are rarely received.
{"title":"Pointer forwarding MIPv6 mobility management","authors":"Chen-Hung Chu, C. Weng","doi":"10.1109/GLOCOM.2002.1189009","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189009","url":null,"abstract":"Widespread use of the Internet at an explosive pace and progress in the operation and deployment of networks have increased the number of people whose lives are tightly involved with this global medium. In wide area deployment, heavy signaling traffic and the handoff latencies due to mobile IP registration could be high if the distance between the visited network and the home network of a Mobile Node is large. Also, base stations with small cells yield frequent handoffs, and requiring a registration with a distant Home Agent and Corresponding Nodes for each such local handoff increases overheads and further aggravates packet loss. This paper, proposes an approach to allowing Mobile Nodes to use a cascaded tunneling scheme in a mobile IP network, called Pointer Forwarding MIPv6 Mobility Management (PFMIPv6) strategy. This approach reduces the cost of updating distant Home Agent and Corresponding Nodes, which greatly reduces the number of signaling messages in the network Furthermore, the Tunneling Chain of a Mobile Node is determined dynamically with no need for preliminary definitions of static anchors or regions. The results of this work demonstrate that the new strategy yields lower average costs than the MIFv6 method, when MNs move fast, but packets are rarely received.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1189125
Abdur R. B. Billah, Bin Wang, A. Awwal
Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing the number of ADMs, minimizing the number of wavelengths, single hub and multiple hub architectures, switching capabilities, etc. We derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of switching streams across wavelengths. We also study traffic grooming in unswitched UPSRs (unidirectional path-switched rings) and derive a more general lower bound for the number of ADMs required in traffic grooming. This bound reduces to special cases first obtained by E. Modiano and A. Chiu (see IEEE J. of Light-wave Technology, 2000). A cost-effective multi-phase traffic grooming algorithm is proposed and studied for UPSRs. Our numerical results show that this algorithm outperforms existing traffic grooming algorithms, resulting in traffic grooming that uses a lower number of ADMs. Our algorithm in many cases also reaches the general lower bound derived.
许多工作都集中在WDM环网中的流量疏导上。以前的工作考虑了流量梳理的许多方面，包括最小化adm的数量，最小化波长的数量，单集线器和多集线器架构，交换能力等。我们推导了WDM环形网络中波长数的一般和更严格的界限，这些网络可能能够跨波长切换流。我们还研究了未交换upsr(单向路径交换环)中的流量疏导，并推导了流量疏导所需的adm数量的更一般的下界。这一界限减少到由E. Modiano和A. Chiu首先得到的特殊情况(参见IEEE J. of Light-wave Technology, 2000)。提出并研究了一种高性价比的多阶段业务量疏导算法。我们的数值结果表明，该算法优于现有的流量梳理算法，导致使用更少的adm数量的流量梳理。我们的算法在很多情况下也达到了推导出的一般下界。
{"title":"Effective traffic grooming in WDM rings","authors":"Abdur R. B. Billah, Bin Wang, A. Awwal","doi":"10.1109/GLOCOM.2002.1189125","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189125","url":null,"abstract":"Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing the number of ADMs, minimizing the number of wavelengths, single hub and multiple hub architectures, switching capabilities, etc. We derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of switching streams across wavelengths. We also study traffic grooming in unswitched UPSRs (unidirectional path-switched rings) and derive a more general lower bound for the number of ADMs required in traffic grooming. This bound reduces to special cases first obtained by E. Modiano and A. Chiu (see IEEE J. of Light-wave Technology, 2000). A cost-effective multi-phase traffic grooming algorithm is proposed and studied for UPSRs. Our numerical results show that this algorithm outperforms existing traffic grooming algorithms, resulting in traffic grooming that uses a lower number of ADMs. Our algorithm in many cases also reaches the general lower bound derived.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127622408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188517
F. Ono, H. Habuchi
A time hopping modified PSM system using pseudo-noise (PN) codes is proposed. The time hopping modified PSM system uses the several PN codes, and it transmits information by the interval between the successive PN codes. The bit error rate performance and the synchronization performance of the proposed system on the additive white Gaussian noise (AWGN) channel are evaluated by theoretical analysis. As a result, there is the optimum preamble pattern for bringing the probability of block error that takes into account the synchronization performance close to the lower bound. The efficiency of the time hopping modified PSM system is greater than that of the conventional SS-PPM system.
{"title":"Performance of the time hopping modified PSM system on the AWGN channel","authors":"F. Ono, H. Habuchi","doi":"10.1109/GLOCOM.2002.1188517","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188517","url":null,"abstract":"A time hopping modified PSM system using pseudo-noise (PN) codes is proposed. The time hopping modified PSM system uses the several PN codes, and it transmits information by the interval between the successive PN codes. The bit error rate performance and the synchronization performance of the proposed system on the additive white Gaussian noise (AWGN) channel are evaluated by theoretical analysis. As a result, there is the optimum preamble pattern for bringing the probability of block error that takes into account the synchronization performance close to the lower bound. The efficiency of the time hopping modified PSM system is greater than that of the conventional SS-PPM system.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127667529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188993
Pham Manh Lam
The construction of a new symmetric code for use in all-optical code-division multiple-access (CDMA) local-area networks (LANs) is described. The new code, which is derived from prime-sequence code allows to design fully programmable all-optical encoder and decoder suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that the number of codewords of the new code is larger than that of the original prime-sequence code and the 2/sup n/ prime-sequence code of the same length. Therefore, optical CDMA LANs using the new code can have a larger number of potential subscribers. The cross-correlation characteristic of the new code is also investigated and the BER performance of the code is evaluated. It is shown that the performance of the new code is better than that of the prime-sequence code of the same length.
{"title":"Symmetric prime-sequence codes for all-optical code-division multiple-access local-area networks","authors":"Pham Manh Lam","doi":"10.1109/GLOCOM.2002.1188993","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188993","url":null,"abstract":"The construction of a new symmetric code for use in all-optical code-division multiple-access (CDMA) local-area networks (LANs) is described. The new code, which is derived from prime-sequence code allows to design fully programmable all-optical encoder and decoder suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that the number of codewords of the new code is larger than that of the original prime-sequence code and the 2/sup n/ prime-sequence code of the same length. Therefore, optical CDMA LANs using the new code can have a larger number of potential subscribers. The cross-correlation characteristic of the new code is also investigated and the BER performance of the code is evaluated. It is shown that the performance of the new code is better than that of the prime-sequence code of the same length.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126405941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188128
Yi-Lin Li, Yumin Lee
We propose a novel low-complexity multi-user detection algorithm based on tree search for a unified signal model that applies to both direct sequence code-division multiple access (DS-CDMA) and multi-carrier CDMA (MC-CDMA) systems. Simulation results show that the proposed algorithm outperforms most previously proposed multi-user detection schemes, and can achieve near-optimal (maximum likelihood) performance with very low complexity.
{"title":"A novel low-complexity near-ML multiuser detector for DS-CDMA and MC-CDMA systems","authors":"Yi-Lin Li, Yumin Lee","doi":"10.1109/GLOCOM.2002.1188128","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188128","url":null,"abstract":"We propose a novel low-complexity multi-user detection algorithm based on tree search for a unified signal model that applies to both direct sequence code-division multiple access (DS-CDMA) and multi-carrier CDMA (MC-CDMA) systems. Simulation results show that the proposed algorithm outperforms most previously proposed multi-user detection schemes, and can achieve near-optimal (maximum likelihood) performance with very low complexity.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"385 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115950751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188046
O. O. Vasilenko
Within the framework of a more effective usage of reverse channel spectrum resources in the mobile packet wireless networks a new algorithm of random multiple access is introduced. The algorithm enables us to exploit the differences in signal fadings of different mobile terminals competing for a common access channel. We also consider an example of the algorithm usage which provides a multiple access in a spread spectrum network. Certain results of the computer simulation and comparative analysis with CSMA/CA are given.
{"title":"Random multiple access algorithm for mobile packet wireless networks with implementation of multiuser diversity","authors":"O. O. Vasilenko","doi":"10.1109/GLOCOM.2002.1188046","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188046","url":null,"abstract":"Within the framework of a more effective usage of reverse channel spectrum resources in the mobile packet wireless networks a new algorithm of random multiple access is introduced. The algorithm enables us to exploit the differences in signal fadings of different mobile terminals competing for a common access channel. We also consider an example of the algorithm usage which provides a multiple access in a spread spectrum network. Certain results of the computer simulation and comparative analysis with CSMA/CA are given.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132388482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：