2010 Second International Conference on Computer and Network Technology最新文献

筛选
英文 中文
Shared Situation Awareness System Architecture for Network Centric Environment Decision Making 面向网络中心环境决策的共享态势感知系统架构
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.16
H. Parvar, M. Fesharaki, B. Moshiri
{"title":"Shared Situation Awareness System Architecture for Network Centric Environment Decision Making","authors":"H. Parvar, M. Fesharaki, B. Moshiri","doi":"10.1109/ICCNT.2010.16","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.16","url":null,"abstract":"Having full and accurate situation awareness is a critical foundation of successful decision-making in network centric environments. Virtual collaboration, virtual organization and people coordination are the result of Situation awareness in net centric systems. On the other hand, having situation awareness reduces operation cost and risk and increases speed of responsibility, speed of operation and total performance of decision makers. In this paper, we present a new architecture to provide shared situation awareness for net centric decision-making using multi-resolution level architecture. In this system decision-maker requests the needed information and the system provides the requested information and situation awareness for decision-making. According to this architecture, knowledge organization, activity principles, theoretical approach for design, control and software engineering provide for shared situation awareness system.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125926960","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}
引用次数: 8
Effect of Aggregate Shape on Skid Resistance of Compacted Hot Mix Asphalt (HMA) 集料形状对压实热拌沥青抗滑性能的影响
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.78
S. M. R. Shah, M. E. Abdullah
{"title":"Effect of Aggregate Shape on Skid Resistance of Compacted Hot Mix Asphalt (HMA)","authors":"S. M. R. Shah, M. E. Abdullah","doi":"10.1109/ICCNT.2010.78","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.78","url":null,"abstract":"Characteristics of pavement surface play an important role in both the safety and comfort of drivers. Inadequate friction or skid resistance can lead to road accidents due to skidding. Aggregates properties such as size, shape, texture and gradation play an important part in providing friction or skid resistance on a pavement surface. This paper evaluates the effect of coarse aggregate shape on the skid resistance of compacted asphalt concrete mixtures. Three different mixes of ACW20 were designed using different shape of coarse aggregate: angular, elongated and flaky. Laboratory study was performed on the compacted wearing course mixture to evaluate the effect of aggregate shape on its properties. The performance evaluation measured included skid resistance, Marshall Stability and flow. The results of this study show that the strength and skid resistance varies with aggregate shape. The angular shape demonstrated the best skid resistance whereas mixes with flaky aggregates were shown to have the lowest stability and skid resistance.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124150165","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}
引用次数: 8
Performance Analysis of MUSIC and ESPRIT DOA Estimation Algorithms for Adaptive Array Smart Antenna in Mobile Communication 移动通信中自适应阵列智能天线MUSIC和ESPRIT DOA估计算法的性能分析
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.45
T. Lavate, V. K. Kokate, A. Sapkal
{"title":"Performance Analysis of MUSIC and ESPRIT DOA Estimation Algorithms for Adaptive Array Smart Antenna in Mobile Communication","authors":"T. Lavate, V. K. Kokate, A. Sapkal","doi":"10.1109/ICCNT.2010.45","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.45","url":null,"abstract":"Adaptive array smart antenna involves the array processing to manipulate the signals induced on various antenna elements in such way that the main beam directing towards the desired signal and forming the nulls towards the interferers. Such smart antennas are widely used in wireless mobile communications as they can increase the channel capacity and coverage range. In adaptive array smart antenna, to locate the desired signal, various direction of arrival (DOA) estimation algorithms are used. This paper investigates and compares MUSIC and ESPRIT, DOA estimation algorithms which are widely used in the design of smart antenna system. MUSIC and ESPRIT algorithms provide high angular resolution and hence they are explored much in detail by varying various parameters of smart antenna system. However simulation in this paper shows that MUSIC algorithm is highly accurate and stable and provides high angular resolution compared to ESPRIT and hence MUSIC algorithm can be widely used in mobile communication to estimate the DOA of the arriving signals.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126282347","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}
引用次数: 185
PICCO: Protocol Independent Congestion Control Method Using Mobile Relays for Ad-Hoc Networks 使用移动中继的Ad-Hoc网络协议独立拥塞控制方法
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.53
Y. N., N. Chiplunkar
{"title":"PICCO: Protocol Independent Congestion Control Method Using Mobile Relays for Ad-Hoc Networks","authors":"Y. N., N. Chiplunkar","doi":"10.1109/ICCNT.2010.53","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.53","url":null,"abstract":"The limited lifetime of batteries and the bandwidth limitation of channels are the major issues in Ad-hoc networks. The term Congestion is usually associated with the bandwidth issues. The bandwidth keeps varying and when there is insufficient bandwidth to satisfy the demand, we say we have a congestion problem. Congestion control methods are partially implemented in the network elements (e.g.: routers) inside the network and partially in the transport protocols running on the end hosts. All congestion control methods were developed depending on the underlying transport protocol TCP and hence cannot be used when the underlying transport protocol changes to UDP. In real time applications, where UDP is mostly used with Real time Transport Protocol (RTP), lost data packets cannot be resent. So it becomes all the more critical to have a proper congestion control method which can be used by UDP as well. PICCO method to solve the congestion problem can be implemented only in the network elements and is independent of the underlying transport protocols. Hence it can be used for TCP as well as UDP. This method reduces the number of packets being dropped in the network, thus improving the overall performance of the network.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128396258","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
Sensor Placement for Heterogenous Point Coverage 异质点覆盖的传感器放置
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.11
Ravanbakhsh Akhlaghinia, S. Hashemi, B. Shadgar
{"title":"Sensor Placement for Heterogenous Point Coverage","authors":"Ravanbakhsh Akhlaghinia, S. Hashemi, B. Shadgar","doi":"10.1109/ICCNT.2010.11","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.11","url":null,"abstract":"Sensor placement in a wireless sensor network, that consists of a number of target points, determines number and locations of sensors required to cover the points. In this paper, we define a sensor placement problem called HPC to cover a large number of target points with various coverage requirements using a minimal number of sensors. We divide this problem into sub-problems and then design an algorithm for finding an approximate solution to this problem. Also, we develop a software tool containing the implementation of our algorithm that graphically displays network model and placement. Our evaluation experiments show the performance of the proposed algorithm.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133860900","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
New Hierarchical Routing Protocol for WSNs 新的wsn分层路由协议
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.103
Ali Hosseinalipour, Davood KeyKhosravi, Abbas Mirzaei Somarin
{"title":"New Hierarchical Routing Protocol for WSNs","authors":"Ali Hosseinalipour, Davood KeyKhosravi, Abbas Mirzaei Somarin","doi":"10.1109/ICCNT.2010.103","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.103","url":null,"abstract":"Clustering in wireless sensor networks is one of the crucial methods for increasing of network lifetime. There are many algorithms for clustering. One of the cluster based algorithm in wireless sensor networks is LEACH algorithm. In this paper we proposed a new clustering method for increasing of network lifetime. In proposed method Clustering is done symmetrically and the best node with respect to remained energy and distance of other nodes in comparing with each that selected as a cluster head. Although in this protocol we didn’t use GPS but we could find geographical position nodes so easily. In this performance of the proposed algorithm via computer simulation was evaluated and compared with other clustering algorithms. The simulation results show the high performance of the proposed clustering algorithm.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134227191","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}
引用次数: 8
Traffic Driven Handoff Management Scheme for Next Generation Cellular Networks (NGCN) 下一代蜂窝网络(NGCN)业务驱动切换管理方案
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.93
A. L. Yusof, M. Ismail, N. Misran
{"title":"Traffic Driven Handoff Management Scheme for Next Generation Cellular Networks (NGCN)","authors":"A. L. Yusof, M. Ismail, N. Misran","doi":"10.1109/ICCNT.2010.93","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.93","url":null,"abstract":"In NGCN, mobile users can move between heterogeneous networks. In this kind of environment, handoff management is the essential issue that supports the handoff of users between various wireless technologies. Handoff decision, one of the handoff management issues consists of finding the appropriate time to perform the handoff and which cell to hand over in cellular networks. Traditionally, the need for initiating the handoff arises when the RSS of the serving base station deteriorates below a certain threshold value. However, in a heterogeneous network environment, more criteria (not only RSS) are needed to initiate the appropriate time to perform the handoff. This research presents a traffic driven handoff management scheme which adopts a hard handoff scheme to adaptively control the handoff time according to the load status of cells. Before accepting a new user, it requests the load information of the target cell in advance before handoff execution. Then, the value of adaptive RSS is applied in the scheme to initiate the right handoff time. The results show that how the handoff initiation criteria might be set in accordance with the quality of services requested by users. It was found that the proposed scheme can support better service quality than the scheme compared. The scheme could efficiently manage overloaded traffic in the system.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130835582","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
Comparison of Attribute Selection Methods for Web Texts Categorization Web文本分类中属性选择方法的比较
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.13
R. Saian, K. Ku-Mahamud
{"title":"Comparison of Attribute Selection Methods for Web Texts Categorization","authors":"R. Saian, K. Ku-Mahamud","doi":"10.1109/ICCNT.2010.13","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.13","url":null,"abstract":"This paper presents a study on the performance of attribute selection methods to be used with Ant-Miner algorithm for web text categorization. The new generated data set by each attribute selection method was classified with Ant-Miner to see the performance in terms of predictive accuracy and the number of rules generated. The results of classification were also compared to C4.5 algorithm.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134138029","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
Effect of Burst Assembly on Data Loss in OBS Network under Correlated Input Traffic 相关输入流量下突发汇聚对OBS网络数据丢失的影响
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.48
G. Chakraborty, S. Choudhury, Md. Sarfaraj Alam Ansari
{"title":"Effect of Burst Assembly on Data Loss in OBS Network under Correlated Input Traffic","authors":"G. Chakraborty, S. Choudhury, Md. Sarfaraj Alam Ansari","doi":"10.1109/ICCNT.2010.48","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.48","url":null,"abstract":"A computational framework for determining the data loss rate for three basic types of burst assembly algorithms of optical burst switched(OBS) network is proposed here. The model is based on our previous work, where a computational scheme for capturing the effect of time correlation of input IP-packet sources on characteristics of assembled burst under various burst assembly algorithms, has been developed. So, the framework, presented here, is also capable of analysing the impact of time correlation on data loss under basic types of burst assemblers. We observe that data loss increases with increase in source correlation for all types of assembler though the effect is more emphasised in case of timer based assembler in comparison with burst threshold based assembler. With the proposed model, the constant loss contours in load-correlation plane for parameterized assembler has also been obtained. This can be applied to design initial assembly parameters for static assemblers and adaptation rules for dynamic assemblers under varying load and source traffic correlation.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115137571","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
E-Partner: Partnership Match for an Extended Enterprise E-Partner:扩展企业的伙伴关系匹配
2010 Second International Conference on Computer and Network Technology Pub Date : 2010-04-23 DOI: 10.1109/ICCNT.2010.113
Harshit Kumar, Pil Seong Park
{"title":"E-Partner: Partnership Match for an Extended Enterprise","authors":"Harshit Kumar, Pil Seong Park","doi":"10.1109/ICCNT.2010.113","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.113","url":null,"abstract":"Companies are increasingly moving towards globalization due to advancement in ICT and communication technologies. However, a phobia still grips them about establishing a partnership that spans geographically distributed location. In this work, we reviewed the problems that companies confront while forging partnerships. Drawn upon the review, we select a set of attributes and construct an attribute ontology that provides a common platform for defining requirement which is machine process able. Architecture is presented for establishing partnership between small and medium sized enterprise, define similarity measure for finding match between partners. Also a proof of concept is discussed to demonstrate and validate the proposed architecture.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132934198","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
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学术官方微信