2006 1st International Symposium on Wireless Pervasive Computing最新文献_第5页

Periodic Spectrum Transmission for Single-Carrier Frequency-Domain Equalization Employing Space-Time Transmit Diversity 利用空时发射分集实现单载波频域均衡的周期频谱传输

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613604

H. Yoshida, T. Kuriyama, F. Maehara, F. Takahata

引用次数: 1

Aspects of cellular planning for emergency and safety services in mobile WiMax networks 移动WiMax网络应急和安全服务的蜂窝规划方面

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613643

F. Velez, V. Carvalho, D. Santos, R. P. Marcos, R. Costa, P. Sebastião, A. Rodrigues

{"title":"Aspects of cellular planning for emergency and safety services in mobile WiMax networks","authors":"F. Velez, V. Carvalho, D. Santos, R. P. Marcos, R. Costa, P. Sebastião, A. Rodrigues","doi":"10.1109/ISWPC.2006.1613643","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613643","url":null,"abstract":"This work addresses cellular planning aspects for a WiMax (worldwide interoperability for microwave access) point-to-multipoint wireless network to be developed in the region of Beira Interior. It is concentrated in more detail in the district of Covilha, and, particularly, in the urban area of the city, in order to guarantee communications from the Health Science Faculty of University of Beira Interior (HSF/UBI)/ Hospital Pero da Covilha to all central urban area of the city. By having aspects related with the carrier-to-noise and carrier-to-interference ratios into account, one concluded that it is necessary to consider a cellular structure with sectorisation, and cell coverage distances around 3 km. Because this zone is very hilly, the optimization of the choice of the location for base stations is essential; the potentialities of the GIS (geographic information systems) tools were explored to optimise the existence of line of sight coverage in coverage. Future research directions regarding architectures for interoperability and mobile IP, security, and the impact of multimedia applications are also addressed.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126823520","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

Asymmetric multihop communication in large sensor networks 大型传感器网络中的非对称多跳通信

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613561

J. Neander, E. Hansen, M. Nolin, M. Bjorkman

引用次数: 38

A distributed hybrid algorithm for broadcasting through a virtual backbone in wireless ad hoc networks 无线自组织网络中通过虚拟骨干网进行广播的一种分布式混合算法

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613595

D. Yuan

引用次数: 2

A Query Processing Mechanism Based on the Broadcast Queue for Broadcast Database Systems 广播数据库系统中基于广播队列的查询处理机制

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613667

S. Kitajima, Jing Cai, T. Terada, T. Hara, S. Nishio

{"title":"A Query Processing Mechanism Based on the Broadcast Queue for Broadcast Database Systems","authors":"S. Kitajima, Jing Cai, T. Terada, T. Hara, S. Nishio","doi":"10.1109/ISWPC.2006.1613667","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613667","url":null,"abstract":"In recent years, there has been an increasing interest in the broadcast database system, where the server periodically broadcasts contents of a database to mobile clients such as PDAs. There are three query processing methods in the broadcast database system: (i) the server processes a query and then broadcasts the query result to the client; (ii) the client stores all data that are necessary in processing the query and then processes it locally; and (iii) the server and the client collaborate in processing the query. Since the performance of each method changes according to the situation, such as the interval of query generation and the size of query results, it is difficult to decide the optimal method among them statically. In this paper, we propose a new query processing method which dynamically changes the order of queries submitted in the queue at the server and also changes processing methods for the queries according to the deadline of queries and the system situation. Our method not only improves the response time but also increases the success rate of query processing compared with the traditional methods.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123798864","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

Enhanced layer-3 handover using the layer-2 triggers 使用第二层触发器增强第三层切换

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613584

Seung-Hun Oh, Young Han Kim, Jong Hwa Lee

引用次数: 0

Blind turbo multiuser detector with unknown intercell interferences 具有未知小区间干扰的盲涡轮多用户检测器

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613650

T. Ploysuwan, P. Teekaput

{"title":"Blind turbo multiuser detector with unknown intercell interferences","authors":"T. Ploysuwan, P. Teekaput","doi":"10.1109/ISWPC.2006.1613650","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613650","url":null,"abstract":"We consider the problem of iterative blind multiuser detection for multi-input-multi-output (MIMO) systems, which consist of K uplink asynchronous DS-CDMA users and n/sub R/ receive antennae, in presence of both intra- and intercell interference. The proposed receiver typically has only the knowledge of the first spreading codes of K/sub in/ /spl les/ K users inside the cell and ignore unknown interference of K - K/sub in/ users outside the cell. The proposed schemes in this paper present two types of iterative blind receivers motivated from the concept of generalized sidelobe canceller (GSC) to separate the problem into two components one in constrained subspace (inner cell space : H/sub in/) and one orthogonal to it (unknown interference plus noise space). The knowledge of intracell channel matrix H/sub in/ is required for our algorithms. So, two types of blind channel estimation both subspace and POR (power of R) methods are used for comparative performances as channel estimation and bit error rate (BER) of iterative receiver. The proposed detectors utilize the computation of log likelihood ratios (LLRs) fed from their turbo decoders at previous iteration to blindly suppress intracell interferences and residuals interferences left by iterative process. The computations of LLRs from iterative blind multiuser detector are refined to their turbo decoders by iterative fashions.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125443311","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

Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm 具有自适应ID重分配的最低ID:一种新的移动自组织网络聚类算法

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613559

D. Gavalas, G. Pantziou, C. Konstantopoulos, B. Mamalis

{"title":"Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm","authors":"D. Gavalas, G. Pantziou, C. Konstantopoulos, B. Mamalis","doi":"10.1109/ISWPC.2006.1613559","DOIUrl":"https://doi.org/10.1109/ISWPC.2006.1613559","url":null,"abstract":"Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mobility) and optimize initial clustering. However, in many situations (e.g. in relatively static topologies) re-clustering procedure is hardly ever invoked; hence initially elected CHs soon reach battery exhaustion. Herein, we introduce an efficient distributed clustering algorithm that uses both mobility and energy metrics to provide stable cluster formations. CHs are initially elected based on the time and cost-efficient lowest-ID method. During clustering maintenance phase though, node IDs are re-assigned according to nodes mobility and energy status, ensuring that nodes with low-mobility and sufficient energy supply are assigned low IDs and, hence, are elected as CHs. Our algorithm also reduces control traffic volume since broadcast period is adjusted according to the nodes mobility pattern: we employ infrequent broadcasting for relative static network topologies, and increase broadcast frequency for highly mobile network configurations. Simulation results verify that energy consumption is uniformly distributed among network nodes and that signaling overhead is significantly decreased.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129709461","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}

引用次数: 36

Mobile semantic data exchange in ad hoc networks using distributed profiles 使用分布式配置文件的自组织网络中的移动语义数据交换

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613649

A. Baumgart, H. Knapp, M. Schader

引用次数: 1

A wireless service for product authentication in mobile RFID environment 一种用于移动RFID环境下产品认证的无线服务

2006 1st International Symposium on Wireless Pervasive Computing Pub Date : 2006-04-10 DOI: 10.1109/ISWPC.2006.1613660

Ju-Han Kim, Howon Kim

引用次数: 21