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

2007 2nd International Symposium on Wireless Pervasive Computing最新文献

筛选
英文 中文
Modeling of mobility and groups in inter-vehicular MANET-based networks 基于manet的车际网络中移动性和群组建模
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342625
Juan-Carlos Cano, C. Calafate, P. Manzoni, C. Toh
{"title":"Modeling of mobility and groups in inter-vehicular MANET-based networks","authors":"Juan-Carlos Cano, C. Calafate, P. Manzoni, C. Toh","doi":"10.1109/ISWPC.2007.342625","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342625","url":null,"abstract":"This paper evaluates the behavior of mobile ad hoc networks when group mobility is involved. We concentrate on group mobility because road vehicles tend to form groups or fleets whose behavior depends on the behavior of the close-by vehicles. We propose four different group mobility models and present a mobility pattern generator, called grcmob that we designed to be used with the ns-2 simulator. We evaluate the performance of vehicular ad hoc networks under a wide number of scenarios using both TCP and UDP data traffic. We show that the number of groups is more important than the number of nodes and that the impact of area size is almost negligible. We also reveal that the mixture of inter- and intra-group communications has the strongest impact on performance. Finally, we show that the presence of groups forces the network topology to be more sparse and therefore the probability of network partitions and node disconnections grows, affecting performance especially as inter-group traffic increases","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125516688","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}
引用次数: 6
A Novel Weighted Cooperative Routing Algorithm Based on Distributed Relay Selection 一种基于分布式中继选择的加权协同路由算法
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342605
Chao Chen, B. Zheng, Xianjing Zhao, Zhen-ya Yan
{"title":"A Novel Weighted Cooperative Routing Algorithm Based on Distributed Relay Selection","authors":"Chao Chen, B. Zheng, Xianjing Zhao, Zhen-ya Yan","doi":"10.1109/ISWPC.2007.342605","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342605","url":null,"abstract":"Typically wireless multi-hop ad hoc and sensor networks utilize protocols that relay packets hop-by-hop along a path connecting source node to sink node. The emerging cooperative routing (CR) methodology, however, can obtain distinct performance gain by selecting extra relay to forward data. This study presents a novel distributed weighted cooperative routing algorithm (DWCRA) which selects the \"best\" relay with the optimal weighted metric for cooperative transmission in a distributed manner. The weighted metric of relay selection strategy comprises of remaining energy of relays and channel state information (CSI) of each source-relay-sink pair. The simulation is implemented on NS-2 platform and results show that, compared to non-cooperative DSDV routing protocol, DWRCA achieves a delivery-lifetime tradeoff between maximal remaining energy algorithm (MREA) and optimal channel state algorithm (OCSA). In addition, different performance demand can be met by dynamic coordination of the weighted factors","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115811152","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}
引用次数: 14
Generating Spreading Codes for MC-CDMA with Desirable Crest Factor and Error Weight Distribution 具有理想波峰系数和误差权分布的MC-CDMA扩频码的生成
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342616
H. Raza, J. Dyer, B. Natarajan
{"title":"Generating Spreading Codes for MC-CDMA with Desirable Crest Factor and Error Weight Distribution","authors":"H. Raza, J. Dyer, B. Natarajan","doi":"10.1109/ISWPC.2007.342616","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342616","url":null,"abstract":"In this paper, criteria for designing spreading codes for multicarrier code division multiple access (MC-CDMA) are derived, and a novel approach for generating customized codesets without any length and size restrictions is proposed. In addition to cross-correlation requirements, MC-CDMA systems have to deal with the issue of high peak to average power ratio (or crest factor). In this work, we map the crest factor requirement to the mean-square aperiodic auto-correlation measure of the spreading codes. Using the proposed trellis approach, we design spreading codes with desired aperiodic auto-correlation, while offering the best possible aperiodic cross-correlation properties. Additionally, we improve the diversity gain by improving the error weight distribution. We demonstrate that this is achieved by increasing the number of allowable phases in the spreading code. To the best of the authors' knowledge, this is the first approach that considers a wide range of performance metrics for code design in MC-CDMA, while offering a flexible approach to design custom codesets","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134132238","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
Map-based Adaptive Positioning in Wireless Sensor Networks 无线传感器网络中基于地图的自适应定位
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342580
A.A. Ahmed, Hongchi Shi, Yi Shang
{"title":"Map-based Adaptive Positioning in Wireless Sensor Networks","authors":"A.A. Ahmed, Hongchi Shi, Yi Shang","doi":"10.1109/ISWPC.2007.342580","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342580","url":null,"abstract":"Frequent localization in sensor networks may be needed due to the dynamically changing topology and the possible mobility of sensor nodes. We present a distributed adaptive localization method that we refer to as: map-based adaptive positioning (MAP). The main idea is to construct a relative local map at every node in the network, consisting of the node itself and its immediate neighbors, and merge the local maps together to form a global map. We consider two algorithms that can be used to estimate the relative local maps: multidimensional scaling (MDS) and semidefinite programming (SDP). The performance of these algorithms depend on two parameters: size of a local map, i.e., number of nodes, and the average connectivity of the node at the center of the local map and its 1-hop neighbors. We use machine learning to adaptively select the appropriate algorithm to estimate the relative local maps. Simulation results show that MAP outperforms both MDS and SDP, with better improvement for networks with less uniform node deployment.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134444188","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}
引用次数: 2
AN EFFICIENT MULTI-USER DETECTION SCHEME FOR OVERLOADED GROUP-ORTHOGONAL MC-CDMA SYSTEMS 一种重载群正交Mc-cdma系统的高效多用户检测方案
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1049/iet-com:20070304
Ping Wang, T. Le-Ngoc
{"title":"AN EFFICIENT MULTI-USER DETECTION SCHEME FOR OVERLOADED GROUP-ORTHOGONAL MC-CDMA SYSTEMS","authors":"Ping Wang, T. Le-Ngoc","doi":"10.1049/iet-com:20070304","DOIUrl":"https://doi.org/10.1049/iet-com:20070304","url":null,"abstract":"This paper presents an efficient multi-user detection (MUD) scheme for overloaded MC-CDMA systems. The proposed detection scheme for overloaded system achieves the optimal performance for constant-modulus modulation, e.g., MPSK, and provides near-optimal performance for non-constant-modulus modulation, e.g., M-QAM. Moreover, it has lower complexity than other optimal detection algorithms, especially suitable for group-orthogonal MC-CDMA (GO-MC-CDMA) systems, where group-based technique keeps joint detection size relatively small","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114196985","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}
引用次数: 6
PCPP: Private Computing on Public Platforms A New Paradigm in Public Computing PCPP:公共平台上的私有计算——公共计算的新范式
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342606
Thomas H. Morris, V. Nair
{"title":"PCPP: Private Computing on Public Platforms A New Paradigm in Public Computing","authors":"Thomas H. Morris, V. Nair","doi":"10.1109/ISWPC.2007.342606","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342606","url":null,"abstract":"As cellular telephones and high capacity memory sticks emerge as users' primary repository for data and applications, users will often run applications and display data on remote hosts. The biggest challenge in supporting this mobile data, mobile applications, stationary platforms model is in ensuring security of the applications as well as the platforms. To that end, we propose PCPP as a new paradigm in public computing in which the remote host is not trusted, rather, security is owned and enforced by the application. PCPP is a two step process which ensures that the application running on the remote host remains unaltered, unmonitored, and unrecorded for future analysis by the public platform or any application running on the public platform","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123825080","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}
引用次数: 5
Design of Adaptive Modulation and Coding Scheme for Truncated HARQ 截断HARQ自适应调制编码方案的设计
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342591
Si H. Park, J. W. Kim, C. Kang
{"title":"Design of Adaptive Modulation and Coding Scheme for Truncated HARQ","authors":"Si H. Park, J. W. Kim, C. Kang","doi":"10.1109/ISWPC.2007.342591","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342591","url":null,"abstract":"In this paper, a new design approach for an adaptive modulation and coding scheme, combined with the truncated hybrid ARQ (HARQ) in the emerging broadband mobile Internet access systems, is proposed. The progressive combining gain can be obtained by the number of retransmissions in HARQ schemes, as the target packet error rate can vary with each retransmission. In other words, higher bandwidth efficiency can be achieved by selecting a more aggressive modulation and coding rate set (MCS) at the expense of packet error rate of earlier transmissions, which can be compensated by the progressive retransmission gain in HARQ. Based on extensive simulation for predicting the combining gain in each retransmission, it has been demonstrated that bandwidth efficiency can be improved as much as 5.8dB and 3.3dB, compared with the conservative AMC design approach with truncated HARQ and aggressive AMC design approach with truncated ARQ, respectively","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125225783","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}
引用次数: 18
Quantifying the Gains of an Optimal Information Model to Facilitate Policy Based QoS in Heterogeneous Communications Networks 量化异构通信网络中基于策略的QoS的最优信息模型增益
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342569
J. Sonnenberg
{"title":"Quantifying the Gains of an Optimal Information Model to Facilitate Policy Based QoS in Heterogeneous Communications Networks","authors":"J. Sonnenberg","doi":"10.1109/ISWPC.2007.342569","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342569","url":null,"abstract":"Considerable work has been done in the past several years to facilitate video, voice and data communications over highly variable, communications-disadvantaged links between mobile users. The first area addressed in most information model examples is often QoS in order to partition the underlying link and physical layer capabilities among the requesting higher layer services. A deployed system must manage these partitions in real time and must adjust parameters in every layer in coordination with local, regional and even global management functions. This mandates a policy-based management approach which, in turn, dictates the construction of an information model that addresses all of these parameters. This paper defines several new areas of information model parameters beyond QoS that are not typically discussed in the current policy based network management (PBNM) information model literature. We then construct an integrated information model over the several policy decision point (PDP) domains and develop some example policies that illustrate the interaction of the policy domains in a representative mobile ad-hoc network. Finally we calculate the bottleneck bandwidth for coordinated and uncoordinated policy management and estimate the operations/management savings and utilization gains possible with an information model-based implementation","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127397039","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
High Capacity VoIP Services in 802.11 Networks 802.11网络下的大容量VoIP业务
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342623
Manjari Chhawchharia, Atanu Guchhait
{"title":"High Capacity VoIP Services in 802.11 Networks","authors":"Manjari Chhawchharia, Atanu Guchhait","doi":"10.1109/ISWPC.2007.342623","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342623","url":null,"abstract":"IEEE 802.11 employs distributed coordination function (DCF) channel access mechanism which is based on carrier sense multiple access with collision avoidance (CSMA/CA). This standard was primarily designed to support best-effort traffic. Moreover, due to the contention-based approach, the bandwidth utilization is inherently inefficient. Therefore, the number of voice over IP (VoIP) calls which can be supported is severely limited. For example, the G.711 speech codec supports only 8 calls in an 802.11b network. We present a new method to increase VoIP capacity in Wi-Fi networks. This methodology requires no change to the existing DCF. It relies on contention-free channel access to improve the efficiency of bandwidth utilization without requiring the support of standard-based point co-ordination function (PCF). The access point (AP) uses packet aggregation in the downlink and scheduling in the uplink to enhance the throughput. Through mathematical analysis, we find that the proposed mechanism results in about 300% improvement over the baseline model. Using this, the G.711 codec supports 27 calls in 802.11b network","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126191885","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}
引用次数: 5
Performance Improvement through Diversity Reception for Bluetooth in the Presence of Interference 干扰条件下蓝牙分集接收性能改进
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342634
B. Masini, Andrea Conti, O. Andrisano
{"title":"Performance Improvement through Diversity Reception for Bluetooth in the Presence of Interference","authors":"B. Masini, Andrea Conti, O. Andrisano","doi":"10.1109/ISWPC.2007.342634","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342634","url":null,"abstract":"In this work, we propose an analytical framework to derive the performance of Bluetooth (BT) in the presence of an IEEE802.11g interferer. In particular, aiming at improving the performance of BT in the presence of interference still maintaining low the complexity, we propose a selection diversity scheme at the receiver side of the BT system and we exploit the spatial diversity to improve the coexistence between different systems sharing resources. We firstly analytically derive the BT performance in terms of mean block error probability and mean packet error probability averaged over Rayleigh fading, then we extend the analysis to the evaluation of the packet error outage, an important figure of merit when real time scenarios are considered. We show that a not negligible improvement for the coexistence issue of the involved systems can be achieved.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433276","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信