Majid Farahmand, A. Azarfar, A. Jafari, V. Zargari
{"title":"A Multivariate Adaptive Method for Detecting ARP Anomaly in Local Area Networks","authors":"Majid Farahmand, A. Azarfar, A. Jafari, V. Zargari","doi":"10.1109/ICSNC.2006.5","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.5","url":null,"abstract":"Worms use different methods to propagate in networks. One of these methods is by means of broadcasting packets. Broadcasted packets occupy high percentage of network bandwidth, and abnormal broadcast traffic analysis could be a useful method for detecting network problems and infected hosts. In this paper a new method for detecting ARP abnormal traffic in a broadcast domain is introduced. A combination of four different ARP traffic criteria are used to determine network anomaly. Four parameters: Rate, Burstiness, Dark space and Sequential scan were considered. Our method focuses on rate anomaly caused by worms, scans and poorly-configured services. We applied our method to a real network to evaluate system accuracy and noticed that during one month, 92.9 percent of alarms were true positive alarms. This technique not only traces ARP anomaly the same way as scanning worms, but also it detects any host that disturbs the traffic rate in different LAN.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115070187","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}
Yin-Jun Chen, Ching-Chung Chen, Shou-Nian Wang, Han-En Lin, R. Hsu
{"title":"GPSenseCar -A Collision Avoidance Support System Using Real-Time GPS Data in a Mobile Vehicular Network","authors":"Yin-Jun Chen, Ching-Chung Chen, Shou-Nian Wang, Han-En Lin, R. Hsu","doi":"10.1109/ICSNC.2006.41","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.41","url":null,"abstract":"Currently, several smart phones have GPS receivre built- in, such as Motorola E1000, HP iPAQ 6515 and Mio A700. Equipped with GPS receiver, the mobile phone has enabled its owner to become a personal position locator. The proposed project GPSenseCar is to use the WiFi smart phone with the built-in GPS receiver to develop a collision avoidance support system for vehicle users. Optical based vehicle collision avoidance system, such as RADAR or CCD camera, has the drawback of vision corner. A vehicle collision avoidance system based on WiFi and GPS can compensate the drawbacks of optical based system to prevent the collision when vehicle is driving in high speed or under near-zero visibility. The GPSenseCar locates the moving objects by calculating on the GPS data, which was emitted from the other users¿ cell phone and collected by the WiFi network of the driver¿s vehicle, such that different level of warning sound can be provided to the driver according to the relative distance between vehicle owners and the other moving vehicles or passengers to create an Augment Reality by sensing the upcoming danger and avoiding collision.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132217881","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 Cluster Based Topology Control Algorithm for Wireless Ad-Hoc Networks","authors":"A. Sarrafi, M. H. Firooz, Hassan Barjini","doi":"10.1109/ICSNC.2006.1","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.1","url":null,"abstract":"This paper proposes a topology control algorithm for Ad-Hoc networks which have a large scale structure and widely distributed nodes. One of the main problems in topology control is power efficiency with consideration of connectivity. The proposed algorithm is aimed to find a topology with near optimum power consumption within reasonable convergence time. While game theory is exploited to prove convergence property of proposed algorithm, clustering concept is employed to reduce convergence time with the aid of parallel processing.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132814935","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 new approach of data hiding within speech based on Hash and Hilbert Transform","authors":"Deng Lixin","doi":"10.1109/ICSNC.2006.7","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.7","url":null,"abstract":"In this paper, we present an approach for data hiding within speech signals based on Hash and Hilbert Transform (HT). The secret data is firstly pre-processed by Hash to enhance its security. Then, exploiting the orthogonality of HT and insensitivity of human perception to the phase of speech, we embed processed secret data into a speech signal by using the HT. We propose in this paper both blind and non-blind methods to extract embedded data. Experiment results have shown that the proposed scheme demonstrates transparent, secure and robust data hiding performances.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130058304","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 Case of Multi-hop Peer-to-Peer Implementation of Mobile Social Applications","authors":"P. Antoniadis, C. Courcoubetis","doi":"10.1109/ICSNC.2006.70","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.70","url":null,"abstract":"In this paper we consider issues related to the design of mobile social software in a multi-hop peer-to-peer environment. We believe that by enabling multi-hop peer-topeer communication could in certain cases make social mobile applications more attractive in terms of location privacy or embarassement, but also more effective in terms of the quality and quantity of the matches achieved. Such an approach could thus contribute in the construction of a critical mass which is necessary for the success of these applications and probably one of the reasons they are not yet widely deployed. On the other hand, it introduces significant implemention challenges related to the contruction and management of a dynamic ad-hoc network. We focus on the provision of the suitable incentives for packet forwarding which is a fundamental problem that needs to be addressed in this context since the ad-hoc nature of the mobile social applications constitutes pricing and reputation (or accounting) based approaches of limited applicability. In this paper we argue that suitable memory-less mechanisms should be devised sketching two such mechanisms for different types of packets exchanged in a mobile social application. Interestingly, as we explain, our proposed mechanisms enforcing contribution while consuming have a more general applicability and could also be used in other applications such as the peer-to-peer resource sharing in ubiquitous computing. We finally discuss several strategic issues that should be also taken into account but are ignored by the corresponding literature and more specifically the consideration of mobility and power transimission as part of the rational strategy of peers participaing in such a system.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116505565","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}
Xueqin Jiang, M. Lee, Ram Prasad Paudel, TaeChol Shin
{"title":"Codes From Generalized Hadamard Matrices","authors":"Xueqin Jiang, M. Lee, Ram Prasad Paudel, TaeChol Shin","doi":"10.1109/ICSNC.2006.27","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.27","url":null,"abstract":"The Hadamard Matrices are widely used in communication systems, data compression, error control coding, cryptography, linear filtering and spectral analysis. Such a popularity of Hadamard matrices is explained by their simplicity and efficiency in a variety of concrete practical realizations. In this paper we consider a family {H_m}, m =1,2,.., of generalized Hadamard matrices of order p^m , where p is a prime number, and construct the corresponding family {C^*m} of generalized p-ary Hadamard codes which meet the Plotkin bound.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128215758","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 neuro-forecastwater-filling scheme of server scheduling","authors":"H. Yousefi’zadeh","doi":"10.1109/ICSNC.2006.6","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.6","url":null,"abstract":"Dynamic server scheduling schemes in queuing systems accommodating delay-sensitive traffic need to address the tradeoff between efficiency and fairness. For delay-sensitive traffic, threshold-exceeding delay or equivalently loss is used as a measure of efficiency. In this paper, a pair of dynamic server scheduling schemes for queuing systems accommodating delaysensitive traffic are compared. Each scheme consists of two components. The first component attempts at forecasting the arriving traffic patterns of the sources sharing the server bandwidth and the second component makes the assignment of server bandwidth among the sources. The schemes utilize BFGS and resilient backpropagation learning in perceptron neural networks to forecast the arriving traffic patterns, respectively. Once the traffic patterns are forecast, the schemes rely on water-filling to make the server bandwidth assignments max-min fair. Our simulations reveal the efficiency and fairness characteristics of the schemes.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132929107","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":"Beyond the Hype: Policies for Military Network Operations","authors":"R. Chadha","doi":"10.1109/ICSNC.2006.25","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.25","url":null,"abstract":"Policy-based network management promises to deliver a high degree of automation for military network management. In the past few years, an increasing number of military network management systems have begun to require support for policy-based network management, in a quest for increased automation, improved network performance, and reduced manpower needed to establish and maintain the network. This activity has led to a proliferation of studies to determine how to best utilize policies to achieve the above goals. Large teams of researchers and engineers are working at a feverish pace to prescribe the ideal policy architecture for military network management. One of the biggest obstacles facing these teams are the unrealistic - or sometimes even unspecified - expectations for policybased management. Policy is being touted as the way to achieve everything a network needs, from on-demand quality of service to conformance to vaguely defined military doctrine. An increasing number of network management requirements are being appended with the qualification \"based on policy\". It is becoming more and more unclear what policies are expected to achieve in a network. The purpose of this paper is to look beyond the hype and attempt to clearly identify the functionality that policies can enable in support of military network operations. The paper discusses the types of policies that are required for supporting network operations in military networks, their functionality, and the resolution of policy conflicts for network management.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133048736","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 Two - Phase Distributed Reconfiguration Algorithm for Node Failures in IP-Over-WDM Networks","authors":"N. Sreenath, B. Palanisamy","doi":"10.1109/ICSNC.2006.16","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.16","url":null,"abstract":"In Wavelength Routed Wavelength Division Multiplexing (WR-WDM) networks, a set of lightpaths (all-optical communication paths) defines the virtual topology. Internet Protocol (IP) makes use of virtual topology to route its traffic in the optical form. In the event of a node failure, the virtual topology may be partitioned so that a set of nodes may not be able to communicate with another set of nodes. The failure may also affect the objective function value leading to decreased network performance. In such a case, it may be indispensable that the connectivity in the virtual topology is restored and the network performance is improved in terms of objective function value. Hence, it may be necessary to alter the existing virtual topology. Altering of a virtual topology is called as virtual topology reconfiguration. In this paper, we propose a two-phase distributed algorithm for virtual topology reconfiguration in the event of a node failure. The algorithm restores the failed connectivity during phase I. Phase II of the algorithm improves the network performance by bringing down the objective function value of the network.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134312244","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":"Application Programming Interface offering classification services to end-user applications","authors":"K. Molnar, M. Kyselak","doi":"10.1109/ICSNC.2006.22","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.22","url":null,"abstract":"There are several sophisticated and practically tested technologies supporting Quality of Service (QoS) through a communication network. On the other hand, the extension of QoS support towards end-user applications is quite rare. The Application Programming Interface (API) described in this paper represents a possibility how to extend QoS in this direction under the Microsoft Windows environment. The solution presented is closely related to the DiffServ technology, i.e. packet marking based on the type of the network service the packet was generated by.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125086181","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}