{"title":"Share factors optimization in the Push-Sum algorithm for sensor networks","authors":"E. Zanaj, M. Baldi, F. Chiaraluce","doi":"10.1109/SOFTCOM.2008.4669474","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669474","url":null,"abstract":"The convergence speed of an asynchronous point-to-point version of the Push-Sum algorithm in sensor networks is investigated both through numerical simulations and theoretical arguments. The main contribution of the paper consists in studying the application of such algorithm in realistic scenarios, represented by non fully-meshed networks. Simulations show that, in this case, convergence may be strongly dependent on the adopted share factor, whose value should be optimized as a function of the connectivity level of the network. Optimum shares are derived for some common topologies, like the ring and the random geometric graph.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606215","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}
{"title":"Deriving compact test suites for telecommunication software using distance metrics","authors":"G. Kovács, G. Németh, Z. Pap, M. Subramaniam","doi":"10.1109/SOFTCOM.2008.4669517","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669517","url":null,"abstract":"This paper proposes a string edit distance based test selection method to generate compact test sets for telecommunications software. Following the results of previous research, a trace in a test set is considered to be redundant if its edit distance from others is less than a given parameter. The algorithm first determines the minimum cardinality of the target test set in accordance with the provided parameter, then it selects the test set with the highest sum of internal edit distances. The selection problem is reduced to an assignment problem in bipartite graphs.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"328 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122744016","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}
{"title":"Direction finding with compensation of Mutual Coupling based on Complex Fast ICA in circular array antenna","authors":"Parivash Hajiani, Mohammad Hakkak","doi":"10.1109/SOFTCOM.2008.4669451","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669451","url":null,"abstract":"Performance of high resolution direction finding is degraded in the presence of mutual coupling existing among antenna array elements. There are different methods to calculate the mutual coupling matrix and compensate its effects in the DF algorithm performance. In this paper, the multiple-signal classification algorithm is used to find the angle of arrival in the uniform circular array. According to the fact that wave propagation follows the maximum entropy principle and independent component analysis is based on this principle, Complex fast ICA (independent component analysis) is used to estimate the mutual coupling matrix among the array elements and consequently use the result matrix to compensate the unwanted effect of mutual coupling in the MUSIC-DOA algorithm. This method neither needs any considerations of the array shape nor complex calculation, like the moments method. Results are compared with the standard MUSIC algorithm without compensation of mutual coupling.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114079191","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}
{"title":"Network protocol modeling: A Time Petri Net modular approach","authors":"A. Masri, T. Bourdeaud'huy, A. Toguyéni","doi":"10.1109/SOFTCOM.2008.4669494","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669494","url":null,"abstract":"Communication services are surrounding our daily life; internet, mail, cellular phones... These services are managed by several protocols. In this paper we propose a generic model for the Ethernet protocol based on time Petri nets. A complete modular service-protocol model can help in better managing services and protocols and to easily change a system element without affecting the other elements. Also it can help us to study different properties of the system such as performance, functionality, validation and any qualitative or quantitative property.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114586786","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}
{"title":"A web caching and prefetching simulator","authors":"J. Márquez, J. Domenech, J.A. Gil, A. Pont","doi":"10.1109/SOFTCOM.2008.4669508","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669508","url":null,"abstract":"The enormous potential of locality based strategies like caching and prefetching to improve Web performance motivates us to propose a novel global framework for performance evaluation in scenarios where different parts of the Web architecture interact. Unlike existing proposals our approach is a fast and flexible tool that allows to represent faithfully the behaviour of each element of the architecture in order to study, reproduce, evaluate and design Web strategies to decrease the userpsilas perceived latency when surfing the Web.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127183163","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}
{"title":"Barcodes and mobile phones as part of logistic chain in construction industry","authors":"J. Vartiainen, T. Kallonen, J. Ikonen","doi":"10.1109/SOFTCOM.2008.4669500","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669500","url":null,"abstract":"Management of goods is an essential part of many businesses. Goods can be identified by different means, but often labor intensive methods are avoided. For this reason barcode and radio identification methods have become popular. In this paper we study the usability of cellular phone camera for tracking goods and present a test application, which can be used for tracking goods. In our test application all the data about the goods is located in a central server which the cellular phone connects via data connection. Readability of barcode in different environments is also evaluated.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123691481","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}
{"title":"The analysis of scheduling algorithms in microcellular 4G MIMO WINNER system","authors":"P. Sroka, Z. Dlugaszewski","doi":"10.1109/SOFTCOM.2008.4669497","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669497","url":null,"abstract":"In this paper impact of resource scheduling algorithms on the average user throughput, average cellpsilas capacity and the quality of provided services in the microcellular 4G environment has been analyzed. Well known scheduling algorithms such as Round Robin, MaxSNR and Fair Rate have been compared with the algorithms proposed for fading channels in [1]. A simple modification of the scheduling has been proposed for all examined algorithms and its impact on the users and system performance has been analyzed. Presented results have been obtained for both uplink and downlink OFDMA transmission in the MIMO channels.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124757557","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}
{"title":"GB-IBEM model of vertical antenna above, below and penetrating ground","authors":"D. Cavka, D. Poljak","doi":"10.1109/SOFTCOM.2008.4669447","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669447","url":null,"abstract":"This paper deals with an assessment of current distribution along vertical antenna penetrating the ground. The model is based on the integro-differential equation of Pocklinghton type together with rigorous Sommerfeld representation of the fields due to an interface. The corresponding integral equation is treated with the Galerkin-Bubnov variant of Indirect Boundary Element Method. The antenna is excited by the voltage source, as well as by the equivalent current source, which is incorporated into the model as a boundary condition.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131534075","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}
{"title":"An efficient management technique for Peer-to-Peer networks","authors":"Marguerite Fayçal, Ahmed Serhrouchni","doi":"10.1109/SOFTCOM.2008.4669509","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669509","url":null,"abstract":"Peer-to-Peer (P2P) networks, like other overlays, do neither follow ISPpsilas policies nor their infrastructure. In fact, in P2P networks, routing tasks are distributed across all system peers in an autonomous and spontaneous way without taking the underlying IP network into account. Otherwise, the Internet is organized in several Autonomous Systems (AS) belonging to various administrative entities (network providers, universities, companies, etc.). But P2P traffic often crosses AS boundaries multiple times. The rapid growth and popularity of P2P networks appear thus somehow daunting for network providers and administrative entities that negotiate business agreements with each other in order to govern bilateral connections between ASs. In this paper, we propose a novel scheme, called NETwork Provider Oriented Peer-to-Peer System (NETPOPPS), which allows an effective cooperation between P2P traffic and network providerspsila business agreements. NETPOPPS also promises alleviated message latency and enhanced lookup time.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131557896","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}
F. Nadeem, M. Gebhart, E. Leitgeb, W. Kogler, M. S. Awan, M.S. Khan, G. Kandus
{"title":"Simulations and analysis of bandwidth efficient switch-over between FSO and mmW links","authors":"F. Nadeem, M. Gebhart, E. Leitgeb, W. Kogler, M. S. Awan, M.S. Khan, G. Kandus","doi":"10.1109/SOFTCOM.2008.4669510","DOIUrl":"https://doi.org/10.1109/SOFTCOM.2008.4669510","url":null,"abstract":"Free Space Optics (FSO) links provide usage of high bandwidth and the flexibility of wireless communication links. However, weather patterns like fog and heavy snow fall limit the availability of FSO. Another technology providing similar properties regarding offered data rates and flexibility of set up is Millimeter Wave Technology (mmW), operating at several tens of GHz. In this case, heavy rain limits mmW link availability. A combination of both technologies had been proved to be very effective to achieve very high availability. Different hybrid architecture of these two links and switch-over techniques had been proposed. All of these techniques require redundant transmission on either both transmission links or waste bandwidth of backup link when main FSO link is operational. In this paper, a switch-over between these technologies is proposed, to maintain high availability without the loss of transmission bandwidth. The performance of this switch-over has been simulated for more than one year measured availability data for hybrid network of mmW link and FSO link. It has been shown that the availability with switchover reaches the redundant link availability but switch-over can save more than 90% redundant transmission that can be used for useful data transfer.","PeriodicalId":157790,"journal":{"name":"2008 16th International Conference on Software, Telecommunications and Computer Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129929450","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}