Pub Date : 2009-11-01DOI: 10.1109/COMNET.2009.5373565
H. Dahmouni, A. Girard, B. Sansò
Traditionally, IP Network planning and design is mostly based on average delay or loss constraints which can often be easily calculated. Jitter, on the other hand, is much more difficult to evaluate but this is particularly important to manage the QoS of real-time and interactive services such as VoIP and streaming video. In this paper, we propose a simple model for the delay jitter that is fast enough to be used in networks design algorithms. It takes into account the packets delay correlation and also the correlation of tandem queues that have a significant impact on the end-to-end jitter. We present simple formulas for the jitter of Poisson traffic in a single queue that can be calculated quickly. We then extend them to the end-to-end jitter of a tagged stream based on a tandem queueing network. The results given by the model are then compared with event-driven simulations. We find that they are very accurate for Poisson traffic over a wide range of traffic loads and more importantly, that they yield conservative values for the jitter so that they can be used in network design procedures.
{"title":"Analytical jitter model for IP network planning and design","authors":"H. Dahmouni, A. Girard, B. Sansò","doi":"10.1109/COMNET.2009.5373565","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373565","url":null,"abstract":"Traditionally, IP Network planning and design is mostly based on average delay or loss constraints which can often be easily calculated. Jitter, on the other hand, is much more difficult to evaluate but this is particularly important to manage the QoS of real-time and interactive services such as VoIP and streaming video. In this paper, we propose a simple model for the delay jitter that is fast enough to be used in networks design algorithms. It takes into account the packets delay correlation and also the correlation of tandem queues that have a significant impact on the end-to-end jitter. We present simple formulas for the jitter of Poisson traffic in a single queue that can be calculated quickly. We then extend them to the end-to-end jitter of a tagged stream based on a tandem queueing network. The results given by the model are then compared with event-driven simulations. We find that they are very accurate for Poisson traffic over a wide range of traffic loads and more importantly, that they yield conservative values for the jitter so that they can be used in network design procedures.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"34 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":"127609184","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.5373564
Sarra Benoubira, M. Frikha, S. Tabbane, Khobeib Ayadi
The internetworking among heterogeneous networks is in demand to provide "always-on" connectivity services. A widespread vision of the fourth generation (4G) mobile networks includes coexistence of current wireless technologies such as WLAN, WiMAX, General Packet Radio Service (GPRS) and Universal Mobile Telecommunications System (UMTS). The major problem that faces next generation wireless networks (NGWN) is vertical handoff management. The existing handoff management protocols are not sufficient to guarantee handoff support that is transparent to the applications in NGWS. In this paper we propose an approach based on IEEE 802.21 MIH and Mobile IPv6 to optimize vertical handover management for multi-interface MN.
{"title":"Vertical handover based on IEEE802.21 and Mobile IPv6 in UMTS/WLAN networks","authors":"Sarra Benoubira, M. Frikha, S. Tabbane, Khobeib Ayadi","doi":"10.1109/COMNET.2009.5373564","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373564","url":null,"abstract":"The internetworking among heterogeneous networks is in demand to provide \"always-on\" connectivity services. A widespread vision of the fourth generation (4G) mobile networks includes coexistence of current wireless technologies such as WLAN, WiMAX, General Packet Radio Service (GPRS) and Universal Mobile Telecommunications System (UMTS). The major problem that faces next generation wireless networks (NGWN) is vertical handoff management. The existing handoff management protocols are not sufficient to guarantee handoff support that is transparent to the applications in NGWS. In this paper we propose an approach based on IEEE 802.21 MIH and Mobile IPv6 to optimize vertical handover management for multi-interface MN.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"1 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":"129632826","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.5373551
Ali Kotti, S. Meherzi, S. Marcos, S. Belghith
It is known that in a direct-sequence (DS) ultrawideband (UWB) system, a single type of UWB pulse is used in all bits for all users. In this paper, we address a method to generate varying waveforms based on spatiotemporal chaotic approach. Regarding spreading sequences, we consider the two cases of short and long sequences. In particular, we propose the use of a family of spatiotemporal chaotic systems, namely Piecewise Coupled Map Lattices (PCML), as spatiotemporal chaotic waveforms and spreading sequences. Such sequences are shown to reduce the multi-user interference (MUI) variance with regard to i.i.d. and Gold sequences for both short and long cases. On the other hand, we evaluate and compare the DS-UWB system performance by using conventional waveform such as Gaussian monocycle pulse and PCML pulses. Finally, we show that the use of long PCML codes with PCML pulses, results in an improvement of the system average BER, hence an increase of the system capacity in terms of number of active users.
{"title":"Asynchronous DS-UWB communication using spatiotemporal chaotic waveforms and sequences","authors":"Ali Kotti, S. Meherzi, S. Marcos, S. Belghith","doi":"10.1109/COMNET.2009.5373551","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373551","url":null,"abstract":"It is known that in a direct-sequence (DS) ultrawideband (UWB) system, a single type of UWB pulse is used in all bits for all users. In this paper, we address a method to generate varying waveforms based on spatiotemporal chaotic approach. Regarding spreading sequences, we consider the two cases of short and long sequences. In particular, we propose the use of a family of spatiotemporal chaotic systems, namely Piecewise Coupled Map Lattices (PCML), as spatiotemporal chaotic waveforms and spreading sequences. Such sequences are shown to reduce the multi-user interference (MUI) variance with regard to i.i.d. and Gold sequences for both short and long cases. On the other hand, we evaluate and compare the DS-UWB system performance by using conventional waveform such as Gaussian monocycle pulse and PCML pulses. Finally, we show that the use of long PCML codes with PCML pulses, results in an improvement of the system average BER, hence an increase of the system capacity in terms of number of active users.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"33 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":"123620011","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.5373561
M. Kamoun, L. Mazet, S. Gault
With the increase of the number of Wireless Local Area Network devices (laptop PC, PDA, cellphones and set-top boxes) multi-user communication get a great interest for future versions of IEEE 802.11 standard. However, current CSMA/CA WLAN protocols do not support multiple transmissions on the same time frequency resource. This hinders these systems from taking a potential increase of the available throughput in dense deployments. In this contribution we propose a new RTS/CTS mechanism destined for WLAN SDMA/OFDMA access. We provide a capacity based analytical framework to assess the performance of these PHY layer techniques from MAC perspective in a multi-user context. Taking into account the MAC overhead it is shown that SDMA provides a substantial gain for multi-user throughput.
{"title":"Efficient backward compatible allocation mechanism for multi-user CSMA/CA schemes","authors":"M. Kamoun, L. Mazet, S. Gault","doi":"10.1109/COMNET.2009.5373561","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373561","url":null,"abstract":"With the increase of the number of Wireless Local Area Network devices (laptop PC, PDA, cellphones and set-top boxes) multi-user communication get a great interest for future versions of IEEE 802.11 standard. However, current CSMA/CA WLAN protocols do not support multiple transmissions on the same time frequency resource. This hinders these systems from taking a potential increase of the available throughput in dense deployments. In this contribution we propose a new RTS/CTS mechanism destined for WLAN SDMA/OFDMA access. We provide a capacity based analytical framework to assess the performance of these PHY layer techniques from MAC perspective in a multi-user context. Taking into account the MAC overhead it is shown that SDMA provides a substantial gain for multi-user throughput.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"28 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":"127267027","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.5373556
F. Hrizi, F. Filali
Vehicular wireless networks are prospective tools which contribute to safer and more efficient roads. Therefore, they require the design and development of new communication protocols that should constitute the building blocks of future vehicular communication architecture. Many works have been carried out in this wide research area. In this paper, we propose a reliable distance-based broadcast protocol to deliver safety information to nodes located in a geographical area when an emergency event occurs. Simulation results show that the proposed protocol achieves its design goal of delivering information in a rapid and efficient manner. Furthermore, we conclude that our proposal performs better in terms of information reception delay as well as redundancy factor as compared to a scheme inspired from previous proposed schemes.
{"title":"Achieving broadcasting efficiency in V2X networks with a distance-based protocol","authors":"F. Hrizi, F. Filali","doi":"10.1109/COMNET.2009.5373556","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373556","url":null,"abstract":"Vehicular wireless networks are prospective tools which contribute to safer and more efficient roads. Therefore, they require the design and development of new communication protocols that should constitute the building blocks of future vehicular communication architecture. Many works have been carried out in this wide research area. In this paper, we propose a reliable distance-based broadcast protocol to deliver safety information to nodes located in a geographical area when an emergency event occurs. Simulation results show that the proposed protocol achieves its design goal of delivering information in a rapid and efficient manner. Furthermore, we conclude that our proposal performs better in terms of information reception delay as well as redundancy factor as compared to a scheme inspired from previous proposed schemes.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"41 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":"127805492","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.5373562
Simon Delamare, M. Riguidel
Internet communications may have strong reliability requirements and outages may thus have serious consequences. Recovery mechanisms are therefore deployed in networks to mitigate the effects of incidents that hit Internet. This paper proposes to study recovery mechanisms based on overlay routing. We are focusing on the ability for such systems to recover a failing communication, compared to traditional IP routing systems. We propose a model of these mechanisms behaviour deployed in several interconnected networks in reaction to different incidents. Our results point out that overlay routing can increase communications reliability and emphasize the importance of overlay nodes deployment.
{"title":"Overlay routing efficiency during Internet outages","authors":"Simon Delamare, M. Riguidel","doi":"10.1109/COMNET.2009.5373562","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373562","url":null,"abstract":"Internet communications may have strong reliability requirements and outages may thus have serious consequences. Recovery mechanisms are therefore deployed in networks to mitigate the effects of incidents that hit Internet. This paper proposes to study recovery mechanisms based on overlay routing. We are focusing on the ability for such systems to recover a failing communication, compared to traditional IP routing systems. We propose a model of these mechanisms behaviour deployed in several interconnected networks in reaction to different incidents. Our results point out that overlay routing can increase communications reliability and emphasize the importance of overlay nodes deployment.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"96 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":"126849160","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.5373555
M. Mbaye, F. Krief, H. Soldano
Self-configuration is one of the most important functions of autonomic networks because it determines optimal use of resources during network's operation. However, this task is very complex as it must be performed according to service contracts between users and operators, network's infrastructure and workload. Knowledge Plane is a recently proposed concept to address this complexity by using cognitive tools (learning and reasoning). In this paper, we propose a Knowledge Plane including a distributed and collaborative machine learning method based on inductive logic programming (ILP). The main objective is to achieve distributed self-configuring by learning collaboratively best configuration strategies. We apply it in a practical context (DiffServ) and evaluate effects of this proposal on network's performances and occupation rate.
{"title":"Collaborative strategy learning for distributed network self-configuring","authors":"M. Mbaye, F. Krief, H. Soldano","doi":"10.1109/COMNET.2009.5373555","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373555","url":null,"abstract":"Self-configuration is one of the most important functions of autonomic networks because it determines optimal use of resources during network's operation. However, this task is very complex as it must be performed according to service contracts between users and operators, network's infrastructure and workload. Knowledge Plane is a recently proposed concept to address this complexity by using cognitive tools (learning and reasoning). In this paper, we propose a Knowledge Plane including a distributed and collaborative machine learning method based on inductive logic programming (ILP). The main objective is to achieve distributed self-configuring by learning collaboratively best configuration strategies. We apply it in a practical context (DiffServ) and evaluate effects of this proposal on network's performances and occupation rate.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"238 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":"123099270","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.5373563
Kaouthar Sethom Ben Reguiga, N. Aitsaadi, G. Pujolle
The home environment becomes ready to host distributed devices dynamically adapting to service availability and reacting to user location and user activity. Sensors, high definition rendering systems, home gateways, wired and wireless controllable equipments are now available. Many protocols enable connectivity and interaction between devices. However, some challenges remain such as a smart routing protocol. In this paper, we propose an adaptive control algorithm for intelligent routing inside home. Our work is divided on two parts: first, we try to adjust Access router routing zone radius dynamically via a fuzzy inference system for load balancing. Then an energy efficient algorithm to find and maintain routes is proposed.
{"title":"An adaptive control algorithm in intelligent home networks","authors":"Kaouthar Sethom Ben Reguiga, N. Aitsaadi, G. Pujolle","doi":"10.1109/COMNET.2009.5373563","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373563","url":null,"abstract":"The home environment becomes ready to host distributed devices dynamically adapting to service availability and reacting to user location and user activity. Sensors, high definition rendering systems, home gateways, wired and wireless controllable equipments are now available. Many protocols enable connectivity and interaction between devices. However, some challenges remain such as a smart routing protocol. In this paper, we propose an adaptive control algorithm for intelligent routing inside home. Our work is divided on two parts: first, we try to adjust Access router routing zone radius dynamically via a fuzzy inference system for load balancing. Then an energy efficient algorithm to find and maintain routes is proposed.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"34 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":"124502360","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.5373554
Olfa Gaddour, A. Koubâa, M. Abid
Security is a challenging issue in Wireless Sensor Networks (WSNs) due to the dual impact of their inherent constraints and their operation in open and harsh environments. The problem of securing a WSN becomes even more complex when considering group communications. In this paper, we address this problem and propose a new security mechanism for group communications in cluster-tree WSNs. We define a group as a set of sensor nodes in the cluster-tree network sharing the same sensory information (e.g. temperature, pressure, etc.). Our objective is to limit the access to the group data exclusively to the members that have securely joined the group. The main contributions of the paper are (1) the proposal of an efficient and secure group management mechanism for cluster-tree networks, and (2) a secure key distribution between group members. Finally, our security analysis shows that the proposed scheme is efficient and secure.
{"title":"SeGCom: A secure group communication mechanism in cluster-tree wireless sensor networks","authors":"Olfa Gaddour, A. Koubâa, M. Abid","doi":"10.1109/COMNET.2009.5373554","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373554","url":null,"abstract":"Security is a challenging issue in Wireless Sensor Networks (WSNs) due to the dual impact of their inherent constraints and their operation in open and harsh environments. The problem of securing a WSN becomes even more complex when considering group communications. In this paper, we address this problem and propose a new security mechanism for group communications in cluster-tree WSNs. We define a group as a set of sensor nodes in the cluster-tree network sharing the same sensory information (e.g. temperature, pressure, etc.). Our objective is to limit the access to the group data exclusively to the members that have securely joined the group. The main contributions of the paper are (1) the proposal of an efficient and secure group management mechanism for cluster-tree networks, and (2) a secure key distribution between group members. Finally, our security analysis shows that the proposed scheme is efficient and secure.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"21 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":"124899887","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.5373568
Ryma Abbassi, S. Fatmi
Security Policy constitutes the main basis of a secured system but can be its main vulnerability also since a wrongly configured policy or an inadequate one can be fatal for the system. Even if the network administrator is a high qualified person, the human interventions are error prone. Nevertheless, a formal specification can avoid such problem. This paper aims to give a first step towards a framework allowing to specify and to verify a given policy with respect to an expected one. Hence, we propose in this paper a new all-purpose security policy modeling based on the concepts of processes, channels, constraints, events and actions. This modeling is called all-purpose because it can be easily used to represent the several kinds of security rules i.e. authorization, obligation and prohibition. Moreover, it constitutes the first step towards the proposition of a new executable security specification language. This language, called S-Promela has a syntax supporting authorization, obligation and prohibition rules and a semantics facilitating the validation task.
{"title":"S-Promela: An executable specification security policies language","authors":"Ryma Abbassi, S. Fatmi","doi":"10.1109/COMNET.2009.5373568","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373568","url":null,"abstract":"Security Policy constitutes the main basis of a secured system but can be its main vulnerability also since a wrongly configured policy or an inadequate one can be fatal for the system. Even if the network administrator is a high qualified person, the human interventions are error prone. Nevertheless, a formal specification can avoid such problem. This paper aims to give a first step towards a framework allowing to specify and to verify a given policy with respect to an expected one. Hence, we propose in this paper a new all-purpose security policy modeling based on the concepts of processes, channels, constraints, events and actions. This modeling is called all-purpose because it can be easily used to represent the several kinds of security rules i.e. authorization, obligation and prohibition. Moreover, it constitutes the first step towards the proposition of a new executable security specification language. This language, called S-Promela has a syntax supporting authorization, obligation and prohibition rules and a semantics facilitating the validation task.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"51 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":"128539588","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
扫码关注我们
求助内容：
应助结果提醒方式：