1,435 research outputs found
An Overview of Distributed Energy-Efficient Topology Control for Wireless Ad Hoc Networks
A wireless ad hoc network is composed of several tiny and inexpensive device such as wireless sensor networks (WSNs) which have limited energy. In this network energy, efficiency is one of the most crucial requirements. Data transmitting in minimum power level is one way of maximizing energy efficiency. Thus, transmission power level of nodes should be managed in a smart way to improve energy efficiency. Topology control is one of the main algorithms used in a wireless network to decrease transmission power level while preserving network connectivity. Topology control could improve energy efficiency by reasonably tuning the transmission power level while preserving network connectivity in order to increase network capacity and lifetime. In pursuit of energy efficiency and connectivity, nodes can be selfish and are conflicting with each other. Therefore to overcome the conflict, game theory is used to construct energy efficient topology, as well as minimizing energy consumption. In this paper, the main goal and most recent energy efficient topology control algorithms in WSNs and ad hoc network are classified and studied according to their specific goals
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
This paper presents a thorough survey of recent work addressing energy
efficient multicast routing protocols and secure multicast routing protocols in
Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which
witness the need of energy management and security in ad hoc wireless networks.
The objective of a multicast routing protocol for MANETs is to support the
propagation of data from a sender to all the receivers of a multicast group
while trying to use the available bandwidth efficiently in the presence of
frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the
inherent broadcast property of wireless transmission. Secure multicast routing
plays a significant role in MANETs. However, offering energy efficient and
secure multicast routing is a difficult and challenging task. In recent years,
various multicast routing protocols have been proposed for MANETs. These
protocols have distinguishing features and use different mechanismsComment: 15 page
A Fair and Secure Cluster Formation Process for Ad Hoc Networks
An efficient approach for organizing large ad hoc networks is to divide the nodes
into multiple clusters and designate, for each cluster, a clusterhead which is responsible for
holding intercluster control information. The role of a clusterhead entails rights and duties.
On the one hand, it has a dominant position in front of the others because it manages the
connectivity and has access to other nodeÂżs sensitive information. But on the other hand, the
clusterhead role also has some associated costs. Hence, in order to prevent malicious nodes
from taking control of the group in a fraudulent way and avoid selfish attacks from suitable
nodes, the clusterhead needs to be elected in a secure way. In this paper we present a novel
solution that guarantees the clusterhead is elected in a cheat-proof manner
A Lightweight and Attack Resistant Authenticated Routing Protocol for Mobile Adhoc Networks
In mobile ad hoc networks, by attacking the corresponding routing protocol,
an attacker can easily disturb the operations of the network. For ad hoc
networks, till now many secured routing protocols have been proposed which
contains some disadvantages. Therefore security in ad hoc networks is a
controversial area till now. In this paper, we proposed a Lightweight and
Attack Resistant Authenticated Routing Protocol (LARARP) for mobile ad hoc
networks. For the route discovery attacks in MANET routing protocols, our
protocol gives an effective security. It supports the node to drop the invalid
packets earlier by detecting the malicious nodes quickly by verifying the
digital signatures of all the intermediate nodes. It punishes the misbehaving
nodes by decrementing a credit counter and rewards the well behaving nodes by
incrementing the credit counter. Thus it prevents uncompromised nodes from
attacking the routes with malicious or compromised nodes. It is also used to
prevent the denial-of-service (DoS) attacks. The efficiency and effectiveness
of LARARP are verified through the detailed simulation studies.Comment: 14 Pages, IJWM
Security and Privacy Issues in Wireless Mesh Networks: A Survey
This book chapter identifies various security threats in wireless mesh
network (WMN). Keeping in mind the critical requirement of security and user
privacy in WMNs, this chapter provides a comprehensive overview of various
possible attacks on different layers of the communication protocol stack for
WMNs and their corresponding defense mechanisms. First, it identifies the
security vulnerabilities in the physical, link, network, transport, application
layers. Furthermore, various possible attacks on the key management protocols,
user authentication and access control protocols, and user privacy preservation
protocols are presented. After enumerating various possible attacks, the
chapter provides a detailed discussion on various existing security mechanisms
and protocols to defend against and wherever possible prevent the possible
attacks. Comparative analyses are also presented on the security schemes with
regards to the cryptographic schemes used, key management strategies deployed,
use of any trusted third party, computation and communication overhead involved
etc. The chapter then presents a brief discussion on various trust management
approaches for WMNs since trust and reputation-based schemes are increasingly
becoming popular for enforcing security in wireless networks. A number of open
problems in security and privacy issues for WMNs are subsequently discussed
before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the
author's previous submission in arXiv submission: arXiv:1102.1226. There are
some text overlaps with the previous submissio
- âŚ