Let , be a graph with vertex set and edge set E. Let be a labeling defined in. Define the sum of neighbourhood of vertex by s = ∈ , where () denotes the open neighbourhood of vertex ∈. A labeling is a proper lucky labeling if () ≠ () and s() ≠ () for all , ∈. The proper lucky number of , denoted by is the least positive integer such that has a proper lucky labeling with 1,2, … , as the set of labels. In this paper we determine proper lucky number of Hexagonal mesh and Honeycomb network.