A non-zero module M is called hollow, if every proper submodule of M is small. In this work we introduce a generalization of this type of modules; we call it prime hollow modules. Some main properties of this kind of modules are investigated and the relation between these modules with hollow modules and some other modules are studied, such as semihollow, amply supplemented and lifting modules.

Let R be a commutative ring with identity, and let M be a unitary left R-module. M is called special selfgenerator or weak multiplication module if for each cyclic submodule Ra of M (equivalently, for each submodule N of M) there exists a family {fi} of endomorphism of M such that Ra = ∑_i▒f_i (M) (equivalently N = ∑_i▒f_i (M)). In this paper we introduce a class of modules properly contained in selfgenerator modules called special selfgenerator modules, and we study some of properties of these modules.

Let R be a commutative ring with non-zero identity element. For two fixed positive integers m and n. A right R-module M is called fully (m,n) -stable relative to ideal A of , if for each n-generated submodule of Mm and R-homomorphism . In this paper we give some characterization theorems and properties of fully (m,n) -stable modules relative to an ideal A of . which generalize the results of fully stable modules relative to an ideal A of R.

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f