Pub Date : 2007-12-12DOI: 10.1109/CANET.2007.4401670
A. Gondran, Oumaya Baala, A. Caminada, H. Mabed
The two relevant stages in cellular network planning process arc the location selection of the transmitters and the frequency assignment. In the literature WLAN planning approach treats successively those two stages. In this article we propose a new approach where location selection and frequency assignment are tackled together during WLAN planning process. This method has two important features. Firstly we use all the available channels for frequency assignment. Secondly multiple signals are taken into account to compute the SINR. Several experimental results show the benefits of this new approach.
{"title":"Joint optimization of access point placement and frequency assignment in WLAN","authors":"A. Gondran, Oumaya Baala, A. Caminada, H. Mabed","doi":"10.1109/CANET.2007.4401670","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401670","url":null,"abstract":"The two relevant stages in cellular network planning process arc the location selection of the transmitters and the frequency assignment. In the literature WLAN planning approach treats successively those two stages. In this article we propose a new approach where location selection and frequency assignment are tackled together during WLAN planning process. This method has two important features. Firstly we use all the available channels for frequency assignment. Secondly multiple signals are taken into account to compute the SINR. Several experimental results show the benefits of this new approach.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372487","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401700
T. Radjabov, U.A. Rasulev
We try to create the cryptographic scheme of producing two identical keys using, for the first time, entangled trinary quantum systems for quantum key distribution. The advantage of trinary quantum systems over the normally used binary quantum systems is an increased coding density and a higher security margin. The trinary quantum systems are encoded into the orbital angular momentum of photons, namely Laguerre -Gaussian modes with azimuthally index 1 +1, 0 and -1, respectively. The orbital angular momentum is controlled with phase holograms. In an Ekert-type protocol the violation of a three-dimensional Bell inequality verifies the security of the generated keys. A key is obtained with a trinary quantum system error rate of approximately 10%.
{"title":"Quantum cryptography with trinary quantum systems","authors":"T. Radjabov, U.A. Rasulev","doi":"10.1109/CANET.2007.4401700","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401700","url":null,"abstract":"We try to create the cryptographic scheme of producing two identical keys using, for the first time, entangled trinary quantum systems for quantum key distribution. The advantage of trinary quantum systems over the normally used binary quantum systems is an increased coding density and a higher security margin. The trinary quantum systems are encoded into the orbital angular momentum of photons, namely Laguerre -Gaussian modes with azimuthally index 1 +1, 0 and -1, respectively. The orbital angular momentum is controlled with phase holograms. In an Ekert-type protocol the violation of a three-dimensional Bell inequality verifies the security of the generated keys. A key is obtained with a trinary quantum system error rate of approximately 10%.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129932434","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401695
Yufeng Luo, J. Guo
When developing hotel information platform, the service providers face an important issue, how to attract more hotels to join in their platform without significantly increasing integration cost but maintaining effective information integration? This paper considers the issue in two aspects of business integration policy and technology support, which bring up a novel hotel power policy approach for service providers to define different hotel partners and integrate heterogeneous hotel information. With this approach, a hotel information collaboration platform is proposed to implement the hotel power policy for integrating the complex real-world hotel information.
{"title":"Hotel power policy approach to heterogeneous online hotel information integration","authors":"Yufeng Luo, J. Guo","doi":"10.1109/CANET.2007.4401695","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401695","url":null,"abstract":"When developing hotel information platform, the service providers face an important issue, how to attract more hotels to join in their platform without significantly increasing integration cost but maintaining effective information integration? This paper considers the issue in two aspects of business integration policy and technology support, which bring up a novel hotel power policy approach for service providers to define different hotel partners and integrate heterogeneous hotel information. With this approach, a hotel information collaboration platform is proposed to implement the hotel power policy for integrating the complex real-world hotel information.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126855109","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401688
H. A. Harhira, S. Pierre
A sensor network is a set of limited-capability nodes that are equipped with wireless transceivers and limited batteries. In this paper, we develop an optimization model for a time dependent planning process. Planning tasks include not only activating or deactivating a set of sensors, but also building a hierarchical architecture based on electing cluster heads in a strategic and energy saving manner. Specifically, we propose an Integer Linear Programming model that aims to balance the energy consumption during a predefined period while dynamically changing covering schema and cluster heads. In order to balance the energy consumption, we propose an energy consumption score that increases exponentially with respect to the real dissipated energy. Finally, numerical results performed by the CPLEX software suite are shown and analyzed. It is obvious that the network energy consumption minimizing and balancing are well achieved.
{"title":"Global cluster based planning of wireless sensor networks","authors":"H. A. Harhira, S. Pierre","doi":"10.1109/CANET.2007.4401688","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401688","url":null,"abstract":"A sensor network is a set of limited-capability nodes that are equipped with wireless transceivers and limited batteries. In this paper, we develop an optimization model for a time dependent planning process. Planning tasks include not only activating or deactivating a set of sensors, but also building a hierarchical architecture based on electing cluster heads in a strategic and energy saving manner. Specifically, we propose an Integer Linear Programming model that aims to balance the energy consumption during a predefined period while dynamically changing covering schema and cluster heads. In order to balance the energy consumption, we propose an energy consumption score that increases exponentially with respect to the real dissipated energy. Finally, numerical results performed by the CPLEX software suite are shown and analyzed. It is obvious that the network energy consumption minimizing and balancing are well achieved.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132519706","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401674
N. Wattanamongkhol, W. Srichavengsup, S. Nakpeerayuth, L. Wuttisiittikulkij
The primary medium access control (MAC) protocol for wireless local area network (WLAN) is distributed coordination function (DCF) for IEEE 802.11. The binary exponential backoff (BEB) scheme used in 802.11 DCF mechanism may suffer from low throughput when the number of stations gets large due to the lack of flexibility in choosing the contention window size imposed by the standard. To improve the system throughput of IEEE 802.11 DCF, in this paper we propose a modification to the conventional BEB. The simulation results show that the modified backoff algorithm helps improve the saturation throughput of the DCF protocol using the same standard parameter settings. In addition, it is shown that the throughput performance of the system depends on the total number of stations and the maximum backoff stage.
{"title":"Performance analysis of modified backoff algorithm in IEEE 802.11 networks","authors":"N. Wattanamongkhol, W. Srichavengsup, S. Nakpeerayuth, L. Wuttisiittikulkij","doi":"10.1109/CANET.2007.4401674","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401674","url":null,"abstract":"The primary medium access control (MAC) protocol for wireless local area network (WLAN) is distributed coordination function (DCF) for IEEE 802.11. The binary exponential backoff (BEB) scheme used in 802.11 DCF mechanism may suffer from low throughput when the number of stations gets large due to the lack of flexibility in choosing the contention window size imposed by the standard. To improve the system throughput of IEEE 802.11 DCF, in this paper we propose a modification to the conventional BEB. The simulation results show that the modified backoff algorithm helps improve the saturation throughput of the DCF protocol using the same standard parameter settings. In addition, it is shown that the throughput performance of the system depends on the total number of stations and the maximum backoff stage.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134068317","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401703
D.Kh. Mirkarimov, T. Radjabov, A. Kamardin, Z. Khakimov
This work devoted to the fabrication of metal nanoparticles in silicon and sapphire by ion implantation and their modification by laser annealing. This approach is promising for the development of optical composite materials in the optoelectronics production technology. Composite layers were fabricated in silicon by implantation of 40-keV Cu+ ions at a dose of 1017 ion/cm2 and an ion beam current density varying from 2.5 to 10 mA/cm2. An interaction of high power excimer laser pulsed with fabricated composite layer aimed to modify the sizes and the size distribution of copper particles. It is found that the laser annealing diminishes nanoparticles in the silicon. Experimental data on laser modification may be explained by photofragmentation and/or melting of the nanoparticles in the silicon.
{"title":"Fabrication of metal’s nanoparticles in silicon and sapphire by low energy ion implantation","authors":"D.Kh. Mirkarimov, T. Radjabov, A. Kamardin, Z. Khakimov","doi":"10.1109/CANET.2007.4401703","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401703","url":null,"abstract":"This work devoted to the fabrication of metal nanoparticles in silicon and sapphire by ion implantation and their modification by laser annealing. This approach is promising for the development of optical composite materials in the optoelectronics production technology. Composite layers were fabricated in silicon by implantation of 40-keV Cu+ ions at a dose of 1017 ion/cm2 and an ion beam current density varying from 2.5 to 10 mA/cm2. An interaction of high power excimer laser pulsed with fabricated composite layer aimed to modify the sizes and the size distribution of copper particles. It is found that the laser annealing diminishes nanoparticles in the silicon. Experimental data on laser modification may be explained by photofragmentation and/or melting of the nanoparticles in the silicon.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"12 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128530465","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401694
Kobra Etminani, Mahmoud Naghibzadeh
Today, the high cost of supercomputers in the one hand and the need for large-scale computational resources on the other hand, has led to use network of computational resources known as Grid. Numerous research groups in universities, research labs, and industries around the world are now working on a type of Grid called Computational Grids that enable aggregation of distributed resources for solving large-scale data intensive problems in science, engineering, and commerce. Several institutions and universities have started research and teaching programs on Grid computing as part of their parallel and distributed computing curriculum. To better use tremendous capabilities of this distributed system, effective and efficient scheduling algorithms are needed. In this paper, we introduce a new scheduling algorithm based on two conventional scheduling algorithms, Min-Min and Max-Min, to use their cons and at the same time, cover their pros. It selects between the two algorithms based on standard deviation of the expected completion time of tasks on resources. We evaluate our scheduling heuristic, the Selective algorithm, within a grid simulator called GridSim. We also compared our approach to its two basic heuristics. The experimental results show that the new heuristic can lead to significant performance gain for a variety of scenarios.
{"title":"A Min-Min Max-Min Selective Algorithm for Grid Task Scheduling","authors":"Kobra Etminani, Mahmoud Naghibzadeh","doi":"10.1109/CANET.2007.4401694","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401694","url":null,"abstract":"Today, the high cost of supercomputers in the one hand and the need for large-scale computational resources on the other hand, has led to use network of computational resources known as Grid. Numerous research groups in universities, research labs, and industries around the world are now working on a type of Grid called Computational Grids that enable aggregation of distributed resources for solving large-scale data intensive problems in science, engineering, and commerce. Several institutions and universities have started research and teaching programs on Grid computing as part of their parallel and distributed computing curriculum. To better use tremendous capabilities of this distributed system, effective and efficient scheduling algorithms are needed. In this paper, we introduce a new scheduling algorithm based on two conventional scheduling algorithms, Min-Min and Max-Min, to use their cons and at the same time, cover their pros. It selects between the two algorithms based on standard deviation of the expected completion time of tasks on resources. We evaluate our scheduling heuristic, the Selective algorithm, within a grid simulator called GridSim. We also compared our approach to its two basic heuristics. The experimental results show that the new heuristic can lead to significant performance gain for a variety of scenarios.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128177579","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401659
H. Shokrzadeh, A. Haghighat, Farzad Tashtarian, Abbas Nayebi
Rumor routing is a classic routing algorithm based on the random walk of agents. In this paper, a method to improve the performance of this routing algorithm is proposed. Here, we try to improve the latency and energy consumption of the traditional algorithm using propagation of query and event agents in straight lines, instead of using purely random walk paths. As our results confirm, this method improves the delivery ratio of the queries which is a drawback of traditional rumor routing. To compare the performance measures with traditional algorithm, a simulation framework is developed and extensive simulations are performed.
{"title":"Directional rumor routing in wireless sensor networks","authors":"H. Shokrzadeh, A. Haghighat, Farzad Tashtarian, Abbas Nayebi","doi":"10.1109/CANET.2007.4401659","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401659","url":null,"abstract":"Rumor routing is a classic routing algorithm based on the random walk of agents. In this paper, a method to improve the performance of this routing algorithm is proposed. Here, we try to improve the latency and energy consumption of the traditional algorithm using propagation of query and event agents in straight lines, instead of using purely random walk paths. As our results confirm, this method improves the delivery ratio of the queries which is a drawback of traditional rumor routing. To compare the performance measures with traditional algorithm, a simulation framework is developed and extensive simulations are performed.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129567781","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401711
Guangjie Han, D. Deokjai Choi, T. Tam Van Nguyen
In wireless sensor networks (WSNs), nodes assist each other by passing data and control packets from one node to another. In a complex WSN, malicious nodes are well disguised so that they can purposely attack the whole network using the natural cooperations of sensors. In additional, the error-prone of sensors always cause the system instability of WSNs. To overcome this, we study trust mechanism in the human society and introduce it into a WSN. We also construct a trust model in accordance with the characteristics of a WSN. Based on trust model, we propose a power-aware and reliable algorithm for sensor selection. The simulation results show that our algorithm can improve the system stability of sensor networks, and efficiently defend against the attacks of malicious nodes.
{"title":"A reliable sensor selection algorithm for wireless sensor networks","authors":"Guangjie Han, D. Deokjai Choi, T. Tam Van Nguyen","doi":"10.1109/CANET.2007.4401711","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401711","url":null,"abstract":"In wireless sensor networks (WSNs), nodes assist each other by passing data and control packets from one node to another. In a complex WSN, malicious nodes are well disguised so that they can purposely attack the whole network using the natural cooperations of sensors. In additional, the error-prone of sensors always cause the system instability of WSNs. To overcome this, we study trust mechanism in the human society and introduce it into a WSN. We also construct a trust model in accordance with the characteristics of a WSN. Based on trust model, we propose a power-aware and reliable algorithm for sensor selection. The simulation results show that our algorithm can improve the system stability of sensor networks, and efficiently defend against the attacks of malicious nodes.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127033788","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 : 2007-12-12DOI: 10.1109/CANET.2007.4401684
S. Kasimov, E.N. Bugibaev, S. Arzikulov
Out-of-date and new safety methods, their rapid introduction to wireless network and reliability of data security are considered in the article. The issues of system creation, providing function and interaction in accordance with portability standards, open system interaction and information security are mentioned in the article.
{"title":"Wireless networks and information security","authors":"S. Kasimov, E.N. Bugibaev, S. Arzikulov","doi":"10.1109/CANET.2007.4401684","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401684","url":null,"abstract":"Out-of-date and new safety methods, their rapid introduction to wireless network and reliability of data security are considered in the article. The issues of system creation, providing function and interaction in accordance with portability standards, open system interaction and information security are mentioned in the article.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129146051","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
扫码关注我们
求助内容：
应助结果提醒方式：