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

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.最新文献

筛选
英文 中文
Effect of localized optimal clustering for reader anti-collision in RFID networks: fairness aspects to the readers 局部最优聚类对RFID阅读器防碰撞的影响:对阅读器的公平性
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523923
Joongheon Kim, Wonjun Lee, Jieun Yu, Jihoon Myung, Eunkyo Kim, Choonhwa Lee
{"title":"Effect of localized optimal clustering for reader anti-collision in RFID networks: fairness aspects to the readers","authors":"Joongheon Kim, Wonjun Lee, Jieun Yu, Jihoon Myung, Eunkyo Kim, Choonhwa Lee","doi":"10.1109/ICCCN.2005.1523923","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523923","url":null,"abstract":"This paper proposes an adaptive and dynamic localized scheme unique to hierarchical clustering in RFID networks, while reducing the overlapping areas of clusters and consequently reducing collisions among RFID readers. Drew on our LLC scheme that adjusts cluster coverage to minimize energy consumption, low-energy localized clustering for RFID networks (LLCR) addresses RFID reader anti-collision problem in this paper. LLCR is a RFID reader anti-collision algorithm that minimizes collisions by minimizing overlapping areas of clusters that each RFID reader covers. LLCR takes into account each RFID reader's energy state as well as RFID reader collisions. For the energy state factor, we distinguish homogeneous RFID networks from heterogeneous ones according to computing power of each RFID reader. Therefore, we have designed efficient homo-LLCR and hetero-LLCR schemes for each case. Our simulation-based performance evaluation shows that LLCR minimizes energy consumption and overlapping areas of clusters of RFID readers.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132038019","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}
引用次数: 50
V2 over IP: telecom service application and operational architecture to support video and voice V2 over IP:支持视频和语音的电信业务应用和运营架构
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523927
Wei Liu, E. K. Park
{"title":"V2 over IP: telecom service application and operational architecture to support video and voice","authors":"Wei Liu, E. K. Park","doi":"10.1109/ICCCN.2005.1523927","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523927","url":null,"abstract":"We have researched the key functional and operational support architecture in IP-based packet voice and video (V2) telecommunication services. This paper summarizes solutions to a number of challenges that the telecom industry has to answer in order to rollout carrier-grade services capability with mass-market acceptance. With a main focus on incorporating the architecture solutions and feature capabilities, we have developed next-generation V2 over IP telecom solution architecture with interoperability and transformation as the key objectives. Advantages of our architecture solutions include meeting legacy service expectation, providing distinctive network and service management, as well as facilitating across telecom industry integration with a uniform approach.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130776409","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
Efficient forwarding of symbolically addressed geocast messages 有效地转发符号寻址的地球广播消息
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523812
Frank Dürr, C. Becker, K. Rothermel
{"title":"Efficient forwarding of symbolically addressed geocast messages","authors":"Frank Dürr, C. Becker, K. Rothermel","doi":"10.1109/ICCCN.2005.1523812","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523812","url":null,"abstract":"Geocast is used to send messages to all hosts located in a geographic area. This target area can be defined either by geometric figures like polygons or by symbolic addresses like city names or room numbers. Geographic routing algorithms, which forward messages based on geographic information, can be used to forward geocast messages. If routing of symbolically addressed messages is based on geometric coordinates, complex mappings between symbolic addresses and their geometric extent as well as complex geometric operations are required. Therefore, we propose a routing algorithm for symbolically addressed geocast messages that operates directly on a symbolic location model. This approach does not require any geometric information for message forwarding, and forwarding decisions can be realized efficiently by comparably simple operations.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116161055","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
A balanced key tree approach for dynamic secure group communication 动态安全组通信的平衡密钥树方法
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523882
Geng Hao, N. V. Vinodchandran, B. Ramamurthy, X. Zou
{"title":"A balanced key tree approach for dynamic secure group communication","authors":"Geng Hao, N. V. Vinodchandran, B. Ramamurthy, X. Zou","doi":"10.1109/ICCCN.2005.1523882","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523882","url":null,"abstract":"Logical key hierarchy (LKH) is a promising solution to handle group key distribution in secure group communication. Several recent studies have investigated different approaches to reduce the re-keying cost of LKH. For certain group communication applications, such as the subscription pay TV; a member's departure time is available when the member joins the group. The proposed scheme aims to improve the re-keying cost for such applications. It uses a combination of an AVL tree and a binary search tree called the leaving tree as the topology of its key tree. Both the AVL tree and the leaving tree are searchable by members' departure times. Our analysis shows that the average costs in terms of the number of key updates for the member join and leave are O(logn) and O(loglog n), respectively. Our simulation results show that the proposed scheme achieves better performance than other balanced tree based solutions.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130625640","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}
引用次数: 10
A simulation study on the performance evaluation of UMTS with multi-service 多业务UMTS性能评估的仿真研究
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523949
Ling Luo, Jianjun Yang, Kangsheng Chen
{"title":"A simulation study on the performance evaluation of UMTS with multi-service","authors":"Ling Luo, Jianjun Yang, Kangsheng Chen","doi":"10.1109/ICCCN.2005.1523949","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523949","url":null,"abstract":"UMTS system supports a variety of services and applications, providing high data rate access to mobile terminals and cross-domain services to the users. It is divided into two groups: radio access network (RAN) and core network. Simulation results and experimental analysis helps to evaluate the performance, in which the simulation code designed on the top of UMTS networks.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130873432","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
Sparsely hubbed light-trail grooming networks 稀疏中心的轻轨梳理网络
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523860
Srivatsan Balasubramanian, Arun Kumar Somani, A. Kamal
{"title":"Sparsely hubbed light-trail grooming networks","authors":"Srivatsan Balasubramanian, Arun Kumar Somani, A. Kamal","doi":"10.1109/ICCCN.2005.1523860","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523860","url":null,"abstract":"Recently, a new architecture called light-trails has been proposed that provides a novel control and management solution to address IP-centric issues at the optical layer. By inclusion of simple hardware that performs drop and continue functionality, overlaid with a light-weight control protocol, light-trails enable efficient sharing of network resources, improve bandwidth utilization and minimize network costs. Due to power budget constraints in such networks, it may not always be possible to have end to end communication in pure optical domain and requests may be required to traverse multiple intermediate transit points called hub nodes before reaching the final destination. The hub nodes need to be equipped with special hardware for switching and grooming connections. We investigate the problem of designing networks where such hubs are sparsely located. We show through our simulation results that by carefully designing heuristics for hub node placement and trail routing, it is possible to achieve high throughput with minimal number of hub nodes.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124107875","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}
引用次数: 9
A scalable mutual exclusion algorithm for mobile ad hoc networks 移动自组织网络的可扩展互斥算法
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523834
Weigang Wu, Jiannong Cao, Jin Yang
{"title":"A scalable mutual exclusion algorithm for mobile ad hoc networks","authors":"Weigang Wu, Jiannong Cao, Jin Yang","doi":"10.1109/ICCCN.2005.1523834","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523834","url":null,"abstract":"Mobile ad hoc networks (MANETs) introduce new challenges to designing algorithms for solving the distributed mutual exclusion (MUTEX) problem. In this paper we propose the first permission-based MUTEX algorithm for MANETs. In order to reduce the messages cost, the algorithm uses the so called \"look-ahead\" technique, which enforces MUTEX only among the hosts currently competing for the critical section (CS). We propose mechanisms to handle the \"doze\" mode and \"disconnection\" of mobile hosts. The constraint of FIFO channel, which is not feasible in MANETs, is also relaxed. Using timeout, a fault tolerance mechanism is introduced to tolerate transient link and host failures. The simulation results show that the proposed algorithm works well under various mobility levels, load levels and system scales, especially when the mobility is high or load level is low. It is also shown that the algorithm has good scalability, especially when most of the requests come from a few active hosts.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"51 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126356386","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}
引用次数: 16
A modified random way-point model equalized for the node crowding effect 一个改进的随机路径点模型均衡了节点拥挤效应
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523806
Ahamed Khan Mohammed
{"title":"A modified random way-point model equalized for the node crowding effect","authors":"Ahamed Khan Mohammed","doi":"10.1109/ICCCN.2005.1523806","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523806","url":null,"abstract":"The problem of crowding of nodes in the center of the simulation area in the random way-point mobility model for ad hoc networks is addressed in this paper. A novel method is proposed to make the distribution of nodes uniform. This is achieved by making the pause time of the nodes dependent on their pause location. Closed form expressions for the pause times as functions of spatial coordinates are derived and validated through simulations. Employing this modified model will remove any artifacts in simulation results which may arise due to nodes crowding in the center of the simulation area. The modification to the random way-point model is simple and can be easily incorporated in simulators such as ns-2 and GloMoSim.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134227971","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
Coverage-based probabilistic forwarding in ad hoc routing 自组织路由中基于覆盖的概率转发
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523798
Hui Ling, D. Mossé, T. Znati
{"title":"Coverage-based probabilistic forwarding in ad hoc routing","authors":"Hui Ling, D. Mossé, T. Znati","doi":"10.1109/ICCCN.2005.1523798","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523798","url":null,"abstract":"Flooding is commonly used in reactive ad hoc routing protocols. Although simple and effective, flooding may incur excessive overhead. In order to reduce unnecessary rebroadcasts, probabilistic gossiping schemes have been proposed. These schemes, however, do not usually adapt the probability of forwarding to time-varying features of the network. To address this shortcoming, four new heuristics to adapt forwarding probability to coverage area and/or topology information are proposed. We show through simulations that the proposed schemes can reduce the number of routing requests by up to 35% compared with existing schemes, while delivering approximately the same amount of data packets.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134246126","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}
引用次数: 15
The impact of multi-homing on network reliability and stability: a case study 多归巢对网络可靠性和稳定性的影响:一个案例研究
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523934
Hyo-Jeong Shin, Dan Pei, Mohit Lad, Yanghee Choi, Lixia Zhang
{"title":"The impact of multi-homing on network reliability and stability: a case study","authors":"Hyo-Jeong Shin, Dan Pei, Mohit Lad, Yanghee Choi, Lixia Zhang","doi":"10.1109/ICCCN.2005.1523934","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523934","url":null,"abstract":"The number of multi-homed user sites has been rapidly increasing in recent years, where a campus or company network is connected to multiple Internet service providers' networks to improve Internet service reliability. In this paper, we examine the impact of multi-homing via BGP on routing stability and network reliability. More specifically, we compare single-homed prefixes with multi-homed prefixes in terms of the number of routing update messages and the duration of unreachability. Our results show that, on average, single-homed prefixes both generates fewer routing updates than multi-homed prefixes, and provide higher reliability than 97% of multi-homed prefixes (which have a low degree of multi-homing). These results suggest the need to further improve BGP's stability to enable Internet users to gain the expected reliability benefit from multi-homing.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131626554","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
首页 上一页 下一页 尾页
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学术官方微信