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

2007 Wireless Telecommunications Symposium最新文献

筛选
英文 中文
Explicit Congestion Notification for error discrimination A practical approach to improve TCP performance over wireless networks 显式拥塞通知错误识别是提高无线网络TCP性能的一种实用方法
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563297
M. Alnuem, J. Mellor, R. Fretwell
{"title":"Explicit Congestion Notification for error discrimination A practical approach to improve TCP performance over wireless networks","authors":"M. Alnuem, J. Mellor, R. Fretwell","doi":"10.1109/WTS.2007.4563297","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563297","url":null,"abstract":"Explicit Congestion Notifications are used to notify TCP when imminent congestion is about to happen. In this work we use this feature to design an error discriminator that can be added to a TCP sender to differentiate between congestion drops and drops because of wireless link failure. By distinguishing between error types, TCP can avoid unnecessary cuts of congestion window when non congestion error happens and when the retransmission of lost packets is enough and there is no need to slow down. A set of experiments were conducted to validate this solution. The results show that ECN is a good predictor of imminent congestion and can be used actively in an error discriminator over networks that suffer from low and medium congestions.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116486182","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
Use of non-monotonic utility in multi-attribute network selection 非单调效用在多属性网络选择中的应用
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563334
F. Bari, Victor C. M. Leung
{"title":"Use of non-monotonic utility in multi-attribute network selection","authors":"F. Bari, Victor C. M. Leung","doi":"10.1109/WTS.2007.4563334","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563334","url":null,"abstract":"Network convergence across different access technologies holds a promise of enabling ubiquitous service availability but faces several technical challenges. With anticipated proliferation of multimode IP devices, the optimal selection of a service delivery network among multiple IP based wireless access alternatives is one of the important issues that is actively studied and discussed in several standardization forums. Use of multi attribute decision making (MADM) algorithms has been proposed in the past for network selection decisions in a heterogeneous wireless network environment. A direct comparison of these algorithms is difficult as this would require the use of another MADM algorithm. A better approach instead is to ascertain the appropriateness of the algorithm to the problem space. This paper provides the basis for evaluating the appropriateness of MADM algorithms for network selection. It analyzes the use of MADM algorithms such as TOPSIS, ELECTRE and GRA for network selection and argues that GRA provides the best approach in scenarios where the utilities of some of the attributes are non-monotonic. The paper proposes a novel stepwise approach for GRA that uses multiple reference networks and explains its working with network selection scenarios.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123202231","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}
引用次数: 39
The Cayley Graph implementation in TinyOS for dense wireless sensor networks 用于密集无线传感器网络的TinyOS中的Cayley Graph实现
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563328
Lei Wang, K. Tang
{"title":"The Cayley Graph implementation in TinyOS for dense wireless sensor networks","authors":"Lei Wang, K. Tang","doi":"10.1109/WTS.2007.4563328","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563328","url":null,"abstract":"Wireless sensor network (WSN) consists of a group of sensors or nodes, linked by a wireless medium (infrared or radio frequency) to perform distributed sensing tasks. The dynamic and lossy nature of wireless communication poses major challenges for highly dense WSN. In our previous work, we proposed a new networking topology, the Cayley pseudo-random protocol (Arden, 1991) (Noel, 2006) for large wireless sensor networks. In this paper, we focus on the implementation of Cayley Graph on Crossbow Technology Inc's sensor nodes. The Cayley graph topology is implemented via the TinyOS emulator, Power Tossim. The performance of the network is evaluated in terms of energy consumption, network lifetime and fairness. Comparison is made with the Xmesh protocol and showed that our Cayley graph implementation consumes less power but trade off with fairness in a relatively small amount.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121303985","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
Public display of SMS: Beyond personal social networks and into the realm of public discourse 短信的公开展示:超越个人社交网络，进入公共话语领域
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563338
Linda Yoon
{"title":"Public display of SMS: Beyond personal social networks and into the realm of public discourse","authors":"Linda Yoon","doi":"10.1109/WTS.2007.4563338","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563338","url":null,"abstract":"As ubiquitous personal communication devices, SMS enabled mobile phones have affordances to extend communication beyond the user's personal social network and into the realm of public discourse. The author developed an interaction project, entitled Write a Story, One Line at a Time, in which users collaborated to write an SMS narrative to be displayed in a public space. The system includes visuals, audio, and time-based typography to attract and engage users to participate. Based on an experiment on anonymous public messaging, the author defined the ideas of destructive and constructive messaging. The interaction project focuses on the frameworks for constructive messaging in public. Secondary research on linguistic, social, and psychological effects of SMS informed the development of a reflexive feature for users. Users were observed and briefly interviewed during the prototype demonstration in December of 2006 to gather qualitative user feedback. The paper includes information on hardware, software, and sensor components employed, as well as potential applications of the system.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121439709","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
Efficient resource management of multiple traffic in integrated wireless and mobile networks 无线和移动融合网络中多种流量的高效资源管理
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563337
Wei Shen, Qing-An Zeng, Cheng Zhu
{"title":"Efficient resource management of multiple traffic in integrated wireless and mobile networks","authors":"Wei Shen, Qing-An Zeng, Cheng Zhu","doi":"10.1109/WTS.2007.4563337","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563337","url":null,"abstract":"Any single type of existing wireless and mobile network cannot provide all types of services, e.g., wide coverage and high bandwidth. An integrated wireless and mobile network is introduced by combining different types of networks to provide more comprehensive services. Although an integrated wireless and mobile network provides more connection options for mobile users than a single wireless and mobile network, it also imposes a great challenge to efficiently utilize the resources. Therefore, it may not be suitable to apply existing resource management schemes which mostly are designed to support multiple traffic in a single wireless and mobile network. In this paper, we propose an efficient resource management scheme to support multiple traffic in an integrated wireless and mobile network. The performances of the proposed scheme are evaluated using theoretical model and simulations. Our results show that the proposed scheme can achieve lower blocking probability of voice calls.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"33 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113944569","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
Experiences with the ns-2 network simulator - explicitly setting seeds considered harmful 使用ns-2网络模拟器的经验-明确设置有害的种子
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563316
Martina Umlauft, P. Reichl
{"title":"Experiences with the ns-2 network simulator - explicitly setting seeds considered harmful","authors":"Martina Umlauft, P. Reichl","doi":"10.1109/WTS.2007.4563316","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563316","url":null,"abstract":"The ns-2 network simulator is one of the most widely used packet network simulators. In version 2.1b9 its old random number generator was replaced by an implementation of MRG32k3a to fix sensitivity to seeds. Due to bad documentation and re-use of old scripts many people still use the old API functions to explicitly set seeds. Unfortunately, this corrupts the correct function of the new generator and can lead to correlated simulation results. This might affect the majority of ns-2 simulation results currently published. We show why this is the case, illustrate possible effects, and how to avoid the problem.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116723440","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
Seed node deployment for wireless mesh networks with uncertain subscription 不确定订阅无线网状网络的种子节点部署
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563324
S. M. Allen, R. Whitaker, S. Hurley
{"title":"Seed node deployment for wireless mesh networks with uncertain subscription","authors":"S. M. Allen, R. Whitaker, S. Hurley","doi":"10.1109/WTS.2007.4563324","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563324","url":null,"abstract":"Infrastructure wireless mesh networks promise a flexible and cost-effective means for providing last-mile delivery for broadband access, particularly in rural areas. Each customer forwards traffic between their neighbors and an Internet gateway, thus providing high coverage for little upfront investment. However, particularly during the early stages of deployment, seed nodes may be necessary to provide acceptable levels of coverage. This is particularly problematic since it is generally unknown in advance which households will subscribe. In this paper we present an optimization algorithm for the placement of seed nodes under uncertain user subscription. Experimentation with the algorithm is used to demonstrate the trade-off between coverage and infrastructure investment at various levels of consumer demand.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116341036","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
Security in User-Assisted Communications 用户辅助通信中的安全
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563301
Tong Zhou, L. Harn
{"title":"Security in User-Assisted Communications","authors":"Tong Zhou, L. Harn","doi":"10.1109/WTS.2007.4563301","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563301","url":null,"abstract":"Today, companies called service providers enable communications and control the related infrastructures. However, with increased computing power, advanced wireless technologies and more standardized terminals, users in the future will be able to take more control of communications. In this paper, we define and discuss a disruptive communication model called user-assisted communications (UAC), which allows users to assist other users to establish communications, and propose a method for managing trust and security, which are the most challenging variables in UAC and must be addressed before UAC can be implemented successfully. A social network based trust establishment (SN-TE) is proposed for UAC implementation.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124721769","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
A comparative study on the modified Max-Log-MAP turbo decoding by extrinsic information scaling 基于外部信息缩放的改进Max-Log-MAP turbo译码的比较研究
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563294
Mustafa Taskaldiran, R. Morling, I. Kale
{"title":"A comparative study on the modified Max-Log-MAP turbo decoding by extrinsic information scaling","authors":"Mustafa Taskaldiran, R. Morling, I. Kale","doi":"10.1109/WTS.2007.4563294","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563294","url":null,"abstract":"A simple but effective technique to improve the performance of the Max-Log-MAP algorithm is to scale the extrinsic information exchanged between two MAP decoders. A comprehensive analysis of the selection of the scaling factors according to channel conditions and decoding iterations is presented in this paper. Choosing a constant scaling factor for all SNRs and iterations is compared with the best scaling factor selection for changing channel conditions and decoding iterations. It is observed that a constant scaling factor for all channel conditions and decoding iterations is the best solution and provides a 0.2-0.4 dB gain over the standard Max-Log-MAP algorithm. Therefore, a constant scaling factor should be chosen for the best compromise.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129373915","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}
引用次数: 11
Modeling of media gateway nodes for next generation networks based on Markov reward models 基于马尔可夫奖励模型的下一代网络媒体网关节点建模
2007 Wireless Telecommunications Symposium Pub Date : 2007-04-26 DOI: 10.1109/WTS.2007.4563295
D. Radev, I. Lokshina
{"title":"Modeling of media gateway nodes for next generation networks based on Markov reward models","authors":"D. Radev, I. Lokshina","doi":"10.1109/WTS.2007.4563295","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563295","url":null,"abstract":"This paper is devoted to modeling and analysis of media gateway nodes for the next generation networks based on Markov reward models. The bandwidth sharing policy with partial overlapped transmission link is considered. Calls arriving to the link that belong to VBR and ABR traffic classes, are presented as independent Poisson processes and Markov processes with constant intensity or random input stream, and exponential service delay time. Service delay time is defined according to MRM. Compression of traffic classes with partial overlapped transmission link is calculated using vector quantification. Simulation and numerical examples are shown.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122542643","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
首页 上一页 下一页 尾页
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学术官方微信
小红书