{"title":"A new design of the IEEE 802.11 MAC layer to enhance the scalability of the DMS service","authors":"Yousri Daldoul, Djamal-Eddine Meddour, T. Ahmed","doi":"10.1109/LCN.2012.6423596","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423596","url":null,"abstract":"The IEEE 802.11v defines the Directed Multicast Service (DMS) in order to enhance the reliability of the multicast transport. This service converts multicast traffic into several unicast streams. Therefore DMS can be used to serve a limited number of receivers. In this paper, we show that using DMS, losses caused by queue rejections may exceed the packet loss rate of the legacy multicast. To resolve the limited scalability of DMS, we define a new scalable version called S-DMS. This version is appropriate for layered streams like H264/SVC and is able to avoid queue overflows. S-DMS delivers the base layer of a video traffic using DMS and transmits the enhancement layer using either DMS or the legacy multicast, depending on the available bandwidth. We show that S-DMS is able to increase considerably the number of admitted multicast members.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126312490","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":"Impact of network conditions on delay-stable communications in closed industrial control networks","authors":"David A. Miller, A. Kamal","doi":"10.1109/LCN.2012.6423673","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423673","url":null,"abstract":"To properly operate closed industrial control networks, it is required that communication with nearly constant delay bounds be supported. In [9] the authors introduced FlexTDMA in order to provide this support, and with minimal delay-jitter in an asynchronous network, under unicast communication. In this paper we consider how periodic on-off traffic and frame loss are managed in the presence of network component clock drifts and bandwidth loads, and introduce the FlexTDMA+ protocol. This protocol includes three improvements over FlexTDMA: baseline preemption, partial baselining and baseline deadline density control. In this paper we consider the relative value of each of these improvements, individually and in combination, has in handling these network conditions.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115715986","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":"On the feasibility of secure application-layer communications on the Web of Things","authors":"J. Granjal, E. Monteiro, J. Silva","doi":"10.1109/LCN.2012.6423615","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423615","url":null,"abstract":"The availability of inexpensive sensing devices capable of wireless communications enables the design of exciting and new distributed sensing applications. The integration of such applications with the Internet will contribute to materialize a vision of a future Web that we nowadays describe as the Web of Things (WoT). Many security-related aspects are still open on how to address security for communications on the WoT, and that must be targeted before such applications can realistically be considered ready for deployment. We discuss the experimental evaluation of mechanisms proposed to secure end-to-end web communications with IPv6-capable sensing applications and devices, as such mechanisms may provide an important contribution towards the WoT. Our experimental evaluation study considers the impact of security on real sensing devices and requirements from sensing applications, allowing the identification of the limitations of current sensing platforms in supporting the proposed mechanisms.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124208964","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":"Enhancing TCP with cross-layer notifications and capacity estimation in heterogeneous access networks","authors":"L. Daniel, M. Kojo","doi":"10.1109/LCN.2012.6423653","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423653","url":null,"abstract":"Finding the available network capacity for a TCP connection is an important research problem as it allows the connection to improve its throughput and fairness in addition to reducing packet losses. As flows arrive and depart randomly in the network, the state of a TCP connection at any instant is very dynamic and a good estimate of the available capacity can enable TCP to quickly adapt to the actual available capacity in the network. This is especially relevant to heterogeneous access network environments where the end-to-end path characteristics of a TCP connection may abruptly change due to the changes in the access link characteristics after a vertical handoff. In this paper, we present an approach that combines available network capacity estimation with cross-layer notifications to TCP about the access link bandwidth and delay to quickly determine a rough estimate of the available capacity for a TCP connection. Using simulation experiments we evaluate our algorithms in the different phases of a TCP connection where the available capacity is unknown such as in the beginning of a TCP connection and after a vertical handoff. Our results show that the proposed algorithms improve TCP throughput and reduce the transfer time after a vertical handoff in heterogeneous access networks.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122468518","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":"Monitoring Traffic Activity Graphs with low-rank matrix approximation","authors":"Yang Liu, Wenji Chen, Y. Guan","doi":"10.1109/LCN.2012.6423680","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423680","url":null,"abstract":"Recently, Traffic Activity Graphs (TAGs) have been proposed to understand, analyze, and model network-wide communication patterns. The topological properties of the TAGs have been shown to be very helpful for malware analysis, anomaly detection, and attack attribution. In a TAG, nodes represent hosts in the network and edges are observed flows that indicate certain communication relations or interactions of interest among the hosts. The challenge is how to capture and analyze TAGs which are usually large, sparse and complex and often have overly-large space and computation requirements. In this paper, we present a new sampling-based low-rank approximation method for monitoring TAGs. The resulted solution can reduce the computation complexity for the communication pattern analysis from O(mn) to O(m+n), where m and n denote the number of sources and destinations, respectively. The experimental results with real-world traffic traces show that our method outperform existing solutions in terms of efficiency and the capability of processing and identifying unknown TAGs.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"18 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132869879","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}
Yuting Hu, Haiquan Wang, Chunhe Xia, Weiguo Li, Ying Yang
{"title":"On the distribution of inter contact time for DTNs","authors":"Yuting Hu, Haiquan Wang, Chunhe Xia, Weiguo Li, Ying Yang","doi":"10.1109/LCN.2012.6423594","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423594","url":null,"abstract":"Inter contact time (ICT) between two mobile nodes is essential to forwarding algorithms and the end-to-end delay in Delay Tolerant Networks (DTNs). However, studies regarding the distribution of ICT lack general applicability and the exponential parameter concerns with too many motion characteristics. Consequently, it is difficult to design the protocol and analyze the performance for DTNs. In this paper, we demonstrate ICT between two mobile nodes is exponentially distributed and the exponential parameter relates to their historical contact numbers and the cumulative ICTs. Moreover, through extensive experimental simulations, we find that our findings have a general applicability in both theoretical mobility models and real world mobility traces, thus providing guidelines on the design of new mobility models with exponential distribution, new message protocols and further performance analysis methods.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124245139","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":"Detecting protocol switching covert channels","authors":"S. Wendzel, S. Zander","doi":"10.1109/LCN.2012.6423628","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423628","url":null,"abstract":"Network covert channels enable hidden communication and can be used to break security policies. Within the last years, new techniques for such covert channels arose, including protocol switching covert channels (PSCCs). PSCCs transfer hidden information by sending network packets with different selected network protocols. In this paper we present the first detection methods for PSCCs. We show that the number of packets between network protocol switches and the time between switches can be monitored to detect PSCCs with 98-99% accuracy for bit rates of 4 bits/second or higher.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124561422","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":"Novel assessment metric and countermeasures for traffic attack threats in wireless sensor networks","authors":"Yousef Ebrahimi, M. Younis","doi":"10.1109/LCN.2012.6423644","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423644","url":null,"abstract":"In wireless sensor networks, all data packets are routed from the individual sensor nodes towards an in-situ base-station (BS). Such traffic pattern makes the BS vulnerable to adversary's attack. Basically, an adversary would intercept the ongoing transmissions and localize their sources. Then by employing traffic analysis techniques, an adversary would correlate the intercepted transmissions to uncover the data path which may lead to the location of the BS. Evidence theory is a well-known scheme that an adversary might use for traffic analysis. However, prior work considered only intercepted transmissions as evidences in the correlation process without factoring in the time of interception. In this paper, we argue that time-based correlation increases the accuracy of the traffic analysis and makes contemporary countermeasures ineffective. A novel technique is proposed to counter the time correlation and boost the anonymity of the BS. The technique imposes buffering delay at each relaying node on the data route in order to disturb the time correlation among consecutive transmissions. Our technique is validated through simulation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124749070","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":"Modeling visitor movement in theme parks","authors":"Gürkan Solmaz, M. Akbaş, D. Turgut","doi":"10.1109/LCN.2012.6423650","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423650","url":null,"abstract":"Realistic modeling of the movement of people in an environment is critical for evaluating the performance of mobile wireless systems such as urban sensing or mobile sensor networks. Existing human movement models are either fully synthetic or rely on traces of actual human movement. There are many situations where we cannot perform an accurate simulation without taking into account what the people are actually doing. For instance, in theme parks, the movement of people is strongly tied to the locations of the attractions and is synchronized with major external events. For these situations, we need to develop scenario specific models. In this paper, we present a model of the movement of visitors in a theme park. The nondeterministic behavior of the human walking pattern is combined with the deterministic behavior of attractions in the theme park. The attractions are divided into groups of rides, restaurants and live shows. The time spent by visitors at different attractions is calculated using specialized queuing-theoretic models. We compare the realism of the model by comparing its simulations to the statistics of the theme parks and to real-world GPS traces of visitor movement. We found that our model provides a better match to the real-world data compared to current state-of-the-art movement models.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115884721","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}
O. Artemenko, T. Simon, A. Mitschele-Thiel, D. Schulz, R. Ta
{"title":"Comparison of Anchor Selection algorithms for improvement of position estimation during the Wi-Fi localization process in disaster scenario","authors":"O. Artemenko, T. Simon, A. Mitschele-Thiel, D. Schulz, R. Ta","doi":"10.1109/LCN.2012.6423660","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423660","url":null,"abstract":"It is very common that during the localization process redundant reference data can be collected. This reference data is called “anchors”. For some position estimation algorithms, like trilateration or Min-Max, only three or four anchors for 2-d or 3-d localization respectively are required. The selection of certain anchors from collected amount can affect the localization accuracy significantly [1]. The main purpose of this paper is to propose and analyze several most promising Optimum Anchor Selection algorIthmS (OASIS) that can contribute to the improvement of the localization precision.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"14 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132580075","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}