Loading…

Position verification for vehicular networks via analyzing two-hop neighbors information

Vehicular networks will enable vehicles on the road to utilize wireless communication to exchange safety information; enhancing traffic flow and minimizing accidents. With vehicle positions being the most frequently exchanged information in vehicular networks; it becomes imperative to establish a st...

Full description

Saved in:
Bibliographic Details
Main Authors: Abu-Elkheir, Mervat, Hamid, Sherin Abdel, Hassanein, Hossam S., Elhenawy, Ibrahim M., Elmougy, Samir
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 812
container_issue
container_start_page 805
container_title
container_volume
creator Abu-Elkheir, Mervat
Hamid, Sherin Abdel
Hassanein, Hossam S.
Elhenawy, Ibrahim M.
Elmougy, Samir
description Vehicular networks will enable vehicles on the road to utilize wireless communication to exchange safety information; enhancing traffic flow and minimizing accidents. With vehicle positions being the most frequently exchanged information in vehicular networks; it becomes imperative to establish a strong level of trust in the announced positions before a vehicle may take action in response. This paper proposes a position verification scheme that involves the collaborative exchange of one-hop neighbor information in order to help a vehicle make better judgments of position announcements. Vehicles can assess neighborhood connectivity and use the logical traffic flow to form a verdict on trusting a position announcement, thus enabling the detection of possible position falsifications. The scheme analyzes accumulated 2-hop neighbors' information in order to define a plausibility area within which a vehicle should exist in order for its position to be considered "correct". In very sparse traffic scenarios, a vehicle will depend on measuring the consistency of a vehicle's Received Signal Strength (RSS) with its announced position. Performance evaluation was carried out via simulation, and results show that defining this plausibility area yields accurate detection of position falsifications with low false positives.
doi_str_mv 10.1109/LCN.2011.6115555
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6115555</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6115555</ieee_id><sourcerecordid>6115555</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-80f0f236d87f0fe89e0b8230ccebcfe235dcdc6bd24a341914f05672824d0cb53</originalsourceid><addsrcrecordid>eNo1UMtOwzAQNAIkSskdiUt-IMFrO34cUcRLioADSNwqx7EbQ5pUdikqX49VylxmZ0Y7h0HoEnAJgNV1Uz-VBAOUHKBKOEKZEhI4EMkUkeIYnf8LDidohgUjBVBMz1AW4wdO4FxJxWfo_WWKfuOnMd_a4J03ei_cFJLRe_M16JCPdvM9hc-Yb73O9aiH3Y8fl3kyi35ap9gv-3YKMfdjelztKy7QqdNDtNmB5-jt7va1fiia5_vH-qYpPIhqU0jssCOUd1Kkw0plcSsJxcbY1jhLaNWZzvC2I0xTBgqYwxUXRBLWYdNWdI6u_nq9tXaxDn6lw25xGIb-Amm7Vok</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Position verification for vehicular networks via analyzing two-hop neighbors information</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Abu-Elkheir, Mervat ; Hamid, Sherin Abdel ; Hassanein, Hossam S. ; Elhenawy, Ibrahim M. ; Elmougy, Samir</creator><creatorcontrib>Abu-Elkheir, Mervat ; Hamid, Sherin Abdel ; Hassanein, Hossam S. ; Elhenawy, Ibrahim M. ; Elmougy, Samir</creatorcontrib><description>Vehicular networks will enable vehicles on the road to utilize wireless communication to exchange safety information; enhancing traffic flow and minimizing accidents. With vehicle positions being the most frequently exchanged information in vehicular networks; it becomes imperative to establish a strong level of trust in the announced positions before a vehicle may take action in response. This paper proposes a position verification scheme that involves the collaborative exchange of one-hop neighbor information in order to help a vehicle make better judgments of position announcements. Vehicles can assess neighborhood connectivity and use the logical traffic flow to form a verdict on trusting a position announcement, thus enabling the detection of possible position falsifications. The scheme analyzes accumulated 2-hop neighbors' information in order to define a plausibility area within which a vehicle should exist in order for its position to be considered "correct". In very sparse traffic scenarios, a vehicle will depend on measuring the consistency of a vehicle's Received Signal Strength (RSS) with its announced position. Performance evaluation was carried out via simulation, and results show that defining this plausibility area yields accurate detection of position falsifications with low false positives.</description><identifier>ISSN: 0742-1303</identifier><identifier>ISBN: 1612849261</identifier><identifier>ISBN: 9781612849263</identifier><identifier>EISBN: 9781612849287</identifier><identifier>EISBN: 9781612849270</identifier><identifier>EISBN: 161284927X</identifier><identifier>EISBN: 1612849288</identifier><identifier>DOI: 10.1109/LCN.2011.6115555</identifier><language>eng</language><publisher>IEEE</publisher><subject>Measurement uncertainty ; position ; Position measurement ; Receivers ; Roads ; security ; Sensors ; Topology ; VANETs ; Vehicles ; vehicular networks ; verification</subject><ispartof>2011 IEEE 36th Conference on Local Computer Networks, 2011, p.805-812</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6115555$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6115555$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Abu-Elkheir, Mervat</creatorcontrib><creatorcontrib>Hamid, Sherin Abdel</creatorcontrib><creatorcontrib>Hassanein, Hossam S.</creatorcontrib><creatorcontrib>Elhenawy, Ibrahim M.</creatorcontrib><creatorcontrib>Elmougy, Samir</creatorcontrib><title>Position verification for vehicular networks via analyzing two-hop neighbors information</title><title>2011 IEEE 36th Conference on Local Computer Networks</title><addtitle>LCN</addtitle><description>Vehicular networks will enable vehicles on the road to utilize wireless communication to exchange safety information; enhancing traffic flow and minimizing accidents. With vehicle positions being the most frequently exchanged information in vehicular networks; it becomes imperative to establish a strong level of trust in the announced positions before a vehicle may take action in response. This paper proposes a position verification scheme that involves the collaborative exchange of one-hop neighbor information in order to help a vehicle make better judgments of position announcements. Vehicles can assess neighborhood connectivity and use the logical traffic flow to form a verdict on trusting a position announcement, thus enabling the detection of possible position falsifications. The scheme analyzes accumulated 2-hop neighbors' information in order to define a plausibility area within which a vehicle should exist in order for its position to be considered "correct". In very sparse traffic scenarios, a vehicle will depend on measuring the consistency of a vehicle's Received Signal Strength (RSS) with its announced position. Performance evaluation was carried out via simulation, and results show that defining this plausibility area yields accurate detection of position falsifications with low false positives.</description><subject>Measurement uncertainty</subject><subject>position</subject><subject>Position measurement</subject><subject>Receivers</subject><subject>Roads</subject><subject>security</subject><subject>Sensors</subject><subject>Topology</subject><subject>VANETs</subject><subject>Vehicles</subject><subject>vehicular networks</subject><subject>verification</subject><issn>0742-1303</issn><isbn>1612849261</isbn><isbn>9781612849263</isbn><isbn>9781612849287</isbn><isbn>9781612849270</isbn><isbn>161284927X</isbn><isbn>1612849288</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1UMtOwzAQNAIkSskdiUt-IMFrO34cUcRLioADSNwqx7EbQ5pUdikqX49VylxmZ0Y7h0HoEnAJgNV1Uz-VBAOUHKBKOEKZEhI4EMkUkeIYnf8LDidohgUjBVBMz1AW4wdO4FxJxWfo_WWKfuOnMd_a4J03ei_cFJLRe_M16JCPdvM9hc-Yb73O9aiH3Y8fl3kyi35ap9gv-3YKMfdjelztKy7QqdNDtNmB5-jt7va1fiia5_vH-qYpPIhqU0jssCOUd1Kkw0plcSsJxcbY1jhLaNWZzvC2I0xTBgqYwxUXRBLWYdNWdI6u_nq9tXaxDn6lw25xGIb-Amm7Vok</recordid><startdate>201110</startdate><enddate>201110</enddate><creator>Abu-Elkheir, Mervat</creator><creator>Hamid, Sherin Abdel</creator><creator>Hassanein, Hossam S.</creator><creator>Elhenawy, Ibrahim M.</creator><creator>Elmougy, Samir</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201110</creationdate><title>Position verification for vehicular networks via analyzing two-hop neighbors information</title><author>Abu-Elkheir, Mervat ; Hamid, Sherin Abdel ; Hassanein, Hossam S. ; Elhenawy, Ibrahim M. ; Elmougy, Samir</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-80f0f236d87f0fe89e0b8230ccebcfe235dcdc6bd24a341914f05672824d0cb53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Measurement uncertainty</topic><topic>position</topic><topic>Position measurement</topic><topic>Receivers</topic><topic>Roads</topic><topic>security</topic><topic>Sensors</topic><topic>Topology</topic><topic>VANETs</topic><topic>Vehicles</topic><topic>vehicular networks</topic><topic>verification</topic><toplevel>online_resources</toplevel><creatorcontrib>Abu-Elkheir, Mervat</creatorcontrib><creatorcontrib>Hamid, Sherin Abdel</creatorcontrib><creatorcontrib>Hassanein, Hossam S.</creatorcontrib><creatorcontrib>Elhenawy, Ibrahim M.</creatorcontrib><creatorcontrib>Elmougy, Samir</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Abu-Elkheir, Mervat</au><au>Hamid, Sherin Abdel</au><au>Hassanein, Hossam S.</au><au>Elhenawy, Ibrahim M.</au><au>Elmougy, Samir</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Position verification for vehicular networks via analyzing two-hop neighbors information</atitle><btitle>2011 IEEE 36th Conference on Local Computer Networks</btitle><stitle>LCN</stitle><date>2011-10</date><risdate>2011</risdate><spage>805</spage><epage>812</epage><pages>805-812</pages><issn>0742-1303</issn><isbn>1612849261</isbn><isbn>9781612849263</isbn><eisbn>9781612849287</eisbn><eisbn>9781612849270</eisbn><eisbn>161284927X</eisbn><eisbn>1612849288</eisbn><abstract>Vehicular networks will enable vehicles on the road to utilize wireless communication to exchange safety information; enhancing traffic flow and minimizing accidents. With vehicle positions being the most frequently exchanged information in vehicular networks; it becomes imperative to establish a strong level of trust in the announced positions before a vehicle may take action in response. This paper proposes a position verification scheme that involves the collaborative exchange of one-hop neighbor information in order to help a vehicle make better judgments of position announcements. Vehicles can assess neighborhood connectivity and use the logical traffic flow to form a verdict on trusting a position announcement, thus enabling the detection of possible position falsifications. The scheme analyzes accumulated 2-hop neighbors' information in order to define a plausibility area within which a vehicle should exist in order for its position to be considered "correct". In very sparse traffic scenarios, a vehicle will depend on measuring the consistency of a vehicle's Received Signal Strength (RSS) with its announced position. Performance evaluation was carried out via simulation, and results show that defining this plausibility area yields accurate detection of position falsifications with low false positives.</abstract><pub>IEEE</pub><doi>10.1109/LCN.2011.6115555</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0742-1303
ispartof 2011 IEEE 36th Conference on Local Computer Networks, 2011, p.805-812
issn 0742-1303
language eng
recordid cdi_ieee_primary_6115555
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Measurement uncertainty
position
Position measurement
Receivers
Roads
security
Sensors
Topology
VANETs
Vehicles
vehicular networks
verification
title Position verification for vehicular networks via analyzing two-hop neighbors information
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T05%3A33%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Position%20verification%20for%20vehicular%20networks%20via%20analyzing%20two-hop%20neighbors%20information&rft.btitle=2011%20IEEE%2036th%20Conference%20on%20Local%20Computer%20Networks&rft.au=Abu-Elkheir,%20Mervat&rft.date=2011-10&rft.spage=805&rft.epage=812&rft.pages=805-812&rft.issn=0742-1303&rft.isbn=1612849261&rft.isbn_list=9781612849263&rft_id=info:doi/10.1109/LCN.2011.6115555&rft.eisbn=9781612849287&rft.eisbn_list=9781612849270&rft.eisbn_list=161284927X&rft.eisbn_list=1612849288&rft_dat=%3Cieee_6IE%3E6115555%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-80f0f236d87f0fe89e0b8230ccebcfe235dcdc6bd24a341914f05672824d0cb53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6115555&rfr_iscdi=true