{"title":"Distributed link scheduling in wireless networks with interference cancellation capabilities","authors":"Long Qu, Jiaming He, C. Assi","doi":"10.1109/WoWMoM.2014.6918967","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918967","url":null,"abstract":"This paper considers the problem of link scheduling in wireless networks with interference cancellation (IC) capabilities and under the physical SINR interference model. We first present a cross layer formulation and then use duality theory to decompose the joint design problem into congestion control and routing/scheduling subproblems, which interact through congestion prices. Given that the problem of scheduling with IC and under the SINR interference regime has been shown to be NP-complete, this paper develops a decentralized approach which allows links to coordinate their transmissions and therefore efficiently solving the link scheduling problem. We show that our decentralized algorithm achieves very close performance to other centralized methods (e.g., greedy maximal scheduling). We also study the performance gains that IC brings to wireless networks and we show that flows in the network achieve up to twice their rates in most instances, in comparisons with networks without interference cancellation capabilities. These gains are attributed to the capabilities of SIC in better managing the interference in the network and promoting higher spatial reuse among contending links.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127462418","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 beaconing policies on traffic density estimation accuracy in traffic information systems","authors":"S. Bastani, Lavy Libman, S. Travis Waller","doi":"10.1109/WoWMoM.2014.6918963","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918963","url":null,"abstract":"Intelligent transport information systems (TIS) are one of the most rapidly emerging applications of wireless vehicular communications using DSRC/WAVE technology. A core function in a TIS is the estimation of traffic density using beacons transmitted by individual vehicles, subsequently used for purposes such as traffic light control or incident detection. In this paper, we conduct an in-depth study on how the accuracy of traffic density estimation depends on various parameters of the wireless beacons transmission policy, such as beaconing rate and timing. Unlike many other studies, our focus is entirely on the application-layer metric of density estimation accuracy, rather than low-layer metrics such as packet loss rate and throughput. Our results are evaluated over a wide range of traffic traces generated by a commercial microscopic traffic simulator (Paramics), corresponding to a typical urban scenario consisting of a signalized intersection of multiple-lane roads.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127501120","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":"An optimal model to partition the evolution of periodic tasks in wireless sensor networks","authors":"C. Brandolese, L. Rucco, W. Fornaciari","doi":"10.1109/WoWMoM.2014.6918962","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918962","url":null,"abstract":"Our research targets an operating paradigm that can be referred to as WSN cloud infrastructure, in which a WSN provider maintains the sensor network over a certain area and allows potential clients to deploy their applications to monitor some parameters of interest. Applications coming from multiple heterogeneous sources may have very inhomogeneous periods and tolerable slacks, inducing a fragmented and inefficient duty cycle on the nodes, strongly accelerating the energy depletion process. In such a paradigm, a way to merge as much as possible the execution moments of the periodic tasks is mandatory, in order to reduce the energy overheads of frequent awakenings of system and devices. The partitioning method presented in this paper subdivides the evolution of the periodic tasks in small self-contained optimization sub-problems, which can be subsequently processed at run-time through a task-merging or a scheduling policy. The model and the related algorithm have been conceived such that the formal guarantees of global optimality are satisfied in the general case of a coverage problem, aimed at finding the sequence of system awakenings that fulfill the deadlines of each periodic task in the system. Moreover, the generality of the model makes it suitable for a variety of task-merging policies and algorithms. Experimental results demonstrate the high computational efficiency of the proposed partitioning approach.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116452366","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}
Emilio Ancillotti, R. Bruno, M. Conti, E. Mingozzi, C. Vallati
{"title":"Trickle-L2: Lightweight link quality estimation through Trickle in RPL networks","authors":"Emilio Ancillotti, R. Bruno, M. Conti, E. Mingozzi, C. Vallati","doi":"10.1109/WoWMoM.2014.6918951","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918951","url":null,"abstract":"Lightweight link quality estimation is crucial in wireless sensor networks. Indeed, devices with limited capabilities shall trade off between consuming their resources to maintain a precise view of the neighbours' link quality and to build routes almost blindly. For instance, the Routing Protocol for Low-Power and Lossy Networks (RPL), which has been recently standardised by the IETF to enable IPv6-based sensor networks, only estimates the quality of the links used to deliver data packets. However, this solution has been demonstrated to cause periods of routing instability and reduced packet delivery rates since it estimates only the quality of utilised links. To address this issue in this work we propose a lightweight link estimation procedure that exploits Trickle-based topology maintenance techniques to simultaneously estimate link qualities and propagate routing information. Our proposed scheme has been integrated in the Contiki's RPL prototype implementation. Simulation results demonstrate that our proposal is capable of measuring the quality of the links to neighbours with small overhead, which results into better routing decisions and improved packet delivery rates.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117291031","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":"Collaborative bandwidth sharing for resilient communication during a disaster","authors":"Kun-Chan Lan, Chien-Ming Chou, C. Li","doi":"10.1109/WoWMoM.2014.6918939","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918939","url":null,"abstract":"Given peoples increasing dependence on communication networks, vulnerabilities of communication networks and the Internet can significantly impact our lives. These networks and services are susceptible to accidents or natural disasters that can disrupt service and compromised the network infrastructure. In the face of these disasters, the need for greater resilience for the Internet has attracted the attention of researchers. In this work, we propose an architecture that allows a disconnected smart-phone in a disaster situation to utilize the Internet connections of neighboring smart-phones. We evaluate the performance of our protocol by comparing it with the Concurrent Multipath Transfer SCTP (CMT-SCTP), and the results show that our protocol can achieve similar or better performance.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129506616","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 placement of multiple sinks in wireless sensor networks","authors":"Louisa Harutyunyan","doi":"10.1109/WoWMoM.2014.6919012","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6919012","url":null,"abstract":"A primary task in wireless sensor networks (WSNs) is for sensors to communicate collected data to a sink for analysis and processing. A single sink in the network can lead to high energy consumption and hence, a reduction of the network lifetime. Thus, to achieve a degree of fault tolerance we consider the problem, where the hop distance from every sensor to a sink is bounded by an integer k and each sensor is within distance k of r sinks. This problem is equivalent to a distance-k total r-dominating set, denoted Dk, r, in WSNs. Due to generally large number of sensors in WSNs or the network being constructed in an unreachable terrain, sensors may be arranged stochastically. Because of this uncertainty and randomness in the network structure, WSNs can be modelled as random graphs. In this work, we study upper bounds on the size of Dk, r, where a WSN is modelled as a random graph.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128380774","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}
Tristan Gaugel, Jens Mittag, H. Hartenstein, E. Ström
{"title":"Understanding differences in MAC performance","authors":"Tristan Gaugel, Jens Mittag, H. Hartenstein, E. Ström","doi":"10.1109/WoWMoM.2014.6918995","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918995","url":null,"abstract":"The suitability and performance of medium access protocols in vehicular environments is already being investigated over a long period of time. Carrier Sense Multiple Access (CSMA) has been shown to perform sufficiently well in most situations and being able to support safety and efficiency vehicular applications. Recently, Self-organizing Time-Division Multiple Access (STDMA) is being considered as an alternative and has been shown to coordinate the channel slightly better under certain situations. However, when comparing both protocols the precise details of radio and network conditions and parametrization of the protocols are decisive on which protocol takes a slight lead. Consequently, scenarios can be constructed quite easily in which one protocol is superior over the other one. The focus of this work is thus not to absolutely compare both protocols, but rather to understand the strengths and weaknesses of both protocols in certain situations. In particular, we consider i) to which degree hidden nodes influence the coordination ability, ii) how an extended carrier sensing range is beneficial and iii) how temporary fading influences the performance of both MAC protocols. Our results show that while an extended carrier sensing range is only beneficial for CSMA, the existence and severity of fading is far less detrimental for STDMA than for CSMA.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121314936","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":"High availability for Non-stop network controller","authors":"Deguo Li, Li Ruan, Limin Xiao, Mingfa Zhu, Wenbo Duan, Yuanhao Zhou, Mengxi Chen, Yinben Xia, Mingming Zhu","doi":"10.1109/WoWMoM.2014.6918986","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918986","url":null,"abstract":"Network controller is the core of the OpenFlow-Based Software-Defined Networks (SDN). High availability of network controller is an urgent need objectively. The appearance of controller instance fault should not be perceived by data plane. During the fault recovery, OpenFlow messages, especially asynchronous message from data plane, should not be discarded. Otherwise the control platform would hold the outdated network status. This is an interesting problem which we call Asynchronous Message Discard (ASMD) trouble. This paper proposes a Non-stop network controller (NSNC). It can troubleshoot the ASMD problem based on highly available TCP (HA-TCP) technology. During the fault recovery on distributed control platform, we want to elect the optimal controller to take over the network devices managed by the failed controller instance. We analyses the minimum metrics set for controller election. The view of this paper is verified on Floodlight controller. Experiments show that when the controller instance fails, asynchronous messages from switch will not be discarded, and using HA-TCP only adds negligible overhead to throughput and latency. We test the performance of election algorithm based on Mininet. Currently, there is only a theoretical analysis of metrics related to the election. We will test the validity of the election strategy in a real scenario as part of our future work.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127917775","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":"Temporal Synchronization Scheme in live 3D video streaming over IEEE 802.11 wireless networks","authors":"Yohaan Yoon, Myungchul Kim, Ben Lee, Kyungmin Go","doi":"10.1109/WoWMoM.2014.6918944","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6918944","url":null,"abstract":"Although 3D video has become popular, streaming over wireless network faces a number of challenges. Due to frequent frame losses in wireless networks, temporal asynchrony occurs and results in serious visual fatigue for viewers. In order to provide better quality of 3D video, this paper proposes a new scheme called the Temporal Synchronization Scheme (TSS) for live 3D video streaming over wireless networks. TSS delivers video frames for the left and right views in the same frame order with the same transmission priority and compensates for frame damage and loss during the decoding phase. In addition, a new metric called the Stereoscopic Temporal Variation Index (STVI) is proposed to measure the degree of temporal asynchrony in 3D video. Subjective assessments demonstrate that STVI is an objective metric for measuring subjective quality. Moreover, our study shows that the proposed scheme results in better 3D video quality than the conventional method in terms of STVI and MOS.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130469171","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":"SPECTA: A formal specification language for content transfer algorithms","authors":"Petter Sandvik","doi":"10.1109/WoWMoM.2014.6919017","DOIUrl":"https://doi.org/10.1109/WoWMoM.2014.6919017","url":null,"abstract":"When data is transferred between nodes in a network, it is often transferred in-order. However, in distributed systems, such as peer-to-peer networks and cloud-based systems, transferring data out-of-order can be advantageous, for instance by improving transfer speed, availability and reliability. With the intent of creating a reusable formalism that can describe the complexities of out-of-order content transfer in a simple manner, while being powerful enough to support as large a variety of distributed content transfer algorithms as possible, we introduce the Specification for Content Transfer Algorithms (SPECTA) language. In this article, we also show how algorithms written in this language can be translated into other formalisms such as Event-B for analysis, verification or code generation.","PeriodicalId":163455,"journal":{"name":"Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134035962","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}