A. Grauballe, M. Jensen, A. Paramanathan, J. D. Rasmussen
{"title":"Implementation of Cooperative Information Storage on Distributed Sensor Boards","authors":"A. Grauballe, M. Jensen, A. Paramanathan, J. D. Rasmussen","doi":"10.1109/ICCW.2008.32","DOIUrl":"https://doi.org/10.1109/ICCW.2008.32","url":null,"abstract":"Reliable data retrieval from a sensor network can require a temporal distributed data storage of the measured data among all motes. This is the case when a source of information, or a gateway, is only occasionally present in the network. We consider a network consisting of motes that in order to save energy independently of each other go into offline mode, switching their radios off. We propose a cooperative mechanism for data distribution that increases system reliability, and at the same time keeps the memory consumption for data storage low on each device. A Reed-Solomon coding scheme is applied as a solution where a certain number of unavailable devices can be tolerated without jeopardizing the system reliability. A prototype of a system is implemented to test the protocol behavior under realistic conditions. Prototyping is done on the OpenSensor platform developed at Aalborg University. To observe the system performance in different settings, additionally a simulator is developed. Performance results indicate that the proposed cooperative data distribution method outperforms the non-cooperative one. The metric used to estimate the system reliability is the probability to retrieve all sensor measurements.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127607821","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":"Distributed Protocol Stacks: A Framework for Balancing Interoperability and Optimization","authors":"D. Kliazovich, F. Granelli","doi":"10.1109/ICCW.2008.51","DOIUrl":"https://doi.org/10.1109/ICCW.2008.51","url":null,"abstract":"This paper discusses architectural details related to a possible evolution in the protocol stack design, enabling to move a set of functions implemented at a particular layer of the protocol stack of one node to another element of the network (node, router, or base station). Communication with the functional block detached in such way is performed using a predefined communication interface. This novel paradigm is refereed to as distributed protocol stacks, and aims at providing a framework for performance optimization of data transfer, improved QoS provisioning, as well as advances in network design, operation, and management.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130758836","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":"Supporting Scalable Multimedia Streaming over Converged DVB-H and DTMB Networks","authors":"Hongfei Du, N. Conci, N. Hendrich","doi":"10.1109/ICCW.2008.58","DOIUrl":"https://doi.org/10.1109/ICCW.2008.58","url":null,"abstract":"This paper studies an efficient solution for transporting scalable video over multi-standard integrated multimedia broadcasting networks, namely DVB-H and DTMB. A novel approach, called network-aware stream adaptation (NASA) framework, is developed within this context to deliver the scalable video streams to the end users over the underlying heterogeneous broadcasting standards. Simulation results prove that the proposed scheme significantly improves the channel utilization and achieves better video quality. An efficient dynamic stream adaptation (DSA) mechanism is then foreseen to perform the most appropriate stream adaptation in response to the current reception conditions, network resources, and channel variations, offering progressive perceived visual display quality and fine-granularity QoS performance.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131503834","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":"Abiding Geocast for Warning Message Dissemination in Vehicular Ad Hoc Networks","authors":"Qiangyuan Yu, G. Heijenk","doi":"10.1109/ICCW.2008.81","DOIUrl":"https://doi.org/10.1109/ICCW.2008.81","url":null,"abstract":"Vehicular ad hoc networks (VANETs) are emerging as a new network environment for intelligent transportation systems (ITS). In many applications envisaged for VANETs, traffic information needs to be disseminated to a group of relevant vehicles and maintained for a duration of time. Here a system of abiding geocast is presented for disseminating warning message among mobile vehicles in VANETs. In this system vehicles on a stretch of roads carry safety messages to vehicles in the opposite direction, so as to warn them regarding a dangerous situation ahead. The objective is that as much as possible all relevant vehicles receive the warning before they reach the warning line, whereas as few messages are broadcasted as possible. Opposite vehicles are preferred as relays to reduce broadcast overhead and help message delivery upstream. Furthermore, wait time of individual relay vehicles are set dynamically for the next broadcast, thus unnecessary broadcasts can be saved while keeping the warning message in the affected area. Simulations show the quality of the proposed system by measuring the broadcast overhead under various conditions.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122772291","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}
F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni
{"title":"CityMob: A Mobility Model Pattern Generator for VANETs","authors":"F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni","doi":"10.1109/ICCW.2008.76","DOIUrl":"https://doi.org/10.1109/ICCW.2008.76","url":null,"abstract":"Ad hoc networking is regarded as an adequate solution to cooperative driving between communicating cars on the road. Deploying and testing these networks, usually known as Vehicular Ad-hoc Networks (VANETs), involves a high cost in the real world, and so simulation is an useful alternative in research. One of the most critical issues in a simulation study of VANETs is the use of a mobility model which resembles, as closely as possible, the real behavior of vehicular traffic. Mobility models are crucial to obtain accurate and meaningful simulation results. In this paper we present CityMob, a mobility pattern generator for VANETs. Citymob allows researchers to easily create urban mobility scenarios, including the possibility to model car accidents. We designed and developed it targeting compatibility with the ns- 2 simulator, and we implemented three different mobility models: Simple Model (SM), Manhattan Model (MM) and Downtown Model (DM). Based on a flooding alert protocol we show that the most realistic mobility model to simulate traffic accidents is the Downtown model. We also find that, for flooding to be effective, a moderate number of vehicles is required.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132315256","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":"A New NS2 Simulation Module for Bandwidth Constraints Models in DS-TE Networks","authors":"D. Adami, C. Callegari, S. Giordano, M. Pagano","doi":"10.1109/ICCW.2008.53","DOIUrl":"https://doi.org/10.1109/ICCW.2008.53","url":null,"abstract":"In recent years, network operators rolled out new revenues-generating services by using IP/MPLS networks. MPLS traffic engineering (TE) allows the creation of end-to-end paths with guaranteed bandwidth as well as the optimization of transmission resources, but it does not provide end-to-end QoS to specific traffic flows. DiffServ-aware MPLS-TE (DS-TE) improves the MPLS-TE model by allowing bandwidth reservations to be performed on a per-class basis. In particular, the Bandwidth Constraints (BCs) model is a building block of the DS-TE architecture, since it establishes how bandwidth is allocated to different traffic classes. This paper deals with the development of a new software module for the simulation of DS- TE networks and BCs models within the Network Simulator 2 (NS2) environment. The results of some simulations are reported to show the operational working of the developed modules and the benefits coming from the use of the DS-Te architecture.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134449803","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 Scheduling of Data Dissemination in Vehicular Networks with Mesh Backhaul","authors":"Liu Zhong-Yi, Liu Bin, Zhao Tong, Yan Wei","doi":"10.1109/ICCW.2008.79","DOIUrl":"https://doi.org/10.1109/ICCW.2008.79","url":null,"abstract":"Vehicular networks have become increasingly popular in the research community. Messages in vehicular networks are usually subject to both time and space constraints, and therefore should be disseminated during a specified duration and within a specific coverage. Since vehicles are constantly moving in and out of a region, dissemination of a message should be repeated to achieve reliability. However, the reliable dissemination for some messages might be at the cost of unreliable or even no chance of dissemination for other messages, which raises tradeoffs between reliability and fairness. In this paper, we study the scheduling of data dissemination in vehicular networks with mesh infrastructure. Performance metrics for reliability and fairness are proposed first. Our metric for reliability covers factors in both time and space dimensions and the metric for fairness incorporates fairness in both the network-wise sense and the mesh roadside unit-wise (MRU-wise) sense. Several scheduling algorithms are developed: one reliability-oriented algorithm, one fairness- oriented algorithm and three hybrid schemes. Extensive evaluation work is performed to quantitively analyze different scheduling algorithms. Our evaluation results show that (1) hybrid schemes outperform reliability-oriented and fairness-oriented algorithms in the sense of overall efficiency and (2) different algorithms have quite different characteristics on reliability and fairness.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114780778","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":"Performance Analysis of IEEE 802.11-Based Ad Hoc Networks Using Game Theory","authors":"Chunfeng Liu, Y. Shu, Wucheng Yang, O. Yang","doi":"10.1109/ICCW.2008.52","DOIUrl":"https://doi.org/10.1109/ICCW.2008.52","url":null,"abstract":"This paper describes a type of selfish node behavior in the MAC layer and studies its effects on the performance of ad hoc networks. We use a game-theoretic approach to investigate the selfish behavior problem by focusing on the strategy that a node can adopt during wireless channel access. Based on this investigation, we obtained the guidelines to design a mechanism that can force the selfish node to obey the IEEE 802.11 protocol, and therefore improve the performance of wireless ad hoc networks. The algorithm consists of two parts. The first part detects selfish behavior based on the throughput, and the second part prevents the selfish behavior. The algorithm has been validated by extensive simulation. Simulation results show that our algorithm are effective in detecting the selfish nodes and eliminate their selfish behavior. As a result, every node can obtain a relatively fair throughput when following the guideline of our algorithm.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124403635","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":"A Cost-Quality Tradeoff in Cooperative Sensor Networking","authors":"E. Bulut, Zijian Wang, B. Szymanski","doi":"10.1109/ICCW.2008.26","DOIUrl":"https://doi.org/10.1109/ICCW.2008.26","url":null,"abstract":"Wireless sensor networks consist of a large number of sensor nodes, each of which senses, computes and communicates with other nodes to collect and process data about the environment. Those networks are emerging as one of the new paradigms in networking with great impact on industry, government and military applications. A sensor network attempts to collect sensing data from the entire domain of its deployment, to process this data to understand phenomena and activities going on in this domain, and finally to communicate the results to the outside world to enable actuators to execute the necessary reactions. However, a sensor node is only capable of sensing events within its limited sensing range, so it has only a localized information about its environment. Hence, to provide the coverage of the entire domain, sensors need to collaborate and share their information with each other. Such sharing increases the knowledge of each sensor about the environment, but it also brings extra communication cost and increases the network operation complexity. In other words, cooperation and data sharing invokes a cost-quality tradeoff in the network. In this paper, we study two different sensor network applications: (i) finding an efficient sleep schedule based on sensing coverage redundancy, and (ii) adjusting traffic light periods to optimize traffic flow. In both applications the cost-quality tradeoff arises. In the paper, we study how fast network functionality increases when the level of cooperation raises and how much this increased functionality is offset by the raising cooperation costs. We simulated both applications with different level of cooperation and without it and demonstrated significant improvements in the overall system quality resulting from the properly selected levels of cooperation between the network's nodes.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280869","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":"Cooperative Spectrum Access for Cognitive Radio Network Employing Rateless Code","authors":"Yan Chen, Hui Huang, V. Lau","doi":"10.1109/ICCW.2008.68","DOIUrl":"https://doi.org/10.1109/ICCW.2008.68","url":null,"abstract":"In cognitive networks, since the secondary users are not licensed owners of the spectrum, they can only access the spectrum opportunistically and cooperatively to exploit the best effort throughput for themselves while guaranteeing that their transmissions would not break the QoS performance of the primary communications. In this paper, we consider the cognitive network in which the primary users have delay sensitive services, e.g., voice or video services, and we take the average delay constraint as primary users' QoS requirement. Three cooperative spectrum access schemes for secondary users under such constraint are proposed, based on the assumption that both the primary and secondary transmitter employ rateless coding. The average throughput of the secondary user for each scheme is calculated and compared both analytically and numerically. The impacts of system parameters and network topology on these schemes are also illustrated via numerical simulations.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121611959","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}