Multiple k-hop clusters based routing scheme to preserve source-location privacy in WSNs

Privacy is becoming one of the most notable challenges threatening wireless sensor networks (WSNs). Adversaries may use RF (radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor’s location. A multiple k -hop clusters based routing strategy (MHCR) is proposed...

Full description

Saved in:
Bibliographic Details
Published inJournal of Central South University Vol. 21; no. 8; pp. 3155 - 3168
Main Authors Ren, Ju, Zhang, Yao-xue, Liu, Kang
Format Journal Article
LanguageEnglish
Published Heidelberg Central South University 01.08.2014
Subjects
Online AccessGet full text
ISSN2095-2899
2227-5223
DOI10.1007/s11771-014-2287-7

Cover

Abstract Privacy is becoming one of the most notable challenges threatening wireless sensor networks (WSNs). Adversaries may use RF (radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor’s location. A multiple k -hop clusters based routing strategy (MHCR) is proposed to preserve source-location privacy as well as enhance energy efficiency for WSNs. Owing to the inherent characteristics of intra-cluster data aggregation, each sensor of the interference clusters is able to act as a fake source to confuse the adversary. Moreover, dummy traffic could be filtered efficiently by the cluster heads during the data aggregation, ensuring no energy consumption be burdened in the hotspot of the network. Through careful analysis and calculation on the distribution and the number of interference clusters, energy efficiency is significantly enhanced without reducing the network lifetime. Finally, the security and delay performance of MHCR scheme are theoretically analyzed. Extensive analysis and simulation results demonstrate that MHCR scheme can improve both the location privacy security and energy efficiency markedly, especially in large-scale WSNs.
AbstractList Privacy is becoming one of the most notable challenges threatening wireless sensor networks (WSNs). Adversaries may use RF (radio frequency) localization techniques to perform hop-by-hop trace back to the source sensor’s location. A multiple k -hop clusters based routing strategy (MHCR) is proposed to preserve source-location privacy as well as enhance energy efficiency for WSNs. Owing to the inherent characteristics of intra-cluster data aggregation, each sensor of the interference clusters is able to act as a fake source to confuse the adversary. Moreover, dummy traffic could be filtered efficiently by the cluster heads during the data aggregation, ensuring no energy consumption be burdened in the hotspot of the network. Through careful analysis and calculation on the distribution and the number of interference clusters, energy efficiency is significantly enhanced without reducing the network lifetime. Finally, the security and delay performance of MHCR scheme are theoretically analyzed. Extensive analysis and simulation results demonstrate that MHCR scheme can improve both the location privacy security and energy efficiency markedly, especially in large-scale WSNs.
Author Ren, Ju
Zhang, Yao-xue
Liu, Kang
Author_xml – sequence: 1
  givenname: Ju
  surname: Ren
  fullname: Ren, Ju
  email: ren_ju@csu.edu.cn
  organization: School of Information Science and Engineering, Central South University
– sequence: 2
  givenname: Yao-xue
  surname: Zhang
  fullname: Zhang, Yao-xue
  organization: School of Information Science and Engineering, Central South University
– sequence: 3
  givenname: Kang
  surname: Liu
  fullname: Liu, Kang
  organization: School of Information Science and Engineering, Central South University
BookMark eNp9kMtOwzAQRS1UJErpB7DzDxj8SOJkiSpeUoEFINhZjjNpDWlc2U6l_j0uYcWiqxlp5ozmnnM06V0PCF0yesUoldeBMSkZoSwjnJeSyBM05ZxLknMuJqmnVU54WVVnaB6CralgvBBFVUzR59PQRbvtAH-Ttdti0w0hgg-41gEa7N0Qbb_CwaxhAzg6vPUQwO8ABzd4A6RzRkfr-jSwO2322Pb44_U5XKDTVncB5n91ht7vbt8WD2T5cv-4uFkSI3IWiWgqmldGZEYCK4wUTGe0LXlpOK1lerltsiJnZUWNkVyXbUPLjGe1rAtoWqHFDMnxrvEuBA-tMjb-fhS9tp1iVB0cqdGRSo7UwZGSiWT_yBRho_3-KMNHJqTdfgVefSUNfQp4BPoBzR174Q
CitedBy_id crossref_primary_10_1016_j_comcom_2015_01_022
crossref_primary_10_1155_2018_9469106
crossref_primary_10_1109_ACCESS_2023_3244138
crossref_primary_10_1109_TWC_2016_2517618
crossref_primary_10_1016_j_jnca_2018_10_008
Cites_doi 10.1109/TPDS.2011.302
10.1109/TPDS.2011.260
10.1023/A:1023447105713
10.1016/j.comnet.2012.01.023
10.1145/357172.357176
10.1016/j.ins.2012.12.037
10.1007/s11771-012-1389-3
10.1109/LCOMM.2011.010311.101885
10.1007/BF02985694
10.1016/j.csi.2011.01.001
10.1145/1029102.1029117
10.1145/1352533.1352547
ContentType Journal Article
Copyright Central South University Press and Springer-Verlag Berlin Heidelberg 2014
Copyright_xml – notice: Central South University Press and Springer-Verlag Berlin Heidelberg 2014
DBID AAYXX
CITATION
DOI 10.1007/s11771-014-2287-7
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2227-5223
EndPage 3168
ExternalDocumentID 10_1007_s11771_014_2287_7
GroupedDBID -03
-0C
-EM
-SC
-S~
.VR
06D
0R~
29~
2B.
2C0
2J2
2JN
2JY
2KG
2KM
2LR
30V
4.4
406
408
40E
5VR
5VS
8UJ
92H
92I
92M
92R
93N
95-
95.
95~
96X
9D9
9DC
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAXDM
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABDZT
ABECU
ABFTV
ABHQN
ABJNI
ABJOX
ABKCH
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACPIV
ACSNA
ACZOJ
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFLOW
AFQWF
AFUIB
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AOCGG
ARCEE
ARMRJ
AXYYD
B-.
BA0
BDATZ
BGNMA
CAJEC
CCEZO
CEKLB
CHBEP
CSCUP
DDRTE
DNIVK
DPUIP
EBLON
EBS
EIOEI
EJD
ESBYG
FA0
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
HF~
HG6
HMJXF
HRMNR
IKXTQ
IWAJR
IXD
I~Z
J-C
JBSCW
JUIAU
JZLTJ
KOV
LLZTM
M4Y
MA-
NPVJJ
NQJWS
NU0
O9J
PF0
PT4
Q--
Q-2
R-C
R89
ROL
RPX
RSV
RT3
S16
S3B
SAP
SCL
SCLPG
SDH
SEG
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T8S
TCJ
TGT
TSG
TUC
U1F
U1G
U2A
U5C
U5M
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W48
YLTOR
Z7R
Z7V
Z7X
Z7Y
Z7Z
Z81
Z83
Z85
Z88
ZMTXR
~A9
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ACSTC
AEZWR
AFDZB
AFHIU
AFOHR
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
ID FETCH-LOGICAL-c351t-3d9059c34c7e16c731a40f828c20b7899fd4651890cc72a8fd08424b7b6edf3a3
IEDL.DBID AGYKE
ISSN 2095-2899
IngestDate Tue Jul 01 03:32:55 EDT 2025
Thu Apr 24 23:07:08 EDT 2025
Fri Feb 21 02:35:00 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 8
Keywords circular routing
hop cluster
source-location privacy
wireless sensor networks
energy efficiency
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c351t-3d9059c34c7e16c731a40f828c20b7899fd4651890cc72a8fd08424b7b6edf3a3
PageCount 14
ParticipantIDs crossref_citationtrail_10_1007_s11771_014_2287_7
crossref_primary_10_1007_s11771_014_2287_7
springer_journals_10_1007_s11771_014_2287_7
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2014-08-01
PublicationDateYYYYMMDD 2014-08-01
PublicationDate_xml – month: 08
  year: 2014
  text: 2014-08-01
  day: 01
PublicationDecade 2010
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationSubtitle Science & Technology of Mining and Metallurgy
PublicationTitle Journal of Central South University
PublicationTitleAbbrev J. Cent. South Univ
PublicationYear 2014
Publisher Central South University
Publisher_xml – name: Central South University
References Li, Ren, Wu (CR14) 2012; 23
Trappe, Washington, Anshel, Boklan (CR15) 2007; 29
Kamat, Zhang, Trappe, Ozturk (CR3) 2005
Liu, Wang, Zhang (CR2) 2012; 19
Bicakci, Gultekin, Tavli, Bagci (CR11) 2011; 33
Liu, Ren, Li, Chen, Shen (CR16) 2012; 56
Liu, Ren, Xu, Zeng, Caen (CR7) 2012; 23
Lamport, Shostak, Pease (CR19) 1982; 4
Bicakci, Bagci, Tavli (CR10) 2011; 15
Li, Ren (CR13) 2009
Mahmoud, Shen (CR4) 2012; 23
Mehta, Liu, Wright (CR1) 2007
Li, Ren (CR6) 2010
Liu, Jin, Cui, Chen (CR9) 2013; 230
Angione, Bellavista, Corradi, Magistretti (CR18) 2006
Yang, Shao, Zhu, Urgaokar, Cao (CR5) 2008
Ozturk, Zhang, Trappe (CR12) 2004; 25
Ju, Yao-xue, Kang (CR8) 2013
Nocetti, Gonzalez, Stojmenovic (CR17) 2003; 22
A Liu (2287_CR16) 2012; 56
L Lamport (2287_CR19) 1982; 4
Y Li (2287_CR6) 2010
Z X Liu (2287_CR2) 2012; 19
Y Li (2287_CR13) 2009
P Kamat (2287_CR3) 2005
K Bicakci (2287_CR11) 2011; 33
K Mehta (2287_CR1) 2007
A F Liu (2287_CR7) 2012; 23
M M Mahmoud (2287_CR4) 2012; 23
A Liu (2287_CR9) 2013; 230
K Bicakci (2287_CR10) 2011; 15
C Ozturk (2287_CR12) 2004; 25
Y Li (2287_CR14) 2012; 23
Y Yang (2287_CR5) 2008
R Ju (2287_CR8) 2013
W Trappe (2287_CR15) 2007; 29
G Angione (2287_CR18) 2006
F G Nocetti (2287_CR17) 2003; 22
References_xml – volume: 23
  start-page: 1805
  issue: 10
  year: 2012
  end-page: 1818
  ident: CR4
  article-title: A cloud-based scheme for protecting source-location privacy against hotspot-locating attack in wireless sensor networks [J]
  publication-title: IEEE Transactions on Parallel and Distributed Systems
  doi: 10.1109/TPDS.2011.302
– volume: 23
  start-page: 1302
  issue: 7
  year: 2012
  end-page: 1311
  ident: CR14
  article-title: Quantitative measurement and design of source-location privacy schemes for wireless sensor networks [J]
  publication-title: IEEE Transactions on Parallel and Distributed Systems
  doi: 10.1109/TPDS.2011.260
– volume: 22
  start-page: 205
  issue: 1/2/3/4
  year: 2003
  end-page: 220
  ident: CR17
  article-title: Connectivity based -hop clustering in wireless networks [J]
  publication-title: Telecommunication systems
  doi: 10.1023/A:1023447105713
– start-page: 314
  year: 2007
  end-page: 323
  ident: CR1
  article-title: Location privacy in sensor networks against a global eavesdropper [C]
  publication-title: IEEE International Conference on Network Protocols
– start-page: 599
  year: 2005
  end-page: 608
  ident: CR3
  article-title: Enhancing source-location privacy in sensor network routing [C]
  publication-title: IEEE International Conference on Distributed Computing Systems
– start-page: 1
  year: 2009
  end-page: 9
  ident: CR13
  article-title: Preserving source-location privacy in wireless sensor networks [C]
  publication-title: IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, ROME: IEEE
– volume: 56
  start-page: 1951
  issue: 7
  year: 2012
  end-page: 1967
  ident: CR16
  article-title: Design principles and improvement of cost function based energy aware routing algorithms for wireless sensor networks [J]
  publication-title: Computer Networks
  doi: 10.1016/j.comnet.2012.01.023
– volume: 23
  start-page: 2438
  issue: 9
  year: 2012
  end-page: 2448
  ident: CR7
  article-title: Analysis and avoidance of energy hole problem in heterogeneous wireless sensor networks [J]
  publication-title: Ruanjian Xuebao/Journal of Software
– start-page: 1
  year: 2010
  end-page: 9
  ident: CR6
  article-title: Source-location privacy through dynamic routing in wireless sensor networks [C]
  publication-title: IEEE International Conference on Communications
– volume: 4
  start-page: 382
  issue: 3
  year: 1982
  end-page: 401
  ident: CR19
  article-title: The Byzantine generals problem [J]
  publication-title: ACM Transactions on Programming Languages and Systems
  doi: 10.1145/357172.357176
– volume: 230
  start-page: 197
  year: 2013
  end-page: 226
  ident: CR9
  article-title: Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network [J]
  publication-title: Information Sciences
  doi: 10.1016/j.ins.2012.12.037
– start-page: 77
  year: 2008
  end-page: 88
  ident: CR5
  article-title: Towards event source unobservability with minimum network traffic in sensor networks [C]
  publication-title: ACM Conference on Wireless Network Security
– volume: 19
  start-page: 3147
  year: 2012
  end-page: 3153
  ident: CR2
  article-title: A neighbor information based false data filtering scheme in wireless sensor networks [J]
  publication-title: Journal of Central South University
  doi: 10.1007/s11771-012-1389-3
– start-page: 1
  year: 2013
  end-page: 9
  ident: CR8
  article-title: An energy-efficient cyclic diversionary routing strategy against global eavesdroppers in wireless sensor networks [J]
  publication-title: International Journal of Distributed Sensor Networks
– volume: 15
  start-page: 205
  issue: 2
  year: 2011
  end-page: 207
  ident: CR10
  article-title: Lifetime bounds of wireless sensor networks preserving perfect sink unobservability [J]
  publication-title: IEEE Communications Letters
  doi: 10.1109/LCOMM.2011.010311.101885
– volume: 29
  start-page: 66
  issue: 3
  year: 2007
  end-page: 69
  ident: CR15
  article-title: Introduction to Cryptography with coding theory [J]
  publication-title: The Mathematical Intelligencer
  doi: 10.1007/BF02985694
– start-page: 10
  year: 2006
  end-page: 10
  ident: CR18
  article-title: A -hop clustering protocol for dense mobile ad-hoc networks [C]
  publication-title: IEEE International Conference on Distributed Computing Systems Workshops
– volume: 33
  start-page: 401
  issue: 4
  year: 2011
  end-page: 410
  ident: CR11
  article-title: Maximizing lifetime of event-unobservable wireless sensor networks [J]
  publication-title: Computer Standards & Interfaces
  doi: 10.1016/j.csi.2011.01.001
– volume: 25
  start-page: 88
  year: 2004
  end-page: 93
  ident: CR12
  article-title: Source location privacy in energy-constrained sensor network routing [C]
  publication-title: ACM Workshop on Security of Ad Hoc and Sensor Networks
– start-page: 314
  volume-title: IEEE International Conference on Network Protocols
  year: 2007
  ident: 2287_CR1
– volume: 230
  start-page: 197
  year: 2013
  ident: 2287_CR9
  publication-title: Information Sciences
  doi: 10.1016/j.ins.2012.12.037
– volume: 29
  start-page: 66
  issue: 3
  year: 2007
  ident: 2287_CR15
  publication-title: The Mathematical Intelligencer
  doi: 10.1007/BF02985694
– volume: 22
  start-page: 205
  issue: 1/2/3/4
  year: 2003
  ident: 2287_CR17
  publication-title: Telecommunication systems
  doi: 10.1023/A:1023447105713
– start-page: 10
  volume-title: IEEE International Conference on Distributed Computing Systems Workshops
  year: 2006
  ident: 2287_CR18
– volume: 33
  start-page: 401
  issue: 4
  year: 2011
  ident: 2287_CR11
  publication-title: Computer Standards & Interfaces
  doi: 10.1016/j.csi.2011.01.001
– volume: 4
  start-page: 382
  issue: 3
  year: 1982
  ident: 2287_CR19
  publication-title: ACM Transactions on Programming Languages and Systems
  doi: 10.1145/357172.357176
– volume: 23
  start-page: 2438
  issue: 9
  year: 2012
  ident: 2287_CR7
  publication-title: Ruanjian Xuebao/Journal of Software
– volume: 25
  start-page: 88
  year: 2004
  ident: 2287_CR12
  publication-title: ACM Workshop on Security of Ad Hoc and Sensor Networks
  doi: 10.1145/1029102.1029117
– volume: 19
  start-page: 3147
  year: 2012
  ident: 2287_CR2
  publication-title: Journal of Central South University
  doi: 10.1007/s11771-012-1389-3
– start-page: 77
  volume-title: ACM Conference on Wireless Network Security
  year: 2008
  ident: 2287_CR5
  doi: 10.1145/1352533.1352547
– start-page: 1
  volume-title: IEEE International Conference on Communications
  year: 2010
  ident: 2287_CR6
– volume: 15
  start-page: 205
  issue: 2
  year: 2011
  ident: 2287_CR10
  publication-title: IEEE Communications Letters
  doi: 10.1109/LCOMM.2011.010311.101885
– start-page: 1
  volume-title: IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, ROME: IEEE
  year: 2009
  ident: 2287_CR13
– volume: 23
  start-page: 1805
  issue: 10
  year: 2012
  ident: 2287_CR4
  publication-title: IEEE Transactions on Parallel and Distributed Systems
  doi: 10.1109/TPDS.2011.302
– volume: 23
  start-page: 1302
  issue: 7
  year: 2012
  ident: 2287_CR14
  publication-title: IEEE Transactions on Parallel and Distributed Systems
  doi: 10.1109/TPDS.2011.260
– start-page: 599
  volume-title: IEEE International Conference on Distributed Computing Systems
  year: 2005
  ident: 2287_CR3
– start-page: 1
  volume-title: International Journal of Distributed Sensor Networks
  year: 2013
  ident: 2287_CR8
– volume: 56
  start-page: 1951
  issue: 7
  year: 2012
  ident: 2287_CR16
  publication-title: Computer Networks
  doi: 10.1016/j.comnet.2012.01.023
SSID ssib031263696
ssib051367662
ssib026412149
ssib016993150
ssib024508231
ssj0001192107
ssib009883398
ssib016971650
Score 2.0105872
Snippet Privacy is becoming one of the most notable challenges threatening wireless sensor networks (WSNs). Adversaries may use RF (radio frequency) localization...
SourceID crossref
springer
SourceType Enrichment Source
Index Database
Publisher
StartPage 3155
SubjectTerms Engineering
Metallic Materials
Title Multiple k-hop clusters based routing scheme to preserve source-location privacy in WSNs
URI https://link.springer.com/article/10.1007/s11771-014-2287-7
Volume 21
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS-RAEC50vOhB96H4pg972qWlX-lOjoP4YBe96LCzp5B-BEWdEScj6K-3K5NMdFkXPDbpQPj6UVWpr74C-GaMLr2xjPokjQGKLDgtNHMUtcCDskEqjYXCZ-f6dKB-DpNhU8c9adnubUqyvqm7YjduDIa-ioro5lOzCEsJT7O0B0v9kz-_jubbKMMGul0UwTXKJHXJuzjOJO_GQiXsdTIsughc8C4qkVzoede7OE5qlbNGZa_-lYOaYnVhtogOC8UQps2f_uu731rAt-nX2qodr8Fli8eMzHJzMK3sgXv-Syryg4B9gtXGyyX92bb8DAth9AVWXmkffoXhWUNlJDf0anxP3O0UNRsmBO2qJw_jKRKySQy-w10g1ZggYxfpmWSWb6BohXFXxQfXj4V7Itcj8vvifLIOg-Ojy8NT2rR5oE4mvKLSZ9HHc1I5E7h2RvJCsTJGgk4wayKYpceG7WnGnDOiSEvPUiWUNVYHX8pCbkBvNB6FTSAsuOg_pqIwwShvQxZCxrz1KCKvJVNbwFroc9dooGMrjtu8U29G0PIIWo6g5WYLvs9fuZ8JgPxv8o92KfLmLpi8P3v7Q7N3YFngWtbkw13oVQ_TsBcdosruNwdgHxYHov8CUXP0vA
linkProvider Springer Nature
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9tAEB614dByoPQlXqV76KnVon151z4iBE0LyaVBTU-W92EVAQkiDhL8enYcO4aqrcRx5bVkzT5mPs833wB8MkaX3lhGfZJGgCILTgvNHEUt8KBskEpjofBgqPun6vs4GTd13LOW7d6mJOubuit248Yg9FVUxDCfmuewoiIEZz1Y2f_66_hwuY0ybKDboQiuUSapS97FcSZ5NxYqYQ-TYTFE4IJ3qERyoZdd7-I4qVXOGpW9-lcOaorVhdkiBiwUIUybP_3bdz_2gI_Tr7VXO3oFo9YeCzLL-d68snvu7g-pyCcabB3WmiiX7C-25Wt4FiZvYPWB9uFbGA8aKiM5p7-nV8RdzFGzYUbQr3pyPZ0jIZtE8B0uA6mmBBm7SM8ki3wDRS-Muyo-OLsp3C05m5CfP4azd3B6dDg66NOmzQN1MuEVlT6LMZ6TypnAtTOSF4qVEQk6wayJxiw9NmxPM-acEUVaepYqoayxOvhSFvI99CbTSdgAwoKL8WMqChOM8jZkIWTMW48i8loytQmsNX3uGg10bMVxkXfqzWi0PBotR6PlZhM-L1-5WgiA_G_yl3Yp8uYumP179taTZn-EF_3R4CQ_-TY83oaXAte1JiLuQK-6nocPMTiq7G5zGO4B_bn2sA
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEA4-QPQgPvFtDp6UYF5N2qOoi89F0MW9lTZJcVG7i9sV_Pdmuu1WQQWPoSm002nn-zoz3yB0oLXKrE4psUHoCYpIGEkUNQS0wJ1MnZAKGoVv2-qiI6-6Qbeaczqsq93rlOS4pwFUmvLieGCz46bxjWkNNFgS7iE_0dNo1n-NGTh6h59MHCqCUboNn2AKBJOaNJ5fR4I1ay4D-jUt5sEC46zhJ4JxNZl_59dBqXdW6e2VP3VAXaxs0eYeuhAgM3Um9aer_h4Lvydiy_jWWkKLFTDFJ2NPWkZTLl9BC1_kCldR97aqPsTP5Kk_wOZlBDILQwyh0OK3_ghqqLHny-7V4aKPocgWKirxOEVAIHCCI_gDvffEfOBejh_v28M11GmdP5xekGoyAzEiYAURNvKwzAhptGPKaMESSTNP3gynqfZ3nVmYsR5G1BjNkzCzNJRcpjpVzmYiEetoJu_nbgNh6oyHfCFPtNPSpi5yLqI2taD7rgSVm4jWNopNJVsO0zNe4kZwGcwae7PGYNZYb6LDySmDsWbHX5uPasPH1es7_H331r9276O5u7NWfHPZvt5G8xwefFk6uINmireR2_Vwpkj3Spf9BOWi3iU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multiple+k-hop+clusters+based+routing+scheme+to+preserve+source-location+privacy+in+WSNs&rft.jtitle=Journal+of+Central+South+University&rft.au=Ren%2C+Ju&rft.au=Zhang%2C+Yao-xue&rft.au=Liu%2C+Kang&rft.date=2014-08-01&rft.issn=2095-2899&rft.eissn=2227-5223&rft.volume=21&rft.issue=8&rft.spage=3155&rft.epage=3168&rft_id=info:doi/10.1007%2Fs11771-014-2287-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11771_014_2287_7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2095-2899&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2095-2899&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2095-2899&client=summon