In cellular and wireless local area networks
(WLAN), wireless imparting only occurs on the last
connection between a base station and the wireless end node.
In multihop wireless web there are one or more interposed
nodes forward the path that hold and forward packets
through wireless links. Multihop wireless web have many
benefits: Compared to networks with solo wireless links,
multihop wireless networks can expand the exposure of a
network and progress connectivity. In this paper to focus the
problem of resource allocation in wireless multihop network
while the source data transmitted to the corresponding
destination through intermediate hops. The intermediate
hop essentially used for relay the information to different
devices that pass the confidential message to its destination.
Here thus the confidential message needs to be protected.
For that purpose encode the message which are transmitted
over different path by using optimal dynamic control
algorithm. It increase utility arbitrarily close to the
maximum achieve utility.
Published In:IJCSN Journal Volume 5, Issue 5
Date of Publication : October 2016
Pages : 792-796
Figures :02
Tables :--
Sasikala N : PG Scholar/CSE
Tagore Institute of Engineering and Technology
Attur, TamilNadu – 636112, India.
Saranya M : Assistant Professor / CSE
Tagore Institute of Engineering and Technology
Attur, TamilNadu – 636112, India.
Surya A : Assistant Professor / CSE
Tagore Institute of Engineering and Technology
Attur, TamilNadu – 636112, India.
All Pairs of Algorithm, End To End,
Confidentiality Encoding
The problem of resource allocation in wireless multi-hop
networks where sources have confidential information to
be transmitted to their corresponding destinations with
the help of intermediate nodes over time-varying uplink
channels. All intermediate nodes are considered as
internal eavesdroppers from which the confidential
information needs to be protected. To provide
confidentiality in such setting, we propose encoding the
message over long blocks of information which are
transmitted over different paths. Then, we designed a
dynamic control algorithm for a given encoding rate and
we prove that our algorithm achieves utility arbitrarily
close to the maximum achievable utility. In this problem,
we find out that increasing the flow rate and keeping
confidentiality is two convicting objective unlike standard
dynamic algorithms, and the proposed algorithm also
considers spatial distribution of the flows over each path.
Next, we consider the system, where the messages are
encoded over finite quantity of blocks.
[1] Yunus Sarikaya, C. Emre Koksal, and Ozgur Ercetin,”
Dynamic Network Control for Confidential Multi-Hop
Communications”, IEEE/ACM TRANSACTIONS ON
NETWORKING, VOL. 24, NO. 2, APRIL 2016
[2] Meng-Hui Lim, and Pong C. Yuen,” Entropy
Measurement for Biometric Verification Systems”,
TRANSACTIONS ON CYBERNETICS, VOL. 46,
NO. 5, MAY 2016
[3] Etienne Perron, Suhas Diggavi and Emre Telatar
EPFL, Lausanne, Switzerland,” On informationtheoretic
confidentiality for wireless networks”, Int.
Zurich Seminar on Communications”, (IZS), March 3-
5, 2010
[4] Yuan-Long Li, Zhi-Hui Zhan, Yue-Jiao Gong, Jun
Zhang, Yun Li, and Qing Li,” Fast Micro-
Differential Evolution for Topological Active Net
Optimization”, TRANSACTIONS ON
CYBERNETICS, VOL. 46, NO. 6, JUNE 2016
[5] Mrs.V.Umadevi Chezhian, Dr. Ramar2 , Mr.Zaheer
Uddin Khan3 ,” Security Requirements in Mobile Ad
Hoc Networks”, Vol. 1, Issue 2, April 2012
[6] Suini Paul Priyadarshini K.R,” Network Coding for
Privacy Protection against Traffic Analysis in Multi-
Hop Wireless Networks”, Volume 2, Issue 4, April
2012
[7] Shivi Sharma, Sonia Jangra,” Mobile Ad Hoc
Network: Issues, Research Trend And Challenges,”
Volume 5, Issue 5, May 2015
[8] C. E. Koksal, O. Ercetin, and Y. Sarikaya, “Control of
wireless networks with confidentiality,” IEEE/ACM
Trans. Netw., vol. 21, no. 1, pp. 324–337, Feb. 2013.