Pub Date : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578181
S. Farahmand, Xiliang Luo, G. Giannakis
A low-complexity, high performance demodulation algorithm suitable for ultra-wideband impulse radio (UWB-IR) is developed. Capitalizing on the recently proposed acquisition scheme based on dirty templates (TDT), the novel demodulator can cope with unknown timing offsets, unknown time-hopping spreading codes, and unknown multipath channels. Both data-aided (DA) and non-data-aided (NDA) TDT schemes are considered. Performance of the resultant TDT-based demodulator is evaluated and shown to be robust to timing estimation errors. Comparisons are provided with the UWB-RAKE receiver when timing errors are absent. It is asserted that the TDT-based demodulator outperforms the RAKE with limited number of fingers in the medium to high signal-to-noise-ratio (SNR) range. Analytical results are corroborated by simulations
{"title":"Demodulation with dirty templates for UWB impulse radios","authors":"S. Farahmand, Xiliang Luo, G. Giannakis","doi":"10.1109/GLOCOM.2005.1578181","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578181","url":null,"abstract":"A low-complexity, high performance demodulation algorithm suitable for ultra-wideband impulse radio (UWB-IR) is developed. Capitalizing on the recently proposed acquisition scheme based on dirty templates (TDT), the novel demodulator can cope with unknown timing offsets, unknown time-hopping spreading codes, and unknown multipath channels. Both data-aided (DA) and non-data-aided (NDA) TDT schemes are considered. Performance of the resultant TDT-based demodulator is evaluated and shown to be robust to timing estimation errors. Comparisons are provided with the UWB-RAKE receiver when timing errors are absent. It is asserted that the TDT-based demodulator outperforms the RAKE with limited number of fingers in the medium to high signal-to-noise-ratio (SNR) range. Analytical results are corroborated by simulations","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128152750","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577768
Tse-En Lu, Kai-Ten Feng
In recent years, many location-a ware routing protocols have been proposed for the mobile ad hoc networks. The routing performance is improved by exploiting the position information of the mobile nodes. However, the mobility characteristics of the mobile nodes have not been taken into consideration. In this paper, the proposed predictive mobility and location-aware routing (PMLAR) algorithm incorporates the moving behaviors of the mobile nodes in the protocol design. The region for packet forwarding is determined by predicting the future trajectory of the destination node. The routing performance can be effectively improved by adopting the prediction mechanism of the proposed PMLAR algorithm. Simulation results show that the PMLAR algorithm outperforms other routing protocols under different network topologies.
{"title":"Predictive mobility and location-aware routing protocol in mobile ad hoc networks","authors":"Tse-En Lu, Kai-Ten Feng","doi":"10.1109/GLOCOM.2005.1577768","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577768","url":null,"abstract":"In recent years, many location-a ware routing protocols have been proposed for the mobile ad hoc networks. The routing performance is improved by exploiting the position information of the mobile nodes. However, the mobility characteristics of the mobile nodes have not been taken into consideration. In this paper, the proposed predictive mobility and location-aware routing (PMLAR) algorithm incorporates the moving behaviors of the mobile nodes in the protocol design. The region for packet forwarding is determined by predicting the future trajectory of the destination node. The routing performance can be effectively improved by adopting the prediction mechanism of the proposed PMLAR algorithm. Simulation results show that the PMLAR algorithm outperforms other routing protocols under different network topologies.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129172483","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577907
K. Ok, C. Kang
In this paper, we propose a new type of window-based pseudonoise (PN) code acquisition scheme, which does not resort to the window threshold, as opposed to the conventional scheme. In particular, it is selecting one or more largest hypothesis energies rather than selecting single largest hypothesis energy subject to the window threshold per search window for verification. By performing the numerical analysis based on a flow graph approach in AWGN and Rician fading channels, we show that the proposed scheme outperforms the conventional one under a low pilot Ec/Io while maintaining the similar level of performances under medium and high pilot Ec/Io's.
{"title":"Generalized window-based PN acquisition scheme in CDMA2000 spread spectrum systems","authors":"K. Ok, C. Kang","doi":"10.1109/GLOCOM.2005.1577907","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577907","url":null,"abstract":"In this paper, we propose a new type of window-based pseudonoise (PN) code acquisition scheme, which does not resort to the window threshold, as opposed to the conventional scheme. In particular, it is selecting one or more largest hypothesis energies rather than selecting single largest hypothesis energy subject to the window threshold per search window for verification. By performing the numerical analysis based on a flow graph approach in AWGN and Rician fading channels, we show that the proposed scheme outperforms the conventional one under a low pilot Ec/Io while maintaining the similar level of performances under medium and high pilot Ec/Io's.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132431653","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578498
Q. Ma, C. Tepedelenlioğlu
Without channel state information (CSI) at the receiver, we study receive antenna selection (AS) for multi-antenna systems that employ differential unitary space-time signals. We perform AS only at the receiver and a subset of receive antennas that have the largest received signal power is chosen. Selecting a single antenna at the receiver, it is proved in Q. Mia and C. Tepedelenlioglu (2005) that with no CSI at the receiver, the diversity gain with AS is preserved for differential unitary space-time codes with full spatial diversity. In this paper, we generalize the performance analysis to the case of selecting more than one antenna at the receiver. As an immediate consequence of performance analysis, based on the derived diversity gain and coding gain expressions, we develop code design principles for the differential ST codes suitable for maximum-power based AS systems. In particular, for 2times2 differential AS systems, we have devised new excellent-performing parametric codes, which outperform known differential codes when AS is employed. Simulation results are presented to validate our analysis and code design
{"title":"Performance analysis and code design for differential antenna selection systems","authors":"Q. Ma, C. Tepedelenlioğlu","doi":"10.1109/GLOCOM.2005.1578498","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578498","url":null,"abstract":"Without channel state information (CSI) at the receiver, we study receive antenna selection (AS) for multi-antenna systems that employ differential unitary space-time signals. We perform AS only at the receiver and a subset of receive antennas that have the largest received signal power is chosen. Selecting a single antenna at the receiver, it is proved in Q. Mia and C. Tepedelenlioglu (2005) that with no CSI at the receiver, the diversity gain with AS is preserved for differential unitary space-time codes with full spatial diversity. In this paper, we generalize the performance analysis to the case of selecting more than one antenna at the receiver. As an immediate consequence of performance analysis, based on the derived diversity gain and coding gain expressions, we develop code design principles for the differential ST codes suitable for maximum-power based AS systems. In particular, for 2times2 differential AS systems, we have devised new excellent-performing parametric codes, which outperform known differential codes when AS is employed. Simulation results are presented to validate our analysis and code design","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133410975","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578095
Syed Faisal A. Shah, A. Tewfik
We propose an enhanced directional beacon based position location procedure for UWB systems. Unlike previous work that relies on strongest return and therefore prone to errors in obstructed line of sight (OLOS) environments, our procedure identifies the LOS return by detecting the earliest arrival. To overcome synchronization problems, we propose a correlation based window algorithm to detect the earliest arrival and hence the LOS component across a 360 deg rotation of directional beacon. We performed a detailed and exact analysis of the algorithm that has not yet reported in the literature. The analysis quantifies the dependence of the algorithm on the variance of noise and the beam pattern. The analysis also motivated us to mitigate the effect of noise. We, therefore, propose an improved algorithm and implement it in a computationally efficient way. To improve position estimation we perform a three point search around the estimated time index n and selects the point that minimizes l2 norm of a performance measure vector. From simulation results we claim position location accuracy of around 30 cm with a pragmatic 4-element antenna array using 2.4 GHz UWB pulses and 4-bit A/D converter at 28 dB SNR
{"title":"Performance analysis of directional beacon based position location algorithm for UWB systems","authors":"Syed Faisal A. Shah, A. Tewfik","doi":"10.1109/GLOCOM.2005.1578095","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578095","url":null,"abstract":"We propose an enhanced directional beacon based position location procedure for UWB systems. Unlike previous work that relies on strongest return and therefore prone to errors in obstructed line of sight (OLOS) environments, our procedure identifies the LOS return by detecting the earliest arrival. To overcome synchronization problems, we propose a correlation based window algorithm to detect the earliest arrival and hence the LOS component across a 360 deg rotation of directional beacon. We performed a detailed and exact analysis of the algorithm that has not yet reported in the literature. The analysis quantifies the dependence of the algorithm on the variance of noise and the beam pattern. The analysis also motivated us to mitigate the effect of noise. We, therefore, propose an improved algorithm and implement it in a computationally efficient way. To improve position estimation we perform a three point search around the estimated time index n and selects the point that minimizes l2 norm of a performance measure vector. From simulation results we claim position location accuracy of around 30 cm with a pragmatic 4-element antenna array using 2.4 GHz UWB pulses and 4-bit A/D converter at 28 dB SNR","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131780219","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577629
Wei Zhou, D. Sarkar, S. Ramakrishnan
MPEG-4 spatial scalable encoding scheme (SSES) provides different resolutions and wide range of VBR, (variate bit rate) video to satisfy requirements of end users with variant screen resolutions and network bandwidth. In a SSES, one base layer traffic and one (or more) enhancement layer(s) traffic are generated. Although many traffic models have been developed for single layer video traffic, none exists for VBR, SSES video traffic. Our extensive studies suggest that MMG (Markov-modulated gamma) model can capture base layer traffic quite well. However, it cannot be used for modeling enhancement layer traffic for two reasons: (1) enhancement layers have no I-frames, (2) enhancement layer traffic and base layer traffic are not independent and have a strong correlation. In this paper, we propose two models for enhancement layer traffic and aggregate traffic. To maintain the correlation between base layer and enhancement layers, we augment the base-layer state transition model. The augmentation uses state transition relation between base layer and enhancement layer traffic or between base layer and aggregate traffic. The models have been validated by QQ plots and leaky-bucket simulations. The model generated traffic streams quite accurately mimic original traffic streams.
{"title":"Traffic models for MPEG-4 spatial scalable video","authors":"Wei Zhou, D. Sarkar, S. Ramakrishnan","doi":"10.1109/GLOCOM.2005.1577629","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577629","url":null,"abstract":"MPEG-4 spatial scalable encoding scheme (SSES) provides different resolutions and wide range of VBR, (variate bit rate) video to satisfy requirements of end users with variant screen resolutions and network bandwidth. In a SSES, one base layer traffic and one (or more) enhancement layer(s) traffic are generated. Although many traffic models have been developed for single layer video traffic, none exists for VBR, SSES video traffic. Our extensive studies suggest that MMG (Markov-modulated gamma) model can capture base layer traffic quite well. However, it cannot be used for modeling enhancement layer traffic for two reasons: (1) enhancement layers have no I-frames, (2) enhancement layer traffic and base layer traffic are not independent and have a strong correlation. In this paper, we propose two models for enhancement layer traffic and aggregate traffic. To maintain the correlation between base layer and enhancement layers, we augment the base-layer state transition model. The augmentation uses state transition relation between base layer and enhancement layer traffic or between base layer and aggregate traffic. The models have been validated by QQ plots and leaky-bucket simulations. The model generated traffic streams quite accurately mimic original traffic streams.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121186955","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578055
Yijia Fan, J. Thompson
In this paper we discuss the outage capacity of multihop networks employing terminals with multiple antennas. We discuss the performance of several novel relaying configurations and signalling algorithms for either limited feedback or non-feedback channels. Three relaying types are considered, namely analogue relaying, digital relaying and hybrid relaying. We find that digital selective relaying outperforms all other relaying configurations considered here while requiring the highest signalling overhead. The matched filter based hybrid relaying scheme appears to be a good suboptimum choice for its good performance and low signalling overhead in the multiple relay scenario. We also find that for hybrid relaying schemes, the MMSE algorithm, which is usually applied in conventional MIMO systems, might not give effective performance improvement when it is applied at relays
{"title":"On the outage capacity of MIMO multihop networks","authors":"Yijia Fan, J. Thompson","doi":"10.1109/GLOCOM.2005.1578055","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578055","url":null,"abstract":"In this paper we discuss the outage capacity of multihop networks employing terminals with multiple antennas. We discuss the performance of several novel relaying configurations and signalling algorithms for either limited feedback or non-feedback channels. Three relaying types are considered, namely analogue relaying, digital relaying and hybrid relaying. We find that digital selective relaying outperforms all other relaying configurations considered here while requiring the highest signalling overhead. The matched filter based hybrid relaying scheme appears to be a good suboptimum choice for its good performance and low signalling overhead in the multiple relay scenario. We also find that for hybrid relaying schemes, the MMSE algorithm, which is usually applied in conventional MIMO systems, might not give effective performance improvement when it is applied at relays","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916406","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578057
S. Tsai, Yuan-Pei Lin, C.-C. Jay Kuo
The performance of a multiuser OFDM transceiver, proposed by authors in S.H. Tsai, et al. (2004) and called the preceded multiuser OFDM (PMU-OFDM) in this work, with time asynchronous access is investigated. We show that the multiaccess interference (MAI) due to time asynchronous access can be reduced to a negligible amount by adopting a proper precoder that uses M/2 symmetric or M/2 anti-symmetric codewords of the M Hadamard-Walsh codes for the preceding task. The PMU-OFDM transceiver with the same precoder was shown to have approximately MAI-free property in a frequency asynchronous environment (S.H. Tsai, et al., 2005). Here, we analyze the approximately MAI-free property of the PMU-OFDM system with respect to time asynchronism. Finally, computer simulation is performed to confirm the derived property
本文研究了由S.H. Tsai等人(2004)提出的多用户OFDM收发器的性能，该收发器在本文中被称为多用户OFDM (PMU-OFDM)，具有时间异步访问。我们表明，通过使用M Hadamard-Walsh码的M/2对称码字或M/2反对称码字的预编码器，可以将时间异步访问引起的多址干扰(MAI)减少到可以忽略不计的数量。具有相同预编码器的PMU-OFDM收发器在频率异步环境中具有大约无mai的特性(S.H. Tsai, et al.， 2005)。本文从时间异步的角度分析了PMU-OFDM系统的近似无mai特性。最后，通过计算机仿真验证了所推导的性质
{"title":"A precoded multiuser OFDM (PMU-OFDM) transceiver for time asynchronous systems","authors":"S. Tsai, Yuan-Pei Lin, C.-C. Jay Kuo","doi":"10.1109/GLOCOM.2005.1578057","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578057","url":null,"abstract":"The performance of a multiuser OFDM transceiver, proposed by authors in S.H. Tsai, et al. (2004) and called the preceded multiuser OFDM (PMU-OFDM) in this work, with time asynchronous access is investigated. We show that the multiaccess interference (MAI) due to time asynchronous access can be reduced to a negligible amount by adopting a proper precoder that uses M/2 symmetric or M/2 anti-symmetric codewords of the M Hadamard-Walsh codes for the preceding task. The PMU-OFDM transceiver with the same precoder was shown to have approximately MAI-free property in a frequency asynchronous environment (S.H. Tsai, et al., 2005). Here, we analyze the approximately MAI-free property of the PMU-OFDM system with respect to time asynchronism. Finally, computer simulation is performed to confirm the derived property","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127421939","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 : 2005-12-01DOI: 10.1109/glocom.2005.1578416
Yu Wang, Weizhao Wang, T. Dahlberg
Wireless hybrid networks combine the characteristics of both cellular and mobile ad hoc networks. In wireless hybrid networks, it is often assumed that each individual mobile node faithfully follows the prescribed protocols without any deviation. However, these mobile devices, when owned by individual users, will likely do what is the most beneficial to their owners, i.e., act "selfishly". Therefore, an algorithm or protocol intended for selfish wireless devices must be designed. In this paper, we specifically study how to design routing protocols in wireless hybrid networks with selfish nodes. We first present a VCG-based routing protocol for hybrid networks, and show it is truthful but could be expensive. Then we modify the VCG-based routing protocol to make it more efficient for hybrid networks in term of total payment. However, we prove that nodes could lie up their costs in the modified method. Moreover, we propose a novel routing protocol based on first-price path auctions [N. Immorlica et al, 2005], which can achieve a Nash equilibrium with low total payment
无线混合网络结合了蜂窝网络和移动自组织网络的特点。在无线混合网络中，通常假设每个单独的移动节点忠实地遵循规定的协议而没有任何偏差。然而，这些移动设备，当个人用户拥有时，可能会做对其所有者最有利的事情，即“自私”的行为。因此，必须为自私的无线设备设计一种算法或协议。本文重点研究了在具有自利节点的无线混合网络中如何设计路由协议。我们首先提出了一种基于vcg的混合网络路由协议，并表明它是真实的，但可能是昂贵的。然后，我们修改了基于vcg的路由协议，使其在总支付方面更有效地适用于混合网络。然而，我们证明了在改进的方法中，节点可以虚报其成本。此外，我们提出了一种新的基于首价路径拍卖的路由协议[N]。Immorlica et al .， 2005]，它可以在低总支付情况下实现纳什均衡
{"title":"Truthful routing for wireless hybrid networks","authors":"Yu Wang, Weizhao Wang, T. Dahlberg","doi":"10.1109/glocom.2005.1578416","DOIUrl":"https://doi.org/10.1109/glocom.2005.1578416","url":null,"abstract":"Wireless hybrid networks combine the characteristics of both cellular and mobile ad hoc networks. In wireless hybrid networks, it is often assumed that each individual mobile node faithfully follows the prescribed protocols without any deviation. However, these mobile devices, when owned by individual users, will likely do what is the most beneficial to their owners, i.e., act \"selfishly\". Therefore, an algorithm or protocol intended for selfish wireless devices must be designed. In this paper, we specifically study how to design routing protocols in wireless hybrid networks with selfish nodes. We first present a VCG-based routing protocol for hybrid networks, and show it is truthful but could be expensive. Then we modify the VCG-based routing protocol to make it more efficient for hybrid networks in term of total payment. However, we prove that nodes could lie up their costs in the modified method. Moreover, we propose a novel routing protocol based on first-price path auctions [N. Immorlica et al, 2005], which can achieve a Nash equilibrium with low total payment","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126390837","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 : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578009
Weiyi Zhang, G. Xue, Jian Tang, K. Thulasiraman
In this paper, we study dynamic light trail routing in a WDM optical network. We present an efficient algorithm for establishing a light trail routing for a new connection request, while using minimum network resources. We also study survivable routing using light trail technology. We present an efficient heuristic for computing a pair of working and protection light trails for a given connection request. Simulation results are presented which demonstrate the advantages of our routing schemes
{"title":"Dynamic light trail routing and protection issues in WDM optical networks","authors":"Weiyi Zhang, G. Xue, Jian Tang, K. Thulasiraman","doi":"10.1109/GLOCOM.2005.1578009","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578009","url":null,"abstract":"In this paper, we study dynamic light trail routing in a WDM optical network. We present an efficient algorithm for establishing a light trail routing for a new connection request, while using minimum network resources. We also study survivable routing using light trail technology. We present an efficient heuristic for computing a pair of working and protection light trails for a given connection request. Simulation results are presented which demonstrate the advantages of our routing schemes","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"54 9-10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132498138","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
扫码关注我们
求助内容：
应助结果提醒方式：