{"title":"Delay Efficient Backpressure Routing in Wireless Ad Hoc Networks","authors":"L. Maglaras, Dimitrios Katsaros","doi":"10.4108/mca.1.4.e5","DOIUrl":"https://doi.org/10.4108/mca.1.4.e5","url":null,"abstract":"Packet scheduling/routing in wireless ad hoc networks is a fundamental problem for ad hoc networking. Backpressure routing is a solid and throughput optimal policy for such networks, but suffers from increased delays. In this article, we present two holistic approaches to improve upon the delay problems of backpressuretype algorithms. We develop two scheduling algorithms, namely Voting backpressure and Layered backpressure routing, which are throughput optimal. We experimentally compare the proposed algorithms against stateof-the-art delay-aware backpressure algorithms, which provide optimal throughput, for different payloads and network topologies, for both static and mobile networks. The experimental evaluation of the proposed delay reduction algorithms attest their superiority in terms of QoS, robustness, low computational complexity and simplicity.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117032897","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":"Cooperation Scheme For Distributed Spectrum Sensing In Cognitive Radio Networks","authors":"Ying Dai, Jie Wu","doi":"10.4108/mca.1.4.e1","DOIUrl":"https://doi.org/10.4108/mca.1.4.e1","url":null,"abstract":"Spectrum sensing is an essential phase in cognitive radio networks (CRNs). It enables secondary users (SUs) to access licensed spectrum, which is temporarily not occupied by the primary users (PUs). The widely used scheme of spectrum sensing is cooperative sensing, in which an SU shares its sensing results with other SUs to improve the overall sensing performance, while maximizing its throughput. For a single SU, if its sensing results are shared early, it would have more time for data transmission, which improves the throughput. However, when multiple SUs send their sensing results early, they are more likely to send out their sensing results simultaneously over the same signaling channel. Under these conditions, conflicts would likely happen. Then, both the sensing performance and throughput would be affected. Therefore, it is important to take when-toshare into account. We model the spectrum sensing as an evolutionary game. Different from previous works, the strategy set for each player in our game model contains not only whether to share its sensing results, but also when to share. The payoff for each player is defined based on the throughput, which considers the influence of the time spent both on sensing and sharing. We prove the existence of the evolutionarily stable strategy (ESS). In addition, we propose a practical algorithm for each secondary user to converge to the ESS. We conduct experiments on our testbed consisting of 4 USRP N200s. The experimental results verify for our model, including the convergence to the ESS.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119025","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}
R. E. Azouzi, Essaid Sabir, Mohammed Raiss El-Fenni, S. K. Samanta
{"title":"A Unified NET-MAC-PHY Cross-layer Framework for Performance Evaluation of Multi-hop Ad hoc WLANs","authors":"R. E. Azouzi, Essaid Sabir, Mohammed Raiss El-Fenni, S. K. Samanta","doi":"10.4108/mca.1.4.e6","DOIUrl":"https://doi.org/10.4108/mca.1.4.e6","url":null,"abstract":"Most of the existing works have been evaluated the performance of 802.11 multihop networks by considering the MAC layer or network layer separately. Knowing the nature of the multi-hop ad hoc networks, many factors in different layers are crucial for study the performance of MANET. In this paper we present a new analytic model for evaluating average end-to-end throughput in IEEE 802.11e multihop wireless networks. In particular, we investigate an intricate interaction among PHY, MAC and Network layers. For instance, we incorporate carrier sense threshold, transmission power, contention window size, retransmissions retry limit, multi rates, routing protocols and network topology together. We build a general cross-layered framework to represent multi-hop ad hoc networks with asymmetric topology and asymmetric traffic. We develop an analytical model to predict throughput of each connection as well as stability of forwarding queues at intermediate nodes in saturated networks. To the best of our knowledge, it seems that our work is the first wherein general topology and asymmetric parameters setup are considered in PHY/MAC/Network layers. Performance of such a system is also evaluated through simulation. We show that performance measures of the MAC layer are affected by the traffic intensity of flows to be forwarded. More precisely, attempt rate and collision probability are dependent on traffic flows, topology and routing.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678109","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}
Elke Roth-Mandutz, Stephen S. Mwanje, A. Mitschele-Thiel
{"title":"Cell Identification based on Received Signal Strength Fingerprints: Concept and Application towards Energy Saving in Cellular Networks","authors":"Elke Roth-Mandutz, Stephen S. Mwanje, A. Mitschele-Thiel","doi":"10.4108/mca.1.4.e4","DOIUrl":"https://doi.org/10.4108/mca.1.4.e4","url":null,"abstract":"The increasing deployment of small cells aimed at off-loading data traffic from macrocells in heterogeneous networks has resulted in a drastic increase in energy consumption in cellular networks. Energy consumption can be optimized in a self-organized way by adapting the number of active cells in response to the current traffic demand. In this paper we concentrate on the complex problem of how to identify small cells to be reactivated in situations where multiple cells are concurrently inactive. Solely based on the received signal strength, we present cell-specific patterns for the generation of unique cell fingerprints. The cell fingerprints of the deactivated cells are matched with measurements from a high data rate demanding mobile device to identify the most appropriate candidate. Our scheme results in a matching success rate of up to 100% to identify the best cell depending on the number of cells to be activated.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134046850","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":"Pre-phase Improvement For Distributed Spectrum Sensing in Cognitive Radio Networks","authors":"Ying Dai, Jie Wu","doi":"10.4108/mca.1.4.e2","DOIUrl":"https://doi.org/10.4108/mca.1.4.e2","url":null,"abstract":"This paper considers a pre-phase of spectrum sensing in cognitive radio networks (CRNs), which is about how to choose a channel for spectrum sensing. We take the time dimension, spectrum dimension, and spacial dimension into account and propose a sense-in-order model. In this model, each node maintains four states regarding each channel, based on the neighbors’ shared information. We construct a state transition diagram for the four states and design an algorithm for every node to calculate the probability of choosing each channel. Extensive simulation results testify to the performance of our model. In addition, we conduct experiments on the USRP/Gnuradio testbed to prove the main part of the sense-in-order model with directional antennas. Experimental results show that the average success percentage under the settings of the testbed is above 70%.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115565754","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 Cooperative Relay in Cognitive Radio Networks","authors":"Donglin Hu, S. Mao","doi":"10.4108/mca.1.3.e3","DOIUrl":"https://doi.org/10.4108/mca.1.3.e3","url":null,"abstract":"Cognitive radios (CR) and cooperative communications represent new paradigms that both can effectively improve the spectrum efficiency of future wireless networks. In this paper, we investigate the problem of cooperative relay in CR networks for further enhanced network performance. We investigate how to effectively integrate these two advanced wireless communications technologies. In particular, we focus on the two representative cooperative relay strategies, decode-and-forward (DF) and amplify-and-forward (AF), and develop optimal spectrum sensing and p-Persistent CSMA for spectrum access. We develop an analysis for the comparison of these two relay strategies in the context of CR networks, and derive closed-form expressions for network-wide throughput achieved by DF, AF and direct link transmissions. Our analysis is validated by simulations. We find each of the strategies performs better in a certain parameter range; there is no case of dominance for the two strategies. The significant gaps between the cooperative relay results and the direct link results exemplify the diversity gain achieved by cooperative relays in CR networks.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131383609","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}
S. Romaszko, D. Denkovski, V. Pavlovska, L. Gavrilovska
{"title":"Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks","authors":"S. Romaszko, D. Denkovski, V. Pavlovska, L. Gavrilovska","doi":"10.4108/mca.1.3.e4","DOIUrl":"https://doi.org/10.4108/mca.1.3.e4","url":null,"abstract":"This paper proposes a rendezvous protocol for cognitive radio ad hoc networks, RAC2E-gQS, which utilizes (1) the asynchronous and randomness properties of the RAC2E protocol, and (2) channel mapping protocol, based on a grid Quorum System (gQS), and taking into account channel heterogeneity and asymmetric channel views. We show that the combination of the RAC2E protocol with the grid-quorum based channel mapping can yield a powerful RAC2E-gQS rendezvous protocol for asynchronous operation in a distributed environment assuring a rapid rendezvous between the cognitive radio nodes having available both symmetric and asymmetric channel views. We also propose an enhancement of the protocol, which uses a torus QS for a slot allocation, dealing with the worst case scenario, a large number of channels with opposite ranking lists.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039753","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 Prohibitive Link between Position-based Routing and Planarity","authors":"David E. Cairns, Marwan M. Fayed, H. Mouftah","doi":"10.4108/mca.1.3.e2","DOIUrl":"https://doi.org/10.4108/mca.1.3.e2","url":null,"abstract":"Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR). This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity. We show that the gap between non-planarity and successful delivery is a single link within a single configuration. Our work begins with an analysis to enumerate all node configurations that cause intersections in the unit-disc graph. We find that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP) that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114434164","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":"Guaranteed Delivery in k-Anycast Routing in Multi-SinkWireless Networks","authors":"N. Mitton, D. Simplot-Ryl, Jun Zheng","doi":"10.4108/mca.1.3.e1","DOIUrl":"https://doi.org/10.4108/mca.1.3.e1","url":null,"abstract":"In k-anycasting, a sensor wants to report event information to any k sinks in the network. In this paper, we describe KanGuRou, the first position-based energy efficient k-anycast routing which guarantees the packet delivery to k sinks as long as the connected component that contains s also contains at least k sinks. A node s running KanGuRou first computes a tree including k sinks with weight as low as possible. If this tree has m ≥ 1 edges originated at node s, s duplicates the message m times and runs m times KanGuRou over a subset of defined sinks. We present two variants of KanGuRou, each of them being more efficient than the other depending of application settings. Simulation results show that KanGuRou allows up to 62% of energy saving compared to plain anycasting.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124541027","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":"Middleware-based Security for Hyperconnected Applications in Future In-Car Networks","authors":"Alexandre Bouard, D. Burgkhardt, C. Eckert","doi":"10.4108/mca.1.3.e7","DOIUrl":"https://doi.org/10.4108/mca.1.3.e7","url":null,"abstract":"Today’s cars take advantage of powerful electronic platforms and provide more and more sophisticated connected services. More than just ensuring the role of a safe transportation mean, they process private information, industrial secrets, communicate with our smartphones, Internet and will soon host thirdparty applications. Their pervasive computerization makes them vulnerable to common security attacks, against which automotive technologies cannot protect. The transition toward Ethernet/IP-based on-board communication could be a first step to respond to these security and privacy issues. In this paper, we present a security framework leveraging local and distributed information flow techniques in order to secure the on-board network against internal and external untrusted components. We describe the implementation and integration of such a framework within an IP-based automotive middleware and provide its evaluation.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128044730","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}