TY - GEN
T1 - Communication-efficient anonymous routing protocol for wireless sensor networks using single path tree topology
AU - Nakamura, Shogo
AU - Hori, Yoshiaki
AU - Sakurai, Kouichi
PY - 2012/5/14
Y1 - 2012/5/14
N2 - In recent years, there are anonymous routing protocols for mobile ad-hoc networks. These protocols provide anonymous communication between an arbitrary pair of nodes. However, there are also some multipoint-to-point sensor networks. In those environments, we have to consider all routes not between an arbitrary pair of sensor nodes but between an arbitrary one sender node and a specific destination node. These existing protocols consider to only security, so nodes may not be able to work efficiency in those environments. In this paper, we propose a new anonymous routing protocol for such multipoint-to-point sensor networks based on efficient routing protocols and existing anonymous routing mechanisms. Moreover, we evidence superiority of our proposal by comparing the amount of information for anonymous routing and a time for route establishment with that of existing protocols. We show that our protocol can establish the anonymous route faster than existing ones and reduce the information for routing from existing ones.
AB - In recent years, there are anonymous routing protocols for mobile ad-hoc networks. These protocols provide anonymous communication between an arbitrary pair of nodes. However, there are also some multipoint-to-point sensor networks. In those environments, we have to consider all routes not between an arbitrary pair of sensor nodes but between an arbitrary one sender node and a specific destination node. These existing protocols consider to only security, so nodes may not be able to work efficiency in those environments. In this paper, we propose a new anonymous routing protocol for such multipoint-to-point sensor networks based on efficient routing protocols and existing anonymous routing mechanisms. Moreover, we evidence superiority of our proposal by comparing the amount of information for anonymous routing and a time for route establishment with that of existing protocols. We show that our protocol can establish the anonymous route faster than existing ones and reduce the information for routing from existing ones.
UR - http://www.scopus.com/inward/record.url?scp=84860720209&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860720209&partnerID=8YFLogxK
U2 - 10.1109/WAINA.2012.175
DO - 10.1109/WAINA.2012.175
M3 - Conference contribution
AN - SCOPUS:84860720209
SN - 9780769546520
T3 - Proceedings - 26th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2012
SP - 766
EP - 771
BT - Proceedings - 26th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2012
T2 - 26th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2012
Y2 - 26 March 2012 through 29 March 2012
ER -