The Experts below are selected from a list of 16761 Experts worldwide ranked by ideXlab platform
Jian Ren - One of the best experts on this subject based on the ideXlab platform.
-
r star destination location privacy schemes in wireless sensor networks
International Conference on Communications, 2015Co-Authors: Leron Lightfoot, Jian RenAbstract:Wireless sensor networks (WSNs) can provide the world with a technology for real-time event monitoring for both military and civilian applications. One of the primary concerns that hinder the successful deployment of wireless sensor networks is providing adequate location privacy. Many protocols have been proposed to provide location privacy but most are based on public-key cryptosystems, while others are either energy inefficient or have certain security flaws. In this paper, after analyzing security weakness of the existing schemes, we propose an architecture that addresses the security flaw for destination location privacy in WSNs based on energy-aware two phase routing protocol. We call this scheme the R-STaR routing protocol. In the first routing phase of R-STaR routing, the source Node transmits the the message to a randomly selected Intermediate Node located in a pre-determined region surrounding the source Node, which we call the R-STaR area. In the second routing phase, the message is routed to the destination Node using shortest path mix with fake message injections. We show that R-STaR routing provides a exceptional balance between security and energy consumption in comparison to existing well-known proposed schemes.
-
quantitative measurement and design of source location privacy schemes for wireless sensor networks
IEEE Transactions on Parallel and Distributed Systems, 2012Co-Authors: Jian RenAbstract:Wireless sensor networks (WSNs) have been widely used in many areas for critical infrastructure monitoring and information collection. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address source-location privacy (SLP). For WSNs, SLP service is further complicated by the nature that the sensor Nodes generally consist of low-cost and low-power radio devices. Computationally intensive cryptographic algorithms (such as public-key cryptosystems), and large scale broadcasting-based protocols may not be suitable. In this paper, we first propose criteria to quantitatively measure source-location information leakage in routing-based SLP protection schemes for WSNs. Through this model, we identify vulnerabilities of some well-known SLP protection schemes. We then propose a scheme to provide SLP through routing to a randomly selected Intermediate Node (RSIN) and a network mixing ring (NMR). Our security analysis, based on the proposed criteria, shows that the proposed scheme can provide excellent SLP. The comprehensive simulation results demonstrate that the proposed scheme is very efficient and can achieve a high message delivery ratio. We believe it can be used in many practical applications.
-
providing hop by hop authentication and source privacy in wireless sensor networks
International Conference on Computer Communications, 2012Co-Authors: Jian RenAbstract:Message authentication is one of the most effective ways to thwart unauthorized and corrupted traffic from being forwarded in wireless sensor networks (WSNs). To provide this service, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial: when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. In this paper, we propose a scalable authentication scheme based on elliptic curve cryptography (ECC). While enabling Intermediate Node authentication, our proposed scheme allows any Node to transmit an unlimited number of messages without suffering the threshold problem. In addition, our scheme can also provide message source privacy. Both theoretical analysis and simulation results demonstrate that our proposed scheme is more efficient than the polynomial-based approach in terms of communication and computational overhead under comparable security levels while providing message source privacy.
-
preserving source location privacy in wireless sensor network using star routing
Global Communications Conference, 2010Co-Authors: Leron Lightfoot, Jian RenAbstract:In wireless sensor networks (WSNs), providing source-location privacy through secure routing is one of the most prosperous techniques. In this paper, we propose a routing technique to provide adequate source-location privacy with low energy consumption. We introduce this technique as the Sink Toroidal Region (STaR) routing. With this technique, the source Node randomly selects an Intermediate Node within a designed STaR area located around the SINK Node. The STaR area is large enough to make it unpractical for an adversary to monitor the entire region. Furthermore, this routing protocol ensures that the Intermediate Node is neither too close, nor too far from the SINK Node in relations to the entire network. While ensuring source location privacy, our simulation results show that the proposed scheme is very efficient and can be used for practical applications.
-
Source-location privacy through dynamic routing in wireless sensor networks
Proceedings - IEEE INFOCOM, 2010Co-Authors: Yun Li, Jian RenAbstract:Wireless sensor networks (WSNs) have the potential to be widely used in many areas for unattended event monitoring. Mainly due to lack of a protected physical boundary, wireless communications are vulnerable to unauthorized interception and detection. Privacy is becoming one of the major issues that jeopardize the successful deployment of wireless sensor networks. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address the source-location privacy. For WSNs, source-location privacy service is further complicated by the fact that the sensor Nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms and large scale broadcasting-based protocols are not suitable for WSNs. In this paper, we propose source-location privacy schemes through routing to randomly selected Intermediate Node(s) before the message is transmitted to the SINK Node. We first describe routing through a single a single randomly selected Intermediate Node away from the source Node. Our analysis shows that this scheme can provide great local source-location privacy. We also present routing through multiple randomly selected Intermediate Nodes based on angle and quadrant to further improve the global source location privacy. While providing source-location privacy for WSNs, our simulation results also demonstrate that the proposed schemes are very efficient in energy consumption, and have very low transmission latency and high message delivery ratio. Our protocols can be used for many practical applications.
Yun Li - One of the best experts on this subject based on the ideXlab platform.
-
Source-location privacy through dynamic routing in wireless sensor networks
Proceedings - IEEE INFOCOM, 2010Co-Authors: Yun Li, Jian RenAbstract:Wireless sensor networks (WSNs) have the potential to be widely used in many areas for unattended event monitoring. Mainly due to lack of a protected physical boundary, wireless communications are vulnerable to unauthorized interception and detection. Privacy is becoming one of the major issues that jeopardize the successful deployment of wireless sensor networks. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address the source-location privacy. For WSNs, source-location privacy service is further complicated by the fact that the sensor Nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms and large scale broadcasting-based protocols are not suitable for WSNs. In this paper, we propose source-location privacy schemes through routing to randomly selected Intermediate Node(s) before the message is transmitted to the SINK Node. We first describe routing through a single a single randomly selected Intermediate Node away from the source Node. Our analysis shows that this scheme can provide great local source-location privacy. We also present routing through multiple randomly selected Intermediate Nodes based on angle and quadrant to further improve the global source location privacy. While providing source-location privacy for WSNs, our simulation results also demonstrate that the proposed schemes are very efficient in energy consumption, and have very low transmission latency and high message delivery ratio. Our protocols can be used for many practical applications.
Hwang Soo Lee - One of the best experts on this subject based on the ideXlab platform.
-
enhanced ad hoc on demand distance vector eaodv routing protocol with route distribution
Vehicular Technology Conference, 2005Co-Authors: Bong Chan Kim, Hwang Soo LeeAbstract:Ad hoc on-demand distance vector (AODV) routing protocol is a representative ad hoc routing protocol based on an on-demand approach. In the route discovery procedure of AODV, a source broadcasts a route request (RREQ) packet to find a route to a destination. If an Intermediate Node has a valid route to the destination in its own route table, the Intermediate Node can reply to the RREQ with a route reply (RREP) packet and discard the RREQ packet. We term this mechanism as the route cache mechanism. The route cache mechanism has the merits of a short route setup time, a high route setup probability, and a small propagation range of RREQ packets. However, the route cache mechanism has the demerit of route concentration on a few mobile Nodes. In this paper, we propose an enhanced AODV (EAODV) routing protocol with a selective route cache mechanism based on a source/destination pair in the route discovery procedure. By the selective route cache mechanism, EAODV can maintain the merits of the route cache mechanism and solve its demerit simultaneously. We compare the performances of the conventional AODV and EAODV in multi- hop access environment, where several mobile Nodes send data packets to a fixed Node such as an access point (AP), via ns-2 simulation. Simulation results show that EAODV outperforms the conventional AODV in terms of the packet delivery ratio, the average end-to-end delay, and the normalized routing overhead because EAODV can get the effect of route distribution in the route discovery procedure by the selective route cache mechanism based on a source/destination pair.
Jorge A Cobb - One of the best experts on this subject based on the ideXlab platform.
-
randomized distance vector routing protocol
ACM Symposium on Applied Computing, 1999Co-Authors: Sangman Bak, Jorge A CobbAbstract:The purpose of routing protocols in a computer network is to maximize throughput. Shortest-path routing protocols have the disadvantage of causing bottlenecks due to their single-path routing. That is, the shortest path between a source and a destination may become highly congested even when many other paths have low utilization. In this paper, we propose a routing scheme that randomly balances traffic over the whole network, therefore, it removes bottlenecks and increases network throughput. For each data message to be sent from a source s to a destination d, the proposed routing protocol randomly chooses an Intermediate Node e, and routes the data message along the shortest path from s to e. Then, it routes the data message via the shortest path from e to d. This increases the effective bandwidth between each pair of Nodes. In our simulation results, we show that this proposed routing protocol distributes traffic evenly over the whole network and increases network throughput.
Lourdes Penalver - One of the best experts on this subject based on the ideXlab platform.
-
two secure and energy saving spontaneous ad hoc protocol for wireless mesh client networks
Journal of Network and Computer Applications, 2011Co-Authors: Raquel Lacuesta, Jaime Lloret, Miguel Garcia, Lourdes PenalverAbstract:We can find many cases where a spontaneous wireless ad-hoc network must be built for a limited period of time in a wireless mesh network: meetings, conferences, etc. One of the main aspects in a spontaneous network is to provide security mechanisms to the users. Confidentially, integrity, authentication, availability and no-repudiation should be provided for all the users in the network and the information should travel ciphered through the network. This paper shows two secure spontaneous wireless ad-hoc network protocols for wireless mesh clients that are based on the computational costs: the weak and the strong one. They are based on the trust of the users and guarantee a secure protocol between the users and the mesh routers. Both protocols provide Node authenticity, Intermediate Node authenticity, integrity checking, random checking, verification distribution and erroneous packets elimination (before they arrive to the destination). The protocol procedure, its messages and development are explained in detail. Finally, we will compare their energy consumption with other secure protocols. The comparison will prove their benefits.