This study presents a mathematical approach to distribute portable excess speed detectors in urban transportation networks. This type of sensor is studied to be located in a network in order to separate most of the demand node pairs in the system resembling the well-known traffic sensor surveillance problem. However, newly, the locations are permitted to be changed introducing the dynamic form of the sensor location problem. The problem is formulated mathematically into three different location problems, namely SLP1, SLP2, and SLP3. The aim is to find the optimal number of sensors to intercept most of the daily traffic for each model objective. The proposed formulations are proven to be an NP-hard problem, and then heuristics are called for the solution. The methodology is applied to AL Riyadh city as a real case study network with 240 demand node pairs and 124 two-way streets. In the SLP1, all the demand node pairs are covered by 19% of the network’s roads, whereas SLP2 model shows the best locations for each assumed budget of sensors to purchase. The SLP2 solutions range from 24 sensors with 100% paths coverage to 1 sensor with nearly 20% of paths coverage. The SLP3 model manages to redistribute the sensors in the network while maintaining its traffic coverage efficiency. Four locations structures manage to cover all the network streets with coverage ranges between 100% and 60%. The results show the capability of providing satisfactory solutions with reasonable computing burden.