Pub Date : 2009-11-01DOI: 10.1109/COMNET.2009.5373558
Nesrine Chakchouk, B. Hamdaoui, M. Frikha
Wireless sensor networks (WSNs) are often deployed in harsh environments with little human control, thereby necessitating self organizing and maintenance mechanisms for medium sharing and data routing. Moreover, since sensor nodes operate on energy-limited batteries, designing energy-efficient routing techniques that extend the network lifetime is of a paramount importance. In this paper, we propose WCDS-DCR, a fully distributed, data-centric, routing technique that makes use of an underlying clustering structure induced by the construction of WCDS (Weakly Connected Dominating Set) to prolong network lifetime. WCDS-DCR aims at extending network lifetime through the use of data aggregation (based on the elimination of redundant data packets) by some particular nodes. It also utilizes both the energy availability information and the distances (in number of hops) from sensors to the sink in order to make hop-by-hop, energy-aware, routing decisions. Simulation results show that our solution is scalable, and outperforms existing schemes in terms of network lifetime.
{"title":"WCDS-induced routing for data-aggregation in wireless sensor networks","authors":"Nesrine Chakchouk, B. Hamdaoui, M. Frikha","doi":"10.1109/COMNET.2009.5373558","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373558","url":null,"abstract":"Wireless sensor networks (WSNs) are often deployed in harsh environments with little human control, thereby necessitating self organizing and maintenance mechanisms for medium sharing and data routing. Moreover, since sensor nodes operate on energy-limited batteries, designing energy-efficient routing techniques that extend the network lifetime is of a paramount importance. In this paper, we propose WCDS-DCR, a fully distributed, data-centric, routing technique that makes use of an underlying clustering structure induced by the construction of WCDS (Weakly Connected Dominating Set) to prolong network lifetime. WCDS-DCR aims at extending network lifetime through the use of data aggregation (based on the elimination of redundant data packets) by some particular nodes. It also utilizes both the energy availability information and the distances (in number of hops) from sensors to the sink in order to make hop-by-hop, energy-aware, routing decisions. Simulation results show that our solution is scalable, and outperforms existing schemes in terms of network lifetime.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127047440","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}
Pub Date : 2009-11-01DOI: 10.1109/COMNET.2009.5373553
M. Fakhfakh, O. Cherkaoui, Imen Limam Bedhiaf, M. Frikha
Virtualization, in telecommunication, has been given great interest over the 20 past years. Migrating operating system instances between physical hosts is one of the most important features of this technology. It allows network administrators to resolve serious problem such us hardware failure, lack in server capacity, while facilitates the management and the upgrade of their systems. With the strong use of Internet Protocol Multimedia Subsystem (IMS) by most of third Generation (3G) network operators as a common infrastructure, live migration may be useful to resolve the overload problem that affects Call Session Control Function (CSCF) components. Our objective is to propose a High availability solution in order to avoid performance degradation. Thus, we aim to proof that when introducing the migration technique within the IMS architecture, we resolve the overload problem and guarantee Quality of Service (QoS) for IMS client. Based on previous work on high availability using virtualization, we describe, in this paper, our methodology and implementation of an experimental scenario using live migration. Then, we evaluate the registration and the session setup delays. The use of migration reduces considerably the delays by 40% for registration and by 38% for session setup. So, we obtain acceptable values compared to the thresholds.
{"title":"High availability in IMS virtualized network","authors":"M. Fakhfakh, O. Cherkaoui, Imen Limam Bedhiaf, M. Frikha","doi":"10.1109/COMNET.2009.5373553","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373553","url":null,"abstract":"Virtualization, in telecommunication, has been given great interest over the 20 past years. Migrating operating system instances between physical hosts is one of the most important features of this technology. It allows network administrators to resolve serious problem such us hardware failure, lack in server capacity, while facilitates the management and the upgrade of their systems. With the strong use of Internet Protocol Multimedia Subsystem (IMS) by most of third Generation (3G) network operators as a common infrastructure, live migration may be useful to resolve the overload problem that affects Call Session Control Function (CSCF) components. Our objective is to propose a High availability solution in order to avoid performance degradation. Thus, we aim to proof that when introducing the migration technique within the IMS architecture, we resolve the overload problem and guarantee Quality of Service (QoS) for IMS client. Based on previous work on high availability using virtualization, we describe, in this paper, our methodology and implementation of an experimental scenario using live migration. Then, we evaluate the registration and the session setup delays. The use of migration reduces considerably the delays by 40% for registration and by 38% for session setup. So, we obtain acceptable values compared to the thresholds.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821009","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}
Pub Date : 2009-11-01DOI: 10.1109/COMNET.2009.5373571
O. Ben Ahmed, Z. Choukair
Intrusion detection system (IDS) is a security technology that attempts to identify and isolate “Intrusions” against computer systems. The major problem of IDS is the vulnerability to fragment attacks. For this problem we propose a new approach (ARD-FA : Association Rules to Detect Fragment Attack) using data mining techniques of links analyses. We develop this approach and show some improvement in managing the problem.
入侵检测系统(IDS)是一种试图识别和隔离针对计算机系统的“入侵”的安全技术。IDS的主要问题是容易受到碎片攻击。针对这一问题，我们提出了一种利用链接分析的数据挖掘技术来检测碎片攻击的新方法(ARD-FA: Association Rules to Detect Fragment Attack)。我们开发了这种方法，并在管理问题方面显示出一些改进。
{"title":"Link analysis approach to improve detection of fragmentation attacks in Misuse IDS","authors":"O. Ben Ahmed, Z. Choukair","doi":"10.1109/COMNET.2009.5373571","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373571","url":null,"abstract":"Intrusion detection system (IDS) is a security technology that attempts to identify and isolate “Intrusions” against computer systems. The major problem of IDS is the vulnerability to fragment attacks. For this problem we propose a new approach (ARD-FA : Association Rules to Detect Fragment Attack) using data mining techniques of links analyses. We develop this approach and show some improvement in managing the problem.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131745998","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
扫码关注我们
求助内容：
应助结果提醒方式：