The Experts below are selected from a list of 822 Experts worldwide ranked by ideXlab platform
Shobhana S - One of the best experts on this subject based on the ideXlab platform.
-
Refining Bogus Data in Wireless Sensor Network Using Non Repudiation and Enrouting Filter Mechanism
2013Co-Authors: Shobhana SAbstract:Wireless sensor network is usually composed of a large number of sensor nodes which are interconnected through wireless links to perform distributed sensing tasks. When a sensor node generates report after being triggered by a special event, it will send the report to a data collection unit (also known as sink) through an established routing path. Wireless sensor networks are usually deployed at unattended or hostile environments. Therefore, they are very vulnerable to various security attacks and also suffer from injecting bogus or false data attack and send the bogus data to the sink to cause upper-level error decision, as well as energy wasted in en-route nodes. So the proposed work deals with a novel bandwidth-efficient cooperative authentication (BECAN) scheme. This scheme can save energy by early detecting and filtering the majority of injected bogus data at the en-route nodes, so that burden of the sink can be reduced. To filter the bogus data, the BECAN adopts cooperative Neighbor Router (CNR)-based filtering mechanism.
Iwao Sasase - One of the best experts on this subject based on the ideXlab platform.
-
An RSVP Connection Renewing Scheme Using Address of Neighbor Routers in Mobile IP-Based Networks
2015Co-Authors: Takeshi Murakami, Tomoaki Takazawa, Yoriko Utsunomiya, Masaki B, Iwao SasaseAbstract:We propose an RSVP connection renewing scheme using address of Neighbor Routers to improve the perform-ance of the renewing time of RSVP connection without increasing the number of RSVP connection hops in Mobile IP-based networks. In the proposed scheme, Next HOP (NHOP) is added to each Router to record an address of Neighbor Router. SEARCH message is defined to know which existing RSVP connection is still available after handoff of MN. In the tree network, since the existing RSVP connection has the highest availability, the proposed scheme can reduce the renewing time of RSVP connection without increasing the number of RSVP connection hops. Moreover, the proposed scheme can reduce the number of RSVP connection hops by using the Router’s own routing table information and own NHOP in the mesh network. The computer simulation results show that the proposed scheme can reduce the renewing time of RSVP connection without increasing the number of RSVP connection hops. © 200
Nithya Menon S. Praveena - One of the best experts on this subject based on the ideXlab platform.
-
BECAN: A Bandwidth Efficient Cooperative Authentication Scheme for Wireless Sensor Networks
2015Co-Authors: Nithya Menon S. PraveenaAbstract:Abstract—This paper propose a bandwidth-efficient cooperative authentication (BECAN) scheme for filtering injected false data in Wireless sensor Networks. Sensor node could be easily compromised as the attacker can gain control obtain key values and change the properties of the node. This results in an false report to sink and energy waste in en-route nodes. The proposed BECAN scheme can save energy by early detecting and filtering the most of injected false data with less time and difficulty at the en-route nodes. In addition,only a very small amount of injected false data needs to be checked by the sink, thereby reduceing the burden on sink. To filter the false data, the BECAN scheme adopts cooperative Neighbor Router (CNR)-based filtering mechanism. Hence it achieves not only high filtering probability but also high reliability
K. Jadhav - One of the best experts on this subject based on the ideXlab platform.
-
AN EFFECTIVE SOURCE ROUTING FOR FALSE DATA INJECTION ATTACK IN WIRELESS SENSOR NETWORK
2015Co-Authors: Madhuri N. Burange, Prof Venkat, K. JadhavAbstract:Wireless sensor network (WSN) is an emerging technology that has resulted in a variety of applications. By using bandwidth-efficient cooperative authentication Network (BECAN) the false data injection filtering done efficiently and with less energy consumption. In WSN Sensor nodes are usually vulnerable to physical attacks or sensor node compromises easily. As the Sensor node could be easily compromised, the attacker can gain control obtain key values and change the properties of the node. This results in an false report to sink node and energy wastage in en-route nodes. In BECAN scheme the flase data injection and filtering done on the earlier stage which avoids false data injection, avoide unnecessary energy consumption in less time and with effieiency. Energy consumption avoid by checking only a very small amount of injected false data by the sink, it reduces the work load of the sink. The heart of BECAN scheme is cooperative Neighbor Router (CNR)-based filtering mechanism and it provides High Filtering Probability as well as high reliabilit
Yajun Wang - One of the best experts on this subject based on the ideXlab platform.
-
Network topology inference based on end-to-end measurements
2014Co-Authors: Xing Jin, Student Member, -p. Ken W. Yiu, -h. Gary S. Chan, Senior Member, Yajun WangAbstract:Abstract—We consider using traceroute-like end-to-end mea-surement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given hosts in an asymmetric network without anonymous Routers, traditionally full ( 1) traceroutes are needed to determine the underlay topology. We investigate how to efficiently infer an underlay topology with low measurement cost, and propose a heuristic called Max-Delta. In the heuristic, a server selects appropriate host-pairs to measure in each iteration so as to reveal the most undiscovered information on the underlay. We further observe that the presence of anonymous Routers significantly distorts and inflates the inferred topology. Previous research has shown that obtaining both exact and approximate topology in the presence of anonymous Routers under certain consistency constraints is intractable. We hence propose fast algo-rithms on how to practically construct an approximate topology by relaxing some constraints. We investigate and compare two algorithms to merge anonymous Routers. The first one uses Isomap to map Routers into a multidimensional space and merges anonymous Routers according to their interdistances. The second algorithm is based on Neighbor Router information, which trades off some accuracy with speed. We evaluate our inference algorithms on Internet-like and real Internet topologies. Our results show that almost full measurement is needed to fully discover the underlay topology. However, sub-stantial reduction in measurements can be achieved if a little accu-racy, say 5%, can be compromised. Moreover, our merging algo-rithms in the presence of anonymous Routers can efficiently infer an underlay topology with good accuracy. Index Terms—Anonymous Router, end-to-end measurement, measurement cost, topology inference. I
