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

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

筛选
英文 中文
Enterprise Library Management for Digital Media with Dynamic Media Synthesis 基于动态媒体合成的数字媒体企业图书馆管理
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342632
W. K. Bodin, A. M. Grizzaffi
{"title":"Enterprise Library Management for Digital Media with Dynamic Media Synthesis","authors":"W. K. Bodin, A. M. Grizzaffi","doi":"10.1109/ISWPC.2007.342632","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342632","url":null,"abstract":"Media players, personal digital assistants and cell phones are rapidly becoming more adept at rendering media files. Support for a plethora of CODECS can be found even in fairly inexpensive devices. While these devices are becoming increasingly capable of rendering media, the media itself has largely been relegated to prerecorded music, radio and television excerpts, and pay per download entertainment content. This paper is intended to introduce both the concept and the system surrounding digital media in the enterprise realm. This digital media is created dynamically, from enterprise resources, databases, XML data and other repositories. In addition to our innovations that will give corporate users access to enterprise media in a handheld form factor, our research is also focused on globalization, investigating ways in which products can be transformed into multi-lingual offerings to serve a new generation of global business needs","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"134 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":"134577151","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
Coordinator Rotation via Domatic Partition in Self-Organizing Sensor Networks 基于Domatic划分的自组织传感器网络协调器旋转
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342660
R. Misra, C. Mandal, R. Guha
{"title":"Coordinator Rotation via Domatic Partition in Self-Organizing Sensor Networks","authors":"R. Misra, C. Mandal, R. Guha","doi":"10.1109/ISWPC.2007.342660","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342660","url":null,"abstract":"We investigate the problem of energy conservation in ClusterHead rotation in wireless sensor networks. Nodes are battery powered without being replenished, thus maximizing lifetime of network by minimizing energy consumption poses challenge in design of protocols. We argue, though clustering addresses lifetime and scalability goals, it results to an expensive load-balancing scheme based on ClusterHead rotation (i.e. re-clustering).The load balancing technique of existing clustering schemes uses global rotation of ClusterHead roles in order to prevent any single node from complete energy exhaustion. Theoretically, the problem of rotating the responsibility of being a ClusterHead has been abstracted as domatic partitioning problem for maximum cluster-lifetime problem. Instead, this work presents an analysis of its design and implementation aspects. We propose a domatic partitioning based scheme for ClusterHead rotation in clustering protocol. Our self-organizing protocol achieves energy-conservation in achieving local load balancing of nodes. The simulation results demonstrate that our approach outperforms re-clustering in terms of energy consumption, and lifetime parameters","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":"134167494","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
Stateless Data Flow Approach with Void Avoidance for Wireless Ad Hoc and Sensor Networks 无线自组织网络和传感器网络的无状态数据流方法
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342610
M. Soyturk, D. Altilar
{"title":"Stateless Data Flow Approach with Void Avoidance for Wireless Ad Hoc and Sensor Networks","authors":"M. Soyturk, D. Altilar","doi":"10.1109/ISWPC.2007.342610","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342610","url":null,"abstract":"In this paper, we propose a void avoidance algorithm for the stateless weight routing (SWR) algorithm which was developed stateless geographical routing protocol for wireless sensor and ad hoc networks. In order to demonstrate the efficiency of the method we started with the illustration of transmission coverage of relay nodes during the course of routing in the SWR protocol. The threshold value to retransmit a packet defined in the SWR may be used for several purposes including elimination of the void problem. It can be shown that the threshold value provides a tool to balance the tradeoff between energy consumption and reliability.. A number of scenario has been considered to test the performance of the void avoidance (recovery!) algorithm. The initial simulation results indicates the proposed algorithm works with the SWR and providing it with an additional feature of adaptivity for wireless ad hoc and sensor networks.","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":"134349168","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
Local Maximum Avoidance with Correlated Street Blocking for Map-based Geographic Routing in VANETs 基于相关街道阻塞的vanet地图地理路由局部最大回避
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342626
Trung-Tuan Luong, Boon-Chong Seet, Bu-Sung Lee
{"title":"Local Maximum Avoidance with Correlated Street Blocking for Map-based Geographic Routing in VANETs","authors":"Trung-Tuan Luong, Boon-Chong Seet, Bu-Sung Lee","doi":"10.1109/ISWPC.2007.342626","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342626","url":null,"abstract":"Inter-vehicular communication has a large potential to enhance road traffic safety and introduce many new services. Geographic routing is known to be a scalable and robust routing strategy for vehicular ad hoc networks (VANETs). However, VANETs with constrained mobility and frequently encountered radio obstacles often result in geographic routing to enter local maximum, which in turn degrades its performance. In this paper, we investigate different recovery schemes for geographic routing to recover from local maximum in a city environment. In addition, we also introduce a new procedure for nodes to avoid entering local maximum. The proposed avoidance scheme is found to show significant performance improvement in a comparative study of three geographic routing protocols","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"72 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":"133557024","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
Genetic Algorithm Based Approach for Extending the Lifetime of Two-Tiered Sensor Networks 基于遗传算法的两层传感器网络寿命延长方法
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342578
S. Wazed, A. Bari, A. Jaekel, S. Bandyopadhyay
{"title":"Genetic Algorithm Based Approach for Extending the Lifetime of Two-Tiered Sensor Networks","authors":"S. Wazed, A. Bari, A. Jaekel, S. Bandyopadhyay","doi":"10.1109/ISWPC.2007.342578","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342578","url":null,"abstract":"In the past few years, the use of higher power relay nodes as cluster heads in two-tiered sensor networks have been proposed, to achieve various objectives including improved network lifetime. These relay nodes may form a network among themselves and route data towards the base station. In such a model, the lifetime of the network is determined mainly by the lifetime of these relay nodes, which, in turn, is directly affected by the data communication scheme. In this paper, we have proposed a genetic algorithm (GA) based solution for scheduling the data gathering of relay nodes that can significantly extend the lifetime of the relay node network. For smaller networks, where the global optimum can be determined, our GA based approach is always able to find the optimal solution. For larger networks, we have compared our approach with traditional routing schemes and shown that our method leads to significant improvements","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"134 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":"116338205","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}
引用次数: 23
Ad Hoc Network Performance Dynamics - a Study Ad Hoc网络性能动态研究
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342666
H.Pd.B. Pimentel, J. Martins
{"title":"Ad Hoc Network Performance Dynamics - a Study","authors":"H.Pd.B. Pimentel, J. Martins","doi":"10.1109/ISWPC.2007.342666","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342666","url":null,"abstract":"This paper presents a study of wireless ad hoc networks dynamic behavior. Based on some works already done in the area of dimensioning wireless ad hoc networks, we perform some simulations to show what the effects of various changes in the network can do to the its overall performance. Increasing the number of simultaneous streams flowing in the network causes congestion spots especially close to the gateways. However, the addition of more gateways increases the average throughput of the network. The simulation tool employed was network simulator (NS-2)","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":"121845902","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
Analysis of Energy Consumption in Clustered Wireless Sensor Networks 集群无线传感器网络能耗分析
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342577
Bolian Yin, Hongchi Shi, Yi Shang
{"title":"Analysis of Energy Consumption in Clustered Wireless Sensor Networks","authors":"Bolian Yin, Hongchi Shi, Yi Shang","doi":"10.1109/ISWPC.2007.342577","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342577","url":null,"abstract":"Clustering is one of the most important approaches used in wireless sensor networks to save energy. Transmission range affects the clustering and in turn affects the energy consumption in the network. We establish an energy consumption model for clustered wireless sensor networks and solve the optimal transmission range problem. Using this model, the total energy consumption can be estimated beforehand based on the traffic pattern, energy model, and network deployment parameters. This model provides an insight into the energy consumption behavior in clustered wireless sensor networks and the relationship among major factors. The optimal transmission range for energy consumption is a function of the traffic load and the node density, but the effect of node density is very limited","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"157 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":"117306404","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}
引用次数: 51
Dynamic Context Networks of Wireless Sensors and RFID tags 无线传感器和RFID标签的动态上下文网络
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342574
T. Sanchez Lopez, Daeyoung Kim, Kyungseon Min, Joonho Lee
{"title":"Dynamic Context Networks of Wireless Sensors and RFID tags","authors":"T. Sanchez Lopez, Daeyoung Kim, Kyungseon Min, Joonho Lee","doi":"10.1109/ISWPC.2007.342574","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342574","url":null,"abstract":"Current research on pervasive systems envisions a world where computation is not only everywhere, but is also attached to objects and users moving and interacting with the environment. For these mobile computing entities to communicate, wireless links should be evaluated, built and released in a dynamic, intelligent way. In this paper we analyze the specific case of mobile entities augmented with sensor and radio frequency identification (RFID) information. We propose a set of protocols for intelligent building of dynamic context networks, where node interactions are conditionally granted and a shared context is built with the information provided by collaborating entities.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"32 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":"126950518","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}
引用次数: 8
Channel Estimation Algorithms for Uplink OFDMA Tiles 上行OFDMA信道估计算法
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342566
M. Grandmaison, Francois Gagnon
{"title":"Channel Estimation Algorithms for Uplink OFDMA Tiles","authors":"M. Grandmaison, Francois Gagnon","doi":"10.1109/ISWPC.2007.342566","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342566","url":null,"abstract":"OFDM is known to be robust to wireless multipath channels since interferences are alleviated by the frequency-domain signal construction and the use of a cyclic prefix. However, it is still necessary to estimate the channel at each subcarrier position and to equalize the flat fading distortion. In the context of orthogonal frequency division multiple access (OFDMA) where uplink data from multiple users are grouped in a time and frequency structure, the use of conventional channel estimation algorithms based on statistic acquisition is not practical. In this paper, four channel estimation algorithms designed for the high diversity uplink OFDMA tile structure are compared. Simulations results for an averaging algorithm, an interpolation algorithm, a regression algorithm and of a novel method combining both previously mentioned with decision guiding are presented for channel models similar to SUI. The novel two-steps algorithm outperforms other algorithms in terms of bit-error rate. This is observed for a range of coding and modulation configurations and varying the multipath channel conditions","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"78 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":"126587316","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
Analysis of the Performance of Decentralized Sensor Network with Correlated Observations 具有相关观测值的分散传感器网络性能分析
2007 2nd International Symposium on Wireless Pervasive Computing Pub Date : 2007-04-16 DOI: 10.1109/ISWPC.2007.342678
N. Gnanapandithan, B. Natarajan
{"title":"Analysis of the Performance of Decentralized Sensor Network with Correlated Observations","authors":"N. Gnanapandithan, B. Natarajan","doi":"10.1109/ISWPC.2007.342678","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342678","url":null,"abstract":"In this paper, we study the performance of a decentralized sensor network in the presence of correlated additive Gaussian noise. We propose a parallel genetic algorithm approach to simultaneously optimize both the fusion rule and the local decision rules in the sense of minimizing the probability of error. Our results show that the algorithm converges to a majority-like fusion rule irrespective of the degree of correlation and that the local decision rules play a key role in determining the performance of the overall system in the case of correlated observations. We also show that the performance of the system degrades with increase in the correlation between the observations","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"21 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":"122171750","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
首页 上一页
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学术官方微信