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

2006 IFIP International Conference on Wireless and Optical Communications Networks最新文献

筛选
英文 中文
Topology discovery and path provisioning in SONET rings using GMPLS 使用GMPLS的SONET环中的拓扑发现和路径配置
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666645
Sourav Das
{"title":"Topology discovery and path provisioning in SONET rings using GMPLS","authors":"Sourav Das","doi":"10.1109/WOCN.2006.1666645","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666645","url":null,"abstract":"In the light of many mergers and acquisitions in the world of optical transport network, distributed control of SONET/SDH rings using GMPLS has become an important entity. The main requirements are topology discovery, path computation and connection control in the multi-vendor SONET/SDH networks utilizing the in-built protection capabilities of SONET/SDH topologies. In this paper we are explicitly taking up these requirements and making small changes in the OSPF-TE LSA processing rules and RSVP-TE signaling mechanism. To show its application, we take up an example TDM network consisting of 2F BLSR, 1:1 linear, 1+1 linear, unprotected, 4F BLSR and UPSR. We then show how each of the links in the example network is advertised with our changes to enable a remote node or EMS/NMS to discover the topology automatically for each network segment. We also show the creation of path automatically in the same way as the creation of LSP in an MPLS based IP networks. We mention when and where detour LSP setup is required to provide protection and when and how it is taken care by the underlying protection scheme of SONET/SDH","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209094","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
Motion estimation method for video compression - an overview 视频压缩的运动估计方法。概述
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666680
M. Manikandan, P. Vijayakumar, N. Ramadass
{"title":"Motion estimation method for video compression - an overview","authors":"M. Manikandan, P. Vijayakumar, N. Ramadass","doi":"10.1109/WOCN.2006.1666680","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666680","url":null,"abstract":"Efficient motion estimation is an important problem because it determines the compression efficiency and complexity of a video encoder. Motion estimation can be formulated as an optimization problem. This paper starts with an introduction of basic motion estimation problem and discusses issues specific to video motion estimation of two types FSBME & VSBME estimations. This paper in three sections presents a overview of block matching ME problem in three directions: 1.) computation complexity reduction; 2.) accurate representation of true motion and 3.) improving coding efficiency","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132973905","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}
引用次数: 14
Multiple attempt node-disjoint multipath routing for mobile ad hoc networks 移动自组织网络的多尝试节点分离多路径路由
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666629
A. Mohammad Abbas, S. Istyak
{"title":"Multiple attempt node-disjoint multipath routing for mobile ad hoc networks","authors":"A. Mohammad Abbas, S. Istyak","doi":"10.1109/WOCN.2006.1666629","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666629","url":null,"abstract":"Identifying multiple node-disjoint paths between a given source and a destination is a challenging issue in mobile ad hoc networks. One cannot guarantee to identify multiple node-disjoint paths in a single route discovery. However, one can identify multiple node-disjoint paths in multiple attempts in an incremental fashion. In this paper, we propose an improved version of a protocol to identify multiple node-disjoint paths between a given source and a destination. We have analytically shown that our version consumes less number of route discoveries than that required by existing protocols","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270549","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
Performance evaluation of a routing protocol for wireless sensor networks 无线传感器网络路由协议的性能评估
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666616
S. Miremadi, M. Fazeli, A. Patooghy, S. Miremadi
{"title":"Performance evaluation of a routing protocol for wireless sensor networks","authors":"S. Miremadi, M. Fazeli, A. Patooghy, S. Miremadi","doi":"10.1109/WOCN.2006.1666616","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666616","url":null,"abstract":"A wireless sensor network with a large number of small sensor nodes can be used as an effective tool for gathering data in various situations. Energy is a critical resource in wireless sensor networks and system lifetime needs to be prolonged through the use of energy-aware strategies during system operation. Routing protocols in WSNs might differ depending on the application and network architecture. Many routing protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The aim of this paper is to evaluate the efficiency of a routing protocol named directed flooding which is a fault-tolerant and energy efficient routing protocol for wireless sensor networks. This protocol is based on the flooding routing protocol, in which energy consumption is decreased and levels of fault-tolerance is increased. This is done by sending data in a specific aperture instead of broadcasting, which is used in the traditional flooding algorithm. A simulator is developed for evaluation of this protocol. The results of simulation are presented and analyzed","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121735189","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 robust and low-complexity timing synchronization algorithm for ADSRC system ADSRC系统的一种鲁棒低复杂度定时同步算法
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666604
H. T. Anh, Jinsang Kim, W.-K. Cho, Jongchan Choi, Kitaek Lim, Jaemin Kwak
{"title":"A robust and low-complexity timing synchronization algorithm for ADSRC system","authors":"H. T. Anh, Jinsang Kim, W.-K. Cho, Jongchan Choi, Kitaek Lim, Jaemin Kwak","doi":"10.1109/WOCN.2006.1666604","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666604","url":null,"abstract":"In this paper, a robust, low-complexity timing synchronization algorithm suitable for 5.9 GHz dedicated short range communications (DSRC) system is proposed. The proposed method uses cross-correlation technique to detect the starting point of both a short training symbol and the guard interval of the first long training symbol. This allows the proposed algorithm to have low-complex architecture. Compared to the scheme proposed by Chang and Kelly, the proposed algorithm attains considerably higher timing synchronization performance and significantly reduced computational complexity. Simulation results show that the proposed algorithm is robust and efficient in high-mobility environments and low signal-to-noise ratio (SNR) conditions","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121531939","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
Analysis of a new fixed channel allocation scheme for a sectorized GSM cellular network 一种新的GSM分界蜂窝网络固定信道分配方案分析
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666531
S. Tokekar, N. Purohit
{"title":"Analysis of a new fixed channel allocation scheme for a sectorized GSM cellular network","authors":"S. Tokekar, N. Purohit","doi":"10.1109/WOCN.2006.1666531","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666531","url":null,"abstract":"A GSM cellular network contains many cells which are connected to a main control unit called main switching centre (MSC). Each cell is responsible to provide a wireless duplex channel to mobile users of its area. The circuitry used at cells for the above purpose is called base transreceiver station (BTS). The channels in wireless networks are a scare resource thus the allotment of channels to the cells has a greater impact on the traffic performance of the network. It is shown that in terms of traffic capacity the dynamic channel allocation (DCA) algorithms outperform other algorithms (A. Boukerche et al., 2004). But they require heavy signaling and increases delay in channel allocation to the users. On the other hand fixed channel allocation (FCA) is simplest and fastest but have poor traffic capacity due to non uniform nature of the traffic in cellular networks. In some practical scenario neither of these techniques works satisfactory e.g. if one or more low traffic cells are located with heavy traffic surrounding cells; the reasons may be geographical (e.g. a lake exists in centre of city), social (e.g. a low profile area) or any other. In this work we have proposed a new FCA scheme for channel allocation in such scenario. The analysis is done for a sectorized GSM network. We are not addressing the problem of temporary hot spots but we are analyzing the long term traffic imbalance. It is observed that there exits a tradeoff between enhancement in grade of service (GOS) so achieved and the degradation in the voice quality received by cochannel users. This tradeoff is addressed in this work","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122498813","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}
引用次数: 13
An adaptive congestion control scheme in CDMA cellular systems CDMA蜂窝系统中的自适应拥塞控制方案
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666578
Wei Wang, Xin Zhang, Yongyu Chang, Dacheng Yang
{"title":"An adaptive congestion control scheme in CDMA cellular systems","authors":"Wei Wang, Xin Zhang, Yongyu Chang, Dacheng Yang","doi":"10.1109/WOCN.2006.1666578","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666578","url":null,"abstract":"In this paper, we propose an adaptive congestion control scheme that consists of base station algorithm and mobile algorithm. This paper focuses on scenario in which all mobiles are best-effort data users except real-time voice mobiles. With the proposed scheme, all data mobiles simultaneously adjust their rates in a deterministic manner according to the average increment or decrease for transmission rates set by the basis of the residual capacity of the system load. Simulations are performed to evaluate the effectiveness of the congestion control scheme using realistic system parameters. It is proved by system level simulations that the proposed adaptive congestion scheme can enlarge system throughput while guaranteeing the quality of service of systems","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132236035","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
Optimal channel allocation in wireless LAN 无线局域网中最优信道分配
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666539
S. Benson, Edwin Raj, Susan Jacob
{"title":"Optimal channel allocation in wireless LAN","authors":"S. Benson, Edwin Raj, Susan Jacob","doi":"10.1109/WOCN.2006.1666539","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666539","url":null,"abstract":"Wireless local area networks (WLANs) or the IEEE 802.11 networks are one of the most popular mediums for interconnecting portable devices. All the stations communicating over WLANs share a common wireless channel. In order to avoid potential collisions, an RTS-CTS handshake procedure is used to acquire the channel. However, most of the existing channel reservation protocols in WLANs view the wireless channel capacity as time invariant for each station which results in poor channel utilization. This paper introduces a handshake based channel aware MAC protocol that assigns the channel according to its fading status observed by each station while ensuring fairness in the access of the channel by all the stations. The uplink and downlink flows are also equalized. This protocol improves the channel utilization and also reduces the packet error rate","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115677874","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 circular layer location management scheme for mobile adhoc networks 一种用于移动自组网的圆形层位置管理方案
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666537
S. Bandyopadhyay, K. Majumder, B. Ghosal
{"title":"A circular layer location management scheme for mobile adhoc networks","authors":"S. Bandyopadhyay, K. Majumder, B. Ghosal","doi":"10.1109/WOCN.2006.1666537","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666537","url":null,"abstract":"The characteristics of mobile adhoc network (MANET), has made the design of efficient routing protocols a critical research challenge. Use of location information in routing is often proposed as a means to achieve scalability. The major issue in location based routing is effective implementation of location management functions so as to reduce the costs associated with them. In this paper, we propose circular layer location management (CLLM) scheme which employs circular layer architecture and multigrained location information organization. Here we show that following our scheme, we can achieve a good asymptotic bound for both location updation and query costs","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114250945","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
Design and analysis of secure transmission of IP over DVB-S/RCS satellite systems 基于DVB-S/RCS卫星系统的IP安全传输设计与分析
2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI: 10.1109/WOCN.2006.1666577
P. Pillai, Yim-Fun Hu
{"title":"Design and analysis of secure transmission of IP over DVB-S/RCS satellite systems","authors":"P. Pillai, Yim-Fun Hu","doi":"10.1109/WOCN.2006.1666577","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666577","url":null,"abstract":"Digital video broadcasting (DVB) technology can be used for providing Internet protocol (IP) based services along with audio and video broadcasting. A new protocol, called unidirectional lightweight protocol (ULE) has been defined by the IETF for the transport of IP datagrams over DVB. ULE provides several benefits over the existing mechanisms used in DVB for transporting IP data. This paper describes an extension to the ULE protocol to provide security for IP services over DVB. The different security requirements for IP over DVB services are discussed. The mechanisms and security extensions for ULE to satisfy these requirements are described. Simulation results are also presented to show the impact of these security mechanisms on the IP traffic","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114061681","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信