Recently, one of the important requirements, in ad hoc networks, is to avoid partitioning problem due to dynamic movement of
special node(s) called "Critical Node(s)". Critical node refers to the node that its removal from the network will break it into many
partitions. Many researches presented different algorithms to detect such critical node(s) in any ad hoc network. These researches did
not take the situation if two nodes together can cause also network separation if both of them are moved or removed at the same
time. This paper introduces a new technique called "Two Critical-Nodes Detection Algorithm (TCNDA)" to determine individual
critical node(s) and also to determine each two node pair(s) which are critical together The area of Ad hoc networks is very active nowadays due to its
infrastructure-less nature, simplicity of deployment in areas
where infrastructure hard to established, mobility and selfconfigurable nature make it suitable for huge range of
applications.