Abstract: This paper presents a novel algorithm to answer skyline queries（e.g.“find the objects which are not “dominated” by other objects” and having higher aggregation value） in distributed environments.Existing algorithms consume an excessive amount of bandwidth when the number of nodes，m，is high.A novel algorithm is proposed called Distributed Rank-aware Skylining（DRS）.DRS terminates in four round-trips regardless of data input，and reduces communication cost by pruning away ineligible objects.The effectiveness of DRS is verified empirically using synthetic data sets.The experiments results show that FDSL is superior to the existing alternatives in the terms of the network traffic when the number of nodes is greater than 4.