Pub Date : 2007-12-12DOI: 10.1109/CANET.2007.4401692
E.S. Rahmiddinov
This work devoted modeling of processes of work of cellular systems to mobile communication. With the help of the developed model it is possible to create virtual systems of cellular mobile communication and training programs showing processes of work of these systems. Is considered of coordinates (in what cell there is a subscriber) moving of the mobile subscriber with one cell in another, processes of identification of the equipment and authentication of the subscriber, also processes occurring at outgoing and entering calls.
{"title":"Modeling of processes of work oF cellular systems of mobile communication","authors":"E.S. Rahmiddinov","doi":"10.1109/CANET.2007.4401692","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401692","url":null,"abstract":"This work devoted modeling of processes of work of cellular systems to mobile communication. With the help of the developed model it is possible to create virtual systems of cellular mobile communication and training programs showing processes of work of these systems. Is considered of coordinates (in what cell there is a subscriber) moving of the mobile subscriber with one cell in another, processes of identification of the equipment and authentication of the subscriber, also processes occurring at outgoing and entering calls.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"213 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":"133626256","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.4401701
Xuetao Wei, Xingwei Wang, Lei Guo, Le Min Li
Availability is an important metric in mesh works. Many previous works have discussed differentiated services provision with availability guarantee. Nowadays, a new request that will use the special wavelengths to transmit different availability traffic appears. In the duration of its holding time, customers will have different availability requirements. Based on this, we propose a simple scheme called time aware availability guarantee (TAAG) to discuss availability guarantee with time variation. Compared to time unaware availability guarantee (TUAG) scheme, TAAG performs better in resource utilization, blocking probability and traffic throughput.
{"title":"A simple insight about availability guarantee with time variation in survivable WDM mesh networks","authors":"Xuetao Wei, Xingwei Wang, Lei Guo, Le Min Li","doi":"10.1109/CANET.2007.4401701","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401701","url":null,"abstract":"Availability is an important metric in mesh works. Many previous works have discussed differentiated services provision with availability guarantee. Nowadays, a new request that will use the special wavelengths to transmit different availability traffic appears. In the duration of its holding time, customers will have different availability requirements. Based on this, we propose a simple scheme called time aware availability guarantee (TAAG) to discuss availability guarantee with time variation. Compared to time unaware availability guarantee (TUAG) scheme, TAAG performs better in resource utilization, blocking probability and traffic throughput.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"243 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":"122129645","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.4401705
K. Aripov, K. Bustanov, E. V. Ob’edkov, F. R. Nasirkhodjaev
The work is devoted to synthesis optoelectronic circuits of receiving nodes for telecommunication devices with amplification featuring enhanced work stability at high values of collector-emitter voltage, high working currents, i.e. in a mode with high dissipation power (several times higher comparing with any known modes of operations), which enables independent optimization of value of spectral sensitivity and amplification factor.
{"title":"Design of functional nodes for telecommunication devices based on Photo- Voltaic and Injection-Voltaic Effects.","authors":"K. Aripov, K. Bustanov, E. V. Ob’edkov, F. R. Nasirkhodjaev","doi":"10.1109/CANET.2007.4401705","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401705","url":null,"abstract":"The work is devoted to synthesis optoelectronic circuits of receiving nodes for telecommunication devices with amplification featuring enhanced work stability at high values of collector-emitter voltage, high working currents, i.e. in a mode with high dissipation power (several times higher comparing with any known modes of operations), which enables independent optimization of value of spectral sensitivity and amplification factor.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"74 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":"129848945","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.4401675
Tao Yu, Shanzhi Chen, Xin Li, Zhen Qin
With the emergence of voice over IP and other realtime business applications, there is a growing demand for high network availability. Commonly deployed link state routing protocols such as OSPF react to link failures through global (i.e., network wide) link state advertisements and routing table recomputations, causing significant forwarding discontinuity after a failure. To improve network availability without jeopardizing routing stability, we propose a proactive local rerouting based approach. The proposed approach prepares for failures using deflection routing and upon a failure, suppresses the link state advertisement and instead triggers local rerouting using an alternate table. Both node and link failure can be handled when no more than one component failure occurs and the proposed approach always finds a loop-free path to a destination if one such path exists. The experimental results show that the proposed approach achieves excellent performance.
{"title":"Enhancing network availability by deflection based fast rerouting","authors":"Tao Yu, Shanzhi Chen, Xin Li, Zhen Qin","doi":"10.1109/CANET.2007.4401675","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401675","url":null,"abstract":"With the emergence of voice over IP and other realtime business applications, there is a growing demand for high network availability. Commonly deployed link state routing protocols such as OSPF react to link failures through global (i.e., network wide) link state advertisements and routing table recomputations, causing significant forwarding discontinuity after a failure. To improve network availability without jeopardizing routing stability, we propose a proactive local rerouting based approach. The proposed approach prepares for failures using deflection routing and upon a failure, suppresses the link state advertisement and instead triggers local rerouting using an alternate table. Both node and link failure can be handled when no more than one component failure occurs and the proposed approach always finds a loop-free path to a destination if one such path exists. The experimental results show that the proposed approach achieves excellent performance.","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":"129590064","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.4401663
Lili Wang, Jianxun Dang, Yi Jin, H. Jin
In this paper, we propose an efficient and fault tolerant topology control algorithm named AWSF for large-scale wireless sensor networks, which introduces the scale-free characteristic of complex networks into the topology of wireless sensor networks to minimize transmission delay and increase robustness. It is a distributed algorithm, letting each node locally adjust its transmission power and determine its neighbor relationship based on certain arbitrary weights which are random real numbers following a negative power-law probability distribution. The topology constructed under AWSF is proved to be scale-free, strongly connected and bi-directional. Simulation results show that the resulting topology has a small average degree and good network performance in terms of transmission delay and robustness.
{"title":"Scale-free topology for large-scale wireless sensor networks","authors":"Lili Wang, Jianxun Dang, Yi Jin, H. Jin","doi":"10.1109/CANET.2007.4401663","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401663","url":null,"abstract":"In this paper, we propose an efficient and fault tolerant topology control algorithm named AWSF for large-scale wireless sensor networks, which introduces the scale-free characteristic of complex networks into the topology of wireless sensor networks to minimize transmission delay and increase robustness. It is a distributed algorithm, letting each node locally adjust its transmission power and determine its neighbor relationship based on certain arbitrary weights which are random real numbers following a negative power-law probability distribution. The topology constructed under AWSF is proved to be scale-free, strongly connected and bi-directional. Simulation results show that the resulting topology has a small average degree and good network performance in terms of transmission delay and robustness.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"98 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":"130855441","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.4401685
D. Adane, P. Adane, S. Sathe
Communicating with confidential data requires special attention in a mobile agents environment, especially when the other hosts must be prevented from eavesdropping the communication. We propose two methods for secured communication between the agent and a host (or other agent). The first approach for an untrusted environment uses on the fly encryption-decryption sequence to directly convert the message or plaintext into one that is encrypted directly with the public key of receiver thus reducing the overhead of retrieving the public key of sender. The technique uses AIGamal encryption/decryption. Theoretically it is proved that this scheme indeed gives the desired result. The second approach uses a trusted central authority for supply of public keys. It uses time stamps, identity of agents and RSA algorithm to provide a secured communication. Our minimal implementation of this technique suggests that it is possible to embed the entire functionality for communication security within an agent. Finally, we also state and explain how the second approach is useful in context of mobile agents with itinerary.
{"title":"Data privacy in mobile agent communication","authors":"D. Adane, P. Adane, S. Sathe","doi":"10.1109/CANET.2007.4401685","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401685","url":null,"abstract":"Communicating with confidential data requires special attention in a mobile agents environment, especially when the other hosts must be prevented from eavesdropping the communication. We propose two methods for secured communication between the agent and a host (or other agent). The first approach for an untrusted environment uses on the fly encryption-decryption sequence to directly convert the message or plaintext into one that is encrypted directly with the public key of receiver thus reducing the overhead of retrieving the public key of sender. The technique uses AIGamal encryption/decryption. Theoretically it is proved that this scheme indeed gives the desired result. The second approach uses a trusted central authority for supply of public keys. It uses time stamps, identity of agents and RSA algorithm to provide a secured communication. Our minimal implementation of this technique suggests that it is possible to embed the entire functionality for communication security within an agent. Finally, we also state and explain how the second approach is useful in context of mobile agents with itinerary.","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":"129906929","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.4401696
T. Radjabov, A. M. Nazarov, A. Simonov, S.V. Pichko, Z. Khakimov
Optical methods of an information communication requires development of the technology of processing of optical materials for making the active optical mediums. The method of a doping of optical materials by rare earths by an ion-beam deposition with the subsequent thermal bakeout was explored which allows to make enough uniform stratums of erbium and on sufficient depth in optic fibers.
{"title":"Implantation of optical materials by rare-earths elements - erbium","authors":"T. Radjabov, A. M. Nazarov, A. Simonov, S.V. Pichko, Z. Khakimov","doi":"10.1109/CANET.2007.4401696","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401696","url":null,"abstract":"Optical methods of an information communication requires development of the technology of processing of optical materials for making the active optical mediums. The method of a doping of optical materials by rare earths by an ion-beam deposition with the subsequent thermal bakeout was explored which allows to make enough uniform stratums of erbium and on sufficient depth in optic fibers.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"32 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":"128114707","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.4401669
Bin Chen, Honglin Hu, Bin Wang, Haifeng Wang
In this paper, we present a novel multi-service scheduling scheme while satisfying the principle of multi-service operation in E-UTRA. Instantaneous buffered packet size is used to modify the traditional proportional fair scheduling algorithm for reducing padding probability. Swapping resource between different services users satisfies the principle of multi-service operation and increases multi-user/service diversity. The simulation results demonstrate that the proposed scheme can increase system throughput and fairness among users.
{"title":"A novel multi-service scheduling scheme for e-utra","authors":"Bin Chen, Honglin Hu, Bin Wang, Haifeng Wang","doi":"10.1109/CANET.2007.4401669","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401669","url":null,"abstract":"In this paper, we present a novel multi-service scheduling scheme while satisfying the principle of multi-service operation in E-UTRA. Instantaneous buffered packet size is used to modify the traditional proportional fair scheduling algorithm for reducing padding probability. Swapping resource between different services users satisfies the principle of multi-service operation and increases multi-user/service diversity. The simulation results demonstrate that the proposed scheme can increase system throughput and fairness among users.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"41 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":"131887090","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.4401698
B.A. Davletyarov, N.H. Gulturaev
This article is devoted to development of mathematic model of reliability evaluation index - the readiness coefficient of data transmission tracks in the control objects of telecommunication networks depending on non-failure parameters, restorability and technical service frequency.
{"title":"The mathematical model of data transmission network elements reliability evaluation","authors":"B.A. Davletyarov, N.H. Gulturaev","doi":"10.1109/CANET.2007.4401698","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401698","url":null,"abstract":"This article is devoted to development of mathematic model of reliability evaluation index - the readiness coefficient of data transmission tracks in the control objects of telecommunication networks depending on non-failure parameters, restorability and technical service frequency.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"81 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":"134326494","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.4401672
Konstantin Hyppönen, Keijo Haataja
As an interconnection technology, Bluetooth has to address all traditional security problems, well known from the distributed networks. Moreover, as Bluetooth networks are formed by the radio links, there are also additional security aspects whose impact is yet not well understood. In this paper, we describe a new man-in-the-middle (MITM) attack on Bluetooth secure simple pairing. The attack is based on the falsification of information sent during the input/output capabilities exchange. In addition, we propose countermeasures that render the attack impractical, although not totally eliminating its potential danger.
{"title":"“Nino” man-in-the-middle attack on bluetooth secure simple pairing","authors":"Konstantin Hyppönen, Keijo Haataja","doi":"10.1109/CANET.2007.4401672","DOIUrl":"https://doi.org/10.1109/CANET.2007.4401672","url":null,"abstract":"As an interconnection technology, Bluetooth has to address all traditional security problems, well known from the distributed networks. Moreover, as Bluetooth networks are formed by the radio links, there are also additional security aspects whose impact is yet not well understood. In this paper, we describe a new man-in-the-middle (MITM) attack on Bluetooth secure simple pairing. The attack is based on the falsification of information sent during the input/output capabilities exchange. In addition, we propose countermeasures that render the attack impractical, although not totally eliminating its potential danger.","PeriodicalId":413993,"journal":{"name":"2007 3rd IEEE/IFIP International Conference in Central Asia on Internet","volume":"290 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":"122979617","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
扫码关注我们
求助内容：
应助结果提醒方式：