Pub Date : 2013-10-24DOI: 10.1109/ISCIT.2013.6645849
Muhammad R. Ahmed, Xu Huang, Hongyan Cui, N. K. Srinath
Wireless sensor networks (WSNs) are an emerging technology for collecting data about the natural or built environment. They consist of low-cost and multifunctional resources and autonomous nodes comprising the appropriate sensors along with computational devices that transmit and receive data wirelessly. The nodes work independently to function on environmental conditions. Normally each node cooperates with its neighbours to wirelessly transmit their readings via a deployed network. A wireless sensor network can be used for many different applications range from a military implementation in the battlefield, an environmental monitoring, playing an function in health sector as well as emergency response of surveillance. With its nature and application scenario WSN had drawn a great attention to the increasing applications. In order to ensure its functionality especially in malicious environments, security mechanisms become essential. Internal attacks have gained prominence and pose most challenging threats to all WSNs. Althougḩ a number of works has been done to secure a WSN but internal attacks have gained little attention. The conventional cryptographic technique does not give the appropriate security to save the network from internal attack that cause by abnormally behaved legitimate nodes. In this paper, we have proposed a new approach for detecting internal attack in two stages with multi-criteria evaluation. A prior to the stage of implementation we have checked whether the targeted node is in transmission range or not then in the current stage, we will make a misbehavior judgment with Abnormal Behavior Identification Mechanism (ABIM) by using cosine similarity for abnormality. Secondly, we combined the multiple pieces of evidences made by the internal attacker or the abnormally behaved nodes evidenced by information sources and then using the Dempester-Shafer Theory (DST) to make final decision. The advantage of this method is that it does not need the knowledge about the normal or malicious node in advance.
{"title":"A novel two-stage Multi-crieteria evaluation for internal attack in WSN","authors":"Muhammad R. Ahmed, Xu Huang, Hongyan Cui, N. K. Srinath","doi":"10.1109/ISCIT.2013.6645849","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645849","url":null,"abstract":"Wireless sensor networks (WSNs) are an emerging technology for collecting data about the natural or built environment. They consist of low-cost and multifunctional resources and autonomous nodes comprising the appropriate sensors along with computational devices that transmit and receive data wirelessly. The nodes work independently to function on environmental conditions. Normally each node cooperates with its neighbours to wirelessly transmit their readings via a deployed network. A wireless sensor network can be used for many different applications range from a military implementation in the battlefield, an environmental monitoring, playing an function in health sector as well as emergency response of surveillance. With its nature and application scenario WSN had drawn a great attention to the increasing applications. In order to ensure its functionality especially in malicious environments, security mechanisms become essential. Internal attacks have gained prominence and pose most challenging threats to all WSNs. Althougḩ a number of works has been done to secure a WSN but internal attacks have gained little attention. The conventional cryptographic technique does not give the appropriate security to save the network from internal attack that cause by abnormally behaved legitimate nodes. In this paper, we have proposed a new approach for detecting internal attack in two stages with multi-criteria evaluation. A prior to the stage of implementation we have checked whether the targeted node is in transmission range or not then in the current stage, we will make a misbehavior judgment with Abnormal Behavior Identification Mechanism (ABIM) by using cosine similarity for abnormality. Secondly, we combined the multiple pieces of evidences made by the internal attacker or the abnormally behaved nodes evidenced by information sources and then using the Dempester-Shafer Theory (DST) to make final decision. The advantage of this method is that it does not need the knowledge about the normal or malicious node in advance.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128734691","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645820
Zixuan Lin, Le Chung Tran, F. Safaei
Recently, the combination of cooperative communication, Space-Time-Frequency Codes (STFCs) and Multiband OFDM Ultra-Wideband (MB-OFDM UWB) has been proposed to improve the data rate, system capacity and reliability. This paper provides insightful performance evaluation for our previous proposed cooperative communication schemes for MB-OFDM UWB systems. In particular, this paper shows that the usefulness of cooperative communication schemes is decided by the mutual relation between the signal-to-noise ratio (SNR) of the inter-node links, referred to as inter-node SNR, and that of the uplinks, which is referred to as uplink SNR. For a certain uplink SNR value, cooperative communication becomes useful when the inter-node SNR is above a certain threshold, the so-called cooperative SNR value, and vice versa. The cooperative SNR values corresponding to different uplink conditions have been derived from the simulation results for the UWB channel models CM1 and CM2 for illustration. Two important observations drawn from this paper are that, in some cases, cooperative communication for MB-OFDM UWB might be still beneficial even when the inter-node links are relatively noisy, and/or when the source nodes are located further apart from each other than from the destination node; and this benefit over a non-cooperative counterpart is more significant when the uplink channels are more dispersive.
{"title":"Performance evaluation of cooperative communications for STFC MB-OFDM UWB","authors":"Zixuan Lin, Le Chung Tran, F. Safaei","doi":"10.1109/ISCIT.2013.6645820","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645820","url":null,"abstract":"Recently, the combination of cooperative communication, Space-Time-Frequency Codes (STFCs) and Multiband OFDM Ultra-Wideband (MB-OFDM UWB) has been proposed to improve the data rate, system capacity and reliability. This paper provides insightful performance evaluation for our previous proposed cooperative communication schemes for MB-OFDM UWB systems. In particular, this paper shows that the usefulness of cooperative communication schemes is decided by the mutual relation between the signal-to-noise ratio (SNR) of the inter-node links, referred to as inter-node SNR, and that of the uplinks, which is referred to as uplink SNR. For a certain uplink SNR value, cooperative communication becomes useful when the inter-node SNR is above a certain threshold, the so-called cooperative SNR value, and vice versa. The cooperative SNR values corresponding to different uplink conditions have been derived from the simulation results for the UWB channel models CM1 and CM2 for illustration. Two important observations drawn from this paper are that, in some cases, cooperative communication for MB-OFDM UWB might be still beneficial even when the inter-node links are relatively noisy, and/or when the source nodes are located further apart from each other than from the destination node; and this benefit over a non-cooperative counterpart is more significant when the uplink channels are more dispersive.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129154382","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645915
Dusadee Apicharttrisorn, Kittipat Apicharttrisorn, T. Kasetkasem
Wireless sensor technologies have enabled us to deploy such small sensors to monitor an area of interest. Object tracking is one of the most attractive applications to be implemented with wireless sensor networks (WSNs). However, many solutions are struggled with energy-draining global positioning system (GPS), poorly-performed trilateration for indoor usage, and impractical, complex algorithms to be implemented in sensor nodes. This paper proposes a moving object tracking algorithm using support vector machines (MOT-SVM). The MOT-SVM takes advantage of light-weighted directional binary sensor networks, and state-of-the-art signal processing algorithms, namely the support vector machines and particle filters. We compare our proposed algorithm with the Aslam's work [1] through the simulation. We examine our algorithms for various movement scenarios such as the linear, random and the “8”-model trajectories, and the scenarios in which observing sensors make observation errors.
{"title":"A moving object tracking algorithm using support vector machines in binary sensor networks","authors":"Dusadee Apicharttrisorn, Kittipat Apicharttrisorn, T. Kasetkasem","doi":"10.1109/ISCIT.2013.6645915","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645915","url":null,"abstract":"Wireless sensor technologies have enabled us to deploy such small sensors to monitor an area of interest. Object tracking is one of the most attractive applications to be implemented with wireless sensor networks (WSNs). However, many solutions are struggled with energy-draining global positioning system (GPS), poorly-performed trilateration for indoor usage, and impractical, complex algorithms to be implemented in sensor nodes. This paper proposes a moving object tracking algorithm using support vector machines (MOT-SVM). The MOT-SVM takes advantage of light-weighted directional binary sensor networks, and state-of-the-art signal processing algorithms, namely the support vector machines and particle filters. We compare our proposed algorithm with the Aslam's work [1] through the simulation. We examine our algorithms for various movement scenarios such as the linear, random and the “8”-model trajectories, and the scenarios in which observing sensors make observation errors.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130343756","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645953
Soisala Phuttima, Worasak Rueangsirarak, R. Chaisricharoen
At the present time there are many business owners who are still managing their organizations as a manager with an old style management system. This paper seeks to explore the IT service innovation to upgrade a structural of the steel logistic business with minimum impact on work and production. In this study, the focus is on the exploration of a system service perspective using three purposes. Firstly, develop a detection system for fraudulent expenses monitoring in the steel logistic business to highlight the weak points of the organization's expenses or fraud. Secondly, discuss an efficient way to enhance and improve the overall productivity of the company using detection of fraudulent expenses in the steel logistic business without working impact. Thirdly, find out an efficient way to reduce workload (cash flow orientated) of the business owners and the way to attract them to adopt the usage of self-sufficient technology. Therefore, this paper proposes the framework of cloud computing service to detect and improve the weakness of the steel logistic SME business.
{"title":"Sufficient cloud service for steel logistic SME with limit effect to workforce","authors":"Soisala Phuttima, Worasak Rueangsirarak, R. Chaisricharoen","doi":"10.1109/ISCIT.2013.6645953","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645953","url":null,"abstract":"At the present time there are many business owners who are still managing their organizations as a manager with an old style management system. This paper seeks to explore the IT service innovation to upgrade a structural of the steel logistic business with minimum impact on work and production. In this study, the focus is on the exploration of a system service perspective using three purposes. Firstly, develop a detection system for fraudulent expenses monitoring in the steel logistic business to highlight the weak points of the organization's expenses or fraud. Secondly, discuss an efficient way to enhance and improve the overall productivity of the company using detection of fraudulent expenses in the steel logistic business without working impact. Thirdly, find out an efficient way to reduce workload (cash flow orientated) of the business owners and the way to attract them to adopt the usage of self-sufficient technology. Therefore, this paper proposes the framework of cloud computing service to detect and improve the weakness of the steel logistic SME business.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130407893","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645811
R. Wicaksono, Kwangrok Chang, William Chan, Yoshinori Nagahara, Seiji Kunishige
This paper provides an enhanced algorithm to design the neighbor cell list (NCL) in WCDMA and E-UTRAN. NCL design has been conventionally performed based on RF coverage data obtained from off-line coverage simulations tool, which requires expensive arrangement of tools and information to run. As a result, automatic and continual update of neighbor relation in the mobile network using SON (Self Optimization Network) takes high cost and complexity. The new algorithm proposed in this paper can build the reliable neighbor relations with must less efforts and information requirements like coverage simulation. The reliability of the algorithm was also verified using actual application to a live network.
{"title":"Enhanced neighbor relation building algorithm for WCDMA and LTE Networks","authors":"R. Wicaksono, Kwangrok Chang, William Chan, Yoshinori Nagahara, Seiji Kunishige","doi":"10.1109/ISCIT.2013.6645811","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645811","url":null,"abstract":"This paper provides an enhanced algorithm to design the neighbor cell list (NCL) in WCDMA and E-UTRAN. NCL design has been conventionally performed based on RF coverage data obtained from off-line coverage simulations tool, which requires expensive arrangement of tools and information to run. As a result, automatic and continual update of neighbor relation in the mobile network using SON (Self Optimization Network) takes high cost and complexity. The new algorithm proposed in this paper can build the reliable neighbor relations with must less efforts and information requirements like coverage simulation. The reliability of the algorithm was also verified using actual application to a live network.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130657859","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645874
A. Safari, Yinan Kong
Wavelets are powerful tools that can be used in signal processing and data compression. They are an excellent alternative to Fourier transforms for applications with transient input signals. There is a large volume of published studies describing the use of wavelets in various fields. However, properties of each family for designs with technology libraries have never been investigated. The present work aims to study the most commonly used wavelets (orthogonal and biorthogonal) and compare the area, speed and power consumption of each family when the designs are synthesized using 150 nm standard cell TSMC library. The aim of this paper is to serve as a convenient reference for wavelet users and reviews.
{"title":"Performance comparison of orthogonal and biorthogonal wavelets using technology libraries","authors":"A. Safari, Yinan Kong","doi":"10.1109/ISCIT.2013.6645874","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645874","url":null,"abstract":"Wavelets are powerful tools that can be used in signal processing and data compression. They are an excellent alternative to Fourier transforms for applications with transient input signals. There is a large volume of published studies describing the use of wavelets in various fields. However, properties of each family for designs with technology libraries have never been investigated. The present work aims to study the most commonly used wavelets (orthogonal and biorthogonal) and compare the area, speed and power consumption of each family when the designs are synthesized using 150 nm standard cell TSMC library. The aim of this paper is to serve as a convenient reference for wavelet users and reviews.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121380522","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645815
K. Kunavut
In mobile ad hoc networks, each node behaves like a router and is responsible to deliver data and control traffic to the other nodes by using specific routing protocol. However, nodes in these networks can arbitrarily move with various speeds and possibly cause the frequent link breaks. Furthermore, they are wireless nodes and inherently have limited bandwidth compared to the wired networks which usually results in the network congestion. These situations lead to more number of packet drop and ineffectiveness in data delivery. Hence, the specific ad hoc routing protocols are required to improve the quality of data transmission by selecting the high throughput path for forwarding traffic. This routing process can be achieved by using one or more effective routing metrics. Expected Transmission Count (ETX) is one of these metrics introduced to improve throughput in ad hoc networks by incorporating the link loss ratio. This loss can be possibly caused by buffer overflow in network congestion situation, link break in highly dynamic topology or unidirectional link in heterogeneous networks. In this work, various simulation scenarios are constructed to study the effect of ETX metric in load- and speed-varying conditions in heterogeneous networks.
{"title":"Performance evaluation of ETX metric on OLSR in heterogeneous networks","authors":"K. Kunavut","doi":"10.1109/ISCIT.2013.6645815","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645815","url":null,"abstract":"In mobile ad hoc networks, each node behaves like a router and is responsible to deliver data and control traffic to the other nodes by using specific routing protocol. However, nodes in these networks can arbitrarily move with various speeds and possibly cause the frequent link breaks. Furthermore, they are wireless nodes and inherently have limited bandwidth compared to the wired networks which usually results in the network congestion. These situations lead to more number of packet drop and ineffectiveness in data delivery. Hence, the specific ad hoc routing protocols are required to improve the quality of data transmission by selecting the high throughput path for forwarding traffic. This routing process can be achieved by using one or more effective routing metrics. Expected Transmission Count (ETX) is one of these metrics introduced to improve throughput in ad hoc networks by incorporating the link loss ratio. This loss can be possibly caused by buffer overflow in network congestion situation, link break in highly dynamic topology or unidirectional link in heterogeneous networks. In this work, various simulation scenarios are constructed to study the effect of ETX metric in load- and speed-varying conditions in heterogeneous networks.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"2 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114023887","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645896
Wachirapong Kesjindatanawaj, Sanun Srisuk
The histogram-based bilateral filtering was developed from bilateral filtering as the constant speed on any size of filtering window. It uses local image histogram to constant the filtering usage time. As it uses the histogram for filtering, the speed of filtering is depended on the number of histogram bins. To increase the filtering speed, the total number of bins must be lower. However, the quality of filtered image is dropped by the low number of bins. The new algorithm, deciles-based bilateral filtering is introduced as the filtering that uses only selected 12 value in histogram of filtering window. It requires less computational loops when compared with B loops of histogram bins in histogram-based filtering. The deciles-based algorithm is tested with many standard images. The output images were compared with normal bilateral filtering and they have PSNR around 42 dB which passes the acceptable threshold at more than 40 dB. To avoid O(B) complexity as histogram-based, the deciles-based algorithm use histogram extract that depend on the size of filtering window. The experimental show that for small to medium size of filtering window, the deciles-based has faster speed and better PSNR value than the histogram-based algorithm at 32 bins.
{"title":"Deciles-based bilateral filtering","authors":"Wachirapong Kesjindatanawaj, Sanun Srisuk","doi":"10.1109/ISCIT.2013.6645896","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645896","url":null,"abstract":"The histogram-based bilateral filtering was developed from bilateral filtering as the constant speed on any size of filtering window. It uses local image histogram to constant the filtering usage time. As it uses the histogram for filtering, the speed of filtering is depended on the number of histogram bins. To increase the filtering speed, the total number of bins must be lower. However, the quality of filtered image is dropped by the low number of bins. The new algorithm, deciles-based bilateral filtering is introduced as the filtering that uses only selected 12 value in histogram of filtering window. It requires less computational loops when compared with B loops of histogram bins in histogram-based filtering. The deciles-based algorithm is tested with many standard images. The output images were compared with normal bilateral filtering and they have PSNR around 42 dB which passes the acceptable threshold at more than 40 dB. To avoid O(B) complexity as histogram-based, the deciles-based algorithm use histogram extract that depend on the size of filtering window. The experimental show that for small to medium size of filtering window, the deciles-based has faster speed and better PSNR value than the histogram-based algorithm at 32 bins.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132354155","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645908
B. Homnan, W. Benjapolakul
In the image's structural pixel position schemes, the controlled approaches have been proposed. This paper compares the histogram equalization-obligated linear function with the spatial resolution on the structural pixel position scheme. The results show that the obligated linear function of the histogram equalization can maintain the pixel retention with lower span and lower covariance, in addition, gives higher peak signal to noise ratio. On the other side, the spatial resolution can improve the pixel distribution with almost full span, but gives similar complexity.
{"title":"Comparison of the spatial resolution with the histogram equalization-obligated linear function on structural pixel position scheme","authors":"B. Homnan, W. Benjapolakul","doi":"10.1109/ISCIT.2013.6645908","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645908","url":null,"abstract":"In the image's structural pixel position schemes, the controlled approaches have been proposed. This paper compares the histogram equalization-obligated linear function with the spatial resolution on the structural pixel position scheme. The results show that the obligated linear function of the histogram equalization can maintain the pixel retention with lower span and lower covariance, in addition, gives higher peak signal to noise ratio. On the other side, the spatial resolution can improve the pixel distribution with almost full span, but gives similar complexity.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134297815","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 : 2013-10-24DOI: 10.1109/ISCIT.2013.6645857
G. Wang, Zhenmin Zhao, Zhaoming Lu, Yi Tong, X. Wen
Network virtualization enables the co-existence of multiple virtual networks (VNs) on the same substrate network (SN) by sharing the available resources. Virtual network embedding (VNE) plays an important role in building virtual networks. In this paper, we propose a new virtual network mapping algorithm based on a mapping tree on nodes mapping phase. Mapping tree, converted from the virtual network, is a simplified topology of virtual network, which is used to describe the hierarchical relationships among the virtual nodes. In our algorithm, different virtual nodes in a mapping tree which are directly connected by virtual links should be mapped to the same substrate node as long as the node's available resources can satisfy the total resource requirements of these virtual nodes. In link mapping phase, we use the k-shortest paths method. Simulation results show that the proposed scheme has a good performance in the acceptance ratio of virtual network requests, and the average revenue of substrate network.
{"title":"A virtual network embedding algorithm based on mapping tree","authors":"G. Wang, Zhenmin Zhao, Zhaoming Lu, Yi Tong, X. Wen","doi":"10.1109/ISCIT.2013.6645857","DOIUrl":"https://doi.org/10.1109/ISCIT.2013.6645857","url":null,"abstract":"Network virtualization enables the co-existence of multiple virtual networks (VNs) on the same substrate network (SN) by sharing the available resources. Virtual network embedding (VNE) plays an important role in building virtual networks. In this paper, we propose a new virtual network mapping algorithm based on a mapping tree on nodes mapping phase. Mapping tree, converted from the virtual network, is a simplified topology of virtual network, which is used to describe the hierarchical relationships among the virtual nodes. In our algorithm, different virtual nodes in a mapping tree which are directly connected by virtual links should be mapped to the same substrate node as long as the node's available resources can satisfy the total resource requirements of these virtual nodes. In link mapping phase, we use the k-shortest paths method. Simulation results show that the proposed scheme has a good performance in the acceptance ratio of virtual network requests, and the average revenue of substrate network.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134341371","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
扫码关注我们
求助内容：
应助结果提醒方式：