Using camouflaging mobility to protect privacy in mobile ad hoc networks

The open nature of wireless medium has left wireless communications vulnerable to various privacy attacks. Much research work has been proposed to protect the identity anonymity of communicating parties, the anonymity of network routes and the location privacy of the message source and destination....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Security and communication networks 2009-11, Vol.2 (6), p.580-594
Hauptverfasser: Tang, Lei, Hong, Xiaoyan, Vrbsky, Susan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 594
container_issue 6
container_start_page 580
container_title Security and communication networks
container_volume 2
creator Tang, Lei
Hong, Xiaoyan
Vrbsky, Susan
description The open nature of wireless medium has left wireless communications vulnerable to various privacy attacks. Much research work has been proposed to protect the identity anonymity of communicating parties, the anonymity of network routes and the location privacy of the message source and destination. However, with the advent of new radio identification and localization techniques, more advanced privacy attacks are possible. We describe a new privacy attack in which the adversary tries to infer the itineraries of the nodes in the network. To protect itinerary privacy, we design an algorithm, called $\Delta$‐camouflaging mobility algorithm, which changes the original motion segments of a node into $\Delta$‐shaped camouflaging paths. Itinerary privacy, correspondent privacy, and route privacy are closely related so we propose a comprehensive anonymous routing scheme, called MARS, to protect these privacy goals. MARS exploits camouflaging mobility to protect itinerary privacy and uses motion pseudonyms generated from the camouflaging mobility to protect correspondent privacy and route privacy without using cryptography. Our analysis results show that $\Delta$‐camouflaging mobility algorithm is cost‐effective, which can significantly reduce the itinerary exposure probability at a small cost of extra travel distance. Moreover, our network simulation results illustrated that MARS anonymous routing scheme and $\Delta$‐camouflaging mobility algorithm did not reduce network layer performance. Copyright © 2009 John Wiley & Sons, Ltd.
doi_str_mv 10.1002/sec.101
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_901682301</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>896191591</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3961-e6028c628ed88e96477220e39550cdec6aabecdd60a3440164a133a3e475f5883</originalsourceid><addsrcrecordid>eNqFkE9Lw0AQxRdRsFbxK-TmQaL7L5vdo4TaCkUPWgQvy3YzqbFJVrOpNd_eLZHiRTzNG-Y3w5uH0DnBVwRjeu3BBkEO0IgopmJMKD3ca8KP0Yn3bxgLwlM-QrOFL5tVZE3tNkVlVrumdsuyKrs-6lz03roObBdq-WlsH5XNMIbI5NGrs1ED3da1a3-KjgpTeTj7qWO0uJ08ZbN4_jC9y27msWVKkBgEptIKKiGXEpTgaUopBqaSBNscrDBmCTbPBTaMc0wEN4Qxw4CnSZFIycboYrgbnH1swHe6Lr2FqjINuI3XKuxIyjD5l5TBjyKJ-kXa1nnfQqHDu7Vpe02w3oWqQ6hB7MjLgdyGCPq_MP04yQY6HujSd_C1p0271iJlaaKf76f6RQqaMaV0xr4BcR-Ffw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>896191591</pqid></control><display><type>article</type><title>Using camouflaging mobility to protect privacy in mobile ad hoc networks</title><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Tang, Lei ; Hong, Xiaoyan ; Vrbsky, Susan</creator><creatorcontrib>Tang, Lei ; Hong, Xiaoyan ; Vrbsky, Susan</creatorcontrib><description>The open nature of wireless medium has left wireless communications vulnerable to various privacy attacks. Much research work has been proposed to protect the identity anonymity of communicating parties, the anonymity of network routes and the location privacy of the message source and destination. However, with the advent of new radio identification and localization techniques, more advanced privacy attacks are possible. We describe a new privacy attack in which the adversary tries to infer the itineraries of the nodes in the network. To protect itinerary privacy, we design an algorithm, called $\Delta$‐camouflaging mobility algorithm, which changes the original motion segments of a node into $\Delta$‐shaped camouflaging paths. Itinerary privacy, correspondent privacy, and route privacy are closely related so we propose a comprehensive anonymous routing scheme, called MARS, to protect these privacy goals. MARS exploits camouflaging mobility to protect itinerary privacy and uses motion pseudonyms generated from the camouflaging mobility to protect correspondent privacy and route privacy without using cryptography. Our analysis results show that $\Delta$‐camouflaging mobility algorithm is cost‐effective, which can significantly reduce the itinerary exposure probability at a small cost of extra travel distance. Moreover, our network simulation results illustrated that MARS anonymous routing scheme and $\Delta$‐camouflaging mobility algorithm did not reduce network layer performance. Copyright © 2009 John Wiley &amp; Sons, Ltd.</description><identifier>ISSN: 1939-0114</identifier><identifier>ISSN: 1939-0122</identifier><identifier>EISSN: 1939-0122</identifier><identifier>DOI: 10.1002/sec.101</identifier><language>eng</language><publisher>Chichester, UK: John Wiley &amp; Sons, Ltd</publisher><subject>Algorithms ; anonymous routing ; camouflaging mobility ; Computer networks ; correspondent privacy ; Cost analysis ; itinerary privacy ; Mars ; mobile ad-hoc networks ; Networks ; Position (location) ; Privacy ; Routing (telecommunications)</subject><ispartof>Security and communication networks, 2009-11, Vol.2 (6), p.580-594</ispartof><rights>Copyright © 2009 John Wiley &amp; Sons, Ltd.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3961-e6028c628ed88e96477220e39550cdec6aabecdd60a3440164a133a3e475f5883</citedby><cites>FETCH-LOGICAL-c3961-e6028c628ed88e96477220e39550cdec6aabecdd60a3440164a133a3e475f5883</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Tang, Lei</creatorcontrib><creatorcontrib>Hong, Xiaoyan</creatorcontrib><creatorcontrib>Vrbsky, Susan</creatorcontrib><title>Using camouflaging mobility to protect privacy in mobile ad hoc networks</title><title>Security and communication networks</title><addtitle>Security Comm. Networks</addtitle><description>The open nature of wireless medium has left wireless communications vulnerable to various privacy attacks. Much research work has been proposed to protect the identity anonymity of communicating parties, the anonymity of network routes and the location privacy of the message source and destination. However, with the advent of new radio identification and localization techniques, more advanced privacy attacks are possible. We describe a new privacy attack in which the adversary tries to infer the itineraries of the nodes in the network. To protect itinerary privacy, we design an algorithm, called $\Delta$‐camouflaging mobility algorithm, which changes the original motion segments of a node into $\Delta$‐shaped camouflaging paths. Itinerary privacy, correspondent privacy, and route privacy are closely related so we propose a comprehensive anonymous routing scheme, called MARS, to protect these privacy goals. MARS exploits camouflaging mobility to protect itinerary privacy and uses motion pseudonyms generated from the camouflaging mobility to protect correspondent privacy and route privacy without using cryptography. Our analysis results show that $\Delta$‐camouflaging mobility algorithm is cost‐effective, which can significantly reduce the itinerary exposure probability at a small cost of extra travel distance. Moreover, our network simulation results illustrated that MARS anonymous routing scheme and $\Delta$‐camouflaging mobility algorithm did not reduce network layer performance. Copyright © 2009 John Wiley &amp; Sons, Ltd.</description><subject>Algorithms</subject><subject>anonymous routing</subject><subject>camouflaging mobility</subject><subject>Computer networks</subject><subject>correspondent privacy</subject><subject>Cost analysis</subject><subject>itinerary privacy</subject><subject>Mars</subject><subject>mobile ad-hoc networks</subject><subject>Networks</subject><subject>Position (location)</subject><subject>Privacy</subject><subject>Routing (telecommunications)</subject><issn>1939-0114</issn><issn>1939-0122</issn><issn>1939-0122</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNqFkE9Lw0AQxRdRsFbxK-TmQaL7L5vdo4TaCkUPWgQvy3YzqbFJVrOpNd_eLZHiRTzNG-Y3w5uH0DnBVwRjeu3BBkEO0IgopmJMKD3ca8KP0Yn3bxgLwlM-QrOFL5tVZE3tNkVlVrumdsuyKrs-6lz03roObBdq-WlsH5XNMIbI5NGrs1ED3da1a3-KjgpTeTj7qWO0uJ08ZbN4_jC9y27msWVKkBgEptIKKiGXEpTgaUopBqaSBNscrDBmCTbPBTaMc0wEN4Qxw4CnSZFIycboYrgbnH1swHe6Lr2FqjINuI3XKuxIyjD5l5TBjyKJ-kXa1nnfQqHDu7Vpe02w3oWqQ6hB7MjLgdyGCPq_MP04yQY6HujSd_C1p0271iJlaaKf76f6RQqaMaV0xr4BcR-Ffw</recordid><startdate>200911</startdate><enddate>200911</enddate><creator>Tang, Lei</creator><creator>Hong, Xiaoyan</creator><creator>Vrbsky, Susan</creator><general>John Wiley &amp; Sons, Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200911</creationdate><title>Using camouflaging mobility to protect privacy in mobile ad hoc networks</title><author>Tang, Lei ; Hong, Xiaoyan ; Vrbsky, Susan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3961-e6028c628ed88e96477220e39550cdec6aabecdd60a3440164a133a3e475f5883</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>anonymous routing</topic><topic>camouflaging mobility</topic><topic>Computer networks</topic><topic>correspondent privacy</topic><topic>Cost analysis</topic><topic>itinerary privacy</topic><topic>Mars</topic><topic>mobile ad-hoc networks</topic><topic>Networks</topic><topic>Position (location)</topic><topic>Privacy</topic><topic>Routing (telecommunications)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tang, Lei</creatorcontrib><creatorcontrib>Hong, Xiaoyan</creatorcontrib><creatorcontrib>Vrbsky, Susan</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Security and communication networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tang, Lei</au><au>Hong, Xiaoyan</au><au>Vrbsky, Susan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Using camouflaging mobility to protect privacy in mobile ad hoc networks</atitle><jtitle>Security and communication networks</jtitle><addtitle>Security Comm. Networks</addtitle><date>2009-11</date><risdate>2009</risdate><volume>2</volume><issue>6</issue><spage>580</spage><epage>594</epage><pages>580-594</pages><issn>1939-0114</issn><issn>1939-0122</issn><eissn>1939-0122</eissn><abstract>The open nature of wireless medium has left wireless communications vulnerable to various privacy attacks. Much research work has been proposed to protect the identity anonymity of communicating parties, the anonymity of network routes and the location privacy of the message source and destination. However, with the advent of new radio identification and localization techniques, more advanced privacy attacks are possible. We describe a new privacy attack in which the adversary tries to infer the itineraries of the nodes in the network. To protect itinerary privacy, we design an algorithm, called $\Delta$‐camouflaging mobility algorithm, which changes the original motion segments of a node into $\Delta$‐shaped camouflaging paths. Itinerary privacy, correspondent privacy, and route privacy are closely related so we propose a comprehensive anonymous routing scheme, called MARS, to protect these privacy goals. MARS exploits camouflaging mobility to protect itinerary privacy and uses motion pseudonyms generated from the camouflaging mobility to protect correspondent privacy and route privacy without using cryptography. Our analysis results show that $\Delta$‐camouflaging mobility algorithm is cost‐effective, which can significantly reduce the itinerary exposure probability at a small cost of extra travel distance. Moreover, our network simulation results illustrated that MARS anonymous routing scheme and $\Delta$‐camouflaging mobility algorithm did not reduce network layer performance. Copyright © 2009 John Wiley &amp; Sons, Ltd.</abstract><cop>Chichester, UK</cop><pub>John Wiley &amp; Sons, Ltd</pub><doi>10.1002/sec.101</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1939-0114
ispartof Security and communication networks, 2009-11, Vol.2 (6), p.580-594
issn 1939-0114
1939-0122
1939-0122
language eng
recordid cdi_proquest_miscellaneous_901682301
source EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection
subjects Algorithms
anonymous routing
camouflaging mobility
Computer networks
correspondent privacy
Cost analysis
itinerary privacy
Mars
mobile ad-hoc networks
Networks
Position (location)
Privacy
Routing (telecommunications)
title Using camouflaging mobility to protect privacy in mobile ad hoc networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T09%3A06%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Using%20camouflaging%20mobility%20to%20protect%20privacy%20in%20mobile%20ad%20hoc%20networks&rft.jtitle=Security%20and%20communication%20networks&rft.au=Tang,%20Lei&rft.date=2009-11&rft.volume=2&rft.issue=6&rft.spage=580&rft.epage=594&rft.pages=580-594&rft.issn=1939-0114&rft.eissn=1939-0122&rft_id=info:doi/10.1002/sec.101&rft_dat=%3Cproquest_cross%3E896191591%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=896191591&rft_id=info:pmid/&rfr_iscdi=true