Reference Hub1
Security in Mobile Ad Hoc Networks

Security in Mobile Ad Hoc Networks

Ekata Mehul, Vikram Limaye
ISBN13: 9781605661568|ISBN10: 1605661562|EISBN13: 9781605661575
DOI: 10.4018/978-1-60566-156-8.ch050
Cite Chapter Cite Chapter

MLA

Mehul, Ekata, and Vikram Limaye. "Security in Mobile Ad Hoc Networks." Handbook of Research in Mobile Business, Second Edition: Technical, Methodological and Social Perspectives, edited by Bhuvan Unhelkar, IGI Global, 2009, pp. 541-558. https://doi.org/10.4018/978-1-60566-156-8.ch050

APA

Mehul, E. & Limaye, V. (2009). Security in Mobile Ad Hoc Networks. In B. Unhelkar (Ed.), Handbook of Research in Mobile Business, Second Edition: Technical, Methodological and Social Perspectives (pp. 541-558). IGI Global. https://doi.org/10.4018/978-1-60566-156-8.ch050

Chicago

Mehul, Ekata, and Vikram Limaye. "Security in Mobile Ad Hoc Networks." In Handbook of Research in Mobile Business, Second Edition: Technical, Methodological and Social Perspectives, edited by Bhuvan Unhelkar, 541-558. Hershey, PA: IGI Global, 2009. https://doi.org/10.4018/978-1-60566-156-8.ch050

Export Reference

Mendeley
Favorite

Abstract

Securing a “Wireless Ad Hoc Network” (WAHN) is a major concern of network administrators. This is particularly so in case of the wireless networks due to their unique characteristics that varies from the traditional networks. For example, WAHN are vulnerable to internal as well as external attacks relatively easily, as compared with traditional networks, because of their ability to be accessible from anywhere within their range. Many solutions have been proposed in this area and they are also being continuously improved. Most of these solutions involve encryption; secure routing, quality of service, and so forth. However, each of these solutions is designed to operate in a particular situation; and it may fail to work successfully in other scenarios. This particular research work offers an alternate to improving the trustworthiness of the neighbourhood and securing the routing procedure. This security is achieved by dynamically computing the trust in neighbours and selecting the most secure route from the available ones for the data transfer. There is also a provision to detect the compromised node and virtually removing it from the network.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.