Intrusion detection techniques in mobile ad hoc and wireless sensor networks

Sun, Bo; Osborne, Lawrence; Xiao, Yang; Guizani, Sghaier

doi:10.1109/mwc.2007.4396943

Cited by 162 publications

(82 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The encryption decryption security scheme and IDS (Intrusion Detection System) against passive and active attackers is identified or detect the malicious actions done by attackers. The IDS are of many types [4,5] that are detecting the malicious activities of attacker and provide the secure communication in MANET. The attacker detection is not only necessary but prevention is also required.…”

Section: Fig 1 Example Of Manetmentioning

confidence: 99%

Secure IDS against Sybil Attacker Routing Misbehavior in MANET

Jain¹,

Mathur²

2015

IJCA

View full text Add to dashboard Cite

Sybil attacker is the routing layer active attacker that replies with multiple identification number (ID's) to nodes that forward request to attacker in a different time instant and drop the data forwarded to attacker after link establishment. The proposed research work is provides the novel secure Intrusion Detection System (IDS) against routing misbehavior of Sybil attack in MANET. The IDS are not determining whether the losses are caused by link errors. It determines the loss due to malicious nodes. In the especially interested in the insider Sybil attack case, whereby malicious nodes that are part of the route exploit their data of the communication context to drop an amount of packets critical to the network performance. The basic idea behind this method is that even though malicious dropping may result in a packet loss rate that is not comparable to normal channel losses. The attacker loss is more than the loss of channel. The proposed IDS is detecting attacker node that reply with multiple ID's and broadcast the particular attacker original ID's that generate fake ID's. Therefore, by detecting the malicious or attacker loss % is decided whether the packet loss is purely due to a combined effect of fake ID's for malicious drop. The routing performance is measured through performance metrics and detection through TPR and FPR. The simulation of attacker and proposed IDS is done in ns-2 simulator.

show abstract

Section: Fig 1 Example Of Manetmentioning

confidence: 99%

Secure IDS against Sybil Attacker Routing Misbehavior in MANET

Jain¹,

Mathur²

2015

IJCA

View full text Add to dashboard Cite

show abstract

“…The base station is secure and able to detect all compromised nodes. Detection of compromised nodes can be actually achieved by means of an Intrusion Detection System (IDS) such as [27][28][29][30]. The BS maintains a blacklist containing the identity of compromised nodes.…”

Section: Network Modelmentioning

confidence: 99%

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

et al. 2012

View full text Add to dashboard Cite

a b s t r a c tSecure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.

show abstract

“…WSNs play an important role in a wide range of applications, such as emergency response [13], environment monitoring [11], smart In WSN with a static sink, the sensed readings of the sensors are usually routed via multihop forwarding to the sink for processing. This type of communication creates a bottleneck in the sensor network.…”

Section: Introductionmentioning

confidence: 99%

Energy Optimization using Neighborhood based Weighted Rendezvous Technique for Wireless Sensor Networks

Ruthvic¹,

Ravi²,

Shenoy³

2015

IJCA

View full text Add to dashboard Cite

Establishing an energy efficient wireless sensor network is a challenging task. A significant amount of research work has already been carried out in this direction to study energy optimization in WSN by taking the advantage of mobile sink or mobile agents. Many approaches using mobile sink have demonstrated that energy usage can be optimized significantly in the phenomenon area from where the sink would collect the sensed readings from the sensor nodes via single or multi hop communication. But, the slow mobility speed of the sink will tend to increase the data collection latency in the sensor network, especially in delay bound WSN applications. To overcome this problem, several rendezvous based techniques have been proposed, in which sink is allowed to visit a subset of the sensor nodes to collect the data via single hop communication. This subset of nodes, called rendezvous points (RPs), is considered as data collection points. All other nodes send their sensed data using the shortest path to these RPs. In this paper a simple neighbourhood based rendezvous technique is proposed. In our approach a subset of sensor nodes from the network is designated as rendezvous points (RPs) set to receive and buffer the data from their nearest source nodes. The selected RP set is such that they take care of denser part of the network where energy consumption is more so that the energy hole problem can be minimized and help optimize the energy consumption in the network. A shortest sink tour is then constructed using only RPs, using which mobile sink makes its tour and collects the buffered data from the RPs within a given deadline. In this paper we explain the NBWRP (Neighbourhood based Weighted Rendezvous Planning) algorithm to compute the RPs. We also evaluate and compare its performance with static sink WSN and WSN with random sink mobility. Our results show that the algorithm achieves better WSN lifetime compared to static sink case and random movement strategy. General TermsWireless Sensor Networks, Mobile base station.

show abstract

Intrusion detection techniques in mobile ad hoc and wireless sensor networks

Cited by 162 publications

References 13 publications

Secure IDS against Sybil Attacker Routing Misbehavior in MANET

Secure IDS against Sybil Attacker Routing Misbehavior in MANET

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

Energy Optimization using Neighborhood based Weighted Rendezvous Technique for Wireless Sensor Networks

Contact Info

Product

Resources

About