Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio (CR) networks. It is a time-varying Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio(CR) networks. It is a time-varying and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.
{"title":"Self-Organizing Dynamic Spectrum Management for Cognitive Radio Networks","authors":"F. Khozeimeh, S. Haykin","doi":"10.1109/CNSR.2010.51","DOIUrl":"https://doi.org/10.1109/CNSR.2010.51","url":null,"abstract":"Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio (CR) networks. It is a time-varying Dynamic spectrum management (DSM) is one of the key problems in the design of cognitive radio(CR) networks. It is a time-varying and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.and location-dependent optimization problem, equivalent to the well-known graph-colouring problem in graph theory. This problem is known to be NP-hard and computationally challenging to solve. Accordingly, finding the exact solution for the DSM optimization problem is typically not practical. In this paper, we introduce a novel self-organizing DSM scheme, which solves the DSM problem in a decentralized manner. The use of self-organization to address the DSM problem offers several benefits: decentralization and scalability ofthe network behaviour, computational simplicity, cost-effectiveness and bandwidth conservation. In the paper, we address the underlying principles involved in the design and implementation of the self-organizing DSM as well as a software testbed for demonstrating this novel approach. Experimental results are presented to justify this new approach.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127595119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a steganography method to covertly transmit data via normal or delayed B frame packets in multimedia streaming over networks. The proposed covert channels do not change the original traffic pattern. The bandwidth and the impact of the proposed covertchannels on the quality of multimedia transmission are analyzed. Simulations on real video traces are conducted and the results show the proposed covert channels not only achieve relatively high bandwidth but also keep the received video quality high, which makesit practical and not easy to be detected.
{"title":"Hiding Data in Multimedia Streaming over Networks","authors":"Hong Zhao, Y. Shi, N. Ansari","doi":"10.1109/CNSR.2010.20","DOIUrl":"https://doi.org/10.1109/CNSR.2010.20","url":null,"abstract":"This paper presents a steganography method to covertly transmit data via normal or delayed B frame packets in multimedia streaming over networks. The proposed covert channels do not change the original traffic pattern. The bandwidth and the impact of the proposed covertchannels on the quality of multimedia transmission are analyzed. Simulations on real video traces are conducted and the results show the proposed covert channels not only achieve relatively high bandwidth but also keep the received video quality high, which makesit practical and not easy to be detected.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123321211","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}
Hongli Xu, Liusheng Huang, Wang Gang, Tao Xu, Yindong Zhang
Recently, cooperative communication is shown to be a promising approach to improve the transmission’s bandwidth without additional antennas on each node. Under this communication paradigm, the selection of relay nodes significantly affects the network throughput. As interfer-ence will greatly decrease the link’s rate, this paper stud-ies the interference-aware relay node assignment problem for multiple transmission pairs which compete for a set of relay nodes to achieve the Max-Min fairness. The main contribution of this paper is formulation of interference- aware relay node assignment problem and development of a heuristic algorithm, called as IRA. This algorithm first assigns an appropriate weight for each transmission pair and enhances the minimum bandwidth of all transmission pairs by an iterative process. The simulation results show that the proposed algorithm can improve the bandwidth provision at least 21.6% and 42.5% compared with ORA algorithm and the direct transmission scheme respectively.
{"title":"Interference-Aware Relay Assignment for Cooperative Networks","authors":"Hongli Xu, Liusheng Huang, Wang Gang, Tao Xu, Yindong Zhang","doi":"10.1109/CNSR.2010.65","DOIUrl":"https://doi.org/10.1109/CNSR.2010.65","url":null,"abstract":"Recently, cooperative communication is shown to be a promising approach to improve the transmission’s bandwidth without additional antennas on each node. Under this communication paradigm, the selection of relay nodes significantly affects the network throughput. As interfer-ence will greatly decrease the link’s rate, this paper stud-ies the interference-aware relay node assignment problem for multiple transmission pairs which compete for a set of relay nodes to achieve the Max-Min fairness. The main contribution of this paper is formulation of interference- aware relay node assignment problem and development of a heuristic algorithm, called as IRA. This algorithm first assigns an appropriate weight for each transmission pair and enhances the minimum bandwidth of all transmission pairs by an iterative process. The simulation results show that the proposed algorithm can improve the bandwidth provision at least 21.6% and 42.5% compared with ORA algorithm and the direct transmission scheme respectively.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127968778","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 considers optimal power distribution among transmitted symbols relayed by cooperating users in wireless network cocast (WNC) to minimize aggregate transmit power using geometric programming based only on long-term fading statistics or network topology while guaranteeing a predetermined quality of service (QoS). Results show that the proposed scheme can significantly save energy consumption.
{"title":"Optimal Symbol Power Distribution for Wireless Network Cocast","authors":"H. Khuong, T. Le-Ngoc","doi":"10.1109/CNSR.2010.63","DOIUrl":"https://doi.org/10.1109/CNSR.2010.63","url":null,"abstract":"This paper considers optimal power distribution among transmitted symbols relayed by cooperating users in wireless network cocast (WNC) to minimize aggregate transmit power using geometric programming based only on long-term fading statistics or network topology while guaranteeing a predetermined quality of service (QoS). Results show that the proposed scheme can significantly save energy consumption.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421546","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}
Key design requirements for wireless sensor network (WSN) applications revolve around long battery life, low cost, small footprint and mesh-networking in supporting communication between large numbers of devices in an interoperable and multi-application environment. This paper presents a WSN testbed that aims to facilitate the developments and experiments of different routing algorithms. Numerous adaptive routing algorithms are implemented to offer self-healing capability for a wide range of WSN applications. Senor nodes in the network can connect together and to sensor gateways in star, mesh, and hybrid topologies. When any sensor node fails due to battery drain, physical destruction, hardware and/or software issues, etc, the network will dynamically route active connections around isolated network segments in order to minimize service interruption.
{"title":"A Wireless Sensor Network Testbed","authors":"Quang-Dung Ho, T. Le-Ngoc","doi":"10.1109/CNSR.2010.71","DOIUrl":"https://doi.org/10.1109/CNSR.2010.71","url":null,"abstract":"Key design requirements for wireless sensor network (WSN) applications revolve around long battery life, low cost, small footprint and mesh-networking in supporting communication between large numbers of devices in an interoperable and multi-application environment. This paper presents a WSN testbed that aims to facilitate the developments and experiments of different routing algorithms. Numerous adaptive routing algorithms are implemented to offer self-healing capability for a wide range of WSN applications. Senor nodes in the network can connect together and to sensor gateways in star, mesh, and hybrid topologies. When any sensor node fails due to battery drain, physical destruction, hardware and/or software issues, etc, the network will dynamically route active connections around isolated network segments in order to minimize service interruption.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133792333","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}
Abdeljalil Karouia, R. Langar, T. Nguyen, G. Pujolle
The Post-IP research direction aims at defining new network architectures apt to replace the Internet architecture in twenty years. To this end, new protocols design is needed to support new applications requirements and provide autonomy as well as intelligence to a network. In this paper, we first propose a new generic protocol model designed for the Future Internet. Our proposal is based on functionality composition concept, which allows the selection and composition of functionalities on demand in order to get the required and most suitable protocol for each application, each network and each device. One of the key distinguishing features of our framework is its flexibility and self-adaptability as well as neutral-technology implementation since it provides a high infrastructure and technology transparency. To highlight the benefits of our proposed model, we present a protocol implementation based on the service oriented architecture (SOA) paradigm. In addition, we present a service-oriented reference architecture for the Nth stratum framework defined within the 4WARD consortium.
{"title":"SOA-Based Approach for the Design of the Future Internet","authors":"Abdeljalil Karouia, R. Langar, T. Nguyen, G. Pujolle","doi":"10.1109/CNSR.2010.19","DOIUrl":"https://doi.org/10.1109/CNSR.2010.19","url":null,"abstract":"The Post-IP research direction aims at defining new network architectures apt to replace the Internet architecture in twenty years. To this end, new protocols design is needed to support new applications requirements and provide autonomy as well as intelligence to a network. In this paper, we first propose a new generic protocol model designed for the Future Internet. Our proposal is based on functionality composition concept, which allows the selection and composition of functionalities on demand in order to get the required and most suitable protocol for each application, each network and each device. One of the key distinguishing features of our framework is its flexibility and self-adaptability as well as neutral-technology implementation since it provides a high infrastructure and technology transparency. To highlight the benefits of our proposed model, we present a protocol implementation based on the service oriented architecture (SOA) paradigm. In addition, we present a service-oriented reference architecture for the Nth stratum framework defined within the 4WARD consortium.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131722193","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}
Key establishment is a critical security issue for wireless sensor networks. Due to resource constraints on the sensors, public key based protocols are not suitable. In addition, conventional symmetric encryption based protocols require significant sensor memory. In this paper, we propose a new hybrid key establishment protocol based on a scheme by Blom and random key pre-distribution. In the proposed protocol, we use deployment knowledge and a new model to distribute key materials among sensors. The network area is divided into non-overlapping hexagonal cells, and key establishment between sensors in a cell is provided by the Blom scheme. Key establishment between sensors residing in neighboring cells is provided via pre-distributed random keys. The proposed protocol provides excellent performance with efficient resource consumption.
{"title":"A New Key Establishment Protocol for Limited Resource Wireless Sensor Networks","authors":"A. Fanian, M. Berenjkoub, H. Saidi, T. Gulliver","doi":"10.1109/CNSR.2010.43","DOIUrl":"https://doi.org/10.1109/CNSR.2010.43","url":null,"abstract":"Key establishment is a critical security issue for wireless sensor networks. Due to resource constraints on the sensors, public key based protocols are not suitable. In addition, conventional symmetric encryption based protocols require significant sensor memory. In this paper, we propose a new hybrid key establishment protocol based on a scheme by Blom and random key pre-distribution. In the proposed protocol, we use deployment knowledge and a new model to distribute key materials among sensors. The network area is divided into non-overlapping hexagonal cells, and key establishment between sensors in a cell is provided by the Blom scheme. Key establishment between sensors residing in neighboring cells is provided via pre-distributed random keys. The proposed protocol provides excellent performance with efficient resource consumption.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129302237","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}
A. Grillo, Alessandro Lentini, M. Naldi, G. Italiano
Strategic bidding coupled with the GSP pricing mechanism is known to lead to aggressive bidding behaviour and Competitor Busting in keyword auctions. We introduce a new pricing mechanism, named Penalized Second Pricing (PSP), to help reducing the unfair effects of aggressive bidding.The performances of GSP and PSP are evaluated both in a static and a dynamic context, where the number of bidders may change during the auction. The simulation experiments show that PSP not only discourages aggressive bidding behaviour, but also leads to larger revenues for the auctioneer than those obtained with GSP.
{"title":"Penalized Second Price: A New Pricing Algorithm for Advertising in Search Engines","authors":"A. Grillo, Alessandro Lentini, M. Naldi, G. Italiano","doi":"10.1109/CNSR.2010.13","DOIUrl":"https://doi.org/10.1109/CNSR.2010.13","url":null,"abstract":"Strategic bidding coupled with the GSP pricing mechanism is known to lead to aggressive bidding behaviour and Competitor Busting in keyword auctions. We introduce a new pricing mechanism, named Penalized Second Pricing (PSP), to help reducing the unfair effects of aggressive bidding.The performances of GSP and PSP are evaluated both in a static and a dynamic context, where the number of bidders may change during the auction. The simulation experiments show that PSP not only discourages aggressive bidding behaviour, but also leads to larger revenues for the auctioneer than those obtained with GSP.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125330748","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 traffic evolution is notoriously marked by an increasing dynamism that promotes the design of a dynamic optical layer. Despite the contention issue, Optical Burst Switchingis planned to be deployed in the near future because it offers the required reactivity.Recourse to electrical processing to solve burst contentions has been disregarded because it can dramatically impact the end-to-end delay and the electrical memory requirements. Recently, the CAROBS transmission scheme has been proposed as an adapted response to the drawbacks of translucent architectures: By exploiting both edge and core traffic grooming, CAROBS significantly reduces the contention rate and the duration of the aggregation process. With the additional use of wavelength conversion, loss-less transfer is achieved with similar end-to-end delay and memory requirements as in all-optical OBS networks.The objective in this paper is to attain similar delay and memory performances for loss-less transfers without the support of wavelength converters. We propose a new train assembly process, called CTA, which reduces the time spent in electrical buffers by decreasing the offset times of the trains. The resulting reduction of the buffer occupancy allows the achievement of similar performances as with wavelength conversion, even in congested states, without investing in any specific equipment.
{"title":"An Enhanced Train Assembly Policy for Lossless OBS with CAROBS","authors":"T. Coutelen, B. Jaumard, G. Hébuterne","doi":"10.1109/CNSR.2010.21","DOIUrl":"https://doi.org/10.1109/CNSR.2010.21","url":null,"abstract":"The traffic evolution is notoriously marked by an increasing dynamism that promotes the design of a dynamic optical layer. Despite the contention issue, Optical Burst Switchingis planned to be deployed in the near future because it offers the required reactivity.Recourse to electrical processing to solve burst contentions has been disregarded because it can dramatically impact the end-to-end delay and the electrical memory requirements. Recently, the CAROBS transmission scheme has been proposed as an adapted response to the drawbacks of translucent architectures: By exploiting both edge and core traffic grooming, CAROBS significantly reduces the contention rate and the duration of the aggregation process. With the additional use of wavelength conversion, loss-less transfer is achieved with similar end-to-end delay and memory requirements as in all-optical OBS networks.The objective in this paper is to attain similar delay and memory performances for loss-less transfers without the support of wavelength converters. We propose a new train assembly process, called CTA, which reduces the time spent in electrical buffers by decreasing the offset times of the trains. The resulting reduction of the buffer occupancy allows the achievement of similar performances as with wavelength conversion, even in congested states, without investing in any specific equipment.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132993290","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
扫码关注我们
求助内容：
应助结果提醒方式：