PHBLISHED : COMMUNICATIONS AND INFORMATION TECHNOLOGY (ICCIT), 2013 THIRD INTERNATIONAL CONFERENCE ON, ISSUE DATE: 19-21 JUNE 2013 AUTHOR : MERSHAD, K.;

Slides:



Advertisements
Similar presentations
Supporting Cooperative Caching in Disruption Tolerant Networks
Advertisements

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Design and Implementation of the OLSR Protocol in an Ad Hoc Framework Juan Gutiérrez Plaza Supervisor: Raimo Kantola Instructor: José Costa Requena Networking.
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Computer Science Department Stony Brook University.
1 Efficient Retrieval of User Contents in MANETs Marco Fiore, Claudio Casetti, Carla-Fabiana Chiasserini Dipartimento di Elettronica, Politecnico di Torino,
A Study of Mobile IP Kunal Ganguly Wichita State University CS843 – Distributed Computing.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Database caching in MANETs Based on Separation of Queries and Responses Author: Hassan Artail, Haidar Safa, and Samuel Pierre Publisher: Wireless And Mobile.
University1 GVGrid: A QoS Routing Protocol for Vehicular Ad Hoc Networks Weihua Sun, Hirozumi Yamaguchi, Koji Yukimasa, Shinji.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Cellular IP: Proxy Service Reference: “Incorporating proxy services into wide area cellular IP networks”; Zhimei Jiang; Li Fung Chang; Kim, B.J.J.; Leung,
Internet GIS. A vast network connecting computers throughout the world Computers on the Internet are physically connected Computers on the Internet use.
A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks Hui Dai, Richar Han Department of Computer Science University of Colorado at Boulder.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Professor OKAMURA Laboratory. Othman Othman M.M. 1.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.
Cloud-Assisted Gateway Discovery for Vehicular Ad Hoc Networks Yen-Wen Lin, Jie-Min Shen, and Hao-Jun Weng Department of Computer and Information Science,
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
A study of Intelligent Adaptive beaconing approaches on VANET Proposal Presentation Chayanin Thaina Advisor : Dr.Kultida Rojviboonchai.
Distributed Authentication in Wireless Mesh Networks Through Kerberos Tickets draft-moustafa-krb-wg-mesh-nw-00.txt Hassnaa Moustafa
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
INTERNET AND ADHOC SERVICE DISCOVERY BY: NEHA CHAUDHARY.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
1 Data Naming in Vehicle-to-Vehicle Communications HU Yao Goto Lab
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
Thesis Presentation Chayanin Thaina Advisor : Asst.Prof. Dr. Kultida Rojviboonchai.
Kun-chan Lan and Chien-Ming Chou National Cheng Kung University
Video Streaming Transmission Over Multi-channel Multi-path Wireless Mesh Networks Speaker : 吳靖緯 MA0G WiCOM '08. 4th International.
A Receiver-Initiated Approach for Channel-Adaptive On-Demand Routing in Ad Hoc Mobile Computing Networks Xiao-Hui Lin, Yu-Kwong Kwok, and Vincent K. N.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Activity 1 5 minutes to discuss and feedback on the following:
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
On Multihop Communications For In-Vehicle Internet Access Based On a TDMA MAC Protocol Hassan Aboubakr Omar ∗, Weihua Zhuang ∗, and Li Li† ∗ Department.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
A New Recovery Method for Greedy Routing Protocols in High Mobile Vehicular Communications 指導教授:許子衡 教授 學 生:董藝興.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
 Attacks and threats  Security challenge & Solution  Communication Infrastructure  The CA hierarchy  Vehicular Public Key  Certificates.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
SOURCE:2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING AUTHER: MINGLIU LIU, DESHI LI, HAILI MAO SPEAKER: JIAN-MING HONG.
Communication Protocol Engineering Lab. VANET-cloud : a generic cloud computing model for vehicular ad hoc networks IEEE Wireless Communications February.
Hybrid Cloud Architecture for Software-as-a-Service Provider to Achieve Higher Privacy and Decrease Securiity Concerns about Cloud Computing P. Reinhold.
A comparison of Ad-Hoc Routing Protocols
Lei Chen and Wendi B. Heinzelman , University of Rochester
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Presentation transcript:

PHBLISHED : COMMUNICATIONS AND INFORMATION TECHNOLOGY (ICCIT), 2013 THIRD INTERNATIONAL CONFERENCE ON, ISSUE DATE: JUNE 2013 AUTHOR : MERSHAD, K.; ARTAIL, H. SPEAKER: 張任頡 STUDENT NUMBER:MA2G0106 CROWN: Discovering and Consuming Services in Vehicular Clouds

Outline I. INTRODUCTION AND BACKGROUND II. THE CROWN FRAMEWORK III. PERFORMANCE EVALUATIONS IV. CONCLUSION AND FUTURE WORK 1

I. INTRODUCTION AND BACKGROUND (1/4) 1. Vehicular Ad hoc Networks (VANETs) allow vehicles to connect to roadside units (RSUs), which connect with each other via a wired network and with passing by vehicles via wireless communications. 2. It is expected that future vehicles will be equipped with advanced in-vehicle resources such as powerful computing and storage devices, and sensor nodes. 2

I. INTRODUCTION AND BACKGROUND (2/4) 3. In VANETs, Vehicular Clouds are distinctive in that cloud servers are mobile vehicles with capable resources and/or Internet access, whereas consumers are vehicles that desire to rent the resources or gain Internet access. For this, consumers need to discover the mobile cloud servers, know their resources, and communicate and request resources from them. 4. We propose a scheme that uses RSUs as cloud directories to store information about mobile cloud servers, and hence, form a distributed dynamic index of such servers. We refer to the cloud server as “STAR”, and to the whole system as “CROWN”. 3

I. INTRODUCTION AND BACKGROUND (3/4) 5. In this paper, we extend the concept of vehicular clouds by enabling STARs to offer their various resources via the RSU network. To the best of our knowledge, we are the first to define the concept of a STAR that offers its cloud services while it is on the move. Our contributions also include identifying the services that could be offered by a STAR and their attributes. 4

I. INTRODUCTION AND BACKGROUND (4/4) 5

II. THE CROWN FRAMEWORK (1/11) A. Vehicular Cloud Services : 1. Network as a Service or NaaS (Internet access): some smart vehicles will have an Internet connection (e.g., via a cellular network), but others do not. Vehicles with internet access may offer their extra bandwidth to others. 2. Storage as a service or SaaS: some smart vehicles will have high on-board storage capacity, but others may need additional storage. 3. Data as a Service or DaaS: a vehicular user may need specific data, for example, a video or music file. A STAR may define part of its storage capacity as a data cache, and use it to store data that it acquires for consumers. 6

II. THE CROWN FRAMEWORK (2/11) B. Registration of a STAR at its Nearest RSU : 7

II. THE CROWN FRAMEWORK (3/11) 8

II. THE CROWN FRAMEWORK (4/11) a. If the speed of the STAR is v, then the radius of AE will be r E = 1.3×v×(t 2 -t 1 ), considering a 30% error factor. The area AE will be used by the RSU to define to consumers the estimated location of the STAR. b. As a STAR rents out its resources, its attributes change. In such cases, the STAR adds the new values of its attributes to the next beacon that it sends to its nearest RSU R 1, which in turn updates these values in its cache and forwards the data to other RSUs in A I. An RSU that stops receiving beacons from a STAR for a given time (e.g., 10 sec) deletes the STAR’s RD. 9

II. THE CROWN FRAMEWORK (5/11) C. Requesting to Rent the STAR Resources : 10

II. THE CROWN FRAMEWORK (6/11) D. Finding STARs that Satisfy a Request : a. In order to know whether the STAR will remain in the VANET for a period of time greater than T a, the RSU adds T a to current time and checks whether the result is less than T l. The total conditions the STAR should satisfy is: Condition Naas = ( BW STAR > BW user ) AND ( D a-STAR < D a-user ) AND ( C a-STAR < C a-user ) AND ( Distance STAR-STAR < Distance to-STAR ) AND ( T current < T a + T l ) 11

II. THE CROWN FRAMEWORK (7/11) b. The total condition that the STAR should satisfy to meet the user storage requirement is : Condition Saas = ( S m-STAR > S m-user ) AND ( T t-STAR < T t-user ) AND ( C s-STAR < C s-user ) AND ( P s ≥ Th Ps ) c. The condition that a STAR must satisfy to fulfill a data request is: Condition Daas = ( DT user ⊆ DT user ) AND ( D c-STAR > D c-user ) AND ( C d-STAR < C d-user ) 12

II. THE CROWN FRAMEWORK (7/11) 13

II. THE CROWN FRAMEWORK (9/11) E. RSU Reply to a User : Once the RSU chooses suitable STAR(s) from L c (based on the value(s) of R e ), the RSU sends a reply that contains the following for each STAR chosen by the RSU: ID of the STAR Last location of the STAR’s (from its last beacon) Last estimated area A E of the STAR (center, radius) The resources and attributes offered by the STAR 14

II. THE CROWN FRAMEWORK (10/11) 15

II. THE CROWN FRAMEWORK (11/11) F. Consuming the STAR’s resources : After a user chooses one or more STARs, he specifies the required resources from each STAR. He then formulates a service packet for each chosen STAR and sends it using the routing protocol. The service packet contains the user credentials and his request. In CROWN, we focus on finding a way to discover and choose the best STARs for consuming services. It should beemphasized that the connection between a user and a STAR should be tightly secured via a mobile security system that insures the privacy and integrity of users and the confidentiality and correctness of data. 16

III. PERFORMANCE EVALUATIONS (1/7) · CROWN was implemented using ns2 software (with p and the Nakagami model). We used SUMO [7] to generate the node movement file that was inputted to ns2. · The map used to generate the movement file has a size of 9×9 Km 2. · The default number of vehicles was set to 300 · minimum and maximum speeds were set to 15 and 30 m/s · Ten RSUs were deployed uniformly to nearly balance their loads. 17

III. PERFORMANCE EVALUATIONS (2/7) 18

III. PERFORMANCE EVALUATIONS (3/7) 1. Compared Protocol and Comparison Parameters : a. We compared CROWN with a cloud service discovery protocol in which the various operations of CROWN were replaced by broadcasting. We call this protocol Broadcast-CROWN (B-CROWN) b. where a STAR registers its services by broadcasting to its neighbors a registration packet with a TTL equal to 10. Each neighbor caches the registration data, decrease the TTL by 1, and rebroadcast the packet to its neighbors. 19

III. PERFORMANCE EVALUATIONS (4/7) c. When a vehicle S needs a certain service, it searches its cache for appropriate STARs. If it finds one, it sends a service packet to it; else, S broadcasts a request packet with a reqID and a TTL set to 5. d. Each vehicle V I that receives a request packet searches its cache for STARs that can execute the request. If it finds, it unicasts a reply to S, provided it has not forwarded a reply packet to S with the same reqID (i.e., it did not detect another vehicle replying before it). 20

III. PERFORMANCE EVALUATIONS (5/7) e. If V I does not find such STARs, it decreases the TTL and then rebroadcasts the request to its neighbors, if the TTL is greater than 0 and if it did not forward a reply to S. When S receives one or more replies, it chooses the best suitable STARs. f. The metrics used for evaluating the two protocols are the: · Service Discovery Delay (D SD ): time between sending a request and receiving the reply packet. · Service Consuming Delay (D SC ): time between sending a service packet and exchanging the first data packet. · Percentage of Hits (P H ): percentage of requests to which a reply is received. · Vehicle Traffic (T V ): includes forwarded traffic. 21

III. PERFORMANCE EVALUATIONS (6/7) 3. Results and Discussions : 22

III. PERFORMANCE EVALUATIONS (7/7) 23

IV. CONCLUSION AND FUTURE WORK (1/1) 1. This paper presented a cloud service discovery protocol for VANETs, where STARs were introduced as mobile cloud servers that offer services to other vehicles. 2. We described how the network of RSUs can be exploited to ease the operation of discovering the best candidate STAR by the user. 3. The results of CROWN were compared to a broadcasting-based protocol and results of some parameters were calculated and discussed. 4. For future work, our main activity will focus on studying the required security strategies for the system. 24

Thanks for your listening ~ 25