BibTeX:

@article{IJIRSTV4I3013,
     title={Fully Secured Adhoc Wireless Network by using on Demand Half Full Weighing Matrices},
     author={Subhash Chandra Dutta, Sudha Singh and D K Singh},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={4},
     number={3},
     pages={71--77},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV4I3013.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

An ad hoc wireless network is a collection of nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. Providing security support for such network is a challenging task. Masquerading, eavesdropping, resource consumption, interference and jamming are some of the major threats to such network. The scheme proposed in this paper gives a general framework to solve the security threats by designing on demand Half-full weighing matrix based cryptography scheme (ODHFWMBCS). It provides almost complete secure communication. ODHFWMBCS is a combination of code containing node identity and public key cryptography. For code, on demand half full weighing matrix have been constructed. The proposed scheme ODHFWMBCS gives a new direction towards more effective and efficient security design for ad hoc wireless networks.

Adhoc wireless network, Public key cryptography, DES, RSA algorithm, Coding theory, Hadamard matrix, Sylvester Hadamard matrix, weighing matrix