DCNET 2012 Abstracts


Full Papers
Paper Nr: 5
Title:

A Cross-layer Design for Video Transmission with TFRC in MANETs

Authors:

George Adam, Christos Bouras, Apostolos Gkamas, Vaggelis Kapoulas and Georgios Kioumourtzis

Abstract: Mobile Ad hoc NETworks (MANETs) are becoming more essential to wireless communications due to growing popularity of mobile devices. However, MANETs do not seem to effectively support multimedia applications and especially video transmission. In this work, we propose a cross-layer design that aims to improve the performance of video transmission using TCP Friendly Rate Control (TFRC). Our design provides priority to video packets and exploits information from the MAC layer in order to improve TFRC’s performance. The proposed cross-layer mechanism utilizes Signal to Noise Ratio (SNR) measurements along the routing path, in order to make the route reconstruction procedure more efficient. Simulation results show that both the use of traffic categorization and the SNR utilization lead to important improvements of video transmission over the mobile Ad hoc network. More specifically, simulations indicate increased average Peak Signal to Noise Ratio (PSNR) for the received video, increased throughput and packet delivery ration, as well as reduced average end-to-end delay.

Paper Nr: 9
Title:

Study on a Fast OSPF Route Reconstruction Method under Network Failures

Authors:

Hiroki Doi

Abstract: The Great East Japan Earthquake occurred onMarch 11, 2011. Many Japanese people and Japanese companies were damaged by the disaster. Also, network failures occurred over a wide area because many facilities of commercial ISPs (Internet Service Providers) were damaged. Thus, there is a need to reexamine the disaster estimation and reconstruct a robust network system against disasters in Japan. The network must have higher reliability and fast recovery. Although OSPF (Open Shortest Path First) is used widely on networks, it has a router dead interval problem. If a (backup) designated router has stopped operation due to failure, the other OSPF routers miss the designated router and try to find it by multiple hello packets. The OSPF routers await a hello packet acknowledgment from the designated router for the router dead interval. After the router dead interval, those routers can recognize that the designated router has ceased the operation. The router dead interval is 40 seconds. This interval time is not only long for many real-time applications but also involves huge buffering of data and a burst of traffic after the router reconstruction. To avoid the router dead interval, we propose a fast method of designated router detection by enhanced OSPF. In this report, we show how our method reduces the route reconstruction time from 45 seconds to 10 or less on OSPF networks.

Paper Nr: 11
Title:

Computational Intelligence Applied to Monitor Bird Behaviour

Authors:

D. F. Larios, C. Rodríguez, J. Barbancho, M. Baena, F. Simón, J. Marín, C. León and J. Bustamante

Abstract: The best way to obtain relevant information about the behaviour of animals is direct observation (of individuals). However, traditional close-up observations can interfere on the behaviour, and taking biometric measurements requires the capture of individuals, which also causes stress. This paper describes an automatic motoring system for birds breeding in nest boxes. The main goal is to significantly increase the amount and quality of data acquired on bird behaviour without stressing the individuals or interfering. This system is based in an interconnected embedded sensor network, which permits sharing this valuable information with researchers all over the world through the internet. Each device of the network is a smart nest-box that allows a cross-validation of sensor information and data quality. This system has been evaluated for the specific case of a lesser kestrel breeding colony in Southern Spain. The lesser kestrel is an insectivorous migratory falcon that readily accepts nest-boxes. The system has been named HORUS and the results obtained from a year experiment demonstrate the efficiency of this approach.

Short Papers
Paper Nr: 6
Title:

Digital Signature of Network Segment using Flow Analysis

Authors:

Alexandro M. Zacaron, Luiz F. Carvalho, Mario H. A. C. Adaniya, Taufik Abrão and Mario Lemes Proença Jr.

Abstract: This paper presents two models for building Digital Signature of Network Segment using flow analysis (DSNSF). The DSNSF can be classified as a characterization of the traffic or as a baseline of the analyzed network segment. In this work two types of signatures of network segment are presented. The first is built applying K-means clustering algorithm and the second using optimized clustering by metaheuristic Ant Colony Optimization (ACO). The signatures provide characterization of the traffic segments analyzed using NetFlow v9 protocols TCP and UDP. The results achieved show that the two models presented using k-means Clustering and metaheuristic Ant Colony Optimization obtained good results for the creation of DSNSF or traffic characterization of the segments analyzed.

Paper Nr: 10
Title:

Mobile Broadband Traffic Forecasts in Korea

Authors:

Chanwoo Cho and Sungjoo Lee

Abstract: During many years, the dominant traffic in mobile broadband networks was voice. However, with the introduction of diverse mobile broadband equipment, the situation has changed. Since mobile broadband devices can allow users to access information instant and connect to web quickly, the mobile world has been revolutionized, where global mobile data traffic has been increasing dramatically. And the changes in the patterns of usage for mobile devices have started to cause traffic jams on the mobile broadband networks. As a result, forecasting the future traffic needs is in urgent need to provide high-quality mobile broadband services. To meet this need, this research aims to suggest a new forecasting method for future mobile broadband traffic. For the purpose, three-round Delphi survey was conducted to identify devices and applications that would affect in the future mobile broadband traffic, and their expected growth rates of users and changes in the patterns of use for each device. Then the total amount of mobile broadband traffic was forecasted based on survey results. The research results are expected to provide the basic research data for a further study.

Paper Nr: 19
Title:

Towards a CDN over ICN

Authors:

Byungjoon Lee, Hongseok Jeon, Seunghyun Yoon and Hoyoung Song

Abstract: The development of Information-Centric Networking (ICN) concepts is one of the significant results of different international Future Internet research activities. In the approaches, the networking paradigm shifts from the host-to-host communication to the information-based communication. The ICN concept is receiving huge attention because of the increasing demand for highly scalable and efficient distribution of information. Meanwhile, the Content Delivery Network (CDN) has been an important patch to the existing IP network that enables the fast delivery of content. Though the CDN architecture relies on the traditional host-to-host communication model, it has been widely deployed to solve the content availability and on-time delivery issues. In this paper, we cover issues and requirements to implement CDN over ICN technologies, and suggest an architecture called IICN which enables an easy transition from IP-based CDN to ICN-based CDN. In IICN, it is possible to incrementally replace IP nodes with ICN-capable nodes. We believe that IICN suggests an important ICN application that leads to an Information-Centric Internet.

Paper Nr: 20
Title:

Improving Network Performane - Management of Nonlinear Dynamics

Authors:

Seyed Shahrestani

Abstract: To manage the huge amount of traffic that is to be carried using the limited bandwidth and other resources, large networks and the Internet are heavily dependent on the use of protocols, and in particular, on TCP/IP protocol suite. While the utilization of TCP/IP is of significant practical value, for most large complex networks it can be inefficient, as it fails to fully take into consideration the importance of the major parts of the system. To overcome this, more complicated congestion control mechanisms, such as AQM/RED are widely utilized. However, these complex mechanisms exhibit nonlinear dynamics, which are not well understood and are usually unaccounted for. As a result of this, to avoid oscillatory behavior or loss of stability, the parameters of these systems are often set too conservatively. In turn, this will lead to unnecessary underutilization of the network resources. On the other hand, through the analysis and management of nonlinearities, the operability regions for the networked systems can be expanded, while its performance is also improved. This paper presents our visionary works of applying these ideas to networked systems, resulting in higher loading and throughput, and avoiding oscillatory or unstable behavior.

Posters
Paper Nr: 3
Title:

TRAFIL - A Tool for Enhancing Simulation TRAce FILes Processing

Authors:

Christos Bouras, Savvas Charalambides, George Kioumourztis and Kostas Stamos

Abstract: NS-2 (Network Simulator) is one of the most popular discrete event simulators used for network simulation. Trace files produced by NS-2 provide very useful information for post simulation analysis. This paper presents the architecture and development considerations for a TRAce FILe analysis tool, which intends to simplify the management of trace files generated during network simulations. The tool is focused on NS-2 trace files, but can be extended to handle a variety of simulation trace files formats. Its purpose is to make the execution of a large number of network simulations faster, and the extraction of results from a large amount of data more flexible and productive. TRAFIL introduces a novel way of interpreting, parsing, reading and eventually utilizing NS-2 trace files by using "metafiles" and "sub-metafiles" during the trace file recognition and process procedures, making the overall operations more abstract, substantially efficient and faster than alternative approaches. Furthermore, TRAFIL facilitates the whole trace file analysis task, offering the opportunity to store each trace file as well as every measurement produced for each trace file. The tool aims to aid the analysis of simulation results offering features that other tools in this area have been missing.

Paper Nr: 8
Title:

Hash Algorithms for 8051-based Sensornodes

Authors:

Manuel Koschuch, Matthias Hudler and Michael Krüger

Abstract: Wireless Sensors Networks are still an emerging technology. Their special architecture allows for unique applications that would be impossible, or at least very difficult, to implement using other technologies. But the wireless data transmission between the single nodes poses new challenges from a security point of view: the single messages have to be secured against eavesdropping and manipulation, as well as the individual nodes have to be secured against capture and extraction of their secret key. Cryptographic hash functions are an integral part of most cryptographic network protocols, whether they are used for signatures or message integrity. In this position paper, we describe a preliminary performance evaluation of three very different hash-functions on a Texas Instruments CC2530 sensor node, based on an 8051 microcontroller: Tiger, representing a hash designed for 64-bit architectures, the current standard SHA-1, and Grøstl, a SHA-3 finalist. Our preliminary results indicate that even without any major optimizations hash algorithms that were clearly not designed to run on constrained devices can be adapted to these environments with quite acceptable results, thereby giving designers of sensor network security protocols new implementation options.

Paper Nr: 16
Title:

Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients

Authors:

John Tsiligaridis

Abstract: The broadcast problem including the plan design is considered. The data are inserted and numbered into customized size relations at a predefined order. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items while avoiding wasting energy by their devices. In the case of multiple channels a dynamic grouping solution is proposed, called the Partition Value Algorithm with Less Dimension (PVALD), under a multiplicity constraint. In order to provide an RBP under relative delays a Dimensioning Algorithm (DA) is developed. The DA, with the criterion of ratio, offers the differentiation of service. This last property, in addition to the self-monitoring, and self-organizing, can be offered by servers today providing also channel availability and lower energy consumption by using a smaller, number of channels, of equal bandwidth. Simulation results are provided.

Paper Nr: 17
Title:

Strictness of Rate-latency Service Curves

Authors:

Ulrich Klehmet and Kai-Steffen Hielscher

Abstract: Network Calculus (NC) offers powerful methods for performance evaluation of queueing systems, especially for the worst-case analysis of communication networks. It is often used to obtain QoS guarantees in packet switched communication systems. One issue of nowadays’ research is the applicability of NC for multiplexed flows, in particular, if the FIFO property cannot be assumed when merging the individual flows. If a node serves the different flows using another schedule than FIFO, the terms ’strict’ or ’non-strict’ service curves play an important role. In this paper, we are dealing with the problems of strict and non-strict service curves in connection with aggregate scheduling. In the literature, the strictness of the service curve of the aggregated flow is reported as a fundamental precondition to get a service curve for the single individual flows at demultiplexing, if the service node process the input flows in Non-FIFO manner. The important strictness-property is assumed to be a unique feature of the service curve alone. But we will show here that this assumption is not true in general. Only the connection with the concrete input allows to classify a service as curve strict or non-strict.