Q2S and Security for Wireless and Mobile Networks最新文献_第2页

Local Topology Aware Probabilistic Routing 局部拓扑感知概率路由

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-10-25 DOI: 10.1145/3267129.3267144

D. Kifle, G. Gianini, M. Libsie

{"title":"Local Topology Aware Probabilistic Routing","authors":"D. Kifle, G. Gianini, M. Libsie","doi":"10.1145/3267129.3267144","DOIUrl":"https://doi.org/10.1145/3267129.3267144","url":null,"abstract":"Gossip-based packet forwarding is used in unstructured networks is to reduce traffic overhead in dense networks and to minimize early gossip termination in sparse networks. Unlike in flooding, where packets are forwarded to all the neighbors, in Gossip-based protocols packets are forwarded with some probability value p<1, to reduce redundancy. However this value has to be carefully tuned: if too small, early gossip termination is likely to occur, if too large, flooding storms can take place, as with the flooding protocol. In this work, we propose to use a forwarding probability based on local topology indicators, such as the effective node degree of the forwarding node: the choice of such probability takes into account the local topology. In a context where each node can have a different forwarding probability, another way of setting efficiently its value consists in further tuning such value for each message, based on the estimated level of completion of the corresponding communication task: to this purpose we propose to use a simple formula based on the messages hop-count. We validate these approaches by simulation using ns-2 in sparse and dense networks and show that they improve the performances in terms of traffic overhead and average end-to-end delay. In terms of packet delivery ratio, the proposed approach yields results comparable to those of the standard protocol AODV.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127059900","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}

引用次数: 2

Virtualized End-to-End Management Functions for Aggregated Control of Video Traffic Flows 虚拟化端到端管理功能，实现视频流量聚合控制

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-10-25 DOI: 10.1145/3267129.3267142

K. Ravindran, Ancy Cherian, Arun Adiththan

{"title":"Virtualized End-to-End Management Functions for Aggregated Control of Video Traffic Flows","authors":"K. Ravindran, Ancy Cherian, Arun Adiththan","doi":"10.1145/3267129.3267142","DOIUrl":"https://doi.org/10.1145/3267129.3267142","url":null,"abstract":"The paper describes the management and control (M&C) functions of various network nodes in an end-to-end rate-adaptive video transport system. Mobile user devices download video clips by sharing the underlying network path from an ingress node. At the core software level, M&C functions realize the well-known AIMD (additive increase multiplicative decrease) based video rate control algorithm to handle congestion along the path. AIMD is exercised on the aggregated data flows at a source ingress node based on the 'loss reports' signaled from the receiver egress node. Our aggregated AIMD-based control reduces the signaling overhead, relative to the existing approaches that anchor an AIMD instance on each user device itself. This offers scalability, while improving the user-experienced QoS: such as low jitter in transfer rates and isolation against device faults. The offloading of aggregated AIMD-based control to the in-network overlay nodes also allows a reduction in the overall bandwidth usage. The software handling of 'last-mile' issues in the path between user devices and egress nodes (such as greedy users and access network channel sharing) are discussed, in a context of fine-granular video encoders in the devices. The paper also shows a virtualization of our M&C functions (as VNF modules) for deployment in large-scale video distribution networks --- such as YouTube.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133083218","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}

引用次数: 1

On TCP Simulation Fidelity in ns-2 ns-2中TCP仿真保真度的研究

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-10-25 DOI: 10.1145/3267129.3267132

Lingfeng Guo, Jack Y. B. Lee

引用次数: 0

The Analysis of Synchronous All-to-All Communication Protocols for Wireless Systems 无线系统中同步全对全通信协议分析

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-10-25 DOI: 10.1145/3267129.3267134

Haoliang Wang, R. Simon

{"title":"The Analysis of Synchronous All-to-All Communication Protocols for Wireless Systems","authors":"Haoliang Wang, R. Simon","doi":"10.1145/3267129.3267134","DOIUrl":"https://doi.org/10.1145/3267129.3267134","url":null,"abstract":"Many applications running over low-power and lossy wireless networks and wireless sensor networks (WSNs) rely heavily on a number of all-to-all communication primitives for services such as data aggregation, voting and consensus. Starting with the Chaos system, synchronous transmission-based broadcasting gossip protocols are now recognized as a technique for enabling efficient all-to-all communications in WSNs. However, despite their effectiveness, there has been relatively little analysis of this class of synchronous broadcasting gossip protocols (SBGPs). In this paper, we address this void by providing a basic theoretical framework for analysis SBGPs. Based on our derived theoretical results and previous experimental measurements, we show that the key for better performance is to increase the network connectivity as much as possible while limiting the number of concurrent transmitters. As a proof of the concept, we propose a multi-radio approach of the SBGP to achieve this purpose. We compare four multi-radio schemes of SBGP with a single radio SBGP through simulation and result has shown the convergence latency can be reduced up to 42% by utilizing multiple radios.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124577492","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}

引用次数: 1

Detecting Forwarding Misbehavior In Clustered IoT Networks 在集群物联网网络中检测转发错误行为

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-10-25 DOI: 10.1145/3267129.3267147

N. Abhishek, Anshoo Tandon, Teng Joon Lim, B. Sikdar

引用次数: 12

Interference Comparison between OFDM & FH-OFDM Systems OFDM与FH-OFDM系统的干扰比较

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-10-25 DOI: 10.1145/3267129.3267145

M. Sakr, M. Soleymani

引用次数: 2

A Novel Proactive Handover Scheme for Achieving Energy-Efficient Vehicular Networks 实现节能汽车网络的一种新型主动切换方案

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-10-25 DOI: 10.1145/3267129.3267148

Peng Sun, Noura Aljeri, A. Boukerche

引用次数: 3

Building a Coverage Hole-free Communication Tree 构建无覆盖孔的通信树

Q2S and Security for Wireless and Mobile Networks Pub Date : 2018-02-23 DOI: 10.1145/3267129.3267139

A. Vergne, L. Decreusefond, P. Martins

引用次数: 0

HiveSign: dynamic message signatures for resource-constrained wireless networks HiveSign:资源受限无线网络的动态消息签名

Q2S and Security for Wireless and Mobile Networks Pub Date : 2014-09-21 DOI: 10.1145/2642687.2642699

Raghav V. Sampangi, S. Sampalli

引用次数: 2

Flow-level modeling and optimization of intercell coordination with dynamic TDD 基于动态TDD的单元间协调流级建模与优化

Q2S and Security for Wireless and Mobile Networks Pub Date : 2014-09-21 DOI: 10.1145/2642687.2642698

Prajwal Osti, S. Aalto, P. Lassila

{"title":"Flow-level modeling and optimization of intercell coordination with dynamic TDD","authors":"Prajwal Osti, S. Aalto, P. Lassila","doi":"10.1145/2642687.2642698","DOIUrl":"https://doi.org/10.1145/2642687.2642698","url":null,"abstract":"We study the intercell coordination problem between two interfering cells combined with dynamic time-division duplexing (TDD). In dynamic TDD, each station selects in each time slot whether it is serving uplink (u) or downlink (d) traffic. Thus, the system has four possible operation modes (uu, ud, du, dd). The amount of intercell interference between the stations clearly depends on the operation mode. We consider a flow-level model where traffic consists of elastic data flows in both cells (cells 1 and 2) and in both directions (uplink and downlink). We first characterize the maximal stability region, and then determine the optimal static (i.e., state-independent) policy. Our main objective is to analyze the potential gains from applying dynamic (i.e., state-dependent) policies, where the chosen operation mode depends on the instantaneous state of the system. To this end, motivated by certain stochastic optimality results in the literature, we define several priority policies. As a reference policy, we have the well-known max-weight policy, and we also develop another dynamic policy by applying the policy iteration algorithm. Notably we prove that certain simple priority policies are, in fact, stochastically optimal in some special cases, but which policy is optimal depends on the setting. To study the exact performance gains achieved by the dynamic policies, we perform extensive simulations. While our stochastic optimality results require exponential service times, in the simulations, we also study the impact of nonexponential service times and consider a physical model where the service time distribution is determined by the joint distribution of flow sizes and the random location of the corresponding user in the cell area. The max-weight policy is, as expected, performing well but the various priority policies are sometimes better and even optimal. Jointly the results indicate that dynamic policies give significant performance gains compared with the optimal static policy.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121447975","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}

引用次数: 4