2010 8th Annual Communication Networks and Services Research Conference最新文献_第5页

Analytical Approach to Maximize Throughput in Wireless Ad Hoc Networks 无线自组织网络中吞吐量最大化的分析方法

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.59

K. Mnif, Asma Sellami

{"title":"Analytical Approach to Maximize Throughput in Wireless Ad Hoc Networks","authors":"K. Mnif, Asma Sellami","doi":"10.1109/CNSR.2010.59","DOIUrl":"https://doi.org/10.1109/CNSR.2010.59","url":null,"abstract":"The main concerns of network performance are throughput, end-to-end packet delay and packet loss. A high-performance network is characterized by high throughput, small delay, and low packet loss. A larger transmission radius increases the probability of finding a receiver with large progress, but simultaneously increases the probability of collision with other transmissions. Transmission range and the expected progress are pair of design parameters. A short-range transmission is preferred in terms of successful transmission because its avoid collision at the receiver. Long transmission range is favourable in term of: i- it moves a packet the maximum it can in one hop in successful transmission, and ii- the high probability to find a receiver candidate in the progression direction. In this paper, a theoretical model to analyse the one hop throughput with regular structure operating under the CSMA/CA access protocol in wireless ad hoc networks is proposed. We show how we can maximize mean packet progress and mean density of information transport by optimizing the transmission probability and the transmission range. Numerical results show that we can find an optimal transmission range to achieve the highest throughput. An optimal transmission range is essential to limit the energy dissipation on the mobile devices.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127119559","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

Most Wanted Internet Applications: A Framework for P2P Identification 最受欢迎的互联网应用:一个P2P识别框架

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.64

Guthemberg Silvestre, S. Fernandes, C. Kamienski, D. Sadok

引用次数: 4

Analysis and Implementation of a Simple Method to Add Noise to a Channel Using Non-uniform Sampling 一种利用非均匀采样向信道中添加噪声的简单方法的分析与实现

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.50

Brandon C. Brown, M. Kaye, B. Petersen

引用次数: 0

Scheduling and Resource Allocation in LTE Uplink with a Delay Requirement 具有时延要求的LTE上行链路调度与资源分配

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.33

Oscar Delgado, B. Jaumard

{"title":"Scheduling and Resource Allocation in LTE Uplink with a Delay Requirement","authors":"Oscar Delgado, B. Jaumard","doi":"10.1109/CNSR.2010.33","DOIUrl":"https://doi.org/10.1109/CNSR.2010.33","url":null,"abstract":"In this paper, we investigate the problem of schedulingand resource allocation for LTE Single Cell Uplink systemswhich use Single Carrier Frequency Division MultipleAccess (SC-FDMA). SC-FDMA (L-FDMA scheme) has particularscheduling requirements such as limited power consumption and contiguous resource block constraints. This last requirement has been seldom taken into account in the previous scheduling and resource allocation algorithms. In addition, there is also an end-to-end delay requirement concern, which has not yet been investigated in conjunction with block contiguity constraints, in the LTE Uplink scheduling and resource allocation literature.The end-to-end delay is a significant quality of service (QoS) matter; taking into account that it has a notable impact on the number of users that can be effectively served.We provide two new scheduling algorithms that, in additionto the channel contiguity constraint, take also into account the end-to-end delay constraint. Simulations are conducted on traffic instances with up to 144 users and results are compared with two very recently proposed algorithms. Results show that we increase by approximately a factor of 3, the user capacity of the system relative to systems that does not include the end-to-end delay constraint, without sacrificing the user fairness.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127962757","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}

引用次数: 34

Characterizing the Impacts of VPN Security Models on Streaming Video 描述VPN安全模型对流媒体视频的影响

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.60

Shihyon Park, B. Matthews, Danny D'Amours, W. McIver

引用次数: 6

Using Routing Optimization in Next Generation Network to Achieve High QoS 利用下一代网络中的路由优化实现高QoS

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.41

E. Fgee, Abdoelbari Elalo, W. Phillips, A. Elhounie

引用次数: 0

A Topology Control Algorithm with Good Spanner Properties for Wireless Sensor Networks 一种具有良好扳手特性的无线传感器网络拓扑控制算法

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.37

N. Ababneh, Anastasios Viglas, S. Selvadurai, N. Boukhatem

{"title":"A Topology Control Algorithm with Good Spanner Properties for Wireless Sensor Networks","authors":"N. Ababneh, Anastasios Viglas, S. Selvadurai, N. Boukhatem","doi":"10.1109/CNSR.2010.37","DOIUrl":"https://doi.org/10.1109/CNSR.2010.37","url":null,"abstract":"The main design challenge for wireless sensor network solutions is energy efficiency to prolong the network operable lifetime. Since most energy is spent for radio communications, an effective approach for energy conservation is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. Assuming node position information is unavailable we propose an algorithm to construct a sparse spanner network topology for these networks. It uses two-hop neighborhood information to select a subset of nodes to be active among all nodes in the neighborhood. Each node in the network selects its own set of active neighbors from among its one-hop neighbors. This set is determined such that it covers all two-hop neighbors. Our proposed algorithm is proved to achieve several desirable properties on both Euclidean and general weighted graphs: (1) the resulting graph is symmetric and connected; (2) the resulting graph also exhibits good spanner properties for both distance/energy and hops; (3) it is constructed locally in a fully distributed fashion; (4) we prove that on the average-case unit disk graphs, the resulting topology features the bounded degree property; (5) finally, the computation cost of our algorithm is at most O(n^3 ), and the communication cost is bounded by O(n^2 ).","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393730","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

Game-Theory Based User Centric Network Selection with Media Independent Handover Services and Flow Management 基于博弈论的用户中心网络选择与媒体独立切换服务和流量管理

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.40

M. A. Khan, U. Toseef, Stefan Marx, C. Görg

{"title":"Game-Theory Based User Centric Network Selection with Media Independent Handover Services and Flow Management","authors":"M. A. Khan, U. Toseef, Stefan Marx, C. Görg","doi":"10.1109/CNSR.2010.40","DOIUrl":"https://doi.org/10.1109/CNSR.2010.40","url":null,"abstract":"Future envisions universal and uninterrupted access to information owing to the widespread use of heterogeneous wireless technologies. The integration of heterogeneous wireless technologies and existence of multi-mode terminals enable users get associated to the best available networks according to user preferences over different application specific requirements, prices and network technologies. In this paper we present the user-centric network selection decision mechanism, where negotiation between users and network operators is carried out using game-theoretic approach. We model the utility functions of users and network operators in terms of offered prices and service quality. The proposed approach builds on IEEE 802.21standard. Session Initiation Protocol(SIP) and Mobile Internet Protocol (MIPv6) based flow management solutions are given, the later approach is implemented using OPNET modeller simulator. The performance of our approachis compared with Long-term contractual approach in termsof users throughput, users’ cost, operators’ revenue and call blocking probability.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130942494","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

Mobility Model for User's Realistic Behavior in Mobile Ad Hoc Network 移动Ad Hoc网络中用户现实行为的移动性模型

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.27

Shiddhartha Raj Bhandari, G. Lee, N. Crespi

引用次数: 15

Prioritized Access for Emergency Stations in Next Generation Broadband Wireless Networks 下一代宽带无线网络中应急站的优先接入

2010 8th Annual Communication Networks and Services Research Conference Pub Date : 2010-05-11 DOI: 10.1109/CNSR.2010.35

Paul Boone, M. Barbeau, E. Kranakis

引用次数: 3