2008 Proceedings of 17th International Conference on Computer Communications and Networks最新文献_第6页

Adaptive Interference Cancellation: Cancellation Performance vs. Computational Overhead 自适应干扰抵消:抵消性能与计算开销

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.144

Cheolgi Kim, Kyungtae Kang, Joongsoo Ma

{"title":"Adaptive Interference Cancellation: Cancellation Performance vs. Computational Overhead","authors":"Cheolgi Kim, Kyungtae Kang, Joongsoo Ma","doi":"10.1109/ICCCN.2008.ECP.144","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.144","url":null,"abstract":"Superposition interference cancellation (SIC) has been highlighted due to its high spatial reuse efficiency in wireless networks. It exploits superposition aspect of multiple signals to cancel interferences. We present three basic SIC schemes, which are (1) superposition demodulation scheme, (2) superposition decoding scheme and (3) iterative superposition decoding scheme in this paper. When selecting an SIC algorithm among them, the computational overhead and cancellation performance have a trade-off relationship. In a fair communication environment, the receiver can save energy with little loss of cancellation performance by adopting a simple SIC algorithm, such as superposition demodulation. If the network condition looks bad, the node should apply a sophisticated SIC scheme, like iterative superposition decoding, to accommodate near-optimal performance of cancellation. Selecting a different SIC scheme in terms of network condition is called adaptive interference cancellation. The adaptive cancellation scheme draws fairly good interference cancellation performance with relatively low mean computational overhead to save energy consumption.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"39 38","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120865855","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

On the Delivery of Scalable Video over Heterogenous P2P Networks 异构P2P网络上可扩展视频传输的研究

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.169

Y. H. Tan, J. Y. Tham, K. Lye

引用次数: 0

A Power-Preserving Broadcast Protocol for WSNs with DoS Resistance 具有DoS阻力的wsn保电广播协议

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.146

Chien-Chun Ni, Tien-Ruey Hsiang, J. D. Tygar

引用次数: 3

A Novel Anti-Collision Protocol for Energy Efficient Identification and Monitoring in RFID-Enhanced WSNs rfid增强型无线传感器网络节能识别与监控的新型防碰撞协议

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.25

Dheeraj K. Klair, Kwan-Wu Chin

引用次数: 13

Data Gathering Algorithm Based Load Balance for Wireless Sensor Networks 基于负载均衡的无线传感器网络数据采集算法

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.143

Guan Xin, L. Guan

引用次数: 6

Flow-Based Channel Assignment in Channel Constrained Wireless Mesh Networks 信道约束无线Mesh网络中基于流的信道分配

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.89

W. Fu, Bin Xie, Xiaoyuan Wang, D. Agrawal

引用次数: 16

Noise-Aware Energy-Efficient Sensor Binding 噪声感知节能传感器绑定

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.128

N. Tas, C. Sastry, Vania Mesrob

{"title":"Noise-Aware Energy-Efficient Sensor Binding","authors":"N. Tas, C. Sastry, Vania Mesrob","doi":"10.1109/ICCCN.2008.ECP.128","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.128","url":null,"abstract":"Most wireless sensor network (WSN) architectures involve clusters of sensor nodes reporting their sensed data to base stations or sink nodes, and end applications access sensor data from the sink nodes through service-oriented paradigms. One of the key challenges involved in the design of WSN applications through such architectures is the need to conserve the energy of batteries used to power sensor nodes. This is because sensor-to-sink communication takes up the bulk of the available battery power on a sensor node. In this paper, we present a novel strategy for associating a sensor node to one of many possible sink nodes. The problem is approached from an \"energy efficiency\" point of view in a noisy environment. We formulate cost metrics that can be utilized to evaluate what impact both signal to noise ratio (SNR) and interference level have on packet loss when a particular sensor node is associated with a particular sink node. Using these cost metrics, a sink node advices a sensor node wishing to associate with it on what costs would be incurred, and the sensor nodes chooses to bind with the sink node that has the least cost. We then undertake a simulation study to demonstrate the efficacy of our cost metrics towards energy efficiency and show that an implicit added benefit is the distribution of the total load on all the available sink nodes resulting in \"load balancing\".","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116393526","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

On QoS Guarantees with Reward Optimization for Servicing Multiple Priority Classes in Wireless Networks 基于奖励优化的无线网络多优先级服务的QoS保证

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.52

Okan Yilmaz, I. Chen

{"title":"On QoS Guarantees with Reward Optimization for Servicing Multiple Priority Classes in Wireless Networks","authors":"Okan Yilmaz, I. Chen","doi":"10.1109/ICCCN.2008.ECP.52","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.52","url":null,"abstract":"We report performance characteristics of a class of call admission control (CAC) algorithms designed for servicing multiple priority classes in wireless networks with the goal of quality of service (QoS) satisfaction and reward optimization. By reward, we mean some sort of \"value\" obtained by the system as a result of servicing multiple priority classes. In this paper we design and evaluate the performance of anew algorithm, elastic threshold-based CAC, in terms of the maximum reward obtainable with QoS satisfaction from servicing multiple priority classes with distinct QoS requirements, and compare it with existing partitioning, threshold, and spillover CAC algorithms. We also develop a heuristic-based search method to determine the best threshold-value sets used for multiple service classes by sequentially adjusting these thresholds based on the total reward and rejection rate vs. QoS constraints of each service class. We demonstrate through test cases and simulation that elastic threshold-based CAC outperforms existing CAC algorithms for QoS satisfaction and reward optimization in solution optimality for serving multiple QoS service classes in wireless networks.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130233424","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

Web-Based Personalized IPTV Services over NGN 基于网络的个性化IPTV业务

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.136

J. Choi, G. Lee, Hyo-Jin Park

引用次数: 10

On the Connectivity of Finite Wireless Networks with Multiple Base Stations 有限多基站无线网络的连通性研究

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.163

S. Bermudez, S. Wicker

{"title":"On the Connectivity of Finite Wireless Networks with Multiple Base Stations","authors":"S. Bermudez, S. Wicker","doi":"10.1109/ICCCN.2008.ECP.163","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.163","url":null,"abstract":"Connectivity is a basic quality of a network since it is required to obtain useful information out of the network. Research literature has mainly focused on the connectivity of wireless networks having a single connected network. However, due to diverse factors, it is feasible that a wireless network will have multiple base stations or sinks, i.e. it will have infrastructure. In this paper we analyze the connectivity of wireless networks with infrastructure and provide formulas to calculate the probability of having a connected network considering finite number of node platforms. With infrastructure the requirements for having a connected network may be relaxed since there can be more than one single-connected component of a network. Using combinatorics arguments we analyze the connectedness of a one- dimensional network over a line segment as a function of the available infrastructure-base stations and wireless nodes. This paper contains definitions for connected subnetworks that form a connected communication network; it also presents a one-dimensional network model and provides probability formulas for network connectivity for any given base stations arbitrary locations and the number of nodes. Through simulation we show the large increase in the probability of having a connected network when comparing a deployment with two base stations versus one with just one base station. This is of strong relevance when designing a wireless network.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129666437","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