In this paper the issue of transmission range in homogeneous wireless networks (HWNs) is addressed. In such networks, wireless mobile nodes are assumed to use the same transmission ranges. In HWNs, higher transmission ranges reduce the number of hops that packets need to reach their destinations, but they also increase the number of nodes that locally compete for the medium access. On the other hand, shorter transmission ranges allow simultaneous transmissions in different areas of the network. However, for such short transmission ranges the probability of a disconnected network increases. To deal with the fore mentioned dilemma, a new approach based on analytically defining an initial transmission range that keeps the network connected is presented herein. The simulation carried out under various network loads has focused on a set of metrics, namely: packets delivery ratio, average end to end delay and normalized routing overhead. The simulation results have shown that using short transmission range may not lead always to optimal performance.
{"title":"Impacts of Transmission Range in Homogeneous Wireless Networks","authors":"M. Djoudi","doi":"10.1109/ICSNC.2008.64","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.64","url":null,"abstract":"In this paper the issue of transmission range in homogeneous wireless networks (HWNs) is addressed. In such networks, wireless mobile nodes are assumed to use the same transmission ranges. In HWNs, higher transmission ranges reduce the number of hops that packets need to reach their destinations, but they also increase the number of nodes that locally compete for the medium access. On the other hand, shorter transmission ranges allow simultaneous transmissions in different areas of the network. However, for such short transmission ranges the probability of a disconnected network increases. To deal with the fore mentioned dilemma, a new approach based on analytically defining an initial transmission range that keeps the network connected is presented herein. The simulation carried out under various network loads has focused on a set of metrics, namely: packets delivery ratio, average end to end delay and normalized routing overhead. The simulation results have shown that using short transmission range may not lead always to optimal performance.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114062907","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}
In this study, we propose a gradual adaption model for estimation of user information access behavior. A variety of userspsila information access data are collected by unit of a day for each user, and analyzed in terms of short, medium, long periods, and by remarkable and exceptional categories. The proposed model is then established by analyzing the pre-processed data based on Full Bayesian Estimation. We further present experimental simulation results, and show the operability and effectiveness of our proposed model.
{"title":"Gradual Adaption Model for Estimation of User Information Access Behavior","authors":"Jing Chen, Roman Y. Shtykh, Qun Jin","doi":"10.1109/ICSNC.2008.56","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.56","url":null,"abstract":"In this study, we propose a gradual adaption model for estimation of user information access behavior. A variety of userspsila information access data are collected by unit of a day for each user, and analyzed in terms of short, medium, long periods, and by remarkable and exceptional categories. The proposed model is then established by analyzing the pre-processed data based on Full Bayesian Estimation. We further present experimental simulation results, and show the operability and effectiveness of our proposed model.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120938147","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}
This paper presents a new bandwidth preemption algorithm supporting differentiated services aware traffic engineering (DS-TE) in the multi-protocol label switching (MPLS). The paper presents the following contributions. Firstly, we look at the problem of organizing the mapping of label switching paths (LSPs) in an optimal way such that we can compromise between several traffic engineering (TE) objectives: load-balancing, avoiding network bottlenecks, reducing routing cost, and minimizing path hop count. Secondly, we introduce DS-TE bandwidth management and admission control mechanisms by proposing a new bandwidth preemption algorithm for the maximum allocation model (MAM). Finally, in our proposed scheme, we conduct preemption in tow dimensions: class type (CT) and preemption level so that an LSP of CT ct and priority p can not be preempted as long as any LSP of weaker precedence remains. A case study is also provided to show how our algorithm performs in MPLS networks where DS-TE is applied.
{"title":"A New Preemption Algorithm Supporting Differentiated Services Aware Traffic Engineering","authors":"A. Kotti, R. Hamza, K. Bouleimen","doi":"10.1109/ICSNC.2008.19","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.19","url":null,"abstract":"This paper presents a new bandwidth preemption algorithm supporting differentiated services aware traffic engineering (DS-TE) in the multi-protocol label switching (MPLS). The paper presents the following contributions. Firstly, we look at the problem of organizing the mapping of label switching paths (LSPs) in an optimal way such that we can compromise between several traffic engineering (TE) objectives: load-balancing, avoiding network bottlenecks, reducing routing cost, and minimizing path hop count. Secondly, we introduce DS-TE bandwidth management and admission control mechanisms by proposing a new bandwidth preemption algorithm for the maximum allocation model (MAM). Finally, in our proposed scheme, we conduct preemption in tow dimensions: class type (CT) and preemption level so that an LSP of CT ct and priority p can not be preempted as long as any LSP of weaker precedence remains. A case study is also provided to show how our algorithm performs in MPLS networks where DS-TE is applied.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131561045","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}
In this paper a new clustering algorithm for vehicular ad-hoc networks (VANET) is presented. The proposed solution is a modification of the Basagnipsilas distributed and mobility-adaptive clustering (DMAC) algorithm. Some additional conditions that have to be fulfilled before the cluster head change, are introduced to better suit the road traffic. Tests performed in the simulation environment consisting of VanetMobiSim and JiST/SWANS++ show that algorithm performs better than the original solution - the clusters stability is significantly increased.
{"title":"Modified DMAC Clustering Algorithm for VANETs","authors":"G. Wolny","doi":"10.1109/ICSNC.2008.28","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.28","url":null,"abstract":"In this paper a new clustering algorithm for vehicular ad-hoc networks (VANET) is presented. The proposed solution is a modification of the Basagnipsilas distributed and mobility-adaptive clustering (DMAC) algorithm. Some additional conditions that have to be fulfilled before the cluster head change, are introduced to better suit the road traffic. Tests performed in the simulation environment consisting of VanetMobiSim and JiST/SWANS++ show that algorithm performs better than the original solution - the clusters stability is significantly increased.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133637581","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}
Wireless networks have specific characteristics that are totally different from conventional networks. In fact, ad hoc networks are closely depending on the distributed cooperation among mobile nodes. Deploying trust evaluation in such environment will be an extra challenge. In this paper, we present a newest model permitting trust evaluation and establishment based on ad hoc routing protocol. Trust evaluation and establishment provide representing, evaluating and maintaining trust within the network, and serve as the basis for higher level routing operations. Our model is an events-based according to the routingpsilas relationships between mobile nodes. Logical and computational trust analysis and evaluation are deployed among network nodes. Each node's evaluation of trust on other nodes should be based on experience statistics computed around two routing events: NRE (new route events) and RFE (route failure events). First ones refer to the new requests or responses in order to establish a new route; however, second ones are consequences of a loss or errors due to existing route problems. To ensure efficiency, the experience statistics are computed by being based on linear temporal logic (LTL) model. Finally and in order to prove the applicability of the proposed solution, we further present an adaptive routing protocol (A2ODV: adaptive AODV) and analyze its efficiency around some performances metrics.
{"title":"Wireless Routing Protocol Based on Trust Evaluation","authors":"Ben Arbia Anis, Hédi Hamdi, Youssef Habib","doi":"10.1109/ICSNC.2008.74","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.74","url":null,"abstract":"Wireless networks have specific characteristics that are totally different from conventional networks. In fact, ad hoc networks are closely depending on the distributed cooperation among mobile nodes. Deploying trust evaluation in such environment will be an extra challenge. In this paper, we present a newest model permitting trust evaluation and establishment based on ad hoc routing protocol. Trust evaluation and establishment provide representing, evaluating and maintaining trust within the network, and serve as the basis for higher level routing operations. Our model is an events-based according to the routingpsilas relationships between mobile nodes. Logical and computational trust analysis and evaluation are deployed among network nodes. Each node's evaluation of trust on other nodes should be based on experience statistics computed around two routing events: NRE (new route events) and RFE (route failure events). First ones refer to the new requests or responses in order to establish a new route; however, second ones are consequences of a loss or errors due to existing route problems. To ensure efficiency, the experience statistics are computed by being based on linear temporal logic (LTL) model. Finally and in order to prove the applicability of the proposed solution, we further present an adaptive routing protocol (A2ODV: adaptive AODV) and analyze its efficiency around some performances metrics.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565647","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}
Transmission Control Protocol (TCP) is known to suffer from performance degradation in mobile wireless environments. This is because such environments are prone to packet losses due to high bit error rates and mobility induced disconnections. TCP interprets packet losses as an indication of congestion and inappropriately invokes congestion control mechanisms, leading to degraded performance.In this paper, we propose a new mechanism that improves TCP performance in a wireless ad hoc network where we use multi-metric joint identification for congestion detection based on end-to-end measurements. On the other hand, in this paper we utilizes network layer feedback for identification of disconnection state furthermore when packets are lost due to channel error, the TCP sender retransmits packets without invoking congestion control.
{"title":"Improvement of TCP Performance in Ad Hoc Networks Using Cross Layer Approach","authors":"S. M. Mirhosseini, F. Torgheh","doi":"10.1109/ICSNC.2008.47","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.47","url":null,"abstract":"Transmission Control Protocol (TCP) is known to suffer from performance degradation in mobile wireless environments. This is because such environments are prone to packet losses due to high bit error rates and mobility induced disconnections. TCP interprets packet losses as an indication of congestion and inappropriately invokes congestion control mechanisms, leading to degraded performance.In this paper, we propose a new mechanism that improves TCP performance in a wireless ad hoc network where we use multi-metric joint identification for congestion detection based on end-to-end measurements. On the other hand, in this paper we utilizes network layer feedback for identification of disconnection state furthermore when packets are lost due to channel error, the TCP sender retransmits packets without invoking congestion control.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116504864","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}
PON (passive optical network) is the most promising technology applicable to TPS (triple play service). To improve processing the packet, MAC (multiple access control) is the most important technology in the PON. The core of MAC is DBA(dynamic bandwidth assignment), it classifies SR-DBA (status report DBA) and NSR-DBA (non status report DBA). However, it's bad in network efficiency because GPON DBA is using BPONpsilas DBA This study develop BR (borrow-refund)-DBA for improve network efficiency and prompt process. For take the gauge of performance evaluation, estimate about throughput, fairness and queue delay in SR-DBA and NSR-DBA environment.
{"title":"Improvement of GPON MAC Protocol for IP TV Service","authors":"SeungKun Lee, Jong-Wook Jang, MoonHan Bae","doi":"10.1109/ICSNC.2008.73","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.73","url":null,"abstract":"PON (passive optical network) is the most promising technology applicable to TPS (triple play service). To improve processing the packet, MAC (multiple access control) is the most important technology in the PON. The core of MAC is DBA(dynamic bandwidth assignment), it classifies SR-DBA (status report DBA) and NSR-DBA (non status report DBA). However, it's bad in network efficiency because GPON DBA is using BPONpsilas DBA This study develop BR (borrow-refund)-DBA for improve network efficiency and prompt process. For take the gauge of performance evaluation, estimate about throughput, fairness and queue delay in SR-DBA and NSR-DBA environment.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122001558","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}
Learning objects have been of great interest to educational organizations all over the globe. Once developed they need to be classified and presented to interested parties in the most effective and operational way. Serious classification problems have to be dealt with when the metadata attached to a learning object contains incomplete and/or in-consistent information. Many-valued logic is suggested for providing meaningful recommendations.
{"title":"Automated Evaluation of Reusable Learning Objects via a Decision Support System","authors":"S. Encheva, S. Tumin","doi":"10.1109/ICSNC.2008.11","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.11","url":null,"abstract":"Learning objects have been of great interest to educational organizations all over the globe. Once developed they need to be classified and presented to interested parties in the most effective and operational way. Serious classification problems have to be dealt with when the metadata attached to a learning object contains incomplete and/or in-consistent information. Many-valued logic is suggested for providing meaningful recommendations.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125509710","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}
M. Mozumdar, F. Gregoretti, L. Lavagno, Laura Vanzago
Data aggregation is a basic mechanism that is used to reduce the traffic flow in sensor networks. In this mechanism, one node basically the cluster leader collects data from surrounding nodes and then sends the summarized information to upstream nodes. In this paper, we propose an algorithm to select cluster leader that will perform data aggregation in a partially connected sensor network. The algorithm also reduces the traffic flow inside the network by adaptively selecting the shortest route for packet routing to the cluster leader.
{"title":"An Algorithm for Selecting the Cluster Leader in a Partially Connected Sensor Network","authors":"M. Mozumdar, F. Gregoretti, L. Lavagno, Laura Vanzago","doi":"10.1109/ICSNC.2008.50","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.50","url":null,"abstract":"Data aggregation is a basic mechanism that is used to reduce the traffic flow in sensor networks. In this mechanism, one node basically the cluster leader collects data from surrounding nodes and then sends the summarized information to upstream nodes. In this paper, we propose an algorithm to select cluster leader that will perform data aggregation in a partially connected sensor network. The algorithm also reduces the traffic flow inside the network by adaptively selecting the shortest route for packet routing to the cluster leader.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124496918","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}
The security problems that plague network services today are increasing at a dramatic pace especially with the constant improvement of network transmission rates and the sheer amount of data exchanged. This translates to not only more attacks but also new types of attacks with network incidents becoming more and more frequent. A substantial part of the attacks occur at Top Level Domains (TLD) who have the mission of guaranteeing the correct functioning of Domain Name System (DNS) zones. This paper presents a proposal to simplify the detection of attacks, and reduce the number of false reports (negative and positive). Our goal is to create a group of techniques for real time monitoring of network traffic, based on network sensors that allow, in real time, to detect abnormal network behaviour and produce meaningful data that can be used to trigger alarms and anticipate future problems, adding and removing rules at DNS firewalls. This sensors, are working together with the primary DNS servers of the .PT domain, currently monitor all traffic that crosses this service. The data correlation between the sensor and other sources (such as IDS, other sensors or agents), between two different dates, can then be used for statistical purposes and to prevent future possible attacks.
{"title":"Protecting the DNS Infrastructure of a Top Level Domain: Dynamic Firewalling with Network Sensors","authors":"João Afonso, P. Veiga","doi":"10.1109/ICSNC.2008.68","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.68","url":null,"abstract":"The security problems that plague network services today are increasing at a dramatic pace especially with the constant improvement of network transmission rates and the sheer amount of data exchanged. This translates to not only more attacks but also new types of attacks with network incidents becoming more and more frequent. A substantial part of the attacks occur at Top Level Domains (TLD) who have the mission of guaranteeing the correct functioning of Domain Name System (DNS) zones. This paper presents a proposal to simplify the detection of attacks, and reduce the number of false reports (negative and positive). Our goal is to create a group of techniques for real time monitoring of network traffic, based on network sensors that allow, in real time, to detect abnormal network behaviour and produce meaningful data that can be used to trigger alarms and anticipate future problems, adding and removing rules at DNS firewalls. This sensors, are working together with the primary DNS servers of the .PT domain, currently monitor all traffic that crosses this service. The data correlation between the sensor and other sources (such as IDS, other sensors or agents), between two different dates, can then be used for statistical purposes and to prevent future possible attacks.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124076690","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：