Pub Date : 2016-06-01DOI: 10.4304/jnw.10.9.512-520
Z. Jadidi, V. Muthukkumarasamy, E. Sithirasenan, Kalvinder Singh
In recent years, flow-based anomaly detection has attracted considerable attention from many researchers and some methods have been proposed to improve its accuracy. However, only a few studies have considered anomaly detection with sampled flow traffic, which is widely used for the management of high-speed networks. This gap is addressed in this study. First, we optimize an artificial neural network (ANN)-based classifier to detect anomalies in flow traffic. The results show that although it has a high degree of accuracy, the classifier loses significant information in the process of sampling. In this regard, we propose a sampling method to improve the performance of flow-based anomaly detection in sampled traffic. While existing sampling methods for anomaly detection preserve only small malicious flows, the proposed algorithm samples both small and large malicious flows. Therefore, the detection rate of the flow-based anomaly detector is improved by about 5% using our algorithm. To evaluate the proposed sampling method, three flow-based datasets are generated in this study
{"title":"Performance of Flow-based Anomaly Detection in Sampled Traffic","authors":"Z. Jadidi, V. Muthukkumarasamy, E. Sithirasenan, Kalvinder Singh","doi":"10.4304/jnw.10.9.512-520","DOIUrl":"https://doi.org/10.4304/jnw.10.9.512-520","url":null,"abstract":"In recent years, flow-based anomaly detection has attracted considerable attention from many researchers and some methods have been proposed to improve its accuracy. However, only a few studies have considered anomaly detection with sampled flow traffic, which is widely used for the management of high-speed networks. This gap is addressed in this study. First, we optimize an artificial neural network (ANN)-based classifier to detect anomalies in flow traffic. The results show that although it has a high degree of accuracy, the classifier loses significant information in the process of sampling. In this regard, we propose a sampling method to improve the performance of flow-based anomaly detection in sampled traffic. While existing sampling methods for anomaly detection preserve only small malicious flows, the proposed algorithm samples both small and large malicious flows. Therefore, the detection rate of the flow-based anomaly detector is improved by about 5% using our algorithm. To evaluate the proposed sampling method, three flow-based datasets are generated in this study","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"138 1","pages":"512-520"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86273796","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 : 2016-06-01DOI: 10.4304/jnw.10.9.521-529
S. Slehat, Z. Chaczko
Tunneling is one of the key mechanisms which can help in the transition from the current IPv4 to IPv6 protocol. The function of automatic tunneling process is to encapsulate IPv6 packets into IPv4 packets. The main components involved in the tunelling mechanism are: Teredo, ISATAP, and 6to4. In some cases, however, these components have ceratain issues related to source routing, neighbor discovery and NAT holes problems. This paper aims to demonstrate how a serious problem related to the Teredo mechanism, called “Teredo NAT Holes” can be solved. The problem NAT Holes problem increases the attack surface in Teredo and thus causes the NAT service to become vulnerable to attacks. This research work proposes an approach called the Packet Authentication and Integrity Services (PAIS) that takes advantage of the Certificate Authentication (CA) that is combined with the Diffie-Hellman key exchange and Hash Message Authentication Code (HMAC) algorithms to provide a suitable solution for the problem. Here it is suggested that the proposed method needs to create the PAIS at the Tunnel’s starting point first, and then needs to verify it at the end point of the Tunnel, by recreating the value of md , which is subsequently inserted into the md field and compared against the md’ field in the packet. The proposed methodology adds md field in order to replace the next header in the packet header structure. The Diffie-Hellman algorithm is used for the key exchange. The IPv6 protocol supports loopback virtual network, and is used in the experimental test bed to validate the efficiency of the method. The experimental results show that the method offers good performance and is able to adequately mitigate NAT Holes issues in Teredo clients
{"title":"Mitigating Nat Holes Vulnerability in Teredo Clients","authors":"S. Slehat, Z. Chaczko","doi":"10.4304/jnw.10.9.521-529","DOIUrl":"https://doi.org/10.4304/jnw.10.9.521-529","url":null,"abstract":"Tunneling is one of the key mechanisms which can help in the transition from the current IPv4 to IPv6 protocol. The function of automatic tunneling process is to encapsulate IPv6 packets into IPv4 packets. The main components involved in the tunelling mechanism are: Teredo, ISATAP, and 6to4. In some cases, however, these components have ceratain issues related to source routing, neighbor discovery and NAT holes problems. This paper aims to demonstrate how a serious problem related to the Teredo mechanism, called “Teredo NAT Holes” can be solved. The problem NAT Holes problem increases the attack surface in Teredo and thus causes the NAT service to become vulnerable to attacks. This research work proposes an approach called the Packet Authentication and Integrity Services (PAIS) that takes advantage of the Certificate Authentication (CA) that is combined with the Diffie-Hellman key exchange and Hash Message Authentication Code (HMAC) algorithms to provide a suitable solution for the problem. Here it is suggested that the proposed method needs to create the PAIS at the Tunnel’s starting point first, and then needs to verify it at the end point of the Tunnel, by recreating the value of md , which is subsequently inserted into the md field and compared against the md’ field in the packet. The proposed methodology adds md field in order to replace the next header in the packet header structure. The Diffie-Hellman algorithm is used for the key exchange. The IPv6 protocol supports loopback virtual network, and is used in the experimental test bed to validate the efficiency of the method. The experimental results show that the method offers good performance and is able to adequately mitigate NAT Holes issues in Teredo clients","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"226 ","pages":"521-529"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91461367","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 : 2016-06-01DOI: 10.4304/jnw.10.10.543-550
I. K. Aulakh, R. Vig
The constraint of limited frequency spectrum for wireless communication is very daunting. The radio spectrum licensed to permanent users is wasted at times when not used continuously. Cognitive radio technology involves a change in regulation of radio spectrum. In cognitive radio networks a secondary user network is designed for efficiently using gaps in spectrum and not causing at the same time harmful interference to license holding primary users. There is a continuous tradeoff between the opposing goals of Primary User transmission protection and Secondary User throughput maximization. For a Secondary User, both sensing and transmitting is important so as to avoid collisions, packet loss and improve throughput. This paper presents optimization of Secondary User packet length in sensing-transmission scheduling for dynamically accessing the spectrum in cognitive radios. The need to maximize the Secondary User access is achieved by optimizing its packet length with respect to collision cost in a threshold based sensing-transmission structure using Matlab simulations. The results are presented in the form of traces of thresholds for different packet lengths and collision costs. This scheme optimizes Secondary User aggressiveness and throughput while safeguarding Primary User interests
{"title":"Secondary User Aggressiveness Optimization in Sensing-Transmission Scheduling for Cognitive Radio Networks","authors":"I. K. Aulakh, R. Vig","doi":"10.4304/jnw.10.10.543-550","DOIUrl":"https://doi.org/10.4304/jnw.10.10.543-550","url":null,"abstract":"The constraint of limited frequency spectrum for wireless communication is very daunting. The radio spectrum licensed to permanent users is wasted at times when not used continuously. Cognitive radio technology involves a change in regulation of radio spectrum. In cognitive radio networks a secondary user network is designed for efficiently using gaps in spectrum and not causing at the same time harmful interference to license holding primary users. There is a continuous tradeoff between the opposing goals of Primary User transmission protection and Secondary User throughput maximization. For a Secondary User, both sensing and transmitting is important so as to avoid collisions, packet loss and improve throughput. This paper presents optimization of Secondary User packet length in sensing-transmission scheduling for dynamically accessing the spectrum in cognitive radios. The need to maximize the Secondary User access is achieved by optimizing its packet length with respect to collision cost in a threshold based sensing-transmission structure using Matlab simulations. The results are presented in the form of traces of thresholds for different packet lengths and collision costs. This scheme optimizes Secondary User aggressiveness and throughput while safeguarding Primary User interests","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"26 1","pages":"543-550"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84256516","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 : 2016-06-01DOI: 10.4304/jnw.10.9.530-542
Coskun Cetinkaya
Traditional IEEE 802.11-based networks use only a single channel to ensure connectivity; however, multi-channel capability is available to provide higher network throughput by allowing simultaneous multiple transmissions that do not interfere with each other. The use of multiple channels raises several new challenges: mainly finding the receiver, scheduling the next transmission, balancing the load among channels, and dealing with multi-channel hidden terminals. This paper proposes a novel and efficient, asynchronous multi-channel medium-access control (MAC) protocol using a single transceiver. The key technique is that the proposed protocol separates searching and scheduling processes where searching users switch channels faster than regular users. Simulation results indicate that the proposed protocol achieves up to 14.10 Mbps network throughput, whereas the IEEE 802.11 MAC protocol, with a single channel, provides only 4.35 Mbps in the best case when three orthogonal channels with an 11- Mbps data rate are available
{"title":"Asynchronous Multi-Channel MAC Protocol","authors":"Coskun Cetinkaya","doi":"10.4304/jnw.10.9.530-542","DOIUrl":"https://doi.org/10.4304/jnw.10.9.530-542","url":null,"abstract":"Traditional IEEE 802.11-based networks use only a single channel to ensure connectivity; however, multi-channel capability is available to provide higher network throughput by allowing simultaneous multiple transmissions that do not interfere with each other. The use of multiple channels raises several new challenges: mainly finding the receiver, scheduling the next transmission, balancing the load among channels, and dealing with multi-channel hidden terminals. This paper proposes a novel and efficient, asynchronous multi-channel medium-access control (MAC) protocol using a single transceiver. The key technique is that the proposed protocol separates searching and scheduling processes where searching users switch channels faster than regular users. Simulation results indicate that the proposed protocol achieves up to 14.10 Mbps network throughput, whereas the IEEE 802.11 MAC protocol, with a single channel, provides only 4.35 Mbps in the best case when three orthogonal channels with an 11- Mbps data rate are available","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"94 1","pages":"530-542"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76795224","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 : 2016-06-01DOI: 10.4304/jnw.10.9.487-500
M. Watfa, S. Miniaoui, Haitham Al-Hassanieh, Samir Selman
Electric vehicles are approximately doubling each year, and the growth is projected to continue to have 20 million electric vehicles on the roads by 2020. In order to reach this goal, research on charging next-generation electric cars have shown a lot of interest. One major challenge with electric vehicles is range anxiety. The proposed research in this paper combines protocol design, analytical, probabilistic and experimental techniques to conduct comprehensive studies on multihop wireless energy transfer serving an integrated electrical vehicular adhoc network (e-VANETs) infrastructure. Our work is the first that addresses multihop energy transfer in e-VANETs and will have a significant impact on fundamental design principles for the development of future electrical car wireless charging infrastructures
{"title":"A Wireless Charging Infrastructure for Future Electrical Vehicular Adhoc Networks","authors":"M. Watfa, S. Miniaoui, Haitham Al-Hassanieh, Samir Selman","doi":"10.4304/jnw.10.9.487-500","DOIUrl":"https://doi.org/10.4304/jnw.10.9.487-500","url":null,"abstract":"Electric vehicles are approximately doubling each year, and the growth is projected to continue to have 20 million electric vehicles on the roads by 2020. In order to reach this goal, research on charging next-generation electric cars have shown a lot of interest. One major challenge with electric vehicles is range anxiety. The proposed research in this paper combines protocol design, analytical, probabilistic and experimental techniques to conduct comprehensive studies on multihop wireless energy transfer serving an integrated electrical vehicular adhoc network (e-VANETs) infrastructure. Our work is the first that addresses multihop energy transfer in e-VANETs and will have a significant impact on fundamental design principles for the development of future electrical car wireless charging infrastructures","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"10 1","pages":"487-500"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78616164","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 : 2016-06-01DOI: 10.4304/jnw.10.10.551-566
Z. Chaczko, S. Slehat, A. Salmon
This paper addresses a prevalent issue in technologybased industries of underperforming or even totally failing projects. There is strong evidence that a major influencing factor to the situation is the incorrect assumption about availability of effective technology that can assist management in project planning. The aim of the paper is to demonstrate and discuss effective approaches for using Predictive Analytics methods and tools in the Telecommunications industry to mitigate project planning issues and avoid possible project failures. Although, these methods and tools are not new, as the traditional statistical models form the core of the application, however, the novelty stems from the new processes and methods used by these tools for presentation and workflow. This change in the approach allowes to lower the usage barrier by providing an access to a wider community of end-users. Thanks to embeding a formalised approach into the workflow, users are guided through complex analytical processes more easily, thus allowing less technically advanced users to draw valuable conclusions without necessarily requiring a formal training in advanced statistical methods. Discussed case studies demonstrate suitability of Predictive Analytics as a powerful and highly accessible tool for project planning in the telecommunications domain.
{"title":"Application of Predictive Analytics in Telecommunications Project Management","authors":"Z. Chaczko, S. Slehat, A. Salmon","doi":"10.4304/jnw.10.10.551-566","DOIUrl":"https://doi.org/10.4304/jnw.10.10.551-566","url":null,"abstract":"This paper addresses a prevalent issue in technologybased industries of underperforming or even totally failing projects. There is strong evidence that a major influencing factor to the situation is the incorrect assumption about availability of effective technology that can assist management in project planning. The aim of the paper is to demonstrate and discuss effective approaches for using Predictive Analytics methods and tools in the Telecommunications industry to mitigate project planning issues and avoid possible project failures. Although, these methods and tools are not new, as the traditional statistical models form the core of the application, however, the novelty stems from the new processes and methods used by these tools for presentation and workflow. This change in the approach allowes to lower the usage barrier by providing an access to a wider community of end-users. Thanks to embeding a formalised approach into the workflow, users are guided through complex analytical processes more easily, thus allowing less technically advanced users to draw valuable conclusions without necessarily requiring a formal training in advanced statistical methods. Discussed case studies demonstrate suitability of Predictive Analytics as a powerful and highly accessible tool for project planning in the telecommunications domain.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"10 1","pages":"551-566"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83727645","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 : 2016-06-01DOI: 10.4304/jnw.10.10.567-578
M. Alshayeji, D. N. Dias, M. D. Samrajesh
Traditionally, Video-on-Demand (VoD) systems were based on servers that streamed video contents to the end users. Later, data replication using Content Delivery Networks (CDN) came into existence; this reduced the overall network load by effectively distributing contents to end user. However, replication using CDN is relatively costly. Today, Peer-to-Peer (P2P) based VoD systems have gained wide popularity due to its robustness, scalability and availability. P2P networks consist of a large number of nodes, including mobile devices that join and leave the network frequently. The challenge is to provide better video Quality of Service (QoS) to the end user by making requested copies of video chunks available on demand. In this paper, we propose an Enhanced Chunk Regulation Algorithm (ECRA) for superior video QoS in P2P networks. We propose a chunk selection algorithm called Local Demand based Chunk Download (LDCD) that fulfills the temporal demand of chunks. Our proposed Peer Ranking Factor (PRF) algorithm uses ranking factor to choose the best suitable peers to download video chunks. Additionally, we present Local Demand based Chunk Replication (LDCR) algorithm that considers the demand for particular videos (i.e. movies) in the local cluster. Based on the available bandwidth and cache space the replication of chunks is accomplished such as the QoS of VoD is superior. Our evaluation shows that the proposed algorithm improves the overall end user’s QoS by minimizing missed chunks, stalling delay and startup delay. Moreover, it provides more effective bandwidth utilization and minimizes the load on the source server
{"title":"Enhanced Chunk Regulation Algorithm for Superior QoS in Heterogeneous P2P Video on Demand","authors":"M. Alshayeji, D. N. Dias, M. D. Samrajesh","doi":"10.4304/jnw.10.10.567-578","DOIUrl":"https://doi.org/10.4304/jnw.10.10.567-578","url":null,"abstract":"Traditionally, Video-on-Demand (VoD) systems were based on servers that streamed video contents to the end users. Later, data replication using Content Delivery Networks (CDN) came into existence; this reduced the overall network load by effectively distributing contents to end user. However, replication using CDN is relatively costly. Today, Peer-to-Peer (P2P) based VoD systems have gained wide popularity due to its robustness, scalability and availability. P2P networks consist of a large number of nodes, including mobile devices that join and leave the network frequently. The challenge is to provide better video Quality of Service (QoS) to the end user by making requested copies of video chunks available on demand. In this paper, we propose an Enhanced Chunk Regulation Algorithm (ECRA) for superior video QoS in P2P networks. We propose a chunk selection algorithm called Local Demand based Chunk Download (LDCD) that fulfills the temporal demand of chunks. Our proposed Peer Ranking Factor (PRF) algorithm uses ranking factor to choose the best suitable peers to download video chunks. Additionally, we present Local Demand based Chunk Replication (LDCR) algorithm that considers the demand for particular videos (i.e. movies) in the local cluster. Based on the available bandwidth and cache space the replication of chunks is accomplished such as the QoS of VoD is superior. Our evaluation shows that the proposed algorithm improves the overall end user’s QoS by minimizing missed chunks, stalling delay and startup delay. Moreover, it provides more effective bandwidth utilization and minimizes the load on the source server","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"567-578"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85860095","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 a Poisson Point Process (PPP) network model, in which the locations of Base Stations (BSs) are randomly distributed according to a Spatial Poisson Process, has been recently used as a tractable stochastic model to analyse the performance of downlink Heterogeneous Cellular Networks (HCNs). The HCN is modelled as a multi-tier cellular network where each tier is characterised by the transmission power level, propagation path loss exponent and density of BSs. The current works on HCN enabling Intercell Interference Coordination (ICIC) technique usually deal with Strict Frequency Reuse (FR) or Soft FR with a reuse factor of D = 1 in a Rayleigh fading channel. It has been assumed that all Base Stations (BSs) transmit continuously which leads to a reduction on the impact of number of users and RBs on network performance. In this paper, the performance of Soft FR with a reuse factor of D > 1 in Rayleigh-Lognormal fading channel is evaluated. The impact of the number of users and Resource Blocks (RBs) on Intercell Interference (ICI) are presented for Round Robin scheduling and indicator functions. The results show that there are opposite trends between coverage probability of Cell-Center User (CCU) and Cell-Edge User (CEU).
{"title":"Analytical Coverage Probability of a Typical User In Heterogeneous Cellular Networks","authors":"S. Lam, K. Sandrasegaran","doi":"10.4304/jnw.11.2.56-61","DOIUrl":"https://doi.org/10.4304/jnw.11.2.56-61","url":null,"abstract":"In a Poisson Point Process (PPP) network model, in which the locations of Base Stations (BSs) are randomly distributed according to a Spatial Poisson Process, has been recently used as a tractable stochastic model to analyse the performance of downlink Heterogeneous Cellular Networks (HCNs). The HCN is modelled as a multi-tier cellular network where each tier is characterised by the transmission power level, propagation path loss exponent and density of BSs. The current works on HCN enabling Intercell Interference Coordination (ICIC) technique usually deal with Strict Frequency Reuse (FR) or Soft FR with a reuse factor of D = 1 in a Rayleigh fading channel. It has been assumed that all Base Stations (BSs) transmit continuously which leads to a reduction on the impact of number of users and RBs on network performance. In this paper, the performance of Soft FR with a reuse factor of D > 1 in Rayleigh-Lognormal fading channel is evaluated. The impact of the number of users and Resource Blocks (RBs) on Intercell Interference (ICI) are presented for Round Robin scheduling and indicator functions. The results show that there are opposite trends between coverage probability of Cell-Center User (CCU) and Cell-Edge User (CEU).","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"41 1","pages":"56-61"},"PeriodicalIF":0.0,"publicationDate":"2016-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81658012","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 dynamic of changing network topology and vehicle density in VANET are causing the dynamic of message traffic intensity. This situation requires adaptability of channel management to provide the channel capacity dynamically and proportionally. The length of CCH interval in VANET represents the capacity of channel or service rate of vehicles. The fixed pattern of CCH/SCH interval as published by IEEE 802.11p/1609.4 would become the constraint of adaptability of vehicles in VANETs. Moreover it would affect to VANET performance inefficient. This research proposes an adaptive scheme of CCH/SCH interval which proportional with density of vehicles based on the number of vehicle connected each other’s. To show how effective the proposed adaptive scheme of CCH/SCH interval can afford to improve of VANET performance (compared to fixed interval scheme of current IEEE standard), we analyze by combining mobility model and queuing network model. We assume that statistically there is a steady state of VANET topology which can be analyzed by using queuing network model. We specified the real map of highway in Bandung city along 10 Km length to achieve the representative experimental result. The various specified of speeds are: 70-90 Km/h, 90-110 Km/h, and 110-130Km/h, while the various of density of vehicle are 15, 30, 45, 60, 75, and 90 vehicles along 10Km length of highway. All of experiments performed in two main scenarios, i.e. the fixed CCH/SCH interval, and adaptive CCH/SCH interval which compared each other to see the improvement. The analytical result examined by simulation method. The experimental results show the improvement of adaptive CCH/SCH interval. The improvement of average delay is 10ms, and the improvement of system throughput is 450 kbps.
{"title":"Adaptive Control Channel Interval in VANET Based on Mobility Model and Queuing Network Analysis","authors":"R. Munadi, D. Perdana, Asep Mulyana","doi":"10.4304/jnw.11.2.62-68","DOIUrl":"https://doi.org/10.4304/jnw.11.2.62-68","url":null,"abstract":"The dynamic of changing network topology and vehicle density in VANET are causing the dynamic of message traffic intensity. This situation requires adaptability of channel management to provide the channel capacity dynamically and proportionally. The length of CCH interval in VANET represents the capacity of channel or service rate of vehicles. The fixed pattern of CCH/SCH interval as published by IEEE 802.11p/1609.4 would become the constraint of adaptability of vehicles in VANETs. Moreover it would affect to VANET performance inefficient. This research proposes an adaptive scheme of CCH/SCH interval which proportional with density of vehicles based on the number of vehicle connected each other’s. To show how effective the proposed adaptive scheme of CCH/SCH interval can afford to improve of VANET performance (compared to fixed interval scheme of current IEEE standard), we analyze by combining mobility model and queuing network model. We assume that statistically there is a steady state of VANET topology which can be analyzed by using queuing network model. We specified the real map of highway in Bandung city along 10 Km length to achieve the representative experimental result. The various specified of speeds are: 70-90 Km/h, 90-110 Km/h, and 110-130Km/h, while the various of density of vehicle are 15, 30, 45, 60, 75, and 90 vehicles along 10Km length of highway. All of experiments performed in two main scenarios, i.e. the fixed CCH/SCH interval, and adaptive CCH/SCH interval which compared each other to see the improvement. The analytical result examined by simulation method. The experimental results show the improvement of adaptive CCH/SCH interval. The improvement of average delay is 10ms, and the improvement of system throughput is 450 kbps.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"58 1","pages":"62-68"},"PeriodicalIF":0.0,"publicationDate":"2016-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90651268","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 an in-depth analysis on the effect of the coexistence in the 2.4 GHz band between IEEE 802.15.4 and IEEE 802.11 on the medium access control. We focus on the slotted CSMA/CA medium access algorithm that is used by IEEE 802.15.4 and analyse the delay that frames undergo when suffering from interference from a WiFi activity. We measure the overhead caused by the additional delay spent in the MAC sublayer frame queue before accessing the medium due to the presence of WiFi interference. We experimented different scenarios with overlapping channels and non-overlapping channels. We show that the two wireless protocols can coexist if we take into considerations the relative positions of the nodes to avoid very high interference and if we avoid monopolizing the channel with a very high rate WiFi traffic even under overlapping channels.
{"title":"Overhead caused by WiFi on ZigBee Networks using Slotted CSMA/CA","authors":"G. Chalhoub, Eric Perrier de La Bathie, M. Misson","doi":"10.4304/jnw.11.2.39-45","DOIUrl":"https://doi.org/10.4304/jnw.11.2.39-45","url":null,"abstract":"This paper presents an in-depth analysis on the effect of the coexistence in the 2.4 GHz band between IEEE 802.15.4 and IEEE 802.11 on the medium access control. We focus on the slotted CSMA/CA medium access algorithm that is used by IEEE 802.15.4 and analyse the delay that frames undergo when suffering from interference from a WiFi activity. We measure the overhead caused by the additional delay spent in the MAC sublayer frame queue before accessing the medium due to the presence of WiFi interference. We experimented different scenarios with overlapping channels and non-overlapping channels. We show that the two wireless protocols can coexist if we take into considerations the relative positions of the nodes to avoid very high interference and if we avoid monopolizing the channel with a very high rate WiFi traffic even under overlapping channels.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"17 1","pages":"39-45"},"PeriodicalIF":0.0,"publicationDate":"2016-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79071507","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
扫码关注我们
求助内容：
应助结果提醒方式：