2010 Fifth International Conference on Systems and Networks Communications最新文献

{"title":"An Improved Multi-path Key Establishment under REM Attacks in Wireless Sensor Networks","authors":"Mahdi Azarafrooz, A. Falahati","doi":"10.1109/ICSNC.2010.31","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.31","url":null,"abstract":"A unconditionally secure message transmission scheme (USMT) is used to address the problem of multi-path key establishment in wireless sensor networks under Reveal-Erase-Modify (REM) attacks. Various analyses demonstrate that, relaxing the integrity condition by allowing a small probability of error without disrupting perfect secrecy and availability as satisfied in our scheme, leads to significant improvements in REM resilient key establishment schemes. However, the introduced integrity error probability affects the protocol regardless of the adversaries’ strategies and cannot be regarded as a point of failure. This randomization in integrity also enhances the security performance of the WSNs employed in hostile environments by improving the tolerable threshold of the key establishment scheme to half of the established paths between two sensor nodes. The proposed algorithm is simulated over a wireless sensor network. The simulation result confirms REM resilience improvement in comparison with previous key establishment protocols.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127202982","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":"IMS Centralized Network Architecture towards Convergence Services","authors":"Jin-Ho Hwang, Nak-po Kim, Yungha Ji, Taehyo Ahn","doi":"10.1109/ICSNC.2010.51","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.51","url":null,"abstract":"The rapid growth of the access technologies provides an opportunity for appropriately equipped user terminals to access the rich communication suite services. And the IP Multimedia Subsystem (IMS) could very well be the best solution for most operators. The more recent releases have included interfaces to non-IP Capable Access Network (IP-CAN) as well as IP-CAN. In addition to, a Mobile VoIP (mVoIP) is one of the most issues according to introducing WLAN or WIMAX networks. In order to provide complete convergence service such as mVoIP based on IMS over both legacy CS networks and IPCANs, it is important to define the new architecture over heterogeneous networks. One of the research challenges for this interworking between various networks is the design of service continuity and consistency to support seamless session mobility based on IMS. In this work, first we review the concept of session continuity as well as the VoIP architecture in 3GPP standardization. Then, we propose the IMS Centralized Network (ICN) Architecture towards convergence services containing Call flows and new services.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115709580","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":"Obstacle Handling in Context-Aware Multilayer Hierarchical Protocol for Wireless Sensor Networks","authors":"M. Haque, Noriko Matsumoto, N. Yoshida","doi":"10.1109/ICSNC.2010.70","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.70","url":null,"abstract":"Application diversities of Wireless Sensor Networks (WSN) emphasize on consideration of all potential factors including obstacle appearance. However, most reputed protocols of WSN has no or little concerned with this issue. In this paper, simple obstacle detection techniques and their solutions for context aware hierarchical protocols are proposed. These techniques enrich the functionality and deployment ability of the network to a next higher level. Performance evaluation shows effective conjunction of the proposed techniques with the example protocol and durable functionality during obstacle emergence period.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127474109","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":"Software-Based Packet Capturing with High Precision Timestamping for Linux","authors":"P. Orosz, T. Skopko","doi":"10.1109/ICSNC.2010.65","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.65","url":null,"abstract":"Widely used network measurement applications, such as tcpdump and Wireshark, use the same common libpcap packet capture library. Libpcap assigns a 10-6 second precision timestamp to all processed frames. Higher physical bandwidth implies shorter inter-arrival times between consecutive frames. Therefore timestamp precision must be proportional to the link speed. Latest version 1.0.x of libpcap provides 10-6 second native resolution, however pcap format supports a larger 2 x 32-bit timestamp value for each stored packets. On Gigabit Ethernet or faster networks, timestamp resolution that works in the microsecond domain may not enable us to precisely reproduce the time-domain relation between consecutive frames. Therefore overall analysis of the data transmission could drive to a false result. Independently from one other, five impact factors could directly bias the generation of timestamps: hardware architecture, NIC driver operation mode, clock source, kernel queue handler and the libpcap itself. In an idealized case generated timestamps are always converging and suitably close to the real arrival or transmission time of each frames so to conserve the original inter-arrival time values. For packet capturing with libpcap, it is assumed that timestamping performed when a frame is enqueued to the kernel’s input packet queue. Accordingly these timestamps represents the time moment when a frame reaches the input queue. Libpcap must retrieve these timestamps from the kernel. Timestamp resolution of network measurement applications must be increased according to the requirements of advanced high speed data networks. In our paper we are going to show an alternative libpcap-based solution that features nanosecond precision timestamping.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124589114","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 Process Approach to Manage the Security of the Communication Systems with Risk Analysis Based on Epidemiological Model","authors":"A. L. Corte, Marialisa Scatá","doi":"10.1109/ICSNC.2010.32","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.32","url":null,"abstract":"Information security means protecting information and information systems from unauthorized access, use, disclosure, disruption, modification or destruction, to assure confidentiality, availability and integrity. The new trends of telecommunications of the last year is the move towards the trasmission of voice over traditional packet switched IP network, voice over IP, that has become a valid alternative to traditional public circuit-switched telephone network and then the convergence of the communication systems, through the next generation networks definition. This environment presents many security problems and significant security challenges. The voice over IP system increase these with those normally tie to IP network. Along with a several benefits of voice over IP, there are new security threats for exchanged informations. This paper analyzes the security issues of the communication systems, starting from the traditional public switched telephone network toward the new next generation network. Then, with this paper, we want to introduce a process approach to manage the security, based on epidemiological model. This model is characterized by three steps, Analysis, Assessment and Management, and it can be applied to a general information security system, to identify, assess and classify the information assets, the processes concerning it, vulnerabilities of each level and common threats. Finally we evaluate the risk and the probability of damage that can crash the system or part of this and propose a model of failure time analysis. The target of this analysis is to calculate the extent of the risk function in order to understand the state and the degree of security of our system, by studying the statistics of failure and to ensure highest degree of security optimizing the business strategic decisions and information and communication technology security economic investments. The methodology is designed to be applied in the future to communication systems, more specifically. This does not exclude the application of this methodology in other areas of interest (biomedical or economical areas) to understand, formalize and solve problems of similar nature.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124957714","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":"Continuous Nearest Neighbor Queries in Weight Changing Road Networks","authors":"Weifeng Lv, Fei Wang, T. Zhu, Yuan Zhang","doi":"10.1109/ICSNC.2010.45","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.45","url":null,"abstract":"Recent researches have focused on continuous nearest neighbor queries in road networks with fixed weight, where all the users find the same routes to the nearest neighbors all the time. As more and more people follow the same way, traffic jams occur and users have to spend more time to get the destinations. In this paper, we propose a novel form of continuous k nearest neighbor queries considering the large scale weight changes in road networks. By using real-time traffic information as the changing weight, we present a Domination Relationship Monitoring Algorithm to solve Continuous k Nearest Neighbor queries in weight changing road networks, which can find the fastest way to k nearest neighbors according to the traffic conditions and avoid traffic jams. Moreover, our algorithm achieves the target of Continuous obstructed Nearest Neighbor to some extent. A comprehensive experimental evaluation using real data has been conducted to demonstrate the efficiency and effectiveness of our algorithm.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126494293","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 Unicast-Based IPTV Service Control","authors":"M. Skrbic, Nerma Šečić, Mirza Varatanović","doi":"10.1109/ICSNC.2010.69","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.69","url":null,"abstract":"This paper presents multicast problems for the Internet Protocol Multimedia Subsystem (IMS) based on the Internet Protocol Television (IPTV) and offers one approach to overcoming them. Presented and addressed are multicast advantages and problems, problems of applying multicast on IMS and bandwidth problem for unicast. At the end, it is safe to conclude that unicast appears to be more appropriate for the IMS-based IPTV.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128089385","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":"WiSe-Nodes: A Family of Node Prototypes for Wireless Sensor Networks","authors":"R. Marcelín-Jiménez, M. L. Villasenor, M. A. Ruiz-Sánchez, V. R.","doi":"10.1109/ICSNC.2010.21","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.21","url":null,"abstract":"A Wireless sensor network (WSN) consists of a potentially large number of sensor nodes with wireless-communication capabilities that work collaboratively to achieve a common goal. While every WSN application has specific requirements, there are some common basic services that any WSN must offer in order to support applications. There are available commercial WSN nodes offering such basic services, but they are still very expensive. So, we ask ourselves if it is possible to build a WSN node keeping low costs, while at the same time implementing these basic services: the answer is yes. We built sensor nodes and we call them WiSe-Nodes. In this paper we present the architecture of our WiSe-Nodes as well as the details about their hardware modules. We present also an hybrid MAC-routing protocol called WASP that implements the basic services of a WSN. Finally, as a tool for the WSN developers we introduce our simulator YAWSS that provides a controlled test environment where new WSN protocols can be tested and executed before implementing them in hardware.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127919346","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":"Efficient Uniform k-out-of-n Generators","authors":"A. Bonnecaze, P. Liardet","doi":"10.1109/ICSNC.2010.34","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.34","url":null,"abstract":"In many distributed network problems, one has to randomly choose a subset of servers in order to execute a task. This can be achieved by using a so called k-out-of-n generator: a generator which randomly chooses k elements among n elements. We introduce new constructions of uniform k-out-of-n generators from a binary generator taken as a primary source of alea. These constructions make use of special codes containing combinatorial objects called Steiner systems. Any Steiner system leads to a generator having a maximal entropy rate. As an example, we analyse in detail the special case k=5 and n=24 and we study the convergence of a random walk on the Mathieu group to the uniform distribution. We show that the speed of convergence is excellent, and as far as we know, better than any known methods.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127957511","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 Secure Gateway Service for Accessing Networked Appliances","authors":"Arshad Muhammad, A. Arabo, M. Merabti, Q. Shi, B. Askwith","doi":"10.1109/ICSNC.2010.35","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.35","url":null,"abstract":"Currently there are a range of digital devices and the trend is moving us closer to an increasingly interconnected world. However one of the current limitations is that device usage is location dependent. For example, when you are in your home environment and your PDA, which contains MP3s, resides in your work environment, there is no mechanism to enable you to use the functionality it provides. Mechanisms need to be developed that enable devices to be used irrespective of where you or your device resides. The challenge is to create a gateway that seamlessly integrates devices from different locations. In order to achieve this several issues need to be addressed, which include Quality of Service (QoS), device capability matching, device presence management and secure connectivity in ad hoc and structured networks. We present a scenario to demonstrate our architecture showing how it can help in arranging daily home visit jobs such as engineer visits, receiving postal deliveries and so on, enabling the user to communicate with an engineer or postman while they are away from home.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131260800","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}