FULL TEXT - RS Publication

International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
Performance Analysis of Networks in Net-Centric Warfare
(NCW)
Niranjan Gupta T M,Student, Mtech 2nd Year, Dept. of ECE, RVCE, Bengaluru,
J Jayanthi, Senior principal Scientist, ALD, CSIR- NAL, Bengaluru, and
Dr. M Bharathi, Associate Prof, Dept. of ECE, RVCE Bengaluru
Abstract:
Network-Centric Warfare (NCW) is composed of integrated system-of-systems that can
extend the capabilities across all the platforms on the network to pursue the maximum
efficiency in mission execution. It allows war fighter’s to take full advantage of all available
information. A topography consisting of totally 34 nodes including firewall node has been
considered. It is divided into three networks. The three networks are representative of army,
military and the navy networks. It is common now a days to communicate through messages.
The sending and receiving message between networks is prone for security issues as our data
can be accessed by everyone within that network. In order to provide security for the
messages in the network of networks, the “Message-Digest”, and PRNG (Pseudo code
Random Number Generator) algorithms are used.
Index Terms: Net-Centric Warfare (NCW), NCO, MD5, PRNG, MANETS, AODV, NS2.
I.
INTRODUCTION
The modern warfare is strongly focused on the informationabout enemy status and activities.
It calls for new and more sophisticated communication systems, which assurances fast and
secure way of exchanging data during Network-Centric Warfare. Net-Centric or Network
Centric refers to contributing as a part of a continuously changing, complex community of
people, devices, information and services interconnected by a communication networks to
achieve maximum benefits of resources available and their significances for better
synchronization of events. The overall military system architecture provides MANET
(Mobile Ad-hoc NETwork) for a military communication networks, at the lowest levels of
command.
The essential features of Ad-hoc networks intended for use in net-centric
environments are:
A. Network decentralization:
Each node in Ad-hoc network can perform the services as well as participate in the data
transfer to the recipient.
B. Ability for the dynamic topology changes:
Network nodes are independent from each other and can arbitrarily change its location, and
with their mutual relations.
C. Radio links usage:
It rejects the need to develop telecommunications infrastructure.
R S. Publication, [email protected]
Page 607
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
D. High network reliability:
In the case of failures of any network components, other nodes in the network can
automatically take over their roles.
E. Good scalability (ease of expansion):
Nodes joining the network that accomplish certain safetyrequirements are able to realize
services almost immediately.
The authentication is based on the identity of a node. The node in the network has to prove
that it is genuine. In many Network applications the identity of participating entities or nodes
is simply determined by their names or addresses. Many of the High levelapplications willuse
mainly names for authenticating, because address lists are much harder to create, understand,
and to maintain than name lists.
When a node wants to spoof the identity of some other node, it is enough to change the
mapping between its low level address and its high level name. An attacker can fake the
name of someone by modifying the association of his address from his own name to the name
he wants to impersonate. Once an attacker has done that, an authenticator can no longer
distinguish between the true and fake entity. In-order to provide the security to the messages
in the network we are proposing the system which is combining the concept of MD5
(Message digest algorithm) and PRNG (Pseudo Code Random Generator) algorithms. These
algorithms are the most efficient algorithms they can be used individually to provide the
message security in the network, but by combining these two algorithms the data exchange
will be more secured.
The rest of the paper is organised as follows. The section 2 will provide the survey
about NCO (Net-Centric Operations), MD5 and AODV. In section 3 actual working of the
MD5 is described along with the PRNG operation. The simulation results are discussed in the
section 4 followed by the Conclusion.
II.
BACKGROUND WORK
Network-Centric Operations provide a force with access to a new, previously unreachable
region of the information domain. The ability to operate in this region provides war fighters
with a new type of information advantage. This advantage is enabled by the dramatic
improvements in information sharing made possible by networking. With this information
advantage, a warfighting force can achieve dramatically improved shared situational
awareness and knowledge.
The term “network-centric” originated from the DOD network centric warfare (NCW), now
commonly called network centric operations (NCO). NCO is an emerging theory of war that
seeks to translate an information advantage into a competitive war fighting strategy through
the robust networking of well informed, geographically-dispersed forces allowing new forms
of warfighting organizational behaviour. NCO’s basic tenets include:
• Utilizing technological advantages to support war fighters in the battlefield
• Networking all systems used by armed forces
• Achieving shared awareness of the battlefield amongst all members of the armed
forces
R S. Publication, [email protected]
Page 608
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
MD5: MD5 is one of the most widely used hash functions in the information era although its
security is suspect. It compresses a piece of information with plain code and random length
into 128 bits value by hash algorithm, which is called information distract. MD5 algorithm is
irreversible and cannot recover the original plain code information from information
abstraction, thus it is always believed safe.
Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad
hoc networks (MANETs) and other wireless ad hoc networks.The AODV Routing protocol
uses an on-demand approach for finding routes, that is, a route is established only when it is
required by a source node for transmitting data packets. It employs destination sequence
numbers to identify the most recent path. AODV offers quick adaptation to dynamic link
conditions, low processing and memory overhead, low memory utilization, and determines
unicast routes to destinations within Adhoc network.
III.
METHODOLOGY/ ALGORITHMS
Most frequently used message digest algorithm is the 128 bit MD5 algorithm Developed by
Ron Rivest of the MIT Laboratory for Computer Science and RSA Data Security.The
algorithmwith a reference implementation was published as Internet RFC 1321 in April 1992,
and was placed into the public domain at that time.
MD5 is an algorithm which:
Takes an input of any length, outputs a message digest of a fixed length (128-bit, 32
characters) .MD5 uses the same algorithm every time. Hence it will always generate the same
message digest for the same string (data).
The algorithm is described through the following five steps:
Step 1. Append Padding Bits
The message is "padded" (extended) so that its length (in bits) is congruent to 448, modulo
512. That is, the message is extended so that it is just 64 bits shy of being a multiple of 512
bits long.
Fig.3.1 MD5 Transform Operation
R S. Publication, [email protected]
Page 609
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
Padding is always performed, even if the length of the message is already congruent to 448,
modulo 512.
Padding is performed as follows: a single "1" bit is appended to the message, and then "0"
bits are appended so that the length in bits of the padded message becomes congruent to 448,
modulo 512. In all, at least one bit and at most 512 bits are appended.
Step 2. Append Length
A 64-bit representation of b (the length of the message before the padding bits were added) is
appended to the result of the previous step. In the unlikely event that b is greater than 2^64,
then only the low-order 64 bits of b are used. (These bits are appended as two 32-bit words
and appended low-order word first in accordance with the previous conventions.)
At this point the resulting message (after padding with bits and with b) has a length that is an
exact multiple of 512 bits. Equivalently, this message has a length that is an exact multiple of
16 (32-bit) words. Let M [0 ... N-1] denote the words of the resulting message, where N is a
multiple of 16.
Step 3. Initialize MD Buffer
A four-word buffer (A,B,C,D) is used to compute the message digest. Here each of A, B, C,
D is a 32-bit register. These registers are initialized to the following values in hexadecimal,
low-order bytes first):
Word A: 01 23 45 67
Word B: 89 ab cd ef
Word C: fe dc ba 98
Word D: 76 54 32 10
Step 4. Process Message in 16-Word Blocks
Here, first define four auxiliary functions that each take as input three 32-bit words and
produce as output one 32-bit word.
F(X,Y,Z) = XY v not(X) Z
G(X,Y,Z) = XZ v Y not(Z)
H(X,Y,Z) = X xor Y xor Z
I(X,Y,Z) = Y xor (X v not(Z))
In each bit position F acts as a conditional: if X then Y else Z. The function F could have
been defined using + instead of v since XY and not(X)Z will never have 1’s in the same bit
position.) It is interesting to note that if the bits of X, Y, and Z are independent and unbiased,
the each bit of F(X,Y,Z) will be independent and unbiased.
The functions G, H, and I are similar to the function F, in that they act in "bitwise parallel" to
produce their output from the bits of X, Y, and Z, in such a manner that if the corresponding
bits of X, Y, and Z are independent and unbiased, then each bit of G(X,Y,Z), H(X,Y,Z), and
I(X,Y,Z) will be independent and unbiased. Note that the function H is the bit-wise "xor" or
"parity" function of its inputs.
Step 5. Output
The message digest produced as output is A, B, C, and D. That is, we begin with the loworder byte of A, and end with the high-order byte of D.
R S. Publication, [email protected]
Page 610
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
Pseudo code random number generator:
A Pseudo Random Number Generator (PRNG), also known as a Deterministic Random Bit
Generator (DRBG), is an algorithm for generating a sequence of numbers that approximates
the properties of random numbers. The sequence is not truly random in that it is completely
determined by a relatively small set of initial values, called the PRNG's state, which includes
a truly random seed. Although sequences that are closer to truly random can be generated
using hardware random number generators, pseudorandom numbers are important in practice
for their speed in number generation and their reproducibility, and they are thus central in
applications such as simulations (e.g., of physical systems with the Monte Carlo method), in
cryptography, and in procedural generation. Good statistical properties are a central
requirement for the output of a PRNG, and common classes of suitable algorithms include
linear congruently generators, lagged Fibonacci generators, and linear feedback shift
registers. Cryptographic applications requirethe output also to be unpredictable, and
moreelaborate designs, which do not inherit the linearity of simpler solutions, are needed.
PRNGs work by keeping an internal state. Typically this is a seed and a key, which are kept
secret. If consumer requests random data, a cryptographic algorithm will operates on the seed
and the key to produce pseudo-random output. The operation of the PRNG is shown in Figure
3.2. The internal state is then updated so that the next request does not produce the same data
as the previous.
INPUT: (Key, Seed),
OUTPUT: random-data,(Key',Seed'),
random-data = F (Key, Seed),
Key’ = F (Key, Seed+1),
Seed’ = F(Key', Seed),
return random-data.
Where F is a Cryptographic function.
Figure.3.2 PRNG Operation
PRNGs are more commonly used in experimentation: they are algorithms that generate
batches of numbers that share key properties with actual random numbers. They are in
common use largely because they can be easily built-in and implemented quickly by
computer programs. A sequence developed by a PRNG can also be replicated if one knows
the seed.
IV.
SIMULATION RESULTS
The simulations have been performed using network simulator NS-2. The network simulator
ns-2 is a discrete event simulation software for network simulations which means it simulates
events such as sending, receiving, forwarding packets. The ns-allinone2.34 supports
simulation for routing protocols.
R S. Publication, [email protected]
Page 611
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
To exchange an information insulation of the nodes is important. The selection of the nodes is
left to the user. The user has to choose a proper node for sender and receiver. Note that the
node from the same group cannot establish a communication.
The figure 4.1 shows the selection of the proper source and the destination nodes.
Fig 4.1 Selection of Source and Destination Node
Fig 4.2 A view of the net-centric network
The figure 4.2 shows the topography of the networks in net-centric warfare. The topography
consists of totally 34 nodes including firewall node and it is divided into three networks. The
three networks are considered as army, military and the navy networks.
Fig 4.3 The generation of Keys for all the nodes
The MD5 will generate the key for each node. The key generated for each and every node are
different as shown in the figure 4.3
R S. Publication, [email protected]
Page 612
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
The network routing protocol AODV will first broadcasts a request for connection to all the
nodes in a network and then chooses the nearest path to the destination from the routing table
entries.
Fig 4.4 Transfer of packets from source to Destination
Once the path is selected from the routing table it starts transmitting the packets through the
firewall as shown in the figure 4.4. The transmission path is indicated with the purple colour
to the nodes that are passing the packets. The green colour node indicates the sender node and
the yellow colour indicates the destination node.
If the sender packets are lost before reaching the destination then it will choose another
nearest path to transmit the packets.
Fig 4.5 Firewall found an Attacker and drops its packets
If the firewall finds an attacker in the network, firewall node is indicated with blue colour
circle. The attacker is indicated with the red colour circle.In the figure 4.5 node 6 is an
attacker. When firewall/Centric node receives the packets from node 6(attacker) it verifies its
IP address.If it is foundto be a spoof of the other node then it will indicate as an Attacker and
it will drop the packets sent from node 6 and forwards only the authenticated sender packets
to destination.
V.
CONCLUSION
In this paper the analysis of Net-Centric and operations of it are studied& analysed. The
major goal of the project was to provide asecurity to the networks. The security is provided
R S. Publication, [email protected]
Page 613
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
by MD (Message Digest) 5 method which will generate a 32bit wide code for each node.
Message packet to the destination is forwarded only when the node is authorized. The
firewall or centric node is used to provide authentication. The AODV is used as a network
routing protocol for the communication.
REFERENCES
[1] Harvey Reed, Fred Stein “Net-Centric Conversations: The Unit of Work for Network
Centric Warfare and Network Centric Operations”, Military Communication Conference,
2006 MILCOM 2006. IEEE Conference, 23-25th Oct 2006.
[2] Shi Fu-li, Lei Yong-lin, Zhu Yi-fan “A Military Communication Super network Structure
Model for Net-centric environment”, International Conference on Computational and
Information Sciences(ICCIS), Chengdu, 17-19 Dec. 2010
[3] RafalBrys, JacekPszczolkowski, MiroslawRuszkowski, “Mechanisms of Ad-hoc networks
supporting Network Centric Warfare”, Communication and Information Systems Conference
(MCC), Military, Gdnask, Central Europe, Conference 8-9 Oct 2012.
[4] SreekanthAnyapu, G. Aparna, R. Manognya, D. Ravi Kumar “Message Security through
Digital Signature Generation and Message Digest Algorithm”, IJETAE Volume 3, Issue 3,
March 2013.
[5] C. Perkins, E. Belding-Royer, S. Das, “Ad hoc On-Demand Distance Vector (AODV)
Routing”, Network Working Group, July 2003
[6] R. Rivest, “The MD5 Message-Digest Algorithm”, MIT Laboratory for Computer Science
and RSA Data Security, Inc., April 1992
[7] Jing Peng, Liang Han, Guanghong Gong and Lingyu Liu, “Network Topology Based on
Information Security for Network Centric Warfare Simulation”, Advanced Computer Theory
and Engineering (ICACTE), 2010 3rd International Conference on (Volume:6 ), Chengdu,
China, DOC- 20-22 Aug. 2010
[8] A.Hedayati, M N.Fesharaki, M. Tavanpour, S. Saberi, AB.Hedayati “A Comparison of
Rerouting Methods in Network Centric Environments Based on Swarm Topology”,
Internatioal Symposium on Telecommunications IEEE 2008.
[9] Latha Kant, Kenneth Y, O. Younis, D. Shallcross, K. Sinkar, A. McAuley, K.
Manousakis, K. Chang and Charles Graff, “Network Science Based Approaches to Design
and Analyse MANETs”, Military Communications, IEEE Communications Magazine, Nov
2008.
[10] Jack L. Burbank, Philip F. Chimento, Brian K. Haberman, and William T. Kasch, “Key
Challenges of Military Tactical Networking and the Elusive Promise of MANET
Technology”, Net-centric Military Comm, IEEE Communications Magazine, Nov 2006
[11] Amine Chigani and James D. Arthur, “The Implications of Network-Centric Software
Systems on Software Architecture: A Critical Evaluation”, Winston-Salem, N. Carolina,
USA, ACMSE 2007, March 23-24, 2007.
R S. Publication, [email protected]
Page 614
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
[12] Mr.Harjit Singh, Er. Gurpinder Singh, “Wireless Networking Security (“Secured-Nim”:
Blocking Misbehaving Users In Anonymizing Networks”), IJARCSSE ISSN: 2277
128XVolume 3, Issue 5, May 2013.
[13] Network Centric or Net-Centric Warfare http://en.wikipedia.org/wiki/Network-centric_
warfare
[14] Information on Ad hoc Networks http://en.wikipedia.org/wiki/Ad_hoc
[15] Ad hoc on Demand Distance Vector Routing http://en.wikipedia.org/wiki/Ad_hoc_OnDemand_Distance_Vector_Routing
[16] Message Digest Algorithm version 5 (MD 5) http://en.wikipedia.org/wiki/MD5
[17]
Pseudo
Random
Number
(PRNG)http://en.wikipedia.org/wiki/Pseudorandom_number_generator
Generator
[18] PRNG Mechanism http://www.cryptosys.net/rng_algorithms.html
[19] David S. AlBerts, John J. Garstka, Frederick P. Stein, “Network Centric Warfare
Developing and Leveraging Information Superiority”, 2nd Edition (Revised), Aug 1999.
[20] DjamelDjneouri, AbdelouahidDerhab and NadjibBadache, “Ad hoc Networks Routing
Protocols and Mobility”, IAJIT vol 3 No. 2, April 2006.
[21] S. D. Khatawkar, K. K. Pandyaji, R. M. Patil, V. M. Sali and U. L. Kulkarni,
“Performance Comparison of DSDV, AODV, DSR, Routing protocols for MANETs”,
IPCSIT vol.35(2012) IACSIT Press, Singapore, 2012.
[22] Network Simulator:http://www.isi.edu/nsnam/ns/
[23] Yih-Chun Hu, Adrian Perrig, David B. Johnson, “Wormhole Attacks in Wireless
Networks”, IEEE Journal on Selected Areas in Communications (Volume:24 , Issue: 2 ),
Pp: 370 – 380, Feb 2006
[24] ShenHai-Wei, Li Jin-ping, “A High-Speed and Long-Period Combined Pseudo-random
Number Generator”, Second International Symposium on Computational Intelligence and
Design, ISCID '09 (Volume:1 ), Changsha, Pp: 112 – 114, 12-14 Dec. 2009
[25] Morshed M.M, Ko F.I.S, Dongwook Lim, Rahman M.H, MazumderM.R.R, Ghosh J,
“Performance evaluation of DSDV and AODV routing protocols in Mobile Ad-hoc
Networks”, 4th International Conference on New Trends in Information Science and Service
Science (NISS), Gyeongju, Pp: 399 – 403, 11-13 May 2010
[26] B.Thanikaivel, B. Pranisa, “Fast and Secure Data Transmission in MANET”,
International Conference on Computer Communication and Informatics (ICCCI -2012), Jan.
10 – 12, 2012, Coimbatore, INDIA, 2012.
[27] Latha Kant, Kenneth Y, O. Younis, D. Shallcross, K. Sinkar, A. McAuley, K.
Manousakis, K. Chang and Charles Graff, “Network Science Based Approaches to Design
R S. Publication, [email protected]
Page 615
International Journal of Advanced Scientific and Technical Research
Available online on http://www.rspublication.com/ijst/index.html
Issue 4 volume 3, May-June 2014
ISSN 2249-9954
and Analyse MANETs”, Military Communications, IEEE Communications Magazine, Nov
2008
[28] Jack L. Burbank, Philip F. Chimento, Brian K. Haberman, and William T. Kasch, “Key
Challenges of Military Tactical Networking and the Elusive Promise of MANET
Technology”, Net-centric Military Comm, IEEE Communications Magazine, Nov 2006
[29] Naqvi S.I, Akram A, “Pseudo-random key generation for secure HMAC-MD5”, IEEE
3rd International Conference on Communication Software and Networks (ICCSN), 2011,
Xi'an, Pp: 573 – 577, 27-29 May 2011
[30] Mary Cindy Ah Kioon, ZhaoShun Wang and Shubra Deb Das, “Security Analysis of
MD5 algorithm in Password Storage”, Proceedings of the 2nd International Symposium on
Computer, Communication, Control and Automation (ISCCCA-13),Atlantis Press, Paris,
France2013
APPENDIX: ABBREVATIONS
AODV: Adhoc On Demand Distance Vector
DOD: Department of Defence
DRBG: Deterministic Random Bit Generator
MANET: Mobile Adhoc NETwork
MD5: Message Digest 5
MDA: Message Digest Algorithm
NCO: Net-Centric Operations
NCW: Net-Centric Warfare
NS 2: Network Simulator 2
PRNG: Pseudo Random Number Generator
R S. Publication, [email protected]
Page 616