2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)最新文献

筛选
英文 中文
Free-space optical links using phase singularity 利用相位奇点的自由空间光链路
B. K. Yadav, H. Kandpal
{"title":"Free-space optical links using phase singularity","authors":"B. K. Yadav, H. Kandpal","doi":"10.1109/ANTS.2009.5409847","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409847","url":null,"abstract":"In this paper, we demonstrate novel type of free-space optical links. It is a contrived idea but has a great potential for realization. The links may be exploited to exchange information in free-space.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124986204","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}
引用次数: 1
Reconsideration of carrier sensing range for wireless ad hoc networks 无线自组网中载波感知距离的重新考虑
Mayur M. Vegad, S. De, Brejesh Lall
{"title":"Reconsideration of carrier sensing range for wireless ad hoc networks","authors":"Mayur M. Vegad, S. De, Brejesh Lall","doi":"10.1109/ANTS.2009.5409853","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409853","url":null,"abstract":"Recent experimental results have shown that the minimum signal-to-interference ratio required at a receiver (CP<inf>th</inf>) depends on the order of arrivals of overlapping frames, and it is much less when the sender's frame arrives earlier. With such differentiating capture capable receivers, in this paper we reconsider the optimal choice for carrier sense range r<inf>s</inf> of wireless nodes. Through simple analysis and simulations we show that r<inf>s</inf> need not be more than (CP<inf>th</inf>)<sup>1/α</sup> r<inf>t</inf>, where α is the wireless path loss factor and r<inf>t</inf> is the nodal communication range.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"934 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127022924","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}
引用次数: 4
Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks 波长路由光网络中固定长度段保护的最佳段长度
Raghunath Tewari, B. Ramamurthy
{"title":"Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks","authors":"Raghunath Tewari, B. Ramamurthy","doi":"10.1109/ANTS.2009.5409857","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409857","url":null,"abstract":"Protecting a network against link failures is a major challenge faced by network operators. The protection scheme has to address two important objectives - fast recovery and minimizing the amount of backup resources needed. Every protection algorithm is a tradeoff between these two objectives. In this paper, we study the problem of segment protection. In particular, we investigate what is the optimal segment size that obtains the best tradeoff between the time taken for recovery and minimizing the bandwidth used by the backup segments. We focus on the uniform fixed-length segment protection method, where each primary path is divided into fixed-length segments, with the exception of the last segment in the path. We observe that the optimal segment size for a given network depends on several factors such as the topology and the ratio of the costs involved.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127413659","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}
引用次数: 1
Transparent (fiber to the premises) Wave Division Multiplexing Passive Optical Network 透明(光纤到现场)波分复用无源光网络
Colm Connolly, M. Schukat
{"title":"Transparent (fiber to the premises) Wave Division Multiplexing Passive Optical Network","authors":"Colm Connolly, M. Schukat","doi":"10.1109/ANTS.2009.5409885","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409885","url":null,"abstract":"The presented passive optical architecture is based on Wave Division Multiplexing Passive Optical Network (WDM-PON), which provides a solution to problems associated with current PONs. The architecture inherently reduces issues like bottleneck bandwidth, reduced security and distance limitations. Results from testing Non-Return-to-Zero (NRZ) and Return-to-Zero (RZ) encoding scheme over distances between 50km and 80km are also briefly discussed.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121771780","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}
引用次数: 0
Two algorithms for network size estimation for master/slave ad hoc networks 主从自组网中网络大小估计的两种算法
R. Ali, Suksant Sae Lor, M. Rio
{"title":"Two algorithms for network size estimation for master/slave ad hoc networks","authors":"R. Ali, Suksant Sae Lor, M. Rio","doi":"10.1109/ANTS.2009.5409896","DOIUrl":"https://doi.org/10.1109/ANTS.2009.5409896","url":null,"abstract":"This paper proposes an adaptation of two network size estimation methods: random tour and gossip-based aggregation to suit master/slave mobile ad hoc networks. We show that it is feasible to accurately estimate the size of ad hoc networks when topology changes due to mobility using both methods. The algorithms were modified to account for the specific constraints of master/slave ad hoc networks and the results show that the proposed modifications perform better on these networks than the original protocols. Each of the two algorithms presents strengths and weaknesses and these are outlined in this paper.","PeriodicalId":245765,"journal":{"name":"2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132607043","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}
引用次数: 17
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信