Pub Date : 2006-07-17DOI: 10.1109/MOBIQW.2006.361773
R. Mangharam, D. Weller, R. Rajkumar, P. Mudalige, F. Bai
Vehicular networks are being developed for efficient broadcast of safety alerts, real-time traffic congestion probing and for distribution of on-road multimedia content. In order to investigate vehicular networking protocols and evaluate the effects of incremental deployment it is essential to have a topology-aware simulation and test-bed infrastructure. While several traffic simulators have been developed under the intelligent transport system initiative, their primary motivation has been to model and forecast vehicle traffic flow and congestion from a queuing perspective. GrooveNet is a hybrid simulator which enables communication between simulated vehicles, real vehicles and between real and simulated vehicles. By modeling inter-vehicular communication within a real street map-based topography it facilitates protocol design and also in-vehicle deployment. GrooveNet's modular architecture incorporates mobility, trip and message broadcast models over a variety of link and physical layer communication models. It is easy to run simulations of thousands of vehicles in any US city and to add new models for networking, security, applications and vehicle interaction. GrooveNet supports multiple network interfaces, GPS and events triggered from the vehicle's on-board computer. Through simulation, we are able to study the message latency, and coverage under various traffic conditions. On-road tests over 400 miles lend insight to required market penetration
{"title":"GrooveNet: A Hybrid Simulator for Vehicle-to-Vehicle Networks","authors":"R. Mangharam, D. Weller, R. Rajkumar, P. Mudalige, F. Bai","doi":"10.1109/MOBIQW.2006.361773","DOIUrl":"https://doi.org/10.1109/MOBIQW.2006.361773","url":null,"abstract":"Vehicular networks are being developed for efficient broadcast of safety alerts, real-time traffic congestion probing and for distribution of on-road multimedia content. In order to investigate vehicular networking protocols and evaluate the effects of incremental deployment it is essential to have a topology-aware simulation and test-bed infrastructure. While several traffic simulators have been developed under the intelligent transport system initiative, their primary motivation has been to model and forecast vehicle traffic flow and congestion from a queuing perspective. GrooveNet is a hybrid simulator which enables communication between simulated vehicles, real vehicles and between real and simulated vehicles. By modeling inter-vehicular communication within a real street map-based topography it facilitates protocol design and also in-vehicle deployment. GrooveNet's modular architecture incorporates mobility, trip and message broadcast models over a variety of link and physical layer communication models. It is easy to run simulations of thousands of vehicles in any US city and to add new models for networking, security, applications and vehicle interaction. GrooveNet supports multiple network interfaces, GPS and events triggered from the vehicle's on-board computer. Through simulation, we are able to study the message latency, and coverage under various traffic conditions. On-road tests over 400 miles lend insight to required market penetration","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121663539","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}
Pub Date : 2006-07-01DOI: 10.1109/MOBIQ.2006.340384
T. Bokareva, N. Bulusu, S. Jha
Ad hoc wireless sensor networks derive much of their promise from their potential for autonomously monitoring remote or physically inaccessible locations. As we begin to deploy sensor networks in real world applications, concerns are being raised about the fidelity and integrity of the sensor network data. In this paper, we motivate and propose an online algorithm that leverages competitive learning neural network for characterization of a dynamic, unknown environment. Based on the proposed characterization sensor networks can autonomously construct multimodal views of their environments and derive the conditions for verifying data integrity over time
{"title":"Learning Sensor Data Characteristics in Unknown Environments","authors":"T. Bokareva, N. Bulusu, S. Jha","doi":"10.1109/MOBIQ.2006.340384","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340384","url":null,"abstract":"Ad hoc wireless sensor networks derive much of their promise from their potential for autonomously monitoring remote or physically inaccessible locations. As we begin to deploy sensor networks in real world applications, concerns are being raised about the fidelity and integrity of the sensor network data. In this paper, we motivate and propose an online algorithm that leverages competitive learning neural network for characterization of a dynamic, unknown environment. Based on the proposed characterization sensor networks can autonomously construct multimodal views of their environments and derive the conditions for verifying data integrity over time","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116596555","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}
Pub Date : 2006-07-01DOI: 10.1109/MOBIQ.2006.340453
F. Anjum
In this paper, some challenges for the providing service in a ubiquitous, mobile environment have been described. The first challenge is to provide the performance, the security is the other important challenge where its associations are formed with particular interfaces and the privacy also needed attention in a world that provides ubiquitous services. The design and development of the services brings their own set of challenges. It has to be designed such that they can function effectively in various resources and similarly it development needs careful thought. The other challenges such as novelty, desirability, testing and evaluation are also described in this paper
{"title":"Challenges on providing services in a Ubiquitous, Mobile Environment","authors":"F. Anjum","doi":"10.1109/MOBIQ.2006.340453","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340453","url":null,"abstract":"In this paper, some challenges for the providing service in a ubiquitous, mobile environment have been described. The first challenge is to provide the performance, the security is the other important challenge where its associations are formed with particular interfaces and the privacy also needed attention in a world that provides ubiquitous services. The design and development of the services brings their own set of challenges. It has to be designed such that they can function effectively in various resources and similarly it development needs careful thought. The other challenges such as novelty, desirability, testing and evaluation are also described in this paper","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115020252","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}
Pub Date : 2006-07-01DOI: 10.1109/MOBIQ.2006.340383
Nikos Anerousis, A. Mohindra
An area of unique opportunity for SaaS is the mobile and ubiquitous computing space. The SaaS model has a number of advantages that are uniquely suited to a resource-constrained mobile computing environment. This short paper gives a high level overview of the SaaS which brings significant opportunities in this space and further presents the architectural considerations for SaaS providers and mobile computing environments
{"title":"The Software-as-a-Service Model for Mobile and Ubiquitous Computing Environments","authors":"Nikos Anerousis, A. Mohindra","doi":"10.1109/MOBIQ.2006.340383","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340383","url":null,"abstract":"An area of unique opportunity for SaaS is the mobile and ubiquitous computing space. The SaaS model has a number of advantages that are uniquely suited to a resource-constrained mobile computing environment. This short paper gives a high level overview of the SaaS which brings significant opportunities in this space and further presents the architectural considerations for SaaS providers and mobile computing environments","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123349529","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}
Pub Date : 2006-07-01DOI: 10.1109/mobiq.2006.340446
A. Lo, Weidong Lu, M. Jacobsson, R. V. Prasad, I. Niemegeers
A personal network is an overlay network which builds on different wireless networking technologies. This overlay network is responsible of glueing the different wireless networking technologies. In this paper, we consider the cooperation of two key technologies to realize a personal network, namely, wireless personal area network and universal mobile telecommunications system (UMTS). The co-operation poses a new set of problems as these technologies were not designed to interwork with each other. In this paper, we describe each of these problems and their solutions
{"title":"Personal Networks: An Overlay Network of Wireless Personal Area Networks and 3G Networks","authors":"A. Lo, Weidong Lu, M. Jacobsson, R. V. Prasad, I. Niemegeers","doi":"10.1109/mobiq.2006.340446","DOIUrl":"https://doi.org/10.1109/mobiq.2006.340446","url":null,"abstract":"A personal network is an overlay network which builds on different wireless networking technologies. This overlay network is responsible of glueing the different wireless networking technologies. In this paper, we consider the cooperation of two key technologies to realize a personal network, namely, wireless personal area network and universal mobile telecommunications system (UMTS). The co-operation poses a new set of problems as these technologies were not designed to interwork with each other. In this paper, we describe each of these problems and their solutions","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128099731","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}
Pub Date : 2006-07-01DOI: 10.1109/MOBIQ.2006.340394
Ling Zhou, Arunabha Sen
Tracking mobile targets is an important application of wireless sensor networks. However, mobility of the target brings new challenges to designing energy-efficient and scalable data collection schemes. A novel dynamic grid-based tracking (DGT) scheme for tracking mobile target is proposed in this paper. This scheme is distributed in nature, and can be adaptive to the mobility of the target. The underlying idea of embedding a virtual grid structure and restricting mobility-related choices to grid nodes can be generally applied to other wireless sensor networks applications, where mobility is an important consideration during protocol design
{"title":"Adaptilve Data Collectilon Scheme for Trackilng Mobille Target in Wireless Sensor Networks","authors":"Ling Zhou, Arunabha Sen","doi":"10.1109/MOBIQ.2006.340394","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340394","url":null,"abstract":"Tracking mobile targets is an important application of wireless sensor networks. However, mobility of the target brings new challenges to designing energy-efficient and scalable data collection schemes. A novel dynamic grid-based tracking (DGT) scheme for tracking mobile target is proposed in this paper. This scheme is distributed in nature, and can be adaptive to the mobility of the target. The underlying idea of embedding a virtual grid structure and restricting mobility-related choices to grid nodes can be generally applied to other wireless sensor networks applications, where mobility is an important consideration during protocol design","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133994378","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}
Pub Date : 2006-07-01DOI: 10.1109/MOBIQ.2006.340389
F. Thouin, R. Thommes, M. Coates
Wireless sensor-actuator networks (SANETs), in which nodes perform actions (actuation) in response to sensor measurements and shared information, have great potential in medical and agricultural applications. In this paper, we focus on the problem of using distributed sensed data to design actuation strategies in order to elicit a desired response from the environment, whilst attempting to minimize the communication in the network. Our methodology is based on batch Q-learning; we describe a distributed approach for learning dyadic regression trees to estimate the Q-functions from collected data. Analysis and simulation indicate that substantial communication savings that can be achieved through distributed learning without significant performance deterioration. The simulations also reveal that the performance of our technique depends strongly on the amount of training data available
{"title":"Optimal Actuation Strategies for Sensor/Actuator Networks","authors":"F. Thouin, R. Thommes, M. Coates","doi":"10.1109/MOBIQ.2006.340389","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340389","url":null,"abstract":"Wireless sensor-actuator networks (SANETs), in which nodes perform actions (actuation) in response to sensor measurements and shared information, have great potential in medical and agricultural applications. In this paper, we focus on the problem of using distributed sensed data to design actuation strategies in order to elicit a desired response from the environment, whilst attempting to minimize the communication in the network. Our methodology is based on batch Q-learning; we describe a distributed approach for learning dyadic regression trees to estimate the Q-functions from collected data. Analysis and simulation indicate that substantial communication savings that can be achieved through distributed learning without significant performance deterioration. The simulations also reveal that the performance of our technique depends strongly on the amount of training data available","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121831235","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}
Pub Date : 1900-01-01DOI: 10.1109/mobiqw.2006.361736
Mirco Musolesi, C. Mascolo
Traditional middleware primitives offer very elementary information dissemination mechanisms, which, in the case of a decentralized and dynamic network such as a mobile ad hoc network, do not offer the ability to control the information spreading. Control over information dissemination could instead be very critical especially in terms of lifetime of the network. Gossip-based communication and epidemic-style algorithms, which are based on a store and forward approach, have been proposed to obtain message dissemination with probabilistic guarantees and lower overheads. However, epidemic algorithms have never been used to allow designers to control the spreading of the information depending on the desired reliability and the network structure. In this paper, we present a middleware for ad hoc networking, which uses epidemic-style information dissemination techniques to tune the reliability of the communication in mobile ad hoc networks. The approach is based on recent results of complex networks theory; the novelty of our idea resides in the evaluation and the exploitation of the structure of the underlying network for the automatic tuning of the dissemination process and its use in the design of the API offered by the middleware. We present a detailed analytical model supported by several simulation results
{"title":"Controlled Epidemic-style Dissemination Middleware for Mobile Ad Hoc Networks","authors":"Mirco Musolesi, C. Mascolo","doi":"10.1109/mobiqw.2006.361736","DOIUrl":"https://doi.org/10.1109/mobiqw.2006.361736","url":null,"abstract":"Traditional middleware primitives offer very elementary information dissemination mechanisms, which, in the case of a decentralized and dynamic network such as a mobile ad hoc network, do not offer the ability to control the information spreading. Control over information dissemination could instead be very critical especially in terms of lifetime of the network. Gossip-based communication and epidemic-style algorithms, which are based on a store and forward approach, have been proposed to obtain message dissemination with probabilistic guarantees and lower overheads. However, epidemic algorithms have never been used to allow designers to control the spreading of the information depending on the desired reliability and the network structure. In this paper, we present a middleware for ad hoc networking, which uses epidemic-style information dissemination techniques to tune the reliability of the communication in mobile ad hoc networks. The approach is based on recent results of complex networks theory; the novelty of our idea resides in the evaluation and the exploitation of the structure of the underlying network for the automatic tuning of the dissemination process and its use in the design of the API offered by the middleware. We present a detailed analytical model supported by several simulation results","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121639758","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}
Pub Date : 1900-01-01DOI: 10.1109/MOBIQ.2006.340395
L. Bolotnyy, G. Robins
Recently Ari Juels suggested a "yoking-proof" where a pair of radio-frequency identification (RFID) tags are both read within a specified time bound, and left open for future research the problem of generating a proof for larger groups of tags. We generalize his protocol by developing a proof which ensures that a group of tags is read within a certain time period. The tags generate such a proof even if the reader is untrusted. The proof is improbable to forge, and is verifiable off-line by a trusted verifier. Juels's problem formulation does not take privacy into account and the resulting protocol offers no privacy to the tags. We modify the problem statement to require the "yoking-proof" to maintain privacy, and we give a protocol for this new anonymous yoking problem, along with suggestions for speed ups
{"title":"Generalized \"Yoking-Proofs\" for a Group of RFID Tags","authors":"L. Bolotnyy, G. Robins","doi":"10.1109/MOBIQ.2006.340395","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340395","url":null,"abstract":"Recently Ari Juels suggested a \"yoking-proof\" where a pair of radio-frequency identification (RFID) tags are both read within a specified time bound, and left open for future research the problem of generating a proof for larger groups of tags. We generalize his protocol by developing a proof which ensures that a group of tags is read within a certain time period. The tags generate such a proof even if the reader is untrusted. The proof is improbable to forge, and is verifiable off-line by a trusted verifier. Juels's problem formulation does not take privacy into account and the resulting protocol offers no privacy to the tags. We modify the problem statement to require the \"yoking-proof\" to maintain privacy, and we give a protocol for this new anonymous yoking problem, along with suggestions for speed ups","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127872853","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}
Pub Date : 1900-01-01DOI: 10.1109/MOBIQ.2006.340410
Jinsong Lin, T. Phan, R. Bagrodia
Type-based communication is proposed as an effective paradigm to enable group communication in wireless ad-hoc networks (MANETs). In this paradigm, type is used as the fundamental construct for addressing and routing messages. Type hierarchies are used to dynamically control group size; and object-oriented principles such as subtyping and multiple inheritance are utilized to construct new groups from existing ones. We present the design of TypeCast, a routing protocol that directly supports type-based communication. TypeCast leverages efficiency and mobility management provided by MANET multicast protocols and extends them by adding a Bloom filter-based type encoding and routing mechanism. TypeCast is fully decentralized and supports subtyping and type-composition. We implement TypeCast on top of ODMRP and conduct a detailed performance and scalability study of TypeCast through simulation. The results show that TypeCast demonstrates good resiliency to mobility and group size. When the number of types in the network increases, TypeCast achieves good scalability thanks to type aggregation provided by Bloom filters
{"title":"TypeCast: Type-Based Routing in Wireless Ad-hoc Networks","authors":"Jinsong Lin, T. Phan, R. Bagrodia","doi":"10.1109/MOBIQ.2006.340410","DOIUrl":"https://doi.org/10.1109/MOBIQ.2006.340410","url":null,"abstract":"Type-based communication is proposed as an effective paradigm to enable group communication in wireless ad-hoc networks (MANETs). In this paradigm, type is used as the fundamental construct for addressing and routing messages. Type hierarchies are used to dynamically control group size; and object-oriented principles such as subtyping and multiple inheritance are utilized to construct new groups from existing ones. We present the design of TypeCast, a routing protocol that directly supports type-based communication. TypeCast leverages efficiency and mobility management provided by MANET multicast protocols and extends them by adding a Bloom filter-based type encoding and routing mechanism. TypeCast is fully decentralized and supports subtyping and type-composition. We implement TypeCast on top of ODMRP and conduct a detailed performance and scalability study of TypeCast through simulation. The results show that TypeCast demonstrates good resiliency to mobility and group size. When the number of types in the network increases, TypeCast achieves good scalability thanks to type aggregation provided by Bloom filters","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124270032","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：