发布求助
文献互助 智能选刊 最新文献

2007 IEEE Wireless Communications and Networking Conference最新文献

筛选
英文 中文
Accuracy Enhancement for Initial Timing Acquisition Through Lagrange Interpolation 利用拉格朗日插值提高初始时序采集精度
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.454
S. W. Oh
{"title":"Accuracy Enhancement for Initial Timing Acquisition Through Lagrange Interpolation","authors":"S. W. Oh","doi":"10.1109/WCNC.2007.454","DOIUrl":"https://doi.org/10.1109/WCNC.2007.454","url":null,"abstract":"Initial timing acquisition typically does not give very high accuracy due to complexity consideration. Although interpolation technique is normally used to increase accuracy, it is not suitable for interpolating power profile in typical timing acquisition since a very high order and complex interpolation is required to obtain accurate estimation. In this paper, we show how a low complexity Lagrange interpolation can be applied to enhance the accuracy of initial timing acquisition without even having to estimate the actual power profile. The interpolation only uses addition and shift operations. Simulation results show that performing Lagrange interpolation always gives better estimations. With the increased accuracy on the initial timing acquisition, the subsequent baseband processing can be carried out with better signal-to-noise ratio.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"261 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123709279","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
Performance Comparison of SPIN based Push-Pull Protocols 基于SPIN的推拉协议的性能比较
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.729
R. Khosla, Xuan Zhong, G. Khanna, S. Bagchi, Edward Ij. Coylem
{"title":"Performance Comparison of SPIN based Push-Pull Protocols","authors":"R. Khosla, Xuan Zhong, G. Khanna, S. Bagchi, Edward Ij. Coylem","doi":"10.1109/WCNC.2007.729","DOIUrl":"https://doi.org/10.1109/WCNC.2007.729","url":null,"abstract":"Multiple data-centric protocols - which can broadly be classified as push-pull, push-only, or pull-only - have been proposed in the literature. In this paper we present a framework to develop an insight into the characteristics of push-pull protocols. The performance of push-pull protocols is critically dependent on the timeout settings used to trigger failure recovery mechanisms. We perform a study of how to choose optimal timeouts to achieve best performance and use these timeouts to simulate and compare various push-pull protocols. Our starting point is a recently proposed SPIN-based protocol, called shortest-path minded SPIN (SPMS), in which meta-data negotiations take place prior to data exchange in order to minimize the number of data transmissions, thereby improving in both energy and delay compared to SPIN. We propose a redesign of SPMS, called SPMS-Rec, which reduces the energy expended in the event of failures by requiring intermediate relay nodes to try alternate routes. Our simulation results show that SPMS-Rec outperforms SPMS, and thus SPIN, yielding energy savings while reducing the delay when multiple nodes fail along a route. We further propose a modification to SPMS-Rec through request suppression which helps in reducing redundant data transmissions.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125399490","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}
引用次数: 10
An Experimental Performance Evaluation of SCPS-TP over Cislunar Communications Links SCPS-TP在地月通信链路上的实验性能评估
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.484
Ruhai Wang, Naga C. Aryasomayajula, Anil Ayyagari, Qian Zhang
{"title":"An Experimental Performance Evaluation of SCPS-TP over Cislunar Communications Links","authors":"Ruhai Wang, Naga C. Aryasomayajula, Anil Ayyagari, Qian Zhang","doi":"10.1109/WCNC.2007.484","DOIUrl":"https://doi.org/10.1109/WCNC.2007.484","url":null,"abstract":"Space communication protocol standards-transport protocol (SCPS-TP) is a set of TCP extensions aimed at reliable transfer of information between space mission end systems. Some works have been done on throughput performance evaluation of SCPS-TP over LEO- and GEO-satellite channels. In this paper, we present an experimental performance evaluation of SCPS-TP over a simulated cislunar communication link. We intend to see how effective both the window-based and the rate-based transmission control mechanisms of the SCPS-TP cope with a long cislunar link delay, especially when hybridized with a high bit-error-rate (BER), and which option has throughput advantage over the other. The experimental results reveal that the protocols have statistically significant performance difference over an error-prone link with a BER around 10-5 at which pure rate control shows superior performance over other three protocols. SCPS-Vegas performs poorly over a long-delayed, error-prone cislunar channel. Quantitatively, the throughput advantage of SCPS-pure rate control is around 3000 bytes/sec over all other three protocols over both symmetrical and asymmetrical channels at BER=10-5. We conclude that pure rate control is very suitable for a long-delayed, error-prone cislunar communication links.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125436410","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}
引用次数: 3
Packets Transmission in Wireless Sensor Networks: Interference, Energy and Delay-Aware Approach 无线传感器网络中的数据包传输:干扰、能量和延迟感知方法
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.466
Xinsheng Xia, Q. Liang
{"title":"Packets Transmission in Wireless Sensor Networks: Interference, Energy and Delay-Aware Approach","authors":"Xinsheng Xia, Q. Liang","doi":"10.1109/WCNC.2007.466","DOIUrl":"https://doi.org/10.1109/WCNC.2007.466","url":null,"abstract":"Delay and energy efficiency are two important parameters to evaluate the wireless sensor networks (WSN) quality. In the WSN, the interference will affect the packets transmission. When a sensor needs to send a packet, we choose the parameter signal-to-interference ratio (SIR) as the threshold to decide whether send or not. SIR thresholds selection show SIR could manage the tradeoff between the average delay and energy consumption. We propose fuzzy logic system (FLS) in the optimization of SIR threshold selection. Average delay and distance of a node to the source node are selected as antecedents for the FLS. The output of FLS provides adjusting factor for the SIR threshold. Simulation result show the fuzzy optimization could achieve a better network efficiency, reduce the average delay and extend the network lifetime.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125500072","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}
引用次数: 3
On the Connectivity of Hierarchical Directional Optical Sensor Networks 层次定向光传感器网络的连通性研究
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.646
U. N. Okorafor, D. Kundur
{"title":"On the Connectivity of Hierarchical Directional Optical Sensor Networks","authors":"U. N. Okorafor, D. Kundur","doi":"10.1109/WCNC.2007.646","DOIUrl":"https://doi.org/10.1109/WCNC.2007.646","url":null,"abstract":"In this paper, we investigate the fundamental property of connectivity in a hierarchical ad-hoc optical sensor network (OSN) communicating with broad beam lasers. The OSN is modeled as a random sector graph, in which the randomly deployed sensors can send data within a contiguous and randomly oriented sector of communication. Hierarchy is achieved by employing passive and active free space optical devices. Connectivity analysis in this hierarchical network model is vital in order to assess the feasibility of routing, security and network protocols. To this end, this paper provides probabilistic bounds on network parameters for hierarchical connectivity in OSNs, using a novel approach that directly considers directionality. In particular, we prove probabilistic bounds on the jointly minimum radius of communication as well as angle of the communication sector (i.e., beam width) required for network connectivity.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126941501","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}
引用次数: 7
MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies MobCast:使用可扩展任播代理实现无缝IP移动的覆盖架构
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.708
Christopher P. Lee, Keshav Attrey, Carlos Caballero, N. Feamster, M. Mihail, J. Copeland
{"title":"MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies","authors":"Christopher P. Lee, Keshav Attrey, Carlos Caballero, N. Feamster, M. Mihail, J. Copeland","doi":"10.1109/WCNC.2007.708","DOIUrl":"https://doi.org/10.1109/WCNC.2007.708","url":null,"abstract":"We propose a routing overlay system, MobCast, for simple and efficient routing to mobile hosts. Mobcast nodes advertise the same address space at each proxy location, and each mobile host is assigned a \"universal\" IP address from this address space, so packets sent to a mobile host's universal IP address automatically go to the nearest proxy on the overlay. The overlay then delivers the packets to the mobile host. Our architecture enables seamless mobility for both micro and macro mobility. While our initial design is not as mature as Mobile IP, it shows great promise to solve the traditional problems of ingress routing, firewalls, NATs, and rapid mobility with much lower complexity. We present our design as a scalable and deployable alternative to mobile IP. In this paper, we focus on describing the MobCast system architecture. We form our arguments for scalability, handoff-speed, and simplicity, and give our initial results for scalability. We postpone a detailed discussion of MobCast's security model for future work.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114899615","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
Prediction of Area Capacity in a Multilink MIMO Cellular Network with Guaranteed QoS 具有保证QoS的多链路MIMO蜂窝网络的区域容量预测
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.239
Akiyo Yoshimoto, T. Hattori
{"title":"Prediction of Area Capacity in a Multilink MIMO Cellular Network with Guaranteed QoS","authors":"Akiyo Yoshimoto, T. Hattori","doi":"10.1109/WCNC.2007.239","DOIUrl":"https://doi.org/10.1109/WCNC.2007.239","url":null,"abstract":"Multilink MIMO technique is a promising technology for cellular networks with a guaranteed quality-of-service. It will provide high capacity and wide coverage. The authors evaluated the downlink performance of the multilink MIMO system from the perspective of quality-of-service. The presence of Rayleigh fading, shadowing, and path loss is assumed. To evaluate the proposed system, the authors develop a performance measure for MIMO cellular systems. The measure is ergodic capacity taking into account area coverage. The numerical results show that the area coverage of proposed multilink MIMO system is greatly improved compared with that of the conventional singlelink MIMO system. Using the proposed measure, the authors also find that the multilink MIMO system could achieve high capacity with guaranteed QoS for a wide coverage.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115094324","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}
引用次数: 7
Product Codes and Parallel Concatenated Product Codes 产品代码和并行串联产品代码
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.23
T. D. H. Huang, Chi-Yuan Chang, Yan-Xiu Zheng, Y. Su
{"title":"Product Codes and Parallel Concatenated Product Codes","authors":"T. D. H. Huang, Chi-Yuan Chang, Yan-Xiu Zheng, Y. Su","doi":"10.1109/WCNC.2007.23","DOIUrl":"https://doi.org/10.1109/WCNC.2007.23","url":null,"abstract":"We study the decoding of product codes and a class of parallel concatenated product codes (PCPC). PCPC improves the minimum distance while retaining the merit of low decoding complexity of turbo product codes (TPC). We prove that using the Fibonacci interleaver does help increasing the minimum distance. The regularity of the interleaver also reduces the implementation complexity and makes parallel interleaving feasible. We show that Pyndiah's algorithm for decoding product codes produce an annealing effect similar to that of the so-called annealed belief propagation (ABP) algorithms which adjusts the \"temperature\" of an augmented cost surface. Decoding methods based on modified Pyndiah and annealed BCJR algorithms for both PC and PCPC are proposed and their performance is compared.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115221318","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
A Concurrent Transmission MAC Protocol for Enhancing Throughout and Avoiding Spectrum Sensing in Cognitive Radio 认知无线电中一种增强全集和避免频谱感知的并发传输MAC协议
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.28
Li-Chun Wang, Chung-Wei Wang, Yin-Chih Lu, Chuan-Ming Liu
{"title":"A Concurrent Transmission MAC Protocol for Enhancing Throughout and Avoiding Spectrum Sensing in Cognitive Radio","authors":"Li-Chun Wang, Chung-Wei Wang, Yin-Chih Lu, Chuan-Ming Liu","doi":"10.1109/WCNC.2007.28","DOIUrl":"https://doi.org/10.1109/WCNC.2007.28","url":null,"abstract":"For the cognitive radio (CR) network, a fundamental issue is how to identify the spectrum opportunities. First, each CR node determines whether there exists transmission opportunities on unlicensed bands. If not, this node will find other opportunity on licensed bands. Thus, increasing the opportunities of concurrent transmissions in unlicensed bands can reduce the overhead of wide-band sensing. In this paper, based on the carrier sensing multiple access protocol, the paper proposed a novel concurrent transmissions MAC (CT-MAC) protocol to identify the possibility of establishing the second link in the presence of the first link in the unlicensed band. In addition to reducing the overhead of wide-band sensing, the proposed CT-MAC scheme can enhance overall throughput and is backward compatible with the IEEE 802.11 standard.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116001260","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}
引用次数: 27
Effectiveness of Physical and Virtual Carrier Sensing in IEEE 802.11 Wireless Ad Hoc Networks IEEE 802.11无线自组织网络中物理和虚拟载波感知的有效性
2007 IEEE Wireless Communications and Networking Conference Pub Date : 2007-03-01 DOI: 10.1109/WCNC.2007.32
Fu-Yi Hung, I. Marsic
{"title":"Effectiveness of Physical and Virtual Carrier Sensing in IEEE 802.11 Wireless Ad Hoc Networks","authors":"Fu-Yi Hung, I. Marsic","doi":"10.1109/WCNC.2007.32","DOIUrl":"https://doi.org/10.1109/WCNC.2007.32","url":null,"abstract":"IEEE 802.11 defines physical and virtual carrier sensing mechanisms to avoid interference in wireless local area networks for the kind of interference originating from within the receiving range of a receiver. However, in wireless ad hoc networks most interference comes from outside of this range. So, the effectiveness of IEEE 802.11 carrier sensing mechanism in ad hoc networks has attracted many studies. Prior research has attempted to evaluate effectiveness from a spatial viewpoint only, using an analytical model to estimate the size of the interference area of an ongoing communication based on the transmitter-receiver distance. Unlike this, the temporal effectiveness of the carrier sensing mechanism has been ignored. This paper proposed an analysis combining spatial and temporal viewpoint to study the effect of interference on the performance of IEEE 802.11 protocol in ad hoc networks. The authors also compare the effectiveness of physical and virtual carrier sensing mechanisms, known as RTS/CTS mechanism, in wireless ad hoc networks.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116068578","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}
引用次数: 19
首页 上一页 下一页 尾页
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学术官方微信