Because of the visual nature (images and videos) of the captured data, the coverage problem in Wireless Multimedia Sensor Networks (WMSNs) is totally different from traditional scalar sensor networks and can be defined in several ways according to the target application. In this paper, we focus on one particular coverage, we called Closed Peripheral Coverage (CPC). This type of coverage is present in several realistic application as military camp surveillance, very sensitive buildings (i.e., nuclear center) surveillance, contaminated region monitoring, etc. The objective hence is to detect any intrusion coming from the outside (viewed by at least one multimedia sensor node). To the best of our knowledge, this is the first research work addressing this issue. Briefly, CPC problem can be defined as follow: after a random deployment of multimedia sensor nodes around the region of interest (i.e., Building to monitor), the goal is to schedule several sets of nodes (i.e., cover sets) such that each of which forms a closed "ring" around the region of interest. Hence, instead activating all nodes at once, the cover sets are scheduled to be activated serially, which ensures a significant network lifetime prolongation improvement. In this paper, we study the CPC problem and present two variants of a centralized algorithm. The preliminary simulation results show clearly the effectiveness of the proposed approaches by a factor varied from 2 to 8 in comparison to the basic approach.